Symbolic Extensions of Amenable Group Actions and the Comparison Property
Tomasz Downarowicz, Guohua Zhang · Memoirs of the American Mathematical Society · 2023
In topological dynamics, the Symbolic Extension Entropy Theorem (SEET) (Boyle and Downarowicz, 2004) describes the possibility of a lossless digitalization of a dynamical system by extending it to a subshift on finitely many symbols. The theorem gives a precise estimate on the entropy of such a symbolic extension (and hence on the necessary number of symbols). Unlike in the measure-theoretic case, where Kolmogorov–Sinai entropy serves as an estimate in an analogous problem, in the topological setup the task reaches beyond the classical theory of measure-theoretic and topological entropy. Necessary are tools from an extended theory of entropy, the theory of entropy structures developed in Downarowicz (2005). The main goal of this paper is to prove the analog of the SEET for actions of (discrete infinite) countable amenable groups: Let a countable amenable group G G act by homeomorphisms on a compact metric space X X and let M G ( X ) \mathcal {M}_{G}(X) denote the simplex of all G G -invariant Borel probability measures on X X . A function E A {E}_{\mathsf {A}} on M G ( X ) \mathcal {M}_{G}(X) equals the extension entropy function h π h^\pi of a symbolic extension π : ( Y , G ) → ( X , G ) \pi :(Y,G)\to (X,G) , where