Litcius/Paper detail

Symbolic Extensions of Amenable Group Actions and the Comparison Property

Tomasz Downarowicz, Guohua Zhang

2023Memoirs of the American Mathematical Society15 citationsDOI

Abstract

In topological dynamics, the <italic>Symbolic Extension Entropy Theorem</italic> (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 <italic>theory of entropy structures</italic> 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: <disp-quote> <italic> Let a countable amenable group <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding="application/x-tex">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula> act by homeomorphisms on a compact metric space <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper X"> <mml:semantics> <mml:mi>X</mml:mi> <mml:annotation encoding="application/x-tex">X</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper M Subscript upper G Baseline left-parenthesis upper X right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">M</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>G</mml:mi> </mml:mrow> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>X</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {M}_{G}(X)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> denote the simplex of all <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding="application/x-tex">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -invariant Borel probability measures on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper X"> <mml:semantics> <mml:mi>X</mml:mi> <mml:annotation encoding="application/x-tex">X</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . A function <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper E Subscript sans-serif upper A"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>E</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">A</mml:mi> </mml:mrow> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">{E}_{\mathsf {A}}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper M Subscript upper G Baseline left-parenthesis upper X right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">M</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>G</mml:mi> </mml:mrow> </mml:msub> <mml:mo stretchy="false">(</mml:mo> <mml:mi>X</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {M}_{G}(X)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> equals the extension entropy function <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="h Superscript pi"> <mml:semantics> <mml:msup> <mml:mi>h</mml:mi> <mml:mi> π </mml:mi> </mml:msup> <mml:annotation encoding="application/x-tex">h^\pi</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of a symbolic extension <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="pi colon left-parenthesis upper Y comma upper G right-parenthesis right-arrow left-parenthesis upper X comma upper G right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi> π </mml:mi> <mml:mo>:</mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mi>Y</mml:mi> <mml:mo>,</mml:mo> <mml:mi>G</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo stretchy="false"> → </mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mi>X</mml:mi> <mml:mo>,</mml:mo> <mml:mi>G</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\pi :(Y,G)\to (X,G)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , where <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="h Superscript pi Baseline left-parenthesis mu right-parenthesis equals sup left-brace right-brace col

Topics & Concepts

Property (philosophy)MathematicsGroup (periodic table)Algebra over a fieldPure mathematicsEpistemologyPhilosophyOrganic chemistryChemistryCellular Automata and ApplicationsComputability, Logic, AI AlgorithmsMathematical Dynamics and Fractals