Hereditary lowerability of diagonal entropy scales

Let $T$ be a continuous self-map of a compact metric space. For each integer $p\geq2$, 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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-02
DOI
https://doi.org/10.48550/arxiv.2611.02638
Primary Topic
Mathematical Dynamics and Fractals
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Hereditary lowerability of diagonal entropy scales

Zhuang Li, Xiaojun Huang
arXiv (Cornell University)
Mathematical Dynamics and Fractals
preprint

Hereditary lowerability of diagonal entropy scales

Zhuang Li, Xiaojun Huang
preprint en

Abstract

Let $T$ be a continuous self-map of a compact metric space. For each integer $p\geq2$, 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.

arXiv (Cornell University)
Mathematical Dynamics and Fractals
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon