Next Article in Journal
Stimuli-Magnitude-Adaptive Sample Selection for Data-Driven Haptic Modeling
Next Article in Special Issue
On Extensions over Semigroups and Applications
Previous Article in Journal
Application of Entropy-Based Metrics to Identify Emotional Distress from Electroencephalographic Recordings
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Zero Entropy Is Generic

Department of Mathematics, College of Natural Sciences, University of Texas at Austin, Austin, TX 78712, USA
Entropy 2016, 18(6), 220; https://doi.org/10.3390/e18060220
Submission received: 16 April 2016 / Revised: 19 May 2016 / Accepted: 31 May 2016 / Published: 4 June 2016
(This article belongs to the Special Issue Entropic Properties of Dynamical Systems)

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 T Aut ( X , μ ) has zero entropy. To be precise, ( X , μ ) denotes a Lebesgue probability space and Aut ( X , μ ) is the group of measure-preserving automorphisms ϕ : X X in which automorphisms that agree almost everywhere are identified. This group has a natural Polish topology: a sequence { T i } Aut ( X , μ ) converges to T if for every measurable subset A X , μ ( T i A   Δ   T A ) 0 as i . The claim is that the subset of all transformations T Aut ( X , μ ) that have zero entropy contain a dense G δ 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 Γ ( X , μ ) . Assuming the action is ergodic, its Rokhlin entropy , denoted h Γ R o k ( X , μ ) , is the infimum of H μ ( P ) over all generating partitions P . Recall that a partition P 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
H μ ( P ) : = - P P μ ( P ) log μ ( P ) .
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 A ( Γ , X , μ ) of all homomorphisms α : Γ Aut ( X , μ ) 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 Cantor Γ by ( f x ) ( g ) = x ( f - 1 g ) (where x Cantor Γ is represented as a function x : Γ Cantor ). This action is by homeomorphisms when we equip Cantor Γ with the product topology. We let Prob Γ ( Cantor Γ ) denote the space of all Γ-invariant Borel probability measures on Cantor Γ with respect to the weak* topology. A fundamental result of Glasner–King [8], together with the weak Rokhlin property [9], imply that, if P is any property of actions that is invariant under measure-conjugacy, then the set of all actions α A ( Γ , X , μ ) that have P is a residual set if and only if the set of all measures μ Prob Γ ( Cantor Γ ) such that Γ ( Cantor Γ , μ ) has P 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 A ( Γ , X , μ ) or Prob Γ ( Cantor Γ ) , whichever one is most convenient for the problem at hand. For most of the paper, we use Prob Γ ( Cantor Γ ) and state the results in terms of A ( Γ , X , μ ) .
The first result of this paper is:
Theorem 1. 
For any countably infinite group Γ, the subset of actions a A ( Γ , X , μ ) 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 a A ( Γ , X , μ ) 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 a A ( Γ , X , μ ) is essentially free, then its measure-conjugacy class is dense in A ( Γ , X , μ ) . If Γ is nonamenable, then this no longer holds: for example, if a 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 ( K , κ ) with | K | < such that the Bernoulli shift Γ ( K , κ ) Γ 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 r ( Γ ) < depending only on Γ such that if Γ ( X , μ ) is an arbitrary measure-preserving action, then there exists another action Γ ( X ˜ , μ ˜ ) with Rokhlin entropy r ( Γ ) that factors onto it [15]. In other words, every action has an extension with bounded Rokhlin entropy. Our next result shows we can take r ( Γ ) = 0 :
Theorem 2. 
If Γ is nonamenable and Γ ( X , μ ) is essentially free, ergodic and probability-measure-preserving, then there exists an action Γ ( X ˜ , μ ˜ ) with zero Rokhlin entropy that extends Γ ( X , μ ) .
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 Γ = Z consequences of Ornstein theory imply that inverse limits and factors of Bernoulli shifts are Bernoulli [17,18]. Without loss of generality, we may assume Γ ( X , μ ) has positive Rokhlin entropy. Using Seward’s recent spectacular generalization of Sinai’s Factor Theorem [19], the extension Γ ( X ˜ , μ ˜ ) is constructed as a relatively independent joining between Γ ( X , μ ) and the aforementioned inverse limit over a common Bernoulli factor. A standard argument shows that, since Γ ( X , μ ) 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 a = Γ ( X , μ ) :
  • a has completely zero entropy (this means every essentially free factor of a has zero Rokhlin entropy);
  • a is disjoint from all Bernoulli shifts over Γ;
  • a is disjoint from all R-CPE (completely positive Rokhlin entropy) actions of Γ;
  • every factor of every self-joining (including infinite self-joinings) of a has zero Rokhlin entropy;
  • a 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 Γ) 1 2 and 3 4 5 . Moreover, if Γ is sofic, then 2 3 . 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 p Γ × ι Γ is dense in the space A ( Γ , X , μ ) of actions [20] where p Γ 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 Γ = G × H where H is an infinite amenable residually finite group. Then, the subset of all actions a A ( Γ , X , μ ) 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, a , it is an open problem whether the generic action that is weakly equivalent to a has zero Rokhlin entropy. However, if a 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 G δ 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 ( X , μ ) , ( Y , ν ) 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, Γ Cantor Γ the action ( g x ) ( f ) = x ( g - 1 f ) . This action is by homeomorphisms when Cantor Γ is given the product topology. We let Prob Γ ( Cantor Γ ) denote the space of Γ-invariant Borel probability measures on Cantor Γ . We give Prob Γ ( Cantor Γ ) the weak* topology which means that a sequence { μ n } converges to a measure μ if and only if f μ n f d μ for every continuous function f on Cantor Γ . In this topology, Prob Γ ( Cantor Γ ) is compact and metrizable (by the Banach–Alaoglu Theorem). When discussing measures μ Prob Γ ( Cantor Γ ) , we say such a measure is essentially free, ergodic or has zero Rokhlin entropy to mean that the associated action Γ ( Cantor Γ , μ ) is essentially free, ergodic or has zero Rokhlin entropy.
Given a topological space X, a subset Y X is a G δ if it can be expressed as a countable intersection of open sets. A subset Y X is residual in X if it contains a dense G δ subset. If X 0 X , then the statement ‘the generic element of X is contained in X 0 ’ means that X 0 is residual.
All functions, partitions and actions considered in this paper are measurable unless explicitly stated otherwise. If P is a partition of a measure space ( X , μ ) , Γ ( X , μ ) is a pmp action and T Γ is finite, then P T : = t T t - 1 P is the coarsest partition containing t - 1 P for all t T . If T is infinite, then P T is the smallest sigma-algebra containing t - 1 P for all t T .
Let B X denote the Borel sigma-algebra on X. If F B X is a sigma-algebra and P is a partition, then the Shannon entropy of P relative to F is
H μ ( P | F ) = - log E [ χ P ( x ) | F ] ( x ) d μ ( x ) ,
where P ( x ) denotes the part of P containing x, χ P ( x ) denotes the characteristic function of P ( x ) and E [ χ P ( x ) | F ] denotes the conditional expectation of χ P ( x ) with respect to F .

3. Rokhlin Entropy

For any subcollection F B X , we let σ - alg ( F ) B X denote the sub-sigma-algebra generated by F and, if Γ X is a measurable action, then we let σ - alg Γ ( F ) denote the smallest sub-sigma-algebra containing g F for every g Γ and F F . We do not distinguish between sigma-algebras that agree up to null sets. Thus, we write F 1 = F 2 if F 1 and F 2 agree up to null sets.
Definition 1. 
The Rokhlin entropy of an ergodic pmp action Γ ( X , μ ) is defined by
h Γ R o k ( X , μ ) = inf P H μ ( P ) ,
where the infimum is over all partitions P with σ - alg Γ ( P ) = B X . For any Γ-invariant F B X , the relative Rokhlin entropy is defined by
h Γ R o k ( X , μ | F ) = inf P H μ ( P | F ) ,
where the infimum is over all partitions P such σ - alg Γ ( P F ) = B X . If Γ ( X , μ ) is nonergodic, then the Rokhlin entropy is defined by
h Γ R o k ( X , μ ) = inf P H μ ( P | Inv ) ,
where Inv is the sigma-algebra of Γ-invariant Borel sets. Given a collection C of Borel subsets of X, the outer Rokhlin entropy relative to F is defined by
h Γ , μ R o k ( C | F ) = inf P H μ ( P | F ) ,
where the infimum is over all partitions P such that C σ - alg Γ ( P ) F . We also write h Γ , μ R o k ( C ) instead of h Γ , μ R o k ( C | F ) when F is trivial. These notions were introduced and studied by Seward in the series [3,4].
Lemma 1. 
The subset of ergodic measures in Prob Γ ( Cantor Γ ) is a G δ set.
Proof. 
This is well-known. Here is a short proof for the reader’s convenience. Fix a metric d on Prob Γ ( Cantor Γ ) . For n = 1 , 2 , 3 , , let X n be the set of all measures μ Prob Γ ( Cantor Γ ) such that there exist measures μ 1 , μ 2 Prob Γ ( Cantor Γ ) with d ( μ 1 , μ 2 ) 1 / n and μ = μ 1 + μ 2 2 . Thus, X n is a closed subset and n = 1 X n is an F σ set. The lemma now follows from the fact that the subset of ergodic measures is the complement of n = 1 X n . ☐
Next, we prove that the set of ergodic measures in Prob Γ ( Cantor Γ ) with zero Rokhlin entropy form a G δ subset. For the next three lemmas, we assume Γ ( X , μ ) is an ergodic pmp action and P , Q are measurable partitions of X with finite Shannon entropy.
Lemma 2. 
h Γ , μ R o k ( P ) H μ ( Q ) + H μ ( P | σ - alg Γ ( Q ) ) .
Proof. 
Corollary 2.6 of [3] implies
h Γ , μ R o k ( P ) h Γ , μ R o k ( Q ) + h Γ , μ R o k ( P | σ - alg Γ ( Q ) ) H μ ( Q ) + H μ ( P | σ - alg Γ ( Q ) ) .
Let P ( X , μ ) denote the set of all partitions of ( X , μ ) with finite Shannon entropy in which we identify partitions that agree up to measure zero. Given partitions P , Q P ( X , μ ) , define
d R o k ( P , Q ) : = H μ ( P | Q ) + H μ ( Q | P ) .
This is the Rokhlin metric. It is a complete, separable metric on P ( X , μ ) .
Lemma 3. 
Let D be a dense subset of P ( X , μ ) . Then,
h Γ , μ R o k ( P ) = sup ϵ > 0 inf { H μ ( Q ) : Q D , H μ ( P | σ - alg Γ ( Q ) ) < ϵ } .
Proof. 
The inequality ≤ follows from Lemma 2. To see the opposite inequality, let ϵ > 0 and let S be a partition with P σ - alg Γ ( S ) and H μ ( S ) h Γ , μ R o k ( P ) + ϵ . Since H μ ( P | S Γ ) = 0 , there exists a finite subset F Γ such that H μ ( P | S F ) < ϵ / 2 . Since D is dense, there exists a partition R D such that d R o k ( R , S ) < ϵ | F | - 1 / 2 . Since
H μ ( R F | S F ) f F H μ ( f - 1 R | S F ) f F H μ ( f - 1 R | f - 1 S ) = | F | H μ ( R | S ) ,
d R o k ( R F , S F ) | F | d R o k ( R , S ) < ϵ / 2 .
Therefore,
H μ ( P | σ - alg Γ ( R ) ) H μ ( P | R F ) H μ ( P | S F ) + d R o k ( S F , R F ) < ϵ .
It follows that
inf { H μ ( Q ) : Q D , H ( P | σ - alg Γ ( Q ) ) < ϵ } H μ ( R ) H μ ( S ) + d R o k ( R , S ) h Γ , μ R o k ( P ) + 2 ϵ .
The Lemma follows by taking the limit as ϵ 0 on both sides. ☐
Lemma 4. 
Suppose P 1 P 2 are an increasing sequence of partitions of ( X , μ ) with finite Shannon entropy such that n P n is the Borel sigma-algebra. Then, h Γ R o k ( X , μ ) = 0 if and only if h Γ , μ R o k ( P n ) = 0 for all n.
Proof. 
The definitions of Rokhlin and outer Rokhlin entropy imply h Γ R o k ( X , μ ) h Γ , μ R o k ( P n ) for every n. This proves one implication. To see the other, suppose h Γ , μ R o k ( P n ) = 0 for all n. Let ϵ > 0 . For every n, there exists a partition Q n of X such that H μ ( Q n ) < ϵ 2 - n and P n σ - alg Γ ( Q n ) . Therefore, n Q n is generating and has entropy < ϵ . This shows h Γ R o k ( X , μ ) < ϵ . Since ϵ is arbitrary, h Γ R o k ( X , μ ) = 0 . ☐
Lemma 5. 
The set
E 0 : = { μ Prob Γ ( Cantor Γ ) : h Γ R o k ( Cantor Γ , μ ) = 0 a n d Γ ( Cantor Γ , μ ) ergodic }
is a G δ set.
Proof. 
Let P n be an increasing sequence of finite partitions of Cantor Γ such that all elements of P n are clopen (=closed and open) and n P n is the full Borel sigma-algebra. Let
E n : = { μ Prob Γ ( Cantor Γ ) : h Γ , μ R o k ( P n ) = 0 and Γ ( Cantor Γ , μ ) ergodic } .
By Lemma 4, E 0 = n E n . Thus, it suffices to show each E n is a G δ . Let D denote the collection of clopen partitions of Cantor Γ . Then, D is dense in P ( Cantor Γ , μ ) for every Borel probability measure μ. For any Q D and finite F Γ , the maps μ H μ ( Q ) and μ H μ ( P n | Q F ) are continuous (because all partitions involved are clopen). Thus, for any ϵ > 0 , the set
{ μ Prob Γ ( Cantor Γ ) : H μ ( P n | Q F ) < ϵ }
is open. Let O ( ϵ ) denote the set of all measures μ Prob Γ ( Cantor Γ ) such that there exist Q D and finite F Γ with H μ ( Q ) < ϵ and H μ ( P n | Q F ) < ϵ . Then, O ( ϵ ) is open. By Lemma 3,
E n = m = 1 O ( 1 / m ) { μ : Γ ( Cantor Γ , μ ) ergodic } .
By Lemma 1, this implies E n is a G δ . ☐

4. A Zero Entropy Action That Factors onto Every Bernoulli Shift

Bernoulli shifts are defined as follows: let ( K , κ ) denote a standard probability space and ( K , κ ) Γ the product measure space. Let Γ act on K Γ by ( g x ) ( f ) = x ( g - 1 f ) for x K Γ , g , f Γ . This action is measure-preserving and is called the Bernoulli shift over Γ with base ( K , κ ) . 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 ϵ > 0 there exists a pmp action Γ ( Y , ν ) satisfying:
  • Γ ( Y , ν ) is a factor of a Bernoulli shift,
  • h Γ R o k ( Y , ν ) < ϵ ,
  • Γ ( Y , ν ) 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 Γ ( X , μ ) , the orbit-equivalence relation is the relation R Γ : = { ( x , γ x ) X × X : x X , γ Γ } . A subequivalence relation is any measurable subset S R Γ that is an equivalence relation in its own right. It is finite if for almost every x X the S -class of x is finite. It is hyperfinite if there exists an increasing sequence S 1 S 2 of finite subequivalence relations such that S = i S i . A subset Y X is S -saturated if Y is a union of S -equivalence classes. The subequivalence S is ergodic if every measurable S -saturated subset is either null or co-null. A graphing of S is a subset G S such that
  • ( x , y ) G ( y , x ) G ,
  • for every ( x , y ) S there exists x = x 0 , x 1 , , x n = y such that ( x i , x i + 1 ) G for all 0 i < n .
A graphing G determines a graph with vertex set X and edges consisting of unordered pairs { x , y } such that ( x , y ) G . If the connected components of this graph are trees, then G is called a treeing and S 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 Γ ( X , μ ) be an essentially free factor of a Bernoulli shift and suppose that its orbit-equivalence relation contains a non-hyperfinite treeable subequivalence relation S . Then, for every pair of probability spaces ( K , κ ) , ( L , λ ) , the direct product action
Γ ( X × K Γ , μ × κ Γ )
factors onto the Bernoulli shift Γ ( L , λ ) Γ .
Proof. 
I claim that we can choose S to be ergodic. Since S is non-hyperfinite, Γ must be nonamenable. Then, the main result of [21] implies that there exists a measurable subset Y X with positive measure such that S restricted to Y is ergodic. Let ϕ : X Y 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 S be the equivalence relation given by ( x , y ) S if and only if ( ϕ x , ϕ y ) S . This is a subequivalence relation of the orbit-equivalence relation; it is ergodic because any nonnull S -invariant measurable subset necessarily contains Y (since S is ergodic and S Y × Y = S ) and therefore contains X (up to measure zero). It is also treeable. Indeed, if G is a treeing of S Y × Y , then we define a treeing G of S by G = G { ( x , ϕ ( x ) ) , ( ϕ ( x ) , x ) : x X - Y } . Thus, we can choose S 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 F 2 ( X , μ ) of the rank two free group whose orbits are contained in Γ-orbits (the main part of this argument is due to Hjorth [22]). Let c : F 2 × X Γ denote the cocycle
c ( f , x ) = g f x = g x .
In addition, for x X and y K Γ , define F x ( y ) K F 2 by
F x ( y ) ( f ) = y ( c ( f - 1 , x ) - 1 ) .
By [14] there exists a factor map Φ : ( K , κ ) F 2 ( L , λ ) F 2 . Thus, we define Ψ : X × K Γ L Γ by
Ψ ( x , y ) ( γ ) = Φ ( F γ - 1 x ( γ - 1 y ) ) ( 1 F 2 ) .
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 x X has the property that its Γ-orbit is partitioned into F 2 -orbits. We consider an element y K Γ 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 ( x , y ) with ( g x , g y ) for g Γ . By restriction, we can also view y as a coloring of the F 2 -orbits that make up the Γ-orbit of x. By identifying each F 2 -orbit with F 2 itself we can view y as a coloring of F 2 (actually several copies of F 2 , one for each F 2 -orbit making up the Γ-orbit). We can apply Φ to such a coloring to obtain a new coloring of (several copies of) F 2 with values in L. By identifying each such copy of F 2 with the F 2 -orbits in Γ x , we obtain again a coloring of the F 2 -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 Γ ( Y , ν ) 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 G = ( V , E ) be a graph and p [ 0 , 1 ] a parameter. The Bernoulli bond percolation with parameter p is the random subset ω p E defined by: if e E is an edge, then e ω p with probability p. Moreover, the events { e ω p : e E } are jointly independent. This is also called p-bond percolaton. We consider ω p to be a random subgraph of G. A cluster is a connected component of ω p . The critical bond percolation of G is the number p c ( G ) equal to the infimum over all p > 0 such that Bernoulli bond percolation with parameter p has an infinite cluster almost surely. See [23] for background.
Lemma 7. 
Let D > 2 be an integer. There exists 0 < α , β < 1 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 T 3 . Therefore, p c ( G ) p c ( T 3 ) . It is well-known that p c ( T 3 ) < 1 . This follows, for example, from the more general statement that p c ( H ) < 1 whenever H is the Cayley graph of a nonamenable group [24] (observe that T 3 is the Cayley graph of Z / 2 Z * Z / 2 Z * Z / 2 Z ). Thus, let α = ( p c ( T 3 ) + 1 ) / 2 . Let ω E ( G ) 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 ( 1 - α ) deg ( v ) ( 1 - α ) D = : β . ☐
Proof of Proposition 1. 
Let Γ 0 Γ be a finitely generated nonamenable subgroup. By [27], there exists a finite generating set S Γ 0 such that bond-percolation on the Cayley graph Cay ( Γ 0 , S ) has a nontrivial uniqueness phase. In other words, there exists p ( 0 , 1 ) such that p-bond-percolation on Cay ( Γ 0 , S ) has infinitely many infinite clusters. It follows by inclusion that p-bond-percolation on Cay ( Γ , S ) also has infinitely many infinite clusters. Here, Cay ( Γ , S ) is the graph with vertex set Γ and edges of the form ( g , g s ) for g Γ , s S . This need not be a connected graph since S need not generate Γ.
Let ω 0 E ( Cay ( Γ , S ) ) denote the set of edges of p-bond-percolation on Cay ( Γ , S ) . By [25], each infinite cluster of ω 0 has infinitely many ends a.s. (for a simpler proof, see [26]). For x Γ , let K 0 ( x ) denote the cluster of ω 0 containing x.
By [23] (Lemma 7.4), there exists a percolation ω 1 ω 0 such that conditioned on the cluster K 0 ( x ) being infinite, the cluster K 1 ( x ) of ω 1 containing x is a tree with infinitely many ends (almost surely). Moreover, the proof shows that we can choose ω 1 to be the minimal spanning forest associated with an iid process. In particular, we can choose ω 1 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 ω 1 consists of a single vertex.
Let α , β be as in Lemma 7.
Claim. 
There exist random subgraphs ω 1 ω 2 satisfying:
  • each infinite cluster of ω i is a tree with infinitely many ends (a.s.),
  • every finite cluster of ω i is a single vertex,
  • the probability that 1 Γ is contained in an infinite cluster of ω i + 1 is at most ( 1 - β ) times the probability that 1 Γ is contained in an infinite cluster of ω i ,
  • each ω i is a factor of a Bernoulli shift.
Proof. 
For induction, we assume ω 1 , , ω n has been constructed.
We cannot directly apply Lemma 7 because some vertex might have degree < 3 in ω n . After repeatedly removing all edges incident to a degree 1 vertex if necessary, we may assume that no vertex of ω n has degree 1. Next, define ω n as follows: the vertices of ω n are the vertices of ω n that have degree at least 3. There is an edge in ω n from v to w if there is a path in ω n from v to w such that all of the intermediate vertices have degree 2.
Let ω n + 1 ω n be the random subgraph obtained from Bernoulli α-bond-percolation on ω n . By Lemma 7, ω n + 1 contains infinite clusters a.s. Moreover, each infinite cluster is a tree with infinitely many ends (since each infinite cluster of ω n is a tree with infinitely many ends). We let ω n + 1 be the subgraph of ω n that is induced from ω n + 1 . More precisely, recall that every edge e of ω n + 1 corresponds to a path e 1 , e 2 , , e k of edges in ω n such that each intermediate vertex has degree 2. We let ω n + 1 be the subgraph containing all such edges e 1 , , e k . Finally, we let ω n + 1 be the subgraph obtained from ω n + 1 by removing all edges that are contained in finite clusters. The properties in the claim are easily verified for ω n + 1 . This completes the induction. ☐
Let δ > 0 be such that
δ | S | log ( 2 ) - δ log ( δ ) - ( 1 - δ ) log ( 1 - δ ) < ϵ / 2 .
It follows from the claim above that there exists a random subgraph ω n of Cay ( Γ , S ) (for some n) such that:
  • the probability that ω n does not contain any edges incident to 1 Γ is at least 1 - δ ,
  • the law of ω n is a factor of a Bernoulli shift,
  • with probability one, some cluster of ω n is a tree with infinitely many ends.
Let X be the space of all subgraphs of Cay ( Γ , S ) and μ the law of ω n . For x X , let ϕ ( x ) = { s S : ( 1 Γ , s ) ω n } . Let P be the partition of X induced by φ: this means that x , y X are in the same part of P if and only if ϕ ( x ) = ϕ ( y ) . The Shannon entropy of P satisfies the bound:
H μ ( P ) δ | S | log ( 2 ) - δ log ( δ ) - ( 1 - δ ) log ( 1 - δ ) < ϵ / 2
(because there are 2 | S | subsets of S and the probability that ϕ ( x ) is empty (when x X is random with law μ) is at least 1 - δ ). The partition P is generating for Γ ( X , μ ) . Therefore,
h Γ R o k ( X , μ ) < ϵ / 2 .
Because each ω n contains an infinite tree with infinitely many ends, the orbit-equivalence relation of Γ ( X , μ ) contains a non-hyperfinite treeable subequivalence relation. To see this, let Y X be the set of all ω X such that 1 Γ is in an infinite cluster of ω. Let F Y × Y be the Borel equivalence relation on Y given by ( g ω , ω ) F if and only if g - 1 and 1 Γ 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 Φ : X Y be any Borel map with graph contained in the orbit-equivalence relation of Γ such that Φ restricted to Y is the identity map. Finally, let F ˜ X × X be the equivalence relation ( x , y ) F ˜ if and only if ( Φ x , Φ y ) F . Then, F ˜ is the required non-hyperfinite treeable subequivalence relation. In fact, if G Y × Y is a treeing of F , then G ˜ : = G { ( x , Φ ( x ) ) : x X } is a treeing of F ˜ .
If Γ ( X , μ ) is not essentially free, then let ( L , λ ) be a nontrivial probability space with Shannon entropy small enough so that the Rokhlin entropy of the direct product Γ ( X × L Γ , μ × λ Γ ) is < ϵ / 2 . Because Γ ( X , μ ) 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 Γ ( X , μ ) by way of the projection map). Thus, without loss of generality, we may assume Γ ( X , μ ) is essentially free.
Let ( K , κ ) be any nontrivial probability space with Shannon entropy < ϵ / 2 . Lemma 6 now implies that the product action
Γ ( X × K Γ , μ × κ Γ )
satisfies the statement of the Theorem. ☐
Corollary 1. 
Let Γ be any countable nonamenable group. There exists a pmp action Γ ( Z , ζ ) satisfying:
  • Γ ( Z , ζ ) is an inverse limit of factors of Bernoulli shifts,
  • h Γ R o k ( Z , ζ ) = 0 ,
  • Γ ( Z , ζ ) factors onto all Bernoulli shifts over Γ.
Proof. 
By Proposition 1 there exists a sequence Γ ( Y i , ν i ) ( i N ) of pmp actions satisfying
  • each Γ ( Y i , ν i ) is a factor of a Bernoulli shift,
  • h Γ R o k ( Y i , ν i ) < 2 - i ,
  • each Γ ( Y i , ν i ) factors onto all Bernoulli shifts over Γ.
It follows that there exist factor maps Φ i : Y i Y i - 1 for i 2 . Let Γ ( Z , ζ ) denote the inverse limit of this system. It suffices to show h Γ R o k ( Z , ζ ) = 0 . This follows from [3] (Corollary 4.9). Alternatively, it can be proven directly as follows. Let ϵ > 0 . Then, there exists an infinite subsequence { n i } i = 1 such that
i h Γ R o k ( Y n i , ν n i ) < ϵ / 2 .
Let P i be a generating partition of Y n i with H μ ( P i ) < h Γ R o k ( Y n i , ν n i ) + ϵ 2 - i - 1 . By pulling back, we may consider P i to be a partition of Z. Then, i P i is a generating partition for Γ ( Z , ζ ) and
H μ i P i i H μ ( P i ) i h Γ R o k ( Y n i , ν n i ) + ϵ 2 - i - 1 < ϵ .
Because ϵ > 0 is arbitrary, this proves h Γ R o k ( Z , ζ ) = 0 . ☐

5. Zero Entropy Extensions

Theorem 4. 
Let Γ be a nonamenable countable group and Γ ( X , μ ) a free ergodic action. Then, there exists a free ergodic action Γ ( X ˜ , μ ˜ ) that factors onto Γ ( X , μ ) and has zero Rokhlin entropy.
Remark 1. 
Seward [15] proved, under the same hypotheses as Theorem 4, the existence of an extension Γ ( X ˜ , μ ˜ ) of Γ ( X , μ ) such that Γ ( X ˜ , μ ˜ ) admits a generating partition with at most n parts where n = n ( Γ ) depends only on Γ. By Seward’s generalization of Krieger’s Generator Theorem [4], Theorem 4 implies that we can take n = 2 .
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 Γ ( X , μ ) with positive Rokhlin entropy, there exists a Bernoulli factor such that the Rokhlin entropy of Γ ( X , μ ) relative to this Bernoulli factor is zero.
Proof of Theorem 4. 
Without loss of generality, we may assume Γ ( X , μ ) has positive Rokhlin entropy. By Theorem 5, there exists a Bernoulli factor Γ ( B , β ) of Γ ( X , μ ) such that
h Γ R o k ( X , μ | B B ) = 0 ,
where B B denotes the sigma-algebra associated with B. Let Γ ( Z , ζ ) be as in Corollary 1. Fix a factor map of Γ ( Z , ζ ) onto Γ ( B , β ) . Let Γ ( X ˜ , μ ˜ ) be the independent joining of Γ ( Z , ζ ) and Γ ( X , μ ) over Γ ( B , β ) .
It suffices to show h Γ R o k ( X ˜ , μ ˜ ) = 0 . By [3] (Corollary 2.6),
h Γ R o k ( X ˜ , μ ˜ ) h Γ R o k ( X ˜ , μ ˜ | B B ) + h Γ , μ ˜ R o k ( B B ) .
Because outer Rokhlin entropy is upper-bounded by the Rokhlin entropy of any intermediate factor,
h Γ , μ ˜ R o k ( B B ) h Γ R o k ( Z , ζ ) = 0 .
Thus, it suffices to prove h Γ R o k ( X ˜ , μ ˜ | B B ) = 0 .
Let ϵ > 0 , α be a generating partition of Z with H ζ ( α ) < ϵ and let β be a partition of X with H μ ( β | B B ) < ϵ such that σ - alg Γ ( β B B ) = B X (up to measure zero). By pulling back, we may consider α and β as partitions on X ˜ . Clearly, α β is generating for the action Γ ( X ˜ , μ ˜ ) and H μ ˜ ( α β | B B ) < 2 ϵ . Since ϵ > 0 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 a = Γ ( X , μ ) be a pmp action and Φ : X Cantor Γ a Γ-equivariant measurable map. Then, there exists a sequence of measures μ i Prob Γ ( Cantor Γ ) such that
  • Γ ( Cantor Γ , μ i ) is measurably-conjugate to a for all i,
  • μ i Φ * μ in the weak* topology as i .
Proof. 
Let Ψ : X Cantor Γ be a Γ-equivariant measurable map such that Γ ( Cantor Γ , Ψ * μ ) is measurably conjugate to a . To see that such a map exists, identify Cantor with { 0 , 1 } N (where the latter has the product topology). We consider an element x { 0 , 1 } N to be a function x : N { 0 , 1 } . Choose a sequence ψ i : X { 0 , 1 } of measurable maps such that for all distinct elements x , y X there exists some i such that ψ i ( x ) ψ i ( y ) . Then, define Ψ ( x ) ( 1 Γ ) ( n ) = ψ n ( x ) and in general, define Ψ ( x ) ( g ) = Ψ ( g - 1 x ) ( 1 Γ ) . It is routine to check that this satisfies the claim.
Define Γ-equivariant maps Φ n : X Cantor Γ so that the first n-coordinates of Φ n ( x ) agree with those of Φ ( x ) and the last coordinates agree with Ψ ( x ) . In other words, for every g Γ ,
Φ n ( x ) ( g ) = ( Φ ( x ) ( g ) ( 1 ) , , Φ ( x ) ( g ) ( n ) , Ψ ( x ) ( g ) ( 1 ) , Ψ ( x ) ( g ) ( 2 ) , ) .
As above, we are identifying Cantor with { 0 , 1 } N . Clearly, Φ n is Γ-equivariant, is an isomorphism onto its image and lim n Φ n * μ = Φ * μ . To finish the lemma, set μ i : = Φ n * μ . ☐
Let Prob Γ e r g ( Cantor Γ ) Prob Γ ( Cantor Γ ) denote the subset of ergodic measures.
Lemma 9. 
The subset of all essentially free measures in Prob Γ ( Cantor Γ ) is a G δ set. Moreover, this subset is dense in Prob Γ ( Cantor Γ ) and its intersection with Prob Γ e r g ( Cantor Γ ) is dense in Prob Γ e r g ( Cantor Γ ) .
Proof. 
For any element g Γ , let Fix ( g ) = { x Cantor Γ : g x = x } . Then, Fix ( g ) is compact in Cantor Γ . By the Portmanteau Theorem, for every ϵ > 0 , the set { μ Prob Γ ( Cantor Γ ) : μ ( Fix ( g ) ) < ϵ } is open. Therefore,
g Γ - { 1 Γ } n = 1 { μ Prob Γ ( Cantor Γ ) : μ ( Fix ( g ) ) < 1 / n }
is a G δ 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 μ Prob Γ ( Cantor Γ ) be arbitrary. We observe that the direct product of Γ ( Cantor Γ , μ ) with a Bernoulli shift is essentially free and factors onto Γ ( Cantor Γ , μ ) .
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 μ Prob Γ e r g ( Cantor Γ ) such that the corresponding action Γ ( Cantor Γ , μ ) is essentially free and has zero Rokhlin entropy, is a dense G δ subset of Prob Γ e r g ( Cantor Γ ) .
Proof. 
Lemmas 9 and 5 show that this subset is a G δ . 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
β : Prob ( Prob Γ e r g ( Cantor Γ ) ) Prob Γ ( Cantor Γ ) ,
π : Prob Γ ( Cantor Γ ) Prob ( Prob Γ e r g ( Cantor Γ ) ) ,
denote the barycenter map and the ergodic decomposition map respectively. To be precise,
β ( ω ) : = μ d ω ( μ ) ,
and π is the inverse of β.
Proposition 3. 
Let Z 0 Prob Γ e r g ( Cantor Γ ) be Borel and define
Z = { μ Prob Γ ( Cantor Γ ) : π ( μ ) ( Z 0 ) = 1 } .
If Z 0 is residual in Prob Γ e r g ( Cantor Γ ) , then Z is residual in Prob Γ ( Cantor Γ ) .
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 Prob Γ e r g ( Cantor Γ ) is a closed (and therefore compact) subset of Prob Γ ( Cantor Γ ) . On the other hand, if Γ does not have (T), then Prob Γ e r g ( Cantor Γ ) is dense in Prob Γ ( Cantor Γ ) . Since β and π are bijective, these two statements imply the lemma. ☐
Proof of Proposition 3. 
Case 1. Suppose Γ does not have property (T). By [28], Prob Γ e r g ( Cantor Γ ) is dense in Prob Γ ( Cantor Γ ) . By Lemma 1, Prob Γ e r g ( Cantor Γ ) is a G δ . Therefore, Prob Γ e r g ( Cantor Γ ) is residual in Prob Γ ( Cantor Γ ) . Thus, Z 0 is residual in Prob Γ ( Cantor Γ ) . Since Z 0 Z , this proves Z is also residual.
Case 2. Suppose Γ has property (T). Let
Y = { ω Prob ( Prob Γ e r g ( Cantor Γ ) ) : ω ( Z 0 ) = 1 } .
By Lemma 10, it suffices to prove that Y is residual. Since Z 0 contains a dense G δ , we may assume without loss of generality that Z 0 is a dense G δ . Thus, the portmanteau Theorem implies Y is a G δ subset.
Let d be a continuous metric on Prob Γ e r g ( Cantor Γ ) . Because Z 0 is dense in Prob Γ e r g ( Cantor Γ ) , for every n N , there exists a Borel map Φ n : Prob Γ e r g ( Cantor Γ ) Z 0 with d ( x , Φ n ( x ) ) < 1 / n for all x. Then, for every μ Prob ( Prob Γ e r g ( Cantor Γ ) ) , Φ n * μ μ in the weak* topology as n . Since Φ n * μ Y , this proves Y 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 Z 0 is Borel (where Z 0 Prob Γ e r g ( Cantor Γ ) 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 A ( Γ , X , μ ) contains the conjugacy class of each of its factors. Because essentially free actions are dense in A ( Γ , X , μ ) , it follows that zero Rokhlin entropy actions are also dense in A ( Γ , X , μ ) . In [2] (Lemma 8.7), it is proven that the subset of all zero-Rokhlin entropy actions in A ( Γ , X , μ ) is a G δ 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 Γ ( X , μ ) be a pmp action and P a partition of X. The naive entropy of P is
h μ n a i v e ( P ) = inf W Γ | W | - 1 H μ ( P W ) ,
where means “a finite subset of”. The naive entropy of Γ ( X , μ ) is
h Γ n a i v e ( X , μ ) = sup P h μ n a i v e ( P ) ,
where the supremum is over all finite-entropy partitions P .
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 { 0 , + } .
Proof. 
Suppose Γ ( X , μ ) and there is a finite-entropy partition P of X with h μ n a i v e ( P ) > 0 . Let W Γ be finite. Then,
h μ n a i v e ( P W ) = inf F Γ | F | - 1 H μ ( P W F ) = inf F Γ H μ ( P W F ) | W F | | W F | | F | h μ n a i v e ( P ) inf F Γ | W F | | F | .
Since Γ is nonamenable, for every real number, r > 0 , there is a finite W Γ , such that
inf F Γ | W F | | F | > r .
Hence, sup W Γ h μ n a i v e ( P W ) = + , proving the theorem. ☐
Definition 3. 
Let a i = Γ ( X i , μ i ) be pmp actions (for i I 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 i X i whose i-th marginal is μ i . Here, Γ acts on the product diagonally: ( γ x ) i = γ x i . We also refer to the action Γ ( i X i , λ ) as a joining. The joining is said to be finite if I is finite and infinite otherwise. In the special case that a i = a j for all i , j , 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 a = Γ ( X , μ ) be a pmp action and P , Q be measurable partitions of X with finite Shannon entropy. Then, for any finite F Γ ,
H μ ( P F ) - H μ ( Q F ) | F | H μ ( P | Q ) .
Thus,
h μ n a i v e ( P ) - h μ n a i v e ( Q ) H μ ( P | Q ) .
Proof. 
Recall that
H μ ( P F | Q F ) = H μ ( P F Q F ) - H μ ( Q F ) , H μ ( Q F | P F ) = H μ ( P F Q F ) - H μ ( P F ) .
Subtracting, we obtain
H μ ( P F ) - H μ ( Q F ) = H μ ( P F | Q F ) - H μ ( Q F | P F ) H μ ( P F | Q F ) f F H μ ( f - 1 P | Q F ) | F | H μ ( P | Q ) .
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 Q ). ☐
Proof of Proposition 4. 
Let us suppose that a = Γ ( X , μ ) is an inverse limit of actions a i = Γ ( X i , μ i ) having zero naive entropy. We will show a has zero naive entropy. Let F i be the Borel sigma-algebra of X i . After pulling back under the factor map, we may identify F i as a sub-sigma-algebra of the Borel sub-sigma-algebra of X which is denoted here by B X . Thus, F 1 F 2 is an increasing sequence of Γ-invariant sigma-algebras and i F i = B X . Because each action a i has zero naive entropy, if P is any partition of X satisfying P F i for some i and H μ ( P ) < , then, necessarily, h μ n a i v e ( P ) = 0 .
Let P be an arbitrary measurable partition of X with finite Shannon entropy. Since inf i H μ ( P | F i ) = 0 , for any ϵ > 0 , there exists an i and a partition Q F i with finite Shannon entropy such that H μ ( P | Q ) < ϵ . By Lemma 11, h μ n a i v e ( P ) ϵ + h μ n a i v e ( Q ) = ϵ . Since ϵ and P are arbitrary, this implies a has zero naive entropy and therefore zero naive entropy is closed under inverse limits.
Next, suppose a = Γ ( X , μ ) has zero naive entropy and let λ be a self-joining of a . We regard λ as a measure on X × X . If P is any partition of X × X with H λ ( P ) < and ϵ > 0 is arbitrary, then there exists a partition Q of X with finite Shannon entropy such that H λ ( P | Q × Q ) < ϵ . Thus, Lemma 11 implies
h λ n a i v e ( P ) ϵ + h λ n a i v e ( Q × Q ) .
Since Q × Q = ( Q × { X } ) ( { X } × Q ) ,
h λ n a i v e ( Q × Q ) = inf F Γ H λ ( ( Q × Q ) F ) | F | = inf F Γ H λ ( Q F × Q F ) | F | inf F Γ H λ ( Q F × { X } ) + H λ ( { X } × Q F ) | F | = inf F Γ 2 H μ ( Q F ) | F | = 2 h μ n a i v e ( Q ) = 0 .
Thus, h λ n a i v e ( P ) ϵ . Since ϵ and P 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 Γ ( X , μ ) 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 a = Γ ( X , μ ) be an ergodic essentially free pmp action. Consider the following five properties:
1. 
a has completely zero entropy (this means every essentially free factor of a has zero Rokhlin entropy),
2. 
a is disjoint from all Bernoulli shifts over Γ,
3. 
a is disjoint from all R-CPE actions of Γ,
4. 
every factor of every self-joining (including infinite self-joinings) of a has zero Rokhlin entropy,
5. 
a has zero naive entropy.
Then, 1 2 and 3 4 5 . Moreover, if Γ is sofic, then 2 3 .
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 2 3 unconditionally. See [3] for partial results on this problem.
Proof. 
( 1 2 ) 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 a has a factor with positive entropy, then it has a Bernoulli factor ϕ : X Y . The corresponding factor joining is the measure ( id X × ϕ ) * μ . This is a non-product joining. ( 2 3 , 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.
( 3 4 ) Let b be another pmp action of Γ and suppose that b and a admit a nonproduct joining. It follows from the relative independence theorem [30] (Theorem 6.25) that there exists an infinite self-joining λ of a such that Γ ( X N , λ ) and b admit a nontrivial common factor. Therefore, b cannot be R-CPE.
( 4 5 ) 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 Γ / N where N Γ 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 g Γ there exists a finite-index subgroup H Γ such that g H ,
  • there exists a decreasing sequence of finite-index normal subgroups Γ H 1 H 2 such that i H i = { 1 } .
Definition 7. 
Let p Γ 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 p Γ × ι is dense in the space of actions A ( Γ , X , μ ) . Equivalently, Γ has MD if the subset of measures in Prob Γ ( Cantor Γ ) 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 μ Prob Γ ( Cantor Γ ) with zero naive entropy.
Lemma 12. 
For any countable group Γ, ZNE is a G δ subset of Prob Γ ( Cantor Γ ) .
Proof. 
Let P n be an increasing sequence of finite clopen partitions of Cantor Γ such that n P n is the Borel sigma-algebra. Recall that clopen means every part of P n is both closed and open. Let A n be the subset of all measures μ Prob Γ ( Cantor Γ ) such that h μ n a i v e ( P n ) = 0 . We claim that n A n = Z N E . Clearly, n A n Z N E . Suppose μ n A n . Let Q be an arbitrary partition of Cantor Γ with H μ ( Q ) < . Then, for every ϵ > 0 there exists n such that H μ ( Q | P n ) < ϵ . By Lemma 11, h μ n a i v e ( Q ) ϵ + h μ n a i v e ( P n ) = ϵ . Since ϵ and Q are arbitrary this proves μ Z N E and therefore, n A n = Z N E as claimed.
It now suffices to show each A n is a G δ subset. Indeed, this follows from the definition:
h μ n a i v e ( P n ) = inf F Γ | F | - 1 H μ ( P n F ) ,
and the fact that μ H μ ( P n F ) is weak* continuous for every finite F Γ . The reason this is weak* continuous uses the fact that if P Cantor Γ is clopen, then its characteristic function is continuous and therefore induces a continuous functional on Prob Γ ( Cantor Γ ) . ☐
Definition 8. 
The kernel of an action a = Γ ( X , μ ) is the subgroup Ker ( a ) : = { g Γ : g x = x for a . e . x X } .
Lemma 13. 
If a has infinite kernel, then it has zero naive entropy.
Proof. 
Let P be an arbitrary partition of X with finite Shannon entropy. Then, P K = P (up to measure zero) for every K ker ( a ) . Therefore,
h μ n a i v e ( P ) inf F Ker ( a ) | F | - 1 H μ ( P F ) = | Ker ( a ) | - 1 H μ ( P ) .
In particular, if Ker ( a ) is infinite, then h μ n a i v e ( P ) = 0 . ☐
Proof of Theorem 3. 
By the Glasner–King correspondence mentioned in the introduction, it suffices to show that ZNE is a dense G δ subset of Prob Γ ( Cantor Γ ) . By Lemma 12, it is a G δ . If Γ has property MD, then, by definition, the subset of all measures μ Prob Γ ( Cantor Γ ) with finite support is dense in Prob Γ ( Cantor Γ ) . Each such measure has infinite kernel. Thus, Lemma 13 implies ZNE is dense. Thus, we assume Γ = G × H , where H is infinite, amenable and residually finite.
Because H is residually finite, there exists a sequence H H 1 H 2 of normal finite-index subgroups of H with i H i = { 1 H } . By [36] (Theorem 1), because H is amenable, there exist right fundamental domains F i for H i such that { F i } forms a Følner sequence. This means: (1) H is the disjoint union of H i f over f F i and (2) for any finite K H ,
lim i | { f F i : f K F i | | F i | = 1 .
Let μ Prob Γ ( Cantor Γ ) be arbitrary. We will show that it is a weak* limit of measures with zero Rokhlin entropy. For i N , define ϕ i : Cantor Γ Cantor Γ by ϕ i ( x ) ( g , h ) = x ( g , f ) , where g G , h H and f F i is the unique element satisfying H i h = H i f . Observe that ϕ i ( x ) is H i -invariant and ϕ i is G-equivariant. Therefore, the pushforward measure ϕ i * μ is G × H i -invariant. In addition, observe that F i - 1 is a left fundamental domain in the sense that H is the disjoint union of f - 1 H i over f F i . Therefore,
μ i : = | F i | - 1 f F i ( 1 G , f i - 1 ) * ϕ i * μ
is Γ-invariant. Since H i is normal, the kernel of the action Γ ( Cantor Γ , μ i ) contains H i . By Lemma 13, this action has zero naive entropy.
We claim that μ i μ as i . To see this, let Φ i : Cantor Γ Cantor Γ × Cantor Γ denote the graph of ϕ i :
Φ i ( x ) = ( x , ϕ i ( x ) ) .
Let λ i = | F i | - 1 f F i ( 1 G , f i - 1 ) * Φ i * μ . Because λ i is a joining of μ and μ i , it suffices to show that for every ( g , h ) G × H ,
λ i ( { ( x , y ) : x ( g , h ) = y ( g , h ) } ) 1
as i . Thus, fix ( g 0 , h 0 ) G × H . To simplify notation, we let
Δ = { ( x , y ) Cantor Γ × Cantor Γ : x ( g 0 , h 0 ) = y ( g 0 , h 0 ) } .
It suffices to show that for any x Cantor Γ ,
# { f F i : ( 1 G , f i - 1 ) Φ i ( x ) Δ } # F i | { f F i : f h 0 F i } | | F i | ,
since the latter tends to 1 uniformly in x. This follows from
{ f F i : ( 1 G , f i - 1 ) Φ i ( x ) Δ } { f F i : f h 0 F i } ,
which follows directly from the definitions: if f F i and f h 0 F i , then
( 1 G , f - 1 ) Φ i ( x ) ( g 0 , h 0 ) = Φ i ( x ) ( g 0 , f h 0 ) = ( x ( g 0 , f h 0 ) , x ( g 0 , f h 0 ) ) .
This proves the claim. This implies that μ i μ as i in the weak* topology. Indeed, if L Γ is any finite subset and f : Cantor L C any continuous function, then the function f ˜ : Cantor Γ C defined by composing the restriction map Cantor Γ Cantor L with f satisfies f ˜ d μ i f d μ . Since such functions are dense in the space of all continuous functions, it follows that μ i μ as claimed. Because μ is arbitrary, this implies ZNE is dense. ☐

10. Weak Containment

Given any pmp action a = Γ ( X , μ ) , let Factor ( a ) denote the set of all measures ν Prob Γ ( Cantor Γ ) such that there is a Γ-equivariant measurable map ϕ : X Cantor Γ with ϕ * μ = ν . This is the set of factor measures. Let W ( a ) be the weak* closure of Factor ( a ) .
Now, suppose b = Γ ( Y , ν ) is another pmp action. We say b is weakly contained in a , denoted b a , if W ( b ) W ( a ) . If b a and a b , then we say a and b 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 a is any essentially free action of Γ, then a weakly contains a Bernoulli shift. There exists an action a 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, a , the set of all measures μ W ( a ) with zero Rokhlin entropy is residual. Of course, this is true if W ( a ) = Prob Γ ( Cantor Γ ) by Theorem 1. It is also true if a is a Bernoulli shift:
Corollary 2. 
Let a be a Bernoulli shift. Then, the generic measure μ W ( a ) has zero Rokhlin entropy.
Proof. 
If Γ is amenable, then W ( a ) = Prob Γ ( Cantor Γ ) . Thus, the result follows from Theorem 1. Thus, we may assume Γ is nonamenable. In this case, a is strongly ergodic and therefore every measure μ W ( a ) is ergodic. By Lemma 5, the set of all measures μ W ( a ) with zero Rokhlin entropy is a G δ subset. By Corollary 1, there exists an action b that is an inverse limit of factors of Bernoulli shifts that factors onto all Bernoulli shifts and has zero Rokhlin entropy. By Lemma 8, W ( b ) = W ( a ) . By Lemma 8 again, the set of measures in W ( b ) 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

  1. Bowen, L. Measure conjugacy invariants for actions of countable sofic groups. J. Am. Math. Soc. 2010, 23, 217–245. [Google Scholar] [CrossRef]
  2. Alpeev, A.; Seward, B. Krieger’s finite generator theorem for ergodic actions of countable groups III. 2016, in press. [Google Scholar]
  3. Seward, B. Krieger’s finite generator theorem for ergodic actions of countable groups II. 2015. arXiv:1501.03367v2. [Google Scholar]
  4. Seward, B. Krieger’s finite generator theorem for ergodic actions of countable groups I. 2014. arXiv:1405.3604. [Google Scholar]
  5. Rokhlin, V.A. Entropy of metric automorphism. Dokl. Akad. Nauk SSSR 1959, 124, 980–983. [Google Scholar]
  6. 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]
  7. 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]
  8. Glasner, E.; King, J. A zero-one law for dynamical properties. Contemp. Math. 1998, 215, 231–242. [Google Scholar]
  9. 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]
  10. Bowen, L.; Hartman, Y.; Tamuz, O. Generic stationary measures and actions. 2015. arXiv:1405.2260. [Google Scholar] [CrossRef]
  11. Foreman, M.; Weiss, B. An anti-classification theorem for ergodic measure preserving transformations. J. Eur. Math. Soc. 2004, 6, 277–292. [Google Scholar] [CrossRef]
  12. Ornstein, D.S.; Weiss, B. Entropy and isomorphism theorems for actions of amenable groups. J. Anal. Math. 1987, 48, 1–141. [Google Scholar] [CrossRef]
  13. 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]
  14. Bowen, L. Weak isomorphisms between Bernoulli shifts. Israel J. Math. 2011, 183, 93–102. [Google Scholar] [CrossRef]
  15. 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]
  16. Gaboriau, D.; Lyons, R. A measurable-group-theoretic solution to von Neumann’s problem. Invent. Math. 2009, 177, 533–540. [Google Scholar] [CrossRef]
  17. Ornstein, D. Factors of Bernoulli shifts are Bernoulli shifts. Adv. Math. 1970, 5, 349–364. [Google Scholar] [CrossRef]
  18. Ornstein, D.S. Ergodic Theory, Randomness, and Dynamical Systems; Yale University Press: New Haven, CT, USA, 1971. [Google Scholar]
  19. Seward, B. Positive entropy actions of countable groups factor onto Bernoulli shifts. 2015, in press. [Google Scholar]
  20. Kechris, A.S. Weak containment in the space of actions of a free group. Isr. J. Math. 2012, 189, 461–507. [Google Scholar] [CrossRef]
  21. Chifan, I.; Ioana, A. Ergodic subequivalence relations induced by a Bernoulli action. Geom. Funct. Anal. 2010, 20, 53–67. [Google Scholar] [CrossRef]
  22. Hjorth, G. A lemma for cost attained. Ann. Pure Appl. Log. 2006, 143, 87–102. [Google Scholar] [CrossRef]
  23. Benjamini, I.; Lyons, R.; Peres, Y.; Schramm, O. Group-invariant percolation on graphs. Geom. Funct. Anal. 1999, 9, 29–66. [Google Scholar] [CrossRef]
  24. 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]
  25. 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]
  26. Lyons, R.; Schramm, O. Indistinguishability of percolation clusters. Ann. Probab. 1999, 27, 1809–1836. [Google Scholar]
  27. 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]
  28. 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]
  29. Kerr, D. Bernoulli actions of sofic groups have completely positive entropy. Israel J. Math. 2014, 202, 461–474. [Google Scholar] [CrossRef]
  30. Glasner, E. Ergodic theory via joinings. In Mathematical Surveys and Monographs; American Mathematical Society: Providence, RI, USA, 2003; Volume 101. [Google Scholar]
  31. Seward, B. Weak containment and Rokhlin entropy. 2016. arXiv:1602.06680. [Google Scholar]
  32. Lubotzky, A.; Shalom, Y. Finite representations in the unitary dual and Ramanujan groups. Contemp. Math. 2004, 347, 173–189. [Google Scholar]
  33. Bowen, L. Periodicity and circle packings of the hyperbolic plane. Geom. Dedicata 2003, 102, 213–236. [Google Scholar] [CrossRef]
  34. Bowen, L.; Tucker-Drob, R.D. On a co-induction question of Kechris. Israel J. Math. 2013, 194, 209–224. [Google Scholar] [CrossRef]
  35. Agol, I.; Groves, D.; Manning, J. The virtual Haken conjecture. Doc. Math. 2013, 18, 1045–1087. [Google Scholar]
  36. 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]
  37. Tucker-Drob, R.D. Weak equivalence and non-classifiability of measure preserving actions. Ergod. Theory Dyn. Syst. 2015, 35, 293–336. [Google Scholar] [CrossRef]
  38. 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]

Share and Cite

MDPI and ACS Style

Bowen, L. Zero Entropy Is Generic. Entropy 2016, 18, 220. https://doi.org/10.3390/e18060220

AMA Style

Bowen L. Zero Entropy Is Generic. Entropy. 2016; 18(6):220. https://doi.org/10.3390/e18060220

Chicago/Turabian Style

Bowen, Lewis. 2016. "Zero Entropy Is Generic" Entropy 18, no. 6: 220. https://doi.org/10.3390/e18060220

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop