Hereditary lowerability of diagonal entropy scales
Abstract
Let T be a continuous self-map of a compact metric space. For each integer p≥2, we consider the upper capacity entropy scale obtained by dividing the p-fold logarithm of an orbit covering number by the (p−1)-fold logarithm of time. We prove that every nonempty compact set contains a compact subset realizing any value between zero and its own scale entropy. Every strictly intermediate value is realized by a countable compact set with exactly one accumulation point. The proof combines localization at a fixed spatial resolution, a finite-tree selection lemma, and refinements of orbit covers at dyadic times. An example shows that the assertion about one accumulation point does not extend to the upper endpoint. On the product-diagonal construction used in classical entropy lowerability, the diagonal scales preserve the values of the base subsets, although classical upper capacity entropy takes only zero or infinity.
Related
- OSFP4: Joint Optimization of Diagonal Smoothing and Block Scales for NVFP4 Quantization
- Entropy Scales in Topological Dynamical Systems
- Hereditary Approximation under Hilbertian Extension
- A hereditary theorem for rigid and pseudorigid components of Lusztig's nilpotent varieties in type A
- Off-diagonal Ramsey numbers
BibTeX
@misc{huang2026hereditary,
title = {{Hereditary lowerability of diagonal entropy scales}},
author = {Xiaojun Huang and Zhuang Li},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.02638},
eprint = {2611.02638},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.02638},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Hereditary lowerability of diagonal entropy scales
AU - Xiaojun Huang
AU - Zhuang Li
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.02638
UR - https://arxiv.org/abs/2611.02638
AB - Let T be a continuous self-map of a compact metric space. For each integer p≥2, we consider the upper capacity entropy scale obtained by dividing the p-fold logarithm of an orbit covering number by the (p−1)-fold logarithm of time. We prove that every nonempty compact set contains a compact subset realizing any value between zero and its own scale entropy. Every strictly intermediate value is realized by a countable compact set with exactly one accumulation point. The proof combines localization at a fixed spatial resolution, a finite-tree selection lemma, and refinements of orbit covers at dyadic times. An example shows that the assertion about one accumulation point does not extend to the upper endpoint. On the product-diagonal construction used in classical entropy lowerability, the diagonal scales preserve the values of the base subsets, although classical upper capacity entropy takes only zero or infinity.
ER -