WorksMathematics
Hereditary lowerability of diagonal entropy scales
Abstract
Let be a continuous self-map of a compact metric space. For each integer , we consider the upper capacity entropy scale obtained by dividing the -fold logarithm of an orbit covering number by the -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.
Introduction
The entropy of a compact subset describes the growth of distinguishable orbit segments starting in that set. The set need not be invariant. This leads to an intermediate-value question: if a compact set has a given entropy, which smaller values occur on its compact subsets? The answer depends both on the growth normalization and on the definition of subset entropy.
The open-cover definition of topological entropy was introduced by Adler, Konheim, and McAndrew [1]. Bowen’s metric formulation [2] describes the same invariant on compact systems through orbit separation. For arbitrary subsets one can retain a common orbit length in every covering ball, obtaining upper capacity entropy, or allow the orbit lengths to vary, as in Bowen’s definition for noncompact sets [3]. These constructions can assign different values even to compact sets that are not invariant.
Huang, Ye, and Zhang [7] formulated lowerability and hereditary lowerability for upper capacity entropy. Lowerability asks for all values between zero and the entropy of the whole system; hereditary lowerability asks the same question inside each nonempty compact subset. They proved lowerability for systems of finite topological entropy. Their subsequent work [8] established lowerability without the finiteness assumption and constructed systems that are not hereditarily lowerable. In particular, their product-diagonal example contains a compact set whose compact subsets have classical upper capacity entropy only zero or infinity. In a recent preprint, Wang [10] proves hereditary lowerability for finite-entropy homeomorphisms. Thus the finite-entropy and infinite-entropy settings have different behavior for the classical normalization.
To distinguish orbit growth below the exponential scale, one can replace the classical normalization by slower growth functions. Katok and Thouvenot [9] introduced slow-entropy invariants in measure-preserving dynamics. In topological dynamics, de Carvalho [4] and Dou, Huang, and Park [5] developed entropy dimension using growth rates between polynomial and exponential ones. More generally, Helfter [6] organized metric covering invariants by families of gauge functions, including families obtained from iterated exponentials and logarithms. Xie, Chen, and Zhou [11] formulate Bowen and upper capacity
2020 Mathematics Subject Classification. Primary 37B40; Secondary 37B10, 54H20.
Key words and phrases. Upper capacity entropy, entropy scale, hereditary lowerability, entropy dimension, compact subset. entropy scales in dynamics and study their comparison and variational properties. These results motivate asking how lowerability behaves for a specified family of orbit-growth scales.
Here the time convention is fixed as . If denotes the least number of radius- Bowen balls of length covering , the diagonal member of the resulting hierarchy is
Here is the -fold logarithm, defined for sufficiently large arguments, and is a regularized version defined on ; both are specified in § 2. The regularization makes (1.1) meaningful when covering numbers stay bounded. For and , this is upper entropy dimension; for general it is the corresponding upper capacity extension to subsets. At every fixed resolution, orbit covering numbers are at most exponential in , so .
Theorem 1.1. Let be a nonempty compact metric space and let be continuous. Fix an integer . For every nonempty compact set and every , there is a nonempty compact set such that
If , the set can be chosen countable with exactly one accumulation point.
Consequently every compact continuous system is hereditarily lowerable for each fixed diagonal scale in (1.1). Neither nor is required to be invariant. No finiteness assumption on classical topological entropy is imposed, and invertibility is not used. The statement is separate for each ; it does not prescribe several scale values on the same subset.
The construction follows the extraction strategy for countable compact sets in [10 Lemma 3.5], using metric covering trees and the diagonal scale estimates developed below. First, fixed-resolution localization produces a countable compact source set with one accumulation point and scale entropy larger than the target. Second, finite subsets of successively smaller tails are selected so that their orbit counts satisfy one common upper bound at all times. For this step we use Wang’s finite-tree lemma [10 Lemma 3.3]. The trees here come from successive metric covers at dyadic times. Their node counts include a logarithmic loss, which the parameter gap in the diagonal scales absorbs. A recurring schedule of spatial resolutions supplies the matching lower bound.
The restriction to strictly intermediate values in the assertion about accumulation points is necessary. § 6 gives, for every fixed and , a compact set with for which every compact subset with at most one accumulation point has . The same section computes on the product-diagonal example of [8]: the classical zero-or-infinity restriction coexists with preservation of the base subsets’ diagonal scale values.
§ 2 records the definitions, covering facts, and finite combinatorial terminology used later. § 3 establishes the scale estimates. § 4 and § 5 give the localization and the proof of Theorem 1.1.
Preliminaries
Orbit metrics and subset entropy
2.1. Orbit metrics and subset entropy. Let be a nonempty compact metric space and let be continuous. We use and , and all logarithms are natural unless a base is displayed. For , set
For a nonempty set , let be the least number of such balls covering , with centers allowed in . Let be the largest cardinality of a subset satisfying for distinct . Such a set is called -separated. The metric induces the topology of , so compactness makes these counts finite. The largest separated cardinality exists even if is not closed: possible cardinalities are integers in a nonempty finite set. Both counts are nondecreasing in .
The standard covering–separation inequalities, in the present open-ball convention, are
Indeed, a separated set of largest cardinality is maximal under inclusion, so every point of is within -distance at most of it. Also, an open ball of radius contains at most one point of an -separated set. See [8 Section 2] for the customary covering and separation descriptions of subset entropy.
Classical upper capacity entropy is
For this is topological entropy. The counts in (3) use one common orbit length at each stage. Bowen’s entropy for noncompact sets instead uses weighted covers whose orbit lengths may vary from ball to ball [3]. All lowerability assertions below concern upper capacity counts.
Iterated functions and the time convention
Set
An expression containing is used only where its successive logarithms are defined, and in limits its argument is sufficiently large that they are positive. Thus , , and . The identities and hold on these domains. For counts that may equal one, use
Every is increasing, and
For , the difference is . If , the next difference is , proving (5) by induction.
In asymptotic notation, means eventually for some constant , and means . A subscript on , such as , permits the constant to depend on that subscript. Limits in time are always taken before the spatial resolution tends to zero.
For positive integers and , the iterated scale family of [6 Proposition 2.4] can, for sufficiently small , be written as
Only its behavior as is needed. Under the convention , its reciprocal becomes
We define
Here . This explicitly fixes the normalization; changing the substitution for would give a different time-growth question. The notation used in the rest of the paper is for .
Lemma 2.1. For every nonempty and all ,
The same outer limit is obtained with in place of . These quantities are independent of the compatible metric on . In particular, .
Proof. Fix and put
If , choose . Eventually , by (2.4). Monotonicity gives , and
For this is ; for its logarithm is . Conversely, if , choose . On an infinite subsequence, . Hence on that subsequence, and the ratio with tends to infinity there. These two arguments also cover and by the available one-sided inequality. Bounded sequences are included in the first argument. This proves the critical-parameter formula at fixed .
Inequalities (2.1) give the separated-count version after . If is another compatible metric, compactness gives, for every , a such that implies . The same implication holds for the corresponding orbit metrics, whence . Interchanging the two metrics proves metric independence. Finally, for ; division by gives the last assertion.
For , two examples of numerical growth rates are
and
Bounded counts have rate zero. Lemma 2.3 bounds the rates that can occur dynamically.
In the case , one also has
To check this, fix and let be the limsup in (9) for . If , then eventually. If , then on an infinite subsequence. These assertions follow by undoing the two regularized logarithms; the bounded difference between and does not change either estimate. Division by proves (2.9), with the same one-sided argument at . For , this is the upper entropy dimension considered in [4, 5]; equation (2.9) specifies the extension used here when is not invariant.
For the estimates used later, fix , put , and define, for and sufficiently large real ,
Thus , and . For one has and ; for one has . Thresholds will always be chosen with , on which domain both functions increase in and .
Finite unions, localization rates, and the range of values
Fix . To retain a spatial resolution in the notation, put
Thus . The symbol denotes a rate, whereas denotes an orbit distance. The map and the fixed integer are suppressed in (2.11).
Lemma 2.2. The quantities and are monotone under inclusion. For a finite family of nonempty subsets of ,
Finite nonempty sets have value zero. Deleting finitely many points from an infinite set changes neither rate.
Proof. Let . Assign each point of a separated set in the union to one containing . The assigned points in each are separated, so
For fixed and , the difference is bounded on . For it is at most , and induction follows because has derivative at most . Division by removes this bounded difference. The limsup of a maximum of finitely many sequences is the maximum of their limsups, proving (2.12). Taking the monotone resolution limit proves (2.13). A finite set has uniformly bounded counts. Writing a set as the union of its remaining points and its deleted finite part proves the deletion statement. □
Lemma 2.3. For every there is an integer such that
Consequently for , and if . If , then for every .
Proof. Cover by open sets of diameter less than . Each nonempty intersection has -diameter less than . There are at most such intersections, and one point from each supplies an open Bowen-ball cover. This proves (2.14). For and ,
If the limit is zero. This gives the bound on ; when , use additionally . If , some fixed and satisfy for infinitely many . The corresponding normalized -fold logarithms tend to one on that subsequence. The upper bound just established gives equality. □
Definition 2.4. For a fixed , is lowerable for if each occurs on a nonempty compact subset of . It is hereditarily lowerable for if the same assertion holds inside every nonempty compact subset , with upper endpoint .
These definitions follow the subset formulation of [7, 8]. An accumulation point of a set is a point every neighborhood of which contains a different point of that set. A model for the compact sets used below is : it is countable, and zero is its only accumulation point. On a compact metric space an infinite set has an accumulation point, so a compact set with none is finite.
Finite partitions and rooted trees
A finite partition of a finite set is a collection of nonempty, pairwise disjoint subsets, called atoms, whose union is . The join consists of all nonempty intersections of an atom of with an atom of . It refines both partitions: each new atom is contained in one atom of either partition. For instance, the join of and form the singleton partition of .
A finite rooted tree is a finite connected graph with no cycles and with a distinguished vertex, its root. A vertex has level if the path from it to the root has edges. Its parent is the preceding vertex on that path. A leaf is a vertex with no children. We consider trees whose leaves all lie at the same level , and call these vertices terminal leaves. A vertex is occupied by a chosen set of leaves if at least one chosen leaf descends from it. For example, a binary tree of depth two has leaves 00, 01, 10, 11. Choosing 00 and 01 occupies one vertex at level one and two at level two; choosing 00 and 10 occupies two vertices at each of these levels.
A sequence of refining partitions of gives such a tree: atoms are vertices, inclusion determines parenthood, and singleton atoms in the last partition are leaves. Controlling the number of occupied vertices therefore controls how many partition atoms are needed to cover a selected subset of .
Lemma 2.5 (Wang, [10 Lemma 3.3]). Let a finite rooted tree have leaves at a common level , and let be the number of vertices at level having a terminal descendant. For every integer , one can select exactly leaves such that the number of occupied vertices satisfies
We use this finite combinatorial result in the stated form. Its proof in [10] applies to arbitrary finite rooted trees and requires no dynamical assumptions. In particular, its loss depends on the current level , not on the final depth .
Symbolic and product models
The two-sided full shift is with . A compatible metric bounded by one is
A cylinder set specifies the coordinates in a finite index set and leaves the others unrestricted. Cylinders are open and closed and form a basis for the product topology. Distinct patterns on have Bowen distance at least , whereas agreement on gives Bowen distance at most . Thus, for and ,
The lower bound uses one representative for each pattern on ; the upper bound uses cylinders on . Hence , and Lemma 2.3 gives for every .
For any compact metric space with , the countable product is compact and metrizable by
For completeness, every sequence in the product has a subsequence converging in coordinate one, a further subsequence converging in coordinate two, and so on. The diagonal subsequence converges in every coordinate. To obtain convergence for (18), first make the tail sum smaller than a prescribed tolerance, and then use convergence of the finitely many remaining coordinates. Sequential compactness is compactness for a metric space. This also explains why only finitely many coordinates are visible at a fixed resolution.
Estimates for the diagonal scales
Fix , write , and use the functions , defined in (11). The following estimates account for the changes in covering counts introduced by the tree construction.
Lemma 3.1. For fixed positive parameters the following statements hold.
(1) For ,
(2) If , then
(3) For , , and ,
The same conclusion holds if a fixed nonnegative constant is added inside .
(4) For , wherever both sides are defined. In particular, the inverse of on a sufficiently large interval is .
(5) Suppose and . Set
Then , eventually, and
Proof. We first record two comparisons of iterated exponentials. For and ,
For , these are and . If either comparison holds at , the logarithm of the corresponding ratio at is the difference between its two level- terms. The larger term divided by the smaller one tends to infinity, and both terms tend to infinity; hence their difference tends to infinity. This proves both assertions by induction.
The identity and (5) give the first limit in (19). For , the second limit and (20) reduce to and . If , put . Taking logarithms gives
Both right-hand sides tend to infinity by (24): in the second line each subtracted term is of smaller order than the first one. This proves the first two parts. For part (3), first note that . This follows from for , and from repeated logarithms for larger . Part (1) gives , whence
Taking further logarithms changes by . That expression equals . Equation (5) now proves (21). Adding a fixed constant changes the first logarithm by and therefore gives the same limit.
The cancellation of with gives
which proves part (4). For part (5), , so . Since and , one has eventually; strict monotonicity gives . Moreover,
For the error is exactly , and for it tends to zero. Since , taking the integer part changes its first logarithm by and hence its -fold logarithm by $o(1). Thus , and (25) proves (23). □
In the construction below, the parameters in Lemma 3.1 are fixed separately at each stage before the time is chosen large enough for the required error bound. No uniformity over parameters from different stages is needed.
Localization and metric covering trees
Keep and fixed.
A countable compact source
The next two lemmas adapt the localization approach of [7 Section 5] to the fixed-resolution rates (2.11) used in the extraction below.
Lemma 4.1. Let be nonempty and compact. If , then there is such that every relative open neighborhood of in satisfies $d_\varepsilon(U)\ge b.
Proof. Otherwise, each has a relative open neighborhood with . Choose a finite subcover of . Since these sets are contained in , their union is , and (13) gives , a contradiction. □
Lemma 4.2. If is nonempty and compact and , then there is a countable compact set
with distinct and .
Proof. Choose and numbers . Apply Lemma 4.1 with . For each , the set has . The definition of limsup therefore permits a strictly increasing sequence and finite -separated sets such that
Put . Every neighborhood of contains all but finitely many of these finite sets. Thus is compact and has no accumulation point other than . Since , we have . In particular is infinite. Enumerating its distinct points other than gives (4.1); every such enumeration converges to , because only finitely many points lie outside any neighborhood of . □
Lemma 4.3. Let have the form (4.1), and define . For every and , one has for all sufficiently large . For each and ,
Proof. Each of the finitely many maps , , is continuous, so . This proves the first assertion. The other assertions follow from finite deletion in Lemma 2.2. □
Trees from successive metric covers
Lemma 4.4. Let be nonempty, let be positive integers, and let be a nonempty finite -separated set, where . Put for , where is the first index with . There is a rooted tree on successive partitions of with these properties:
Each level- atom has -diameter less than .
If denotes the number of level- vertices, then
The terminal leaves are the individual points of . If a nonempty subset occupies vertices at level , then
Proof. At time , take a cover of by exactly open Bowen balls of radius and order its members. Assign each point of to the first ball containing it, discarding empty assigned sets. This produces a partition of . Each atom is contained in one ball and therefore has -diameter less than . Define the refining partitions , with . These define a rooted tree as in § 2. The bound on the number of intersections gives the first inequality in (4.2); monotonicity in time gives the second.
An atom of cannot contain two distinct points of : their -distance would be less than $2\rho < \eta$, contradicting separation. Thus terminal atoms are singletons, and all vertices have terminal descendants. For a selected subset , choose one of its points from each occupied level- atom. The radius- balls about those points cover at time and at every earlier time, since . Finally , so a single ball centered at covers whenever $n \le L. □
Exact extraction and hereditary lowerability
The next construction adapts [10 Lemma 3.5]. Here the trees are supplied by Lemma 4.4, and Lemma 3.1 controls the resulting losses in the diagonal normalization.
Proposition 5.1. Let and let have the form (4.1). If , there is a countable compact set with exactly one accumulation point such that .
Proof. We use and the functions in (2.10). By Lemma 2.3, .
Choice of resolutions and parameters. Choose such that
discarding finitely many initial terms to have . Let be a sequence in which every positive integer appears infinitely often; for instance, concatenate the finite lists $(1), (1,2), (1,2,3), . This recurrence will provide infinitely many witness times at each fixed resolution before the resolution limit is taken. Choose with , and set
Then and . Choose so that for every . The auxiliary number may exceed one; it is a comparison parameter rather than a claimed entropy value.
A threshold before choosing a tail. Put . At stage , choose an integer , in the positive-logarithm domain, so large that
Here and below . To justify this choice, take . Lemma 2.1 implies that the fixed-resolution covering rate at is at most , so for all sufficiently large integers . One can obtain this last inequality directly by inserting a parameter strictly between and in the proof of that lemma. Equation (20) then yields eventually, establishing (5.2).
Only after has been fixed, choose a tail index , strictly larger than previous tail indices, for which
This is possible by Lemma 4.3. In particular, all times up to are controlled by one ball.
Separated source points and the selected cardinality. Finite deletion gives . There are therefore arbitrarily large integers for which contains an -separated set with
Indeed, choose with . Along arbitrarily large times the normalized regularized logarithm of the separated count exceeds , while that of tends to . For such times define
Lemma 3.1 allows us to choose one of the times in (5.4), denoted by , so large that , , , and
Write , , and let be the corresponding separated set, with . All these requirements are eventual inequalities for the already fixed stage parameters, so they can be met simultaneously along the unbounded available times.
Since and ,
Together with , this gives .
Selection on a metric covering tree. Apply Lemma 4.4 to , using , , , and . Its times are , ending at the first . Denote its node counts by . Since , equations (27) and (5.2) give
Use Lemma 2.5 to select leaves, and let be the corresponding points. Write for the occupied node counts. When , we have
It follows that . When , cardinality alone gives . These two estimates hold for every level in the same selected tree.
One upper bound for every stage and every time. For , let be the first dyadic time at least . Then and . By (28) and the two preceding estimates,
This includes the case , for which the second estimate applies. For the cover has one ball by (31). For ,
Extend to a positive nondecreasing function on the remaining bounded interval, keeping its original values for large arguments. The three cases give a stage-independent bound
The compact union and its upper rate. Set
Each is finite and lies in by (31). Since , the set is countable and compact, and it has at most the accumulation point . Also .
Fix , and choose such that whenever . Let . The integers are strictly increasing, since . Hence at most stages satisfy . For the stages with , use (36) and monotonicity in the radius. For every remaining stage with , equation (31) implies . All those remaining stages, together with , need just one ball. Thus
For sufficiently large , the right-hand side is at most for a fixed constant : use and . Part (3) of Lemma 3.1 gives
Since was arbitrary, .
A lower bound at each recurring resolution. Fix . There are infinitely many stages with . At each such stage, is -separated, so . Equation (33) therefore implies
Letting yields . This proves equality. Since , Lemma 2.2 rules out a finite ; compactness then ensures that is its unique accumulation point. □
Proof of Theorem 1.1. If , choose a singleton in . If , choose . For , Lemma 4.2 gives a countable compact of the form (4.1) with . Apply Proposition 5.1 to . The resulting set lies in and has exactly one accumulation point. □
Thus, for every nonempty compact and each fixed ,
the theorem gives inclusion from right to left, and monotonicity gives the reverse inclusion.
Remark 5.2. The proof uses at specific points. For a formal classical replacement , the estimate fails: the quotient equals . In addition, for , whereas the classical denominator retains the factor two. Finally, the source value is always finite here by Lemma 2.3. Consequently this argument gives no hereditary lowerability assertion for on infinite-entropy systems.
Sharpness and comparison with classical entropy
We give two complements to Theorem 1.1. The first shows why the assertion about one accumulation point is restricted to strictly intermediate values. The second compares with classical entropy on the product-diagonal construction of Huang, Ye, and Zhang.
The upper endpoint
Proposition 6.1. For every integer and every , there are a compact metric space , a homeomorphism , and a nonempty compact set such that
while every nonempty compact subset with at most one accumulation point satisfies .
Proof. Choose with . Since , Theorem 1.1 supplies nonempty compact sets with . Moreover, : otherwise Lemma 2.3 would give , contrary to .
Let be a separate copy of , and set . Define
and . This is a metric. Within a component the triangle inequality follows from that for ; a path leaving has length at least , whereas distances within are at most . For points in different components the displayed sums give the remaining triangle inequalities. Each is compact and open and closed in . A sequence with unbounded component indices has a subsequence converging to ; otherwise it has a subsequence in a fixed compact component or a constant subsequence at . Thus is compact.
Let act as the shift on each and fix . Both and are continuous within each component and preserve the distance to , so is a homeomorphism. Regard as a subset of and put
This set is closed: each is closed in its component, and limits with unbounded component indices equal . Hence is compact.
Use superscripts to distinguish covering numbers for and . Fix and choose so that for . All components with remain in the radius- Bowen ball about at every time. Covering the other components separately therefore gives
A finite sum is at most its largest summand times the number of terms. Thus, by the bounded-error estimate in Lemma 2.2, its normalized -growth is at most the largest rate of its summands; the same argument applies to the classical logarithm. It follows that and after taking the resolution limit. For each fixed and , a ball meeting must have its center in , already by the distance at time zero. Hence
Consequently , and monotonicity yields .
Now let be nonempty and compact with at most one accumulation point. If there is none, is finite and . If the only accumulation point is , each is finite: it is compact, and an infinite such intersection would have an accumulation point in . At each fixed resolution only finitely many components require separate covers in (6.1); their intersections with are finite, and the remaining points fit in one ball about . Thus is bounded in and .
Finally, suppose the unique accumulation point lies in . Then meets only finitely many components, since otherwise a sequence with increasing component indices would have the second accumulation point . Its intersections with the other components are finite by compactness. Therefore is finite, and Lemma 2.2 gives . □
The product-diagonal comparison
Let be a compact homeomorphism system with , give a compatible metric , and set
Equip with the metric (2.17). The maps and are continuous coordinatewise, so is a homeomorphism. The map is a homeomorphism onto its image, with inverse given by the first coordinate projection. In this construction, [8 Proposition 3.2 and its proof] gives, for every nonempty compact ,
In particular, has infinite classical entropy and no compact subset of finite positive classical entropy. The diagonal scales have the following behavior.
Proposition 6.2. For every nonempty compact and every ,
Proof. Projection onto the first coordinate sends a radius- Bowen ball for into a radius- Bowen ball for , since for every . The centers project to points of , whether or not they belong to . Projecting a cover therefore yields
and hence .
For the reverse inequality, fix , choose with , and take . If , then for ,
because for . Replacing every center in a length- cover of by gives
Put . The integer is fixed at this resolution, and . Thus
The middle inequality only bounds a subsequence upper limit by the full upper limit. Letting proves the reverse bound. □
For the binary full shift, Theorem 1.1 supplies, for each fixed and , a nonempty compact set with . Lemma 2.3 then gives . Equations (40) and (41) imply
Thus the classical entropy restriction on allows intermediate diagonal scale values on its classical zero-entropy subsets.
College of Mathematics and Statistics, Chongqing University, Chongqing 401331, China Email address: [email protected]
College of Mathematics and Statistics, Chongqing University, Chongqing 401331, China Email address: [email protected]
References
- [1]R. L. Adler, A. G. Konheim, and M. H. McAndrew, Topological entropy, Trans. Amer. Math. Soc. 114 (1965), no. 2, 309–319. doi:10.1090/S0002-9947-1965-0175106-9.DOI
- [2]R. Bowen, Entropy for group endomorphisms, Trans. Amer. Math. Soc. 153 (1971), 401–414. doi:10.1090/S0002-9947-1971-0274707-X.
- [3]R. Bowen, Topological entropy for noncompact sets, Trans. Amer. Math. Soc. 184 (1973), 125–136. doi:10.1090/S0002-9947-1973-0338317-X.DOI
- [4]M. de Carvalho, Entropy dimension of dynamical systems, Portugal. Math. 54 (1997), no. 1, 19–40.
- [5]D. Dou, W. Huang, and K. K. Park, Entropy dimension of topological dynamical systems, Trans. Amer. Math. Soc. 363 (2011), no. 2, 659–680. doi:10.1090/S0002-9947-2010-04906-2.DOI
- [6]M. Helfter, Scales, Math. Z. 310 (2025), no. 1, Paper No. 15. doi:10.1007/s00209-025-03719-5.DOI
- [7]W. Huang, X. Ye, and G. Zhang, Lowering topological entropy over subsets, Ergodic Theory Dynam. Systems 30 (2010), no. 1, 181–209. doi:10.1017/S0143385709000066.DOI
- [8]W. Huang, X. Ye, and G. Zhang, Lowering topological entropy over subsets revisited, Trans. Amer. Math. Soc. 366 (2014), no. 8, 4423–4442. doi:10.1090/S0002-9947-2014-06117-5.DOI
- [9]A. Katok and J.-P. Thouvenot, Slow entropy type invariants and smooth realization of commuting measure-preserving transformations, Ann. Inst. H. Poincaré Probab. Statist. 33 (1997), no. 3, 323–338. doi:10.1016/S0246-0203(97)80094-5.DOI
- [10]X. Wang, Hereditary lowerability of topological dynamical systems, 2026. Preprint, arXiv:2608.07115v1.arxiv.org/abs/2608.07115
- [11]Y. Xie, E. Chen, and X. Zhou, Entropy scales in topological dynamical systems, 2026. Preprint, arXiv:2608.10460v2.arxiv.org/abs/2608.10460