Abstract
Dan Rudolph showed that for an amenable group, Γ, the generic measure-preserving action of Γ on a Lebesgue space has zero entropy. Here, this is extended to nonamenable groups. In fact, the proof shows that every action is a factor of a zero entropy action! This uses the strange phenomena that in the presence of nonamenability, entropy can increase under a factor map. The proof uses Seward’s recent generalization of Sinai’s Factor Theorem, the Gaboriau–Lyons result and my theorem that for every nonabelian free group, all Bernoulli shifts factor onto each other.
1. Introduction
Entropy theory in dynamics has recently been extended from actions of the integers (and, more generally, amenable groups) to actions of sofic groups [1] and arbitrary countable groups [2,3,4]. Here, we begin to investigate generic properties of measure-preserving actions of countable groups with an eye towards understanding their entropy theory.
Our starting point is a result due to Rokhlin [5]: the generic automorphism has zero entropy. To be precise, denotes a Lebesgue probability space and is the group of measure-preserving automorphisms in which automorphisms that agree almost everywhere are identified. This group has a natural Polish topology: a sequence converges to T if for every measurable subset , as . The claim is that the subset of all transformations that have zero entropy contain a dense subset, so that it is residual in the sense of the Baire category.
In order to consider the analogous question for general countable groups, we first need a notion of entropy. Thus, suppose we have a countable group Γ and a probability-measure-preserving action . Assuming the action is ergodic, its Rokhlin entropy , denoted , is the infimum of over all generating partitions . Recall that a partition of X is generating if the smallest Γ-invariant sigma-algebra containing it is the full Borel sigma-algebra (modulo null sets) and the Shannon entropy is defined by
Rokhlin entropy agrees with Kolmogorov–Sinai entropy for essentially free actions whenever Γ is amenable [6], and Rokhlin entropy upper-bounds sofic entropy when Γ is sofic (this is immediate from the definition in [1]).
We also need a space of actions. This can be handled in two different ways. We consider the space of all homomorphisms equipped with the topology of pointwise convergence (see [7] for details). Alternatively, let Cantor denote the usual middle thirds Cantor set and let Γ act on by (where is represented as a function ). This action is by homeomorphisms when we equip with the product topology. We let denote the space of all Γ-invariant Borel probability measures on with respect to the weak* topology. A fundamental result of Glasner–King [8], together with the weak Rokhlin property [9], imply that, if is any property of actions that is invariant under measure-conjugacy, then the set of all actions that have is a residual set if and only if the set of all measures such that has is a residual set (more precisely, Glasner and King proved this result with the unit interval in place of the Cantor set. However, in [10], it was shown to hold for any perfect Polish space in place of the unit interval). Therefore, we can choose to study either or , whichever one is most convenient for the problem at hand. For most of the paper, we use and state the results in terms of .
The first result of this paper is:
Theorem 1.
For any countably infinite group Γ, the subset of actions with zero Rokhlin entropy is residual in the sense of Baire category.
As mentioned above, because Rokhlin entropy is an upper bound for sofic entropy, this implies that the generic action has nonpositive sofic entropy with respect to all sofic approximations of Γ.
The main difficulty in proving Theorem 1 is showing that the subset of actions with zero entropy is dense. If Γ is amenable, then the argument is due to Rudolph (see the Subclaim after Claim 19 in [11]). It is essentially a consequence of the Rokhlin Lemma which implies if an action is essentially free, then its measure-conjugacy class is dense in . If Γ is nonamenable, then this no longer holds: for example, if is strongly ergodic (e.g., if it is a Bernoulli shift), then the closure of its measure-conjugacy class does not contain any nonergodic actions.
Assuming Γ is nonamenable, we take advantage of the fact that entropy can increase under a factor map. The first example of this phenomenon is due to Ornstein and Weiss [12]; they showed that the two-shift over the rank two free group factors onto the four-shift. This was generalized in several ways: Ball proved that if Γ is any nonamenable group, then there exists some probability space with such that the Bernoulli shift factors onto all Bernoulli shifts over Γ[13]. I proved that if Γ contains a nonabelian free group, then in fact all Bernoulli shifts over Γ factor onto each other [14]. It is still unknown whether this conclusion holds for all nonamenable Γ. Lastly, Seward proved that there is some number depending only on Γ such that if is an arbitrary measure-preserving action, then there exists another action with Rokhlin entropy that factors onto it [15]. In other words, every action has an extension with bounded Rokhlin entropy. Our next result shows we can take :
Theorem 2.
If Γ is nonamenable and is essentially free, ergodic and probability-measure-preserving, then there exists an action with zero Rokhlin entropy that extends .
Here is a quick sketch of the proof: using the ideas of Gaboriau–Lyons [16] and the fact that, for free groups, all Bernoulli shifts factor onto each other [14], it is shown that there exists an inverse limit of factors of Bernoulli shifts which (a) has zero Rokhlin entropy and (b) factors onto all Bernoulli shifts. By contrast, if consequences of Ornstein theory imply that inverse limits and factors of Bernoulli shifts are Bernoulli [17,18]. Without loss of generality, we may assume has positive Rokhlin entropy. Using Seward’s recent spectacular generalization of Sinai’s Factor Theorem [19], the extension is constructed as a relatively independent joining between and the aforementioned inverse limit over a common Bernoulli factor. A standard argument shows that, since is a factor of a zero entropy action, it is also a limit of zero entropy actions (see Lemma 8), proving that zero entropy actions are dense.
1.1. Strengthenings of Zero Entropy
Theorem 2 highlights the fact that, if Γ is nonamenable, zero entropy actions can have positive entropy factors. Thus, we consider the following stronger notions of zero entropy for an action :
- has completely zero entropy (this means every essentially free factor of has zero Rokhlin entropy);
- is disjoint from all Bernoulli shifts over Γ;
- is disjoint from all R-CPE (completely positive Rokhlin entropy) actions of Γ;
- every factor of every self-joining (including infinite self-joinings) of has zero Rokhlin entropy;
- has zero naive entropy (naive entropy is defined in Section 7).
If Γ is amenable, then all five notions agree with zero entropy. In Section 8, it is shown that (for any group Γ) and . Moreover, if Γ is sofic, then . It is an open problem whether all of these properties are equivalent.
To state the next result, recall that a group Γ has property MD if the measure conjugacy class of is dense in the space of actions [20] where denotes the action of Γ on its profinite completion and denotes the trivial action on the unit interval. For example, free groups, surface groups and fundamental groups of hyperbolic three-manifolds have MD (Theorem 8 below). The final result shows that, for some groups, zero naive entropy is generic:
Theorem 3.
Suppose Γ either has property MD or has the form where H is an infinite amenable residually finite group. Then, the subset of all actions with zero naive entropy is residual in the sense of Baire category.
It is an open problem whether this conclusion holds for every group Γ. Indeed, it is unknown whether every group Γ admits an essentially free action with zero naive entropy.
The notion of weak containment of actions was introduced by Kechris [20] as an analog to weak containment of unitary representations. For a given action, , it is an open problem whether the generic action that is weakly equivalent to has zero Rokhlin entropy. However, if is a Bernoulli shift, then we show this is the case in the last section, Section 10.
1.2. Organization
Section 2 introduces notation and recalls important terminology. Section 3 reviews Rokhlin entropy and proves that zero Rokhlin entropy is a condition for essentially free, ergodic actions. Section 4 constructs an inverse limit of factors of Bernoulli shifts that has zero Rokhlin entropy and factors onto all Bernoulli shifts. Section 5 proves Theorem 2. Section 6 proves Theorem 1. Section 7 introduces naive entropy. Section 8 introduces five strengthenings of zero entropy. Section 9 proves Theorem 3. The last section Section 10 formulates the open problem: for a given weak equivalence classes of actions, is zero entropy generic?
2. Preliminaries
Throughout this paper, Γ always denotes a countable discrete group and denote standard probability spaces. We are mainly concerned with probability-measure-preserving actions which is abbreviated as “pmp actions”. Let Cantor denote the standard middle thirds Cantor set, the action . This action is by homeomorphisms when is given the product topology. We let denote the space of Γ-invariant Borel probability measures on . We give the weak* topology which means that a sequence converges to a measure μ if and only if for every continuous function f on . In this topology, is compact and metrizable (by the Banach–Alaoglu Theorem). When discussing measures , we say such a measure is essentially free, ergodic or has zero Rokhlin entropy to mean that the associated action is essentially free, ergodic or has zero Rokhlin entropy.
Given a topological space X, a subset is a if it can be expressed as a countable intersection of open sets. A subset is residual in X if it contains a dense subset. If , then the statement ‘the generic element of X is contained in ’ means that is residual.
All functions, partitions and actions considered in this paper are measurable unless explicitly stated otherwise. If is a partition of a measure space , is a pmp action and is finite, then is the coarsest partition containing for all . If T is infinite, then is the smallest sigma-algebra containing for all .
Let denote the Borel sigma-algebra on X. If is a sigma-algebra and is a partition, then the Shannon entropy of relative to is
where denotes the part of containing x, denotes the characteristic function of and denotes the conditional expectation of with respect to .
3. Rokhlin Entropy
For any subcollection , we let denote the sub-sigma-algebra generated by and, if is a measurable action, then we let denote the smallest sub-sigma-algebra containing for every and . We do not distinguish between sigma-algebras that agree up to null sets. Thus, we write if and agree up to null sets.
Definition 1.
The Rokhlin entropy of an ergodic pmp action is defined by
where the infimum is over all partitions with . For any Γ-invariant , the relative Rokhlin entropy is defined by
where the infimum is over all partitions such . If is nonergodic, then the Rokhlin entropy is defined by
where is the sigma-algebra of Γ-invariant Borel sets. Given a collection of Borel subsets of X, the outer Rokhlin entropy relative to is defined by
where the infimum is over all partitions such that . We also write instead of when is trivial. These notions were introduced and studied by Seward in the series [3,4].
Lemma 1.
The subset of ergodic measures in is a set.
Proof.
This is well-known. Here is a short proof for the reader’s convenience. Fix a metric d on . For , let be the set of all measures such that there exist measures with and . Thus, is a closed subset and is an set. The lemma now follows from the fact that the subset of ergodic measures is the complement of . ☐
Next, we prove that the set of ergodic measures in with zero Rokhlin entropy form a subset. For the next three lemmas, we assume is an ergodic pmp action and are measurable partitions of X with finite Shannon entropy.
Lemma 2.
Proof.
Corollary 2.6 of [3] implies
☐
Let denote the set of all partitions of with finite Shannon entropy in which we identify partitions that agree up to measure zero. Given partitions , define
This is the Rokhlin metric. It is a complete, separable metric on .
Lemma 3.
Let be a dense subset of . Then,
Proof.
The inequality ≤ follows from Lemma 2. To see the opposite inequality, let and let be a partition with and . Since , there exists a finite subset such that Since is dense, there exists a partition such that . Since
Therefore,
It follows that
The Lemma follows by taking the limit as on both sides. ☐
Lemma 4.
Suppose are an increasing sequence of partitions of with finite Shannon entropy such that is the Borel sigma-algebra. Then, if and only if for all n.
Proof.
The definitions of Rokhlin and outer Rokhlin entropy imply for every n. This proves one implication. To see the other, suppose for all n. Let . For every n, there exists a partition of X such that and . Therefore, is generating and has entropy . This shows . Since ϵ is arbitrary, . ☐
Lemma 5.
The set
is a set.
Proof.
Let be an increasing sequence of finite partitions of such that all elements of are clopen (=closed and open) and is the full Borel sigma-algebra. Let
By Lemma 4, . Thus, it suffices to show each is a . Let denote the collection of clopen partitions of . Then, is dense in for every Borel probability measure μ. For any and finite , the maps and are continuous (because all partitions involved are clopen). Thus, for any , the set
is open. Let denote the set of all measures such that there exist and finite with and . Then, is open. By Lemma 3,
By Lemma 1, this implies is a . ☐
4. A Zero Entropy Action That Factors onto Every Bernoulli Shift
Bernoulli shifts are defined as follows: let denote a standard probability space and the product measure space. Let Γ act on by for . This action is measure-preserving and is called the Bernoulli shift over Γ with base . This section constructs a zero Rokhlin entropy action that factors onto all Bernoulli shifts (assuming Γ is nonamenable). The main part of the argument is in the next proposition: that there are factors of Bernoulli shifts with little entropy that factor onto all Bernoulli shifts.
Proposition 1.
Let Γ be a countable nonamenable group. Then, for every there exists a pmp action satisfying:
- is a factor of a Bernoulli shift,
- ,
- factors onto every Bernoulli shift over Γ.
The proof uses the fact that, for nonabelian free groups, all Bernoulli shifts factor onto each other. In order to apply this, we need some concepts from measured equivalence relations. Thus, given an action , the orbit-equivalence relation is the relation . A subequivalence relation is any measurable subset that is an equivalence relation in its own right. It is finite if for almost every the -class of x is finite. It is hyperfinite if there exists an increasing sequence of finite subequivalence relations such that . A subset is -saturated if Y is a union of -equivalence classes. The subequivalence is ergodic if every measurable -saturated subset is either null or co-null. A graphing of is a subset such that
- ,
- for every there exists such that for all .
A graphing determines a graph with vertex set X and edges consisting of unordered pairs such that . If the connected components of this graph are trees, then is called a treeing and is said to be treeable. Intuitively, graphings are treated in a manner similar to Cayley graphs and treeable subequivalence relations are analogous to free subgroups.
Lemma 6.
Let be an essentially free factor of a Bernoulli shift and suppose that its orbit-equivalence relation contains a non-hyperfinite treeable subequivalence relation . Then, for every pair of probability spaces , the direct product action
factors onto the Bernoulli shift .
Proof.
I claim that we can choose to be ergodic. Since is non-hyperfinite, Γ must be nonamenable. Then, the main result of [21] implies that there exists a measurable subset with positive measure such that restricted to Y is ergodic. Let be any measurable map such that (a) the graph of φ is contained in the orbit-equivalence relation and (b) φ restricted to Y is the identity map. Now, let be the equivalence relation given by if and only if . This is a subequivalence relation of the orbit-equivalence relation; it is ergodic because any nonnull -invariant measurable subset necessarily contains Y (since is ergodic and ) and therefore contains X (up to measure zero). It is also treeable. Indeed, if is a treeing of , then we define a treeing of by . Thus, we can choose to be ergodic.
By [16] (Proposition 14), the existence of an ergodic non-hyperfinite treeable subequivalence relation implies the existence of an essentially free ergodic pmp action of the rank two free group whose orbits are contained in Γ-orbits (the main part of this argument is due to Hjorth [22]). Let denote the cocycle
In addition, for and , define by
By [14] there exists a factor map . Thus, we define by
It is routine to check that this is the required factor. For the sake of clarity, here is an explanation without the algebra. An element has the property that its Γ-orbit is partitioned into -orbits. We consider an element as a coloring of Γ with colors in K. By identifying Γ with the orbit of x, we may also think of y as a coloring of the orbit of x. This coloring does not change if we replace the pair with for . By restriction, we can also view y as a coloring of the -orbits that make up the Γ-orbit of x. By identifying each -orbit with itself we can view y as a coloring of (actually several copies of , one for each -orbit making up the Γ-orbit). We can apply Φ to such a coloring to obtain a new coloring of (several copies of) with values in L. By identifying each such copy of with the -orbits in , we obtain again a coloring of the -orbits of x contained in the Γ-orbit of x and therefore, we obtain a coloring of Γ by L. This is what the map Ψ does. ☐
In order to use the lemma above to prove Proposition 1, we need to construct the factor in such a way that its orbit equivalence relation contains a non-hyperfinite treeable subequivalence relation. This will be accomplished through percolation theory for which we will need a bit of background. Thus, let be a graph and a parameter. The Bernoulli bond percolation with parameter p is the random subset defined by: if is an edge, then with probability p. Moreover, the events are jointly independent. This is also called p-bond percolaton. We consider to be a random subgraph of G. A cluster is a connected component of . The critical bond percolation of G is the number equal to the infimum over all such that Bernoulli bond percolation with parameter p has an infinite cluster almost surely. See [23] for background.
Lemma 7.
Let be an integer. There exists such that the following holds. Let G be a tree such that every vertex in G has degree at least 3 and at most D. Then, almost surely α-Bernoulli bond percolation on G has an infinite cluster and every such cluster is a tree with infinitely many ends. In addition, for any vertex v of G, the probability (with respect to α-bond percolation) that v is contained in a finite cluster is at least β.
Proof.
Note that G contains a copy of the three-regular tree . Therefore, . It is well-known that . This follows, for example, from the more general statement that whenever H is the Cayley graph of a nonamenable group [24] (observe that is the Cayley graph of ). Thus, let . Let denote α-bond percolation on G. Since G is a tree, ω is a forest a.s. By [25], each infinite cluster of ω has infinitely many ends a.s. (for a simpler proof, see [26]).
The probability that a vertex v is contained in a finite cluster of ω is at least the probability that v is itself a cluster. The latter probability is . ☐
Proof of Proposition 1.
Let be a finitely generated nonamenable subgroup. By [27], there exists a finite generating set such that bond-percolation on the Cayley graph has a nontrivial uniqueness phase. In other words, there exists such that p-bond-percolation on has infinitely many infinite clusters. It follows by inclusion that p-bond-percolation on also has infinitely many infinite clusters. Here, is the graph with vertex set Γ and edges of the form for . This need not be a connected graph since S need not generate Γ.
Let denote the set of edges of p-bond-percolation on . By [25], each infinite cluster of has infinitely many ends a.s. (for a simpler proof, see [26]). For , let denote the cluster of containing x.
By [23] (Lemma 7.4), there exists a percolation such that conditioned on the cluster being infinite, the cluster of containing x is a tree with infinitely many ends (almost surely). Moreover, the proof shows that we can choose to be the minimal spanning forest associated with an iid process. In particular, we can choose so that its law is a factor of a Bernoulli process. After removing some edges if necessary, we may also assume that every finite cluster of consists of a single vertex.
Let be as in Lemma 7.
Claim.
There exist random subgraphs satisfying:
- each infinite cluster of is a tree with infinitely many ends (a.s.),
- every finite cluster of is a single vertex,
- the probability that is contained in an infinite cluster of is at most times the probability that is contained in an infinite cluster of ,
- each is a factor of a Bernoulli shift.
Proof.
For induction, we assume has been constructed.
We cannot directly apply Lemma 7 because some vertex might have degree in . After repeatedly removing all edges incident to a degree 1 vertex if necessary, we may assume that no vertex of has degree 1. Next, define as follows: the vertices of are the vertices of that have degree at least 3. There is an edge in from v to w if there is a path in from v to w such that all of the intermediate vertices have degree 2.
Let be the random subgraph obtained from Bernoulli α-bond-percolation on . By Lemma 7, contains infinite clusters a.s. Moreover, each infinite cluster is a tree with infinitely many ends (since each infinite cluster of is a tree with infinitely many ends). We let be the subgraph of that is induced from . More precisely, recall that every edge e of corresponds to a path of edges in such that each intermediate vertex has degree 2. We let be the subgraph containing all such edges . Finally, we let be the subgraph obtained from by removing all edges that are contained in finite clusters. The properties in the claim are easily verified for . This completes the induction. ☐
Let be such that
It follows from the claim above that there exists a random subgraph of (for some n) such that:
- the probability that does not contain any edges incident to is at least ,
- the law of is a factor of a Bernoulli shift,
- with probability one, some cluster of is a tree with infinitely many ends.
Let X be the space of all subgraphs of and μ the law of . For , let . Let be the partition of X induced by φ: this means that are in the same part of if and only if . The Shannon entropy of satisfies the bound:
(because there are subsets of S and the probability that is empty (when is random with law μ) is at least ). The partition is generating for . Therefore,
Because each contains an infinite tree with infinitely many ends, the orbit-equivalence relation of contains a non-hyperfinite treeable subequivalence relation. To see this, let be the set of all such that is in an infinite cluster of ω. Let be the Borel equivalence relation on Y given by if and only if and are in the same infinite cluster of ω. This is a non-hyperfinite treeable equivalence relation since its equivalence classes are in one-to-one bijection with the infinite clusters of ω. Let be any Borel map with graph contained in the orbit-equivalence relation of Γ such that Φ restricted to Y is the identity map. Finally, let be the equivalence relation if and only if . Then, is the required non-hyperfinite treeable subequivalence relation. In fact, if is a treeing of , then is a treeing of .
If is not essentially free, then let be a nontrivial probability space with Shannon entropy small enough so that the Rokhlin entropy of the direct product is . Because is a factor of a Bernoulli shift, this direct product is also a factor of a Bernoulli shift. Moreover, it is essentially free. In addition, its orbit-equivalence relation contains a non-hyperfinite treeable subequivalence relation (this can be obtained by pulling back a non-hyperfinite treeable subequivalence relation of by way of the projection map). Thus, without loss of generality, we may assume is essentially free.
Let be any nontrivial probability space with Shannon entropy . Lemma 6 now implies that the product action
satisfies the statement of the Theorem. ☐
Corollary 1.
Let Γ be any countable nonamenable group. There exists a pmp action satisfying:
- is an inverse limit of factors of Bernoulli shifts,
- factors onto all Bernoulli shifts over Γ.
Proof.
By Proposition 1 there exists a sequence () of pmp actions satisfying
- each is a factor of a Bernoulli shift,
- ,
- each factors onto all Bernoulli shifts over Γ.
It follows that there exist factor maps for . Let denote the inverse limit of this system. It suffices to show . This follows from [3] (Corollary 4.9). Alternatively, it can be proven directly as follows. Let . Then, there exists an infinite subsequence such that
Let be a generating partition of with . By pulling back, we may consider to be a partition of Z. Then, is a generating partition for and
Because is arbitrary, this proves . ☐
5. Zero Entropy Extensions
Theorem 4.
Let Γ be a nonamenable countable group and a free ergodic action. Then, there exists a free ergodic action that factors onto and has zero Rokhlin entropy.
Remark 1.
Seward [15] proved, under the same hypotheses as Theorem 4, the existence of an extension of such that admits a generating partition with at most n parts where depends only on Γ. By Seward’s generalization of Krieger’s Generator Theorem [4], Theorem 4 implies that we can take .
We will need Seward’s generalization of Sinai’s Factor Theorem [19]:
Theorem 5.
(Seward [19]). For any countable group Γ and any ergodic essentially free action with positive Rokhlin entropy, there exists a Bernoulli factor such that the Rokhlin entropy of relative to this Bernoulli factor is zero.
Proof of Theorem 4.
Without loss of generality, we may assume has positive Rokhlin entropy. By Theorem 5, there exists a Bernoulli factor of such that
where denotes the sigma-algebra associated with B. Let be as in Corollary 1. Fix a factor map of onto . Let be the independent joining of and over .
It suffices to show . By [3] (Corollary 2.6),
Because outer Rokhlin entropy is upper-bounded by the Rokhlin entropy of any intermediate factor,
Thus, it suffices to prove .
Let , α be a generating partition of Z with and let β be a partition of X with such that (up to measure zero). By pulling back, we may consider α and β as partitions on . Clearly, is generating for the action and . Since is arbitrary, this implies the claim. ☐
6. Zero Entropy Is Generic
In this section, the proof of Theorem 1 is completed. Most of our results so far hold only for essentially free ergodic actions. In order to generalize them, first we show that essentially free actions are generic. The next lemma will be helpful twice.
Lemma 8.
Let be a pmp action and a Γ-equivariant measurable map. Then, there exists a sequence of measures such that
- is measurably-conjugate to for all i,
- in the weak* topology as .
Proof.
Let be a Γ-equivariant measurable map such that is measurably conjugate to . To see that such a map exists, identify Cantor with (where the latter has the product topology). We consider an element to be a function . Choose a sequence of measurable maps such that for all distinct elements there exists some i such that . Then, define and in general, define . It is routine to check that this satisfies the claim.
Define Γ-equivariant maps so that the first n-coordinates of agree with those of and the last coordinates agree with . In other words, for every ,
As above, we are identifying Cantor with . Clearly, is Γ-equivariant, is an isomorphism onto its image and . To finish the lemma, set . ☐
Let denote the subset of ergodic measures.
Lemma 9.
The subset of all essentially free measures in is a set. Moreover, this subset is dense in and its intersection with is dense in .
Proof.
For any element , let . Then, is compact in . By the Portmanteau Theorem, for every , the set is open. Therefore,
is a set. The above set is the same as the subset of essentially free measures. This proves the first claim.
To prove the second claim, let be arbitrary. We observe that the direct product of with a Bernoulli shift is essentially free and factors onto .
Moreover, this product is ergodic if μ is ergodic. Thus, Lemma 8 implies that μ is a weak* limit of essentially free measures and these measures can be chosen to be ergodic if μ is ergodic. ☐
The next step shows that the generic ergodic measure has zero Rokhlin entropy.
Proposition 2.
The subset of measures such that the corresponding action is essentially free and has zero Rokhlin entropy, is a dense subset of .
Proof.
Lemmas 9 and 5 show that this subset is a . If Γ is nonamenable, then it is dense by Lemmas 8, 9 and Theorem 4. If Γ is amenable, then the result is due to Rudolph (see the Subclaim after Claim 19 in [11]). This uses the fact that Rokhlin entropy agrees with classical entropy by [6]. ☐
Next, we prove that any property that is residual for ergodic measures is automatically residual for all measures. To make this precise, let
denote the barycenter map and the ergodic decomposition map respectively. To be precise,
and π is the inverse of β.
Proposition 3.
Let be Borel and define
If is residual in , then is residual in .
First, we need a lemma:
Lemma 10.
The barycenter map β is continuous. The ergodic decomposition map π is continuous if and only if Γ has property (T) in which case it is a homeomorphism.
Proof.
The first statement is straightforward. The main result of [28] states that if Γ has property (T), then is a closed (and therefore compact) subset of . On the other hand, if Γ does not have (T), then is dense in . Since β and π are bijective, these two statements imply the lemma. ☐
Proof of Proposition 3.
Case 1. Suppose Γ does not have property (T). By [28], is dense in . By Lemma 1, is a . Therefore, is residual in . Thus, is residual in . Since , this proves is also residual.
Case 2. Suppose Γ has property (T). Let
By Lemma 10, it suffices to prove that is residual. Since contains a dense , we may assume without loss of generality that is a dense . Thus, the portmanteau Theorem implies is a subset.
Let d be a continuous metric on . Because is dense in , for every , there exists a Borel map with for all x. Then, for every , in the weak* topology as . Since , this proves is dense. ☐
Proof of Theorem 1.
The main theorem of [2] implies that an action has zero Rokhlin if and only if almost every ergodic component has zero Rokhlin entropy. In addition, [3] (Corollary 4.4) shows that is Borel (where is the set of measures with zero Rokhlin entropy). Thus, Theorem 1 follows from Propositions 2 and 3. ☐
Remark 2.
Here is a brief sketch of an alternative proof of Theorem 1. Using the nonergodic version of Seward’s generalization of Sinai’s Theorem [19] in the proof of Theorem 4, it can be shown that every essentially free pmp action admits a zero Rokhlin entropy extension (ergodicity is not required). The theory of weak equivalence of actions shows that the measure conjugacy class of any action in contains the conjugacy class of each of its factors. Because essentially free actions are dense in , it follows that zero Rokhlin entropy actions are also dense in . In [2] (Lemma 8.7), it is proven that the subset of all zero-Rokhlin entropy actions in is a subset. Alternatively, this can be proven in a manner similar to the proof of Lemma 5.
7. Naive Entropy
This section introduces naive entropy. The main result is that zero naive entropy is closed under factors, self-joinings and inverse limits.
Definition 2.
Let be a pmp action and a partition of X. The naive entropy of is
where means “a finite subset of”. The naive entropy of is
where the supremum is over all finite-entropy partitions .
It is an exercise to show that, if Γ is amenable, then naive entropy coincides with Kolmogorov–Sinai entropy (we will not need this fact). However, if Γ is nonamenable, the situation is very different:
Theorem 6.
If Γ is nonamenable, then every pmp action of Γ has naive entropy in .
Proof.
Suppose and there is a finite-entropy partition of X with . Let be finite. Then,
Since Γ is nonamenable, for every real number, , there is a finite , such that
Hence, , proving the theorem. ☐
Definition 3.
Let be pmp actions (for where I is some index set). We always assume I is at most countable. A joining of these actions is a Γ-invariant Borel probability measure on the produce space whose i-th marginal is . Here, Γ acts on the product diagonally: . We also refer to the action as a joining. The joining is said to be finite if I is finite and infinite otherwise. In the special case that for all , the joining is called a self-joining.
The main result here is:
Proposition 4.
Zero naive entropy is closed under factors, self-joinings (both finite and infinite) and inverse limits.
We will need the following lemma showing that naive entropy is Lipschitz in the space of partitions.
Lemma 11.
Let be a pmp action and be measurable partitions of X with finite Shannon entropy. Then, for any finite ,
Thus,
Proof.
Recall that
Subtracting, we obtain
This proves the first inequality. The second one follows from the first (observe that we need only consider a sequence of Fs that realize the naive entropy for ). ☐
Proof of Proposition 4.
Let us suppose that is an inverse limit of actions having zero naive entropy. We will show has zero naive entropy. Let be the Borel sigma-algebra of . After pulling back under the factor map, we may identify as a sub-sigma-algebra of the Borel sub-sigma-algebra of X which is denoted here by . Thus, is an increasing sequence of Γ-invariant sigma-algebras and . Because each action has zero naive entropy, if is any partition of X satisfying for some i and , then, necessarily, .
Let be an arbitrary measurable partition of X with finite Shannon entropy. Since , for any , there exists an i and a partition with finite Shannon entropy such that . By Lemma 11, . Since ϵ and are arbitrary, this implies has zero naive entropy and therefore zero naive entropy is closed under inverse limits.
Next, suppose has zero naive entropy and let λ be a self-joining of . We regard λ as a measure on . If is any partition of with and is arbitrary, then there exists a partition of X with finite Shannon entropy such that . Thus, Lemma 11 implies
Since ,
Thus, . Since ϵ and are arbitrary, this implies λ has zero naive entropy and, by induction, zero naive entropy is closed under finite self-joinings. Any infinite self-joining is an inverse limit of finite self-joinings. Thus, the above results show that zero naive entropy is closed under infinite self-joinings. It is immediate from the definitions that zero naive entropy is closed under factors. ☐
I do not know whether zero naive entropy is closed under joinings. For example, if two actions have zero naive entropy, does their direct product also have zero naive entropy?
8. Five Strengthenings of Zero Entropy
Here, we introduce five strengthenings of the notion of zero entropy. First, we need the following definitions:
Definition 4.
An action has completely positive Rokhlin entropy (denoted R-CPE) if every nontrivial factor has positive Rokhlin entropy.
Definition 5.
Two actions are said to be disjoint if the only joining between them is the product joining.
Theorem 7.
Let be an ergodic essentially free pmp action. Consider the following five properties:
- 1.
- has completely zero entropy (this means every essentially free factor of has zero Rokhlin entropy),
- 2.
- is disjoint from all Bernoulli shifts over Γ,
- 3.
- is disjoint from all R-CPE actions of Γ,
- 4.
- every factor of every self-joining (including infinite self-joinings) of has zero Rokhlin entropy,
- 5.
- has zero naive entropy.
Remark 3.
When Γ is amenable, all five properties listed above are equivalent because naive entropy and Rokhlin entropy agree with Kolmogorov–Sinai entropy (at least for ergodic essentially free actions). However, when Γ is nonamenable, it is an open problem whether any or all of the implications above can be reversed.
Remark 4.
If Γ is nonsofic, then we do not know whether Bernoulli shifts over Γ have positive Rokhlin entropy. This is why we cannot say whether unconditionally. See [3] for partial results on this problem.
Proof.
() This is immediate from Seward’s generalization of Sinai’s Factor Theorem 5, which states that any ergodic essentially free action with positive entropy factors onto a Bernoulli shift. Thus, if has a factor with positive entropy, then it has a Bernoulli factor . The corresponding factor joining is the measure . This is a non-product joining. (, assuming Γ is sofic) Since Γ is sofic, Bernoulli shifts have completely positive entropy by [29]. This uses the fact that sofic entropy is a lower bound for Rokhlin entropy.
() Let be another pmp action of Γ and suppose that and admit a nonproduct joining. It follows from the relative independence theorem [30] (Theorem 6.25) that there exists an infinite self-joining λ of such that and admit a nontrivial common factor. Therefore, cannot be R-CPE.
() This follows from Proposition 4 and [31] (Theorem 1.5) which states that the naive entropy of a generating partition is an upper bound for the Rokhlin entropy. Therefore, zero naive entropy implies zero Rokhlin entropy. ☐
9. Zero Naive Entropy
For an arbitrary group Γ, it is an open problem whether Γ has an essentially free pmp action with zero naive entropy. However for special classes of groups, we will show that not only do such actions exist, they are generic. First, we need a definition:
Definition 6.
The profinite completion of Γ is the inverse limit of the groups of the form where has finite index in Γ. It is a compact group on which Γ acts by left translations. The group Γ is said to be residually finite if any one of the following equivalent conditions hold:
- the action of Γ on its profinite completion is essentially free,
- for every non-identity element there exists a finite-index subgroup such that ,
- there exists a decreasing sequence of finite-index normal subgroups such that .
Definition 7.
Let denote the action of Γ on its profinite completion by left-translations. This is a pmp action where the measure on the profinite completion is its Haar measure. In addition, let ι denote the trivial action of Γ on the unit interval with respect to Lebesgue measure (the trivial action is the action in which every group element fixes every point).
A group Γ has MD if the measure conjugacy class of the direct product action is dense in the space of actions . Equivalently, Γ has MD if the subset of measures in with finite support is dense in the weak* topology. This definition is due to Kechris [20]; it is a strengthening of property FD which was considered earlier by Lubotzky–Shalom [32] in their study of unitary representations.
Theorem 8.
Free groups, surface groups and fundamental groups of closed hyperbolic three-manifolds have MD.
Proof.
The case of free groups was proven independently by Kechris [20] and Bowen [33]. The rest was proven in [34]. The case of fundamental groups of closed hyperbolic 3-manifolds relies on Agol’s virtual fibering Theorem [35]. ☐
Let ZNE denote the subset of measures with zero naive entropy.
Lemma 12.
For any countable group Γ, ZNE is a subset of .
Proof.
Let be an increasing sequence of finite clopen partitions of such that is the Borel sigma-algebra. Recall that clopen means every part of is both closed and open. Let be the subset of all measures such that . We claim that . Clearly, . Suppose . Let be an arbitrary partition of with . Then, for every there exists n such that . By Lemma 11, . Since ϵ and are arbitrary this proves and therefore, as claimed.
It now suffices to show each is a subset. Indeed, this follows from the definition:
and the fact that is weak* continuous for every finite . The reason this is weak* continuous uses the fact that if is clopen, then its characteristic function is continuous and therefore induces a continuous functional on . ☐
Definition 8.
The kernel of an action is the subgroup .
Lemma 13.
If has infinite kernel, then it has zero naive entropy.
Proof.
Let be an arbitrary partition of X with finite Shannon entropy. Then, (up to measure zero) for every . Therefore,
In particular, if is infinite, then . ☐
Proof of Theorem 3.
By the Glasner–King correspondence mentioned in the introduction, it suffices to show that ZNE is a dense subset of . By Lemma 12, it is a . If Γ has property MD, then, by definition, the subset of all measures with finite support is dense in . Each such measure has infinite kernel. Thus, Lemma 13 implies ZNE is dense. Thus, we assume , where H is infinite, amenable and residually finite.
Because H is residually finite, there exists a sequence of normal finite-index subgroups of H with . By [36] (Theorem 1), because H is amenable, there exist right fundamental domains for such that forms a Følner sequence. This means: (1) H is the disjoint union of over and (2) for any finite ,
Let be arbitrary. We will show that it is a weak* limit of measures with zero Rokhlin entropy. For , define by , where and is the unique element satisfying . Observe that is -invariant and is G-equivariant. Therefore, the pushforward measure is -invariant. In addition, observe that is a left fundamental domain in the sense that H is the disjoint union of over . Therefore,
is Γ-invariant. Since is normal, the kernel of the action contains . By Lemma 13, this action has zero naive entropy.
We claim that as . To see this, let denote the graph of :
Let . Because is a joining of μ and , it suffices to show that for every ,
as . Thus, fix . To simplify notation, we let
It suffices to show that for any ,
since the latter tends to 1 uniformly in x. This follows from
which follows directly from the definitions: if and , then
This proves the claim. This implies that as in the weak* topology. Indeed, if is any finite subset and any continuous function, then the function defined by composing the restriction map with f satisfies . Since such functions are dense in the space of all continuous functions, it follows that as claimed. Because μ is arbitrary, this implies ZNE is dense. ☐
10. Weak Containment
Given any pmp action , let denote the set of all measures such that there is a Γ-equivariant measurable map with . This is the set of factor measures. Let be the weak* closure of .
Now, suppose is another pmp action. We say is weakly contained in , denoted , if . If and , then we say and are weakly equivalent. This notion was introduced in [20]. In [37], it is proven that the definition given in this paper is equivalent to the one introduced in [20]. Some basic facts: all Bernoulli shifts over Γ are weakly equivalent. In fact, the Abert–Weiss Theorem [38] states: if is any essentially free action of Γ, then weakly contains a Bernoulli shift. There exists an action that weakly contains all actions of Γ (this is called the weak Rokhlin property, see [9]).
It is an open problem whether, for a given action, , the set of all measures with zero Rokhlin entropy is residual. Of course, this is true if by Theorem 1. It is also true if is a Bernoulli shift:
Corollary 2.
Let be a Bernoulli shift. Then, the generic measure has zero Rokhlin entropy.
Proof.
If Γ is amenable, then . Thus, the result follows from Theorem 1. Thus, we may assume Γ is nonamenable. In this case, is strongly ergodic and therefore every measure is ergodic. By Lemma 5, the set of all measures with zero Rokhlin entropy is a subset. By Corollary 1, there exists an action that is an inverse limit of factors of Bernoulli shifts that factors onto all Bernoulli shifts and has zero Rokhlin entropy. By Lemma 8, . By Lemma 8 again, the set of measures in with zero Rokhlin entropy is dense. ☐
Acknowledgments
I am deeply grateful to Robin Tucker-Drob and Brandon Seward. Many of the ideas presented here were obtained during conversations with each of them, spanning over a year. In addition, thanks to Miklos Abert for suggesting the problem of determining whether zero entropy is generic in each weak equivalence class. I would also like to thank Pierre-Antoine Guihéneuf for the reference [5] and Benjy Weiss for informing me of Rudolph’s result in [11]. This research was supported in part by National Science Foundation grant DMS-1500389, NSF CAREER Award DMS-0954606.
Conflicts of Interest
The author declares no conflict of interest.
References
- Bowen, L. Measure conjugacy invariants for actions of countable sofic groups. J. Am. Math. Soc. 2010, 23, 217–245. [Google Scholar] [CrossRef]
- Alpeev, A.; Seward, B. Krieger’s finite generator theorem for ergodic actions of countable groups III. 2016, in press. [Google Scholar]
- Seward, B. Krieger’s finite generator theorem for ergodic actions of countable groups II. 2015. arXiv:1501.03367v2. [Google Scholar]
- Seward, B. Krieger’s finite generator theorem for ergodic actions of countable groups I. 2014. arXiv:1405.3604. [Google Scholar]
- Rokhlin, V.A. Entropy of metric automorphism. Dokl. Akad. Nauk SSSR 1959, 124, 980–983. [Google Scholar]
- Seward, B.; Tucker-Drob, R.D. Borel structurability on the 2-shift of a countable group. Ann. Pure Appl. Log. 2016, 167, 1–21. [Google Scholar] [CrossRef]
- Kechris, A.S. Global aspects of ergodic group actions. In Mathematical Surveys and Monographs; American Mathematical Society: Providence, RI, USA, 2010; Volume 160. [Google Scholar]
- Glasner, E.; King, J. A zero-one law for dynamical properties. Contemp. Math. 1998, 215, 231–242. [Google Scholar]
- Glasner, E.; Thouvenot, J.-P.; Weiss, B. Every countable group has the weak Rohlin property. Bull. Lond. Math. Soc. 2006, 38, 932–936. [Google Scholar] [CrossRef]
- Bowen, L.; Hartman, Y.; Tamuz, O. Generic stationary measures and actions. 2015. arXiv:1405.2260. [Google Scholar] [CrossRef]
- Foreman, M.; Weiss, B. An anti-classification theorem for ergodic measure preserving transformations. J. Eur. Math. Soc. 2004, 6, 277–292. [Google Scholar] [CrossRef]
- Ornstein, D.S.; Weiss, B. Entropy and isomorphism theorems for actions of amenable groups. J. Anal. Math. 1987, 48, 1–141. [Google Scholar] [CrossRef]
- Ball, K. Factors of independent and identically distributed processes with non-amenable group actions. Ergod. Theory Dyn. Syst. 2005, 25, 711–730. [Google Scholar] [CrossRef]
- Bowen, L. Weak isomorphisms between Bernoulli shifts. Israel J. Math. 2011, 183, 93–102. [Google Scholar] [CrossRef] [Green Version]
- Seward, B. Every action of a nonamenable group is the factor of a small action. J. Mod. Dyn. 2014, 8, 251–270. [Google Scholar] [CrossRef]
- Gaboriau, D.; Lyons, R. A measurable-group-theoretic solution to von Neumann’s problem. Invent. Math. 2009, 177, 533–540. [Google Scholar] [CrossRef]
- Ornstein, D. Factors of Bernoulli shifts are Bernoulli shifts. Adv. Math. 1970, 5, 349–364. [Google Scholar] [CrossRef]
- Ornstein, D.S. Ergodic Theory, Randomness, and Dynamical Systems; Yale University Press: New Haven, CT, USA, 1971. [Google Scholar]
- Seward, B. Positive entropy actions of countable groups factor onto Bernoulli shifts. 2015, in press. [Google Scholar]
- Kechris, A.S. Weak containment in the space of actions of a free group. Isr. J. Math. 2012, 189, 461–507. [Google Scholar] [CrossRef]
- Chifan, I.; Ioana, A. Ergodic subequivalence relations induced by a Bernoulli action. Geom. Funct. Anal. 2010, 20, 53–67. [Google Scholar] [CrossRef] [Green Version]
- Hjorth, G. A lemma for cost attained. Ann. Pure Appl. Log. 2006, 143, 87–102. [Google Scholar] [CrossRef]
- Benjamini, I.; Lyons, R.; Peres, Y.; Schramm, O. Group-invariant percolation on graphs. Geom. Funct. Anal. 1999, 9, 29–66. [Google Scholar] [CrossRef]
- Benjamini, I.; Lyons, R.; Peres, Y.; Schramm, O. Critical percolation on any nonamenable group has no infinite clusters. Ann. Probab. 1999, 27, 1347–1356. [Google Scholar]
- Häggström, O.; Peres, Y. Monotonicity of uniqueness for percolation on Cayley graphs: All infinite clusters are born simultaneously. Probab. Theory Relat. Fields 1999, 113, 273–285. [Google Scholar] [CrossRef]
- Lyons, R.; Schramm, O. Indistinguishability of percolation clusters. Ann. Probab. 1999, 27, 1809–1836. [Google Scholar]
- Pak, I.; Smirnova-Nagnibeda, T. On non-uniqueness of percolation on nonamenable Cayley graphs. C. R. Acad. Sci. Paris Sér. I Math. 2000, 330, 495–500. [Google Scholar] [CrossRef]
- Glasner, E.; Weiss, B. Kazhdan’s property T and the geometry of the collection of invariant measures. Geom. Funct. Anal. 1997, 7, 917–935. [Google Scholar] [CrossRef]
- Kerr, D. Bernoulli actions of sofic groups have completely positive entropy. Israel J. Math. 2014, 202, 461–474. [Google Scholar] [CrossRef]
- Glasner, E. Ergodic theory via joinings. In Mathematical Surveys and Monographs; American Mathematical Society: Providence, RI, USA, 2003; Volume 101. [Google Scholar]
- Seward, B. Weak containment and Rokhlin entropy. 2016. arXiv:1602.06680. [Google Scholar]
- Lubotzky, A.; Shalom, Y. Finite representations in the unitary dual and Ramanujan groups. Contemp. Math. 2004, 347, 173–189. [Google Scholar]
- Bowen, L. Periodicity and circle packings of the hyperbolic plane. Geom. Dedicata 2003, 102, 213–236. [Google Scholar] [CrossRef]
- Bowen, L.; Tucker-Drob, R.D. On a co-induction question of Kechris. Israel J. Math. 2013, 194, 209–224. [Google Scholar] [CrossRef]
- Agol, I.; Groves, D.; Manning, J. The virtual Haken conjecture. Doc. Math. 2013, 18, 1045–1087. [Google Scholar]
- Weiss, B. Monotileable amenable groups. In Topology, Ergodic Theory, Real Algebraic Geometry: Rokhlin’s Memorial; American Mathematical Society: Providence, RI, USA, 2001; pp. 257–262. [Google Scholar]
- Tucker-Drob, R.D. Weak equivalence and non-classifiability of measure preserving actions. Ergod. Theory Dyn. Syst. 2015, 35, 293–336. [Google Scholar] [CrossRef] [Green Version]
- Abért, M.; Weiss, B. Bernoulli actions are weakly contained in any free action. Ergod. Theory Dyn. Syst. 2013, 33, 323–333. [Google Scholar] [CrossRef]
© 2016 by the author; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC-BY) license (http://creativecommons.org/licenses/by/4.0/).