Papers
Topics
Authors
Recent
Search
2000 character limit reached

Relative Topological Entropy

Updated 29 November 2025
  • Relative topological entropy is defined as the exponential growth rate of distinguishable orbit segments in fibers over a given factor, quantifying additional complexity in dynamical systems.
  • It extends classical topological entropy through weighted generalizations and mean dimension frameworks, incorporating variational principles and averaging techniques for amenable groups.
  • The invariant is crucial for distinguishing orbit complexity in extensions, aiding in the classification of systems with zero or infinite fiber complexity.

Relative topological entropy is a central invariant in topological dynamics, measuring the orbit complexity of a dynamical system relative to a chosen factor or subsystem. It generalizes classical topological entropy by quantifying the exponential growth rate of distinguishable orbit segments in the fibers above the factor, and further extends to weighted and mean dimension settings to address more subtle forms of complexity. Variational principles, covering and spanning structures, and group-theoretic averaging play integral roles in its definition and analysis, particularly for actions of amenable groups and factor maps.

1. Formal Definitions and Characterizations

Relative topological entropy is most commonly formalized for a factor map π:XY\pi : X \to Y between compact topological dynamical systems and for group actions (X,G)(X, G) via homeomorphisms. Given a finite open cover α\alpha of XX and a Følner sequence (Fn)(F_n) in a countable discrete amenable group GG, the open-cover definition is

H(α;π)=supyYlim supn1FnlogN(αFn,π1(y)),H(\alpha; \pi) = \sup_{y \in Y} \limsup_{n \to \infty} \frac{1}{|F_n|} \log N(\alpha^{F_n}, \pi^{-1}(y)),

where N(αFn,π1(y))N(\alpha^{F_n}, \pi^{-1}(y)) is the smallest cardinality of a subcover of the fiber π1(y)\pi^{-1}(y) by sets from the joint cover αFn\alpha^{F_n}. The supremum over α\alpha yields the relative topological entropy htop(π;XY)h_{\mathrm{top}}(\pi ; X | Y) (Liu et al., 22 Nov 2025).

An equivalent formulation—using metrics associated to the system—relies on (Fn)(F_n) and the induced metrics dFnd_{F_n} on XX fibers, considering the maximal cardinality of ϵ\epsilon-separated sets. Independence from the specific Følner sequence and, in the case of non-discrete amenable groups, independence from the choice of averaging net (such as Van Hove nets) is guaranteed by results analogous to the Ornstein–Weiss lemma (Hauser, 2019).

Weighted generalizations specify a continuous potential fC(X,R)f \in C(X, \mathbb{R}) and a weight w[0,1]w \in [0,1]. The relative ww-weighted topological entropy htopw(XY,π)h^w_{\mathrm{top}}(X|Y, \pi) specializes from the relative weighted topological pressure PZ(T,π,f)P_Z(T, \pi, f) when f0f \equiv 0 (Yin, 2024).

2. Measure-theoretic and Variational Principles

A fundamental aspect of relative topological entropy is its connection to invariant probability measures and conditional entropy. For three compact metric systems (X,T)(X, T), (Y,S)(Y, S), (Z,R)(Z, R) with factor maps π:XY\pi: X \to Y, σ:YZ\sigma: Y \to Z, and composite ρ=σπ\rho = \sigma \circ \pi, the conditional entropy of μM(X,T)\mu \in M(X, T) above RR is given by

hμ(TR)=hμ(Tσ1BZ)=hμ(Tπ1BY)+hπ+μ(Sσ1BZ),h_\mu(T | R) = h_\mu(T | \sigma^{-1} \mathcal{B}_Z) = h_\mu(T | \pi^{-1} \mathcal{B}_Y ) + h_{\pi_+ \mu}(S | \sigma^{-1} \mathcal{B}_Z ),

where BY\mathcal{B}_Y, BZ\mathcal{B}_Z denote Borel σ\sigma-algebras (Yin, 2024).

The main variational principle for relative ww-weighted pressure asserts: PZ(T,π,f)=supμM(X,T)[whμ(TR)+(1w)hπ+μ(SR)+wfdμ].P_Z(T, \pi, f) = \sup_{\mu \in M(X, T)} \left[w h_\mu(T|R) + (1-w) h_{\pi_+ \mu}(S|R) + w \int f d\mu \right]. Specializing to w=1w=1 recovers Ledrappier–Walters’ classical principle of relative entropy and pressure (Yin, 2024).

3. Extensions to Amenable Groups and Non-discrete Actions

Relative topological entropy has been extensively studied for actions of non-discrete amenable groups on compact spaces. The construction utilizes uniformities (entourages), Van Hove nets, and Haar measures. Given a factor map π:XY\pi: X \to Y and a group GG acting on XX, the relative entropy (using Van Hove nets {Fi}\{F_i\}) is

htop(G,XY)=supηUXlim supi1μ(Fi)log[Covπ(Nη(Fi))]h_{\mathrm{top}}(G,X|Y) = \sup_{\eta \in \mathcal{U}_X } \limsup_{i \to \infty} \frac{1}{\mu(F_i)} \log \left[ \mathrm{Cov}_\pi (N_\eta(F_i)) \right ]

where Nη(Fi)N_\eta(F_i) is the Bowen-entourage and Covπ()\mathrm{Cov}_\pi(\cdot) is the maximal covering number taken over fibers (Hauser, 2019).

This formalism extends entropy-addition results (Bowen’s formula), and invariance under choice of averaging net, providing a unified framework over both discrete and continuum groups. The independence of Van Hove nets is established for locally compact amenable groups and is essential for applications to aperiodic order and cut-and-project schemes (Hauser, 2019).

4. Relative Mean Dimension and Entropy Dimension

Relative mean dimension mdim(π;XY)mdim(\pi; X|Y) measures the orbit complexity in terms of real parameters per group element, complementing the exponential bit-complexity of entropy. For π:XY\pi: X \to Y, metric dd on XX, and Følner sequence (Fn)(F_n),

mdim(π;XY)=limϵ0limn1FnsupyYwidimϵ(π1(y),dFn),mdim(\pi; X|Y) = \lim_{\epsilon \to 0}\lim_{n \to \infty} \frac{1}{|F_n|} \sup_{y \in Y} widim_\epsilon ( \pi^{-1}(y), d_{F_n} ),

where widimϵwidim_\epsilon is the minimal kk such that the fiber admits an ϵ\epsilon-embedding into a kk-dimensional simplicial complex (Liu et al., 22 Nov 2025).

An analogous notion is the relative entropy dimension D(X,Gπ)D(X,G|\pi), defined via critical exponents describing the sub-exponential growth rates of covering numbers: Dsup(X,Gπ)=supUinf{a0:hsup(G,U,aπ)=0}D_{\sup}(X,G|\pi) = \sup_{\mathcal{U}}\inf\{a \ge 0 : h_{\sup}(G,\mathcal{U}, a|\pi) = 0\} and similar for DinfD_{\inf}, utilizing refinements over all finite open covers (Xiao et al., 2022). These dimensions coincide with those derived from entropy-generating sets and reflect the full spectrum of fiber complexity below classical entropy scale.

5. Induced Factors, Probability Measures, and Disjointness

For a factor map π:(X,G)(Y,G)\pi: (X,G) \to (Y,G), the induced factor on spaces of probability measures π~:(M(X),G)(M(Y),G)\widetilde{\pi}: (M(X),G) \to (M(Y),G) preserves and reflects relative entropy properties. Key theorems establish that:

  • htop(π;XY)=0h_{\mathrm{top}}(\pi; X | Y) = 0 if and only if htop(π~;M(X)M(Y))=0h_{\mathrm{top}}(\widetilde{\pi}; M(X) | M(Y)) = 0
  • htop(π;XY)>0h_{\mathrm{top}}(\pi; X | Y) > 0 if and only if mdim(π~)=mdim(\widetilde{\pi}) = \infty

These equivalences utilize combinatorial independence sets and covering-dimension arguments, notably the Karpovsky–Milman lemma for binary patterns and Lebesgue-covering lemmas for simplices (Liu et al., 22 Nov 2025).

Relative entropy dimensions also govern disjointness properties of extensions: if the nnth relative dimension set Dn(X,GπX)\mathcal{D}_n(X,G|\pi_X) for one system strictly dominates that for another system over a common factor ZZ, then the systems are disjoint over ZZ, i.e., admit no nontrivial joining (Xiao et al., 2022).

6. Classical Recovery, Weighted Formalism, and Limit Cases

When the weight w=1w=1 in the relative weighted pressure formalism, or when factors are trivial (e.g., ZZ is a point), all relative notions collapse to classical absolute definitions: Ledrappier–Walters’ principle for entropy and pressure,

P(T,π,f)=supμ:π+μ=ν[hμ(Tπ)+fdμ]P(T, \pi, f) = \sup_{\mu: \pi_+ \mu = \nu} [h_\mu(T|\pi) + \int f d\mu]

Further, when the factor is trivial, entropy dimensions and mean dimension become absolute invariants for the system (X,G)(X,G), subsuming earlier results of Dou, Huang, and Park for Z\mathbb{Z}-actions (Xiao et al., 2022).

Weighted approaches, as formalized by Tsukamoto and extended by Yin, permit flexible thermodynamic formalism and enable interpolation between purely topological and measure-theoretic complexity contributions (Yin, 2024).

7. Significance and Applications

Relative topological entropy serves as a foundational tool for distinguishing orbit complexity in extensions, quantifying how much additional information is retained in fibers of a factor map beyond the factor’s own dynamics. Its weighted and dimension-theoretic variants address finer distinctions of complexity relevant to zero-entropy systems, sub-exponential growth, and non-classical settings such as cut-and-project schemes or actions of non-discrete amenable groups.

The connections to mean dimension and induced factors have far-reaching implications for problems in ergodic theory, symbolic dynamics, aperiodic order, and topological classification. The equivalence between positive relative entropy and infinite mean dimension of induced factors unifies combinatorial and geometric perspectives in the study of orbit growth rates (Liu et al., 22 Nov 2025).

The independence of entropy from averaging procedures (Følner or Van Hove sequences) and the ability to reduce non-discrete group actions to discrete lattice cases greatly enhance the generality and applicability of the theory (Hauser, 2019). The relative dimension set framework provides robust criteria for dynamical disjointness, extending classical joining results to amenable-group actions and complex extensions (Xiao et al., 2022).

A plausible implication is that these theories enable precise characterizations of extensions with zero or infinite fiber complexity, laying foundations for further classification and rigidity phenomena in dynamical systems.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Relative Topological Entropy.