Characteristic measures of symbolic dynamical systems
Joshua Frisch, Omer Tamuz

TL;DR
This paper investigates characteristic measures in symbolic dynamical systems, demonstrating that zero entropy shifts always have such measures and that their automorphism groups are sofic, revealing structural properties of these systems.
Contribution
It introduces the concept of characteristic measures in symbolic dynamics and proves their existence for zero entropy shifts, also analyzing the nature of their automorphism groups.
Findings
Zero entropy shifts always admit characteristic measures.
Automorphism groups of minimal zero entropy shifts are sofic.
Provides new insights into the structure of symbolic dynamical systems.
Abstract
A probability measure is a characteristic measure of a topological dynamical system if it is invariant to the automorphism group of the system. We show that zero entropy shifts always admit characteristic measures. We use similar techniques to show that automorphism groups of minimal zero entropy shifts are sofic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Characteristic measures of symbolic dynamical systems
Joshua Frisch and Omer Tamuz
California Institute of Technology
Abstract.
A probability measure is a characteristic measure of a topological dynamical system if it is invariant to the automorphism group of the system. We show that zero entropy shifts always admit characteristic measures. We use similar techniques to show that automorphism groups of minimal zero entropy shifts are sofic.
J. Frisch was funded by an NSF Grant (DMS-1464475). O. Tamuz was supported by a grant from the Simons Foundation (#419427), a Sloan research fellowship, a BSF award (#2018397), and an NSF CAREER award (DMS-1944153).
1. Introduction
Let be a topological dynamical system: a jointly continuous action of a topological group on a compact Hausdorff space . A homeomorphism of is an automorphism of if for all . We denote by the group of automorphisms, equipped with the compact-open topology. A Borel probability measure on is invariant if for all .
Definition 1.1**.**
A Borel probability measure on is characteristic if for all .
Note that characteristic measures are not necessarily invariant, and invariant measures are not necessarily characteristic. However, when is abelian then is a subgroup of , and hence every characteristic measure is -invariant; this is not true for general . When is amenable then admits invariant measures, and moreover, if there are characteristic measures, then there are characteristic invariant measures. Likewise, if is amenable then there are characteristic measures, and if there are invariant measures then there are characteristic invariant measures. This follows from the fact that (resp., ) acts affinely on the compact, convex set of characteristic (resp., invariant) measures.
In this paper we will focus on symbolic dynamical systems, or shifts, and restrict our attention to finitely generated . Let be a finite alphabet. The full shift is the dynamical system , where is equipped with the product topology and the action is by left translations. A shift is a subsystem of , with a closed, -invariant subset of .
The automorphism groups of shifts are always countable [hedlund1969endomorphisms]. Even in the simplest case that , these groups exhibit rich structure; for example contains the free group on two generators, as well as every finite group (see, e.g., [boyle1988automorphism]).
Some shifts obviously admit characteristic measures: these include uniquely ergodic shifts, shifts with a unique measure of maximal entropy, shifts with periodic points (which include all shifts of finite type), and shifts with amenable automorphism groups. But since is in general non-amenable, it is not obvious that every admits a characteristic measure. Indeed, we do not know if this holds.
Our main result concerns zero entropy shifts. To define the entropy of a shift, let , the growth function of , assign to each finite the cardinality of the restriction of to . The entropy of is given by
[TABLE]
Theorem 1.2**.**
Let be a shift with . Then admits a characteristic measure.
Our proof techniques critically uses the zero entropy assumption, and thus leaves open the broader question:
Question 1.3**.**
Does every shift admit a characteristic measure?
We more generally do not know of any countable group and a shift that does not admit characteristic measures.
Recent work [cyr2015automorphism1, cyr2015automorphism, coven2015automorphisms, cyr2014automorphism, donoso2015automorphism, salo2014toeplitz, salo2014block] shows that “small shifts” have “small automorphism groups.” For example, minimal shifts with slow stretched exponential growth (that is, shifts with for ) have amenable automorphism groups, as shown by Cyr and Kra [cyr2015automorphism]. They conjecture that every minimal zero entropy shift has an amenable automorphism group. A proof of this conjecture would imply Theorem 1.2 for minimal shifts.
Theorem 1.2 is a consequence of the following, more general result that applies to finitely generated groups, and relates the existence of characteristic measures to the growth of the shift. Given a finitely generated group , we fix a generating set, and denote by the ball of radius , according to the corresponding word length metric.
Theorem 1.4**.**
Let be a finitely generated group. Then every shift for which
[TABLE]
admits a characteristic measure.
Theorem 1.2 is an immediate specialization of this result to the case .
1.1. Beyond symbolic systems
It is simple to construct a dynamical system , which is not symbolic, and which has no characteristic measures: simply let act trivially on the Cantor set . This system admits no characteristic measures, since the Cantor set has no measure that is invariant to all of its homeomorphisms.
Recall that a dynamical system is said to be topologically transitive if for every two non-empty open sets there is some such that . The system is minimal if has no closed, -invariant sets. It is free if for every and every non-trivial ; in the important case of every non-trivial minimal system is free.
Question 1.5**.**
Does there exist a non-trivial minimal topological dynamical system that does not admit a characteristic measure?
An example of a topologically transitive -system without characteristic measures is the action by shifts on , where is the Cantor set.
Recall that is said to be proximal [glasner1976proximal] if for every there exists a net in such that . Many constructions of dynamical systems without invariant measures are proximal (e.g., the Furstenberg boundary of non-amenable groups [furstenberg1963poisson, glasner1976proximal]). Hence the following claim highlights a tension that needs to be overcome in order to construct minimal systems without characteristic measures.
Claim 1.6**.**
Let be a free system. Then is not proximal.
Proof.
Assume that is proximal. Then for each and , there is a net such that . Since and commute, and since the action is continuous, we have that . Hence is not free. ∎
1.2. Soficity of automorphism groups
We show the following result, using techniques that are similar to those used to prove Theorem 1.2.
Theorem 1.7**.**
Let a minimal shift with . Then is sofic.
Soficity, as defined by Gromov [gromov1999endomorphisms] (see also Weiss [weiss2000sofic]) is a joint weakening of amenability and residual finiteness, and so this result, in a weak sense, supports the aforementioned conjecture that these automorphism groups are amenable.
Acknowledgments
We would like to thank Lewis Bowen, Byrna Kra and Anthony Quas for helpful comments and suggestions.
2. Proofs
Let be a countable group, a finite alphabet and a subshift of . Let be a finite subset of . The restriction of to is denoted by . We denote
[TABLE]
and denote the growth function of by
[TABLE]
Proposition 2.1**.**
Let be a countable group, and let be an increasing sequence of finite subsets of with . Let be a shift with the property that for every finite it holds that
[TABLE]
Then admits a characteristic measure.
If is in addition amenable then admits a characteristic invariant measure. To see this, note that the set of characteristic measures is a compact, convex subset of the Borel measures on . The group acts on this set, since for any characteristic , and it holds that . Since is amenable this action must have a fixed point, which is the desired characteristic invariant measure.
The proof of Proposition 2.1 will use the notion of a memory set. Given , there is some finite and a map such that
[TABLE]
The set is called a memory set of ; see, e.g., [ceccherini2010cellular, p. 6]. We can assume without loss of generality that contains the identity.
Proof of Proposition 2.1.
For each , let be the restriction map , so that . Let be a set of representatives of the set of preimages of . Hence and .
Let be the uniform measure over , and let be any weak limit of a subsequence of ; such a limit exists by compactness. We will show that is characteristic.
Fix . Let be a memory set of , and assume it contains the identity. There is thus such that . Denote
[TABLE]
Let be the set of projections of the elements of to . Since contains it follows that .
Define by
[TABLE]
for .
By the definition of this is well defined, and moreover ; that is, maps the restriction of to to the restriction of to . Hence . Also, is onto and so there is a subset such that the restriction of to is a bijection from to .
For every , we can, by the claim hypothesis, take to be large enough so that . Then and are both of size . Since their union is contained in and is thus of size at most , their intersection is of size at least . Since
[TABLE]
and since is a bijection when restricted to , is also of size at least , which is at least .
Since is the uniform distribution on , it follows that the push-forward measures and differ by at most in total variation. Since the sequence is increasing, this implies that for all it also holds that and differ by at most . Thus for each , and are identical, and so , since , and so the cylinder sets defined by the restrictions form a clopen basis for the Borel -algebra. We have thus shown that is characteristic.
∎
Using Proposition 2.1, the proof of our main result is straightforward.
Proof of Theorem 1.4.
Denote . By the claim hypothesis, there is a sequence such that . Thus, and because is increasing, there is another subsequence such that for every
[TABLE]
Hence if we set then the conditions of Proposition 2.1 are satisfied, and thus the conclusion follows. ∎
Theorem 1.7 is a corollary of the following more general statement.
Theorem 2.2**.**
Let be a countable group, and let be an increasing sequence of finite subsets of with . Let be a minimal shift with the property that for every finite it holds that
[TABLE]
Then is sofic.
The following lemma will serve as our working definition of a sofic group; the reduction to the usual definition is straighforward (see, e.g., [juschenko, Lemma 2.1]). A partially defined map from a set to is a map from a subset of into .
Lemma 2.3**.**
Let be a countable group. Suppose that for all finite subsets and all we have a finite set and a map that assigns to each a partially defined map from to which satisfies the following four conditions:
- (1)
for every there is a subset with , such that the map is defined and injective on . 2. (2)
For the identity element , is the identity map wherever it is defined. 3. (3)
* whenever all three are defined.* 4. (4)
If there is some such that , then is the identity.
Then is sofic.
We will need the following compactness lemma.
Lemma 2.4**.**
Let be an automorphism of a subshift such that for all . Then there is some finite set such that for all the restrictions and differ.
Proof.
Let be an increasing sequence of finite subsets of with . Assume towards a contradiction that for each there is a such that . Assume without loss of generality that the sequence converges to . Since the sequence is increasing, for all . Hence , since exhausts . This is in contradiction to our assumption that has no fixed points. ∎
Proof of Theorem 2.2.
Let be a finite subset of which includes the identity. Fix . Let be a finite subset of that contains the memory sets111See the proof of Proposition 2.1 for the definition of a memory set. of all .
Since is minimal, for every and non-trivial . To see this, note that if the set of fixed points of is non-empty then it is a subshift, and so, by minimality, must be all of . Accordingly, by Lemma 2.4, we can enlarge (while keeping it finite) so that for all and .
To prove the claim we proceed to find partially defined maps which satisfy the assumptions in Lemma 2.3 for . Choose large enough so that . Denote and .
For every , there is a natural map which, given , maps the configuration to the configuration . This is well defined, since contains the memory set of , and hence is determined by .
Since is an automorphism, is surjective. Now we set to be and let the partially defined map from to be given by whenever there exists a such that , and is the unique element of whose projection on is . This map is undefined when uniqueness fails.
We now prove that this map has the four properties required by Lemma 2.3.
- (1)
Since the projection map is surjective, and since there can be at most many elements in with more than one extension to . Thus is one-to-one on a fraction of . Since is surjective, it follows that is defined on a fraction of . 2. (2)
If has a unique extension to then that extension must be . Applying this to the identity of yields the desired condition. 3. (3)
Suppose , and are all defined. We show that .
Note that for any and , if is defined, then . Applying this to , and we get that for
[TABLE] 4. (4)
The fourth condition follows from the fact that , and the defining property of that ensures that and differ.
We have thus proved that all of the conditions of Lemma 2.3 hold, and so and the group is sofic. ∎
Theorem 1.7 is an easy corollary of Theorem 2.2, as, by the same argument as in the proof of Theorem 1.2, every zero entropy subshift must satisfy
[TABLE]
References
