Next Article in Journal
Noise Suppression in 94 GHz Radar-Detected Speech Based on Perceptual Wavelet Packet
Next Article in Special Issue
Fiber-Mixing Codes between Shifts of Finite Type and Factors of Gibbs Measures
Previous Article in Journal
Greedy Algorithms for Optimal Distribution Approximation
Previous Article in Special Issue
Constant Slope Maps and the Vere-Jones Classification
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Positive Sofic Entropy Implies Finite Stabilizer

Department of Mathematics, Ben-Gurion University of the Negev, Be’er Sheva 8410501, Israel
Entropy 2016, 18(7), 263; https://doi.org/10.3390/e18070263
Submission received: 1 May 2016 / Revised: 11 July 2016 / Accepted: 14 July 2016 / Published: 18 July 2016
(This article belongs to the Special Issue Entropic Properties of Dynamical Systems)

Abstract

:
We prove that, for a measure preserving action of a sofic group with positive sofic entropy, the stabilizer is finite on a set of positive measures. This extends the results of Weiss and Seward for amenable groups and free groups, respectively. It follows that the action of a sofic group on its subgroups by inner automorphisms has zero topological sofic entropy, and that a faithful action that has completely positive sofic entropy must be free.

1. Introduction

The last decade brought a number of important developments in dynamics of non-amenable group actions. Among these we note the various extensions of classical entropy theory. For actions of free groups, Bowen introduced a numerical invariant known as f-invariant entropy [1]. Some time later Bowen defined a new invariant for actions of sofic groups, called sofic entropy [2]. Kerr and Li further developed sofic entropy theory and also adapted it to groups actions on topological spaces by homeomorphisms [3]. The classical notion of entropy for amenable groups and Bowen’s f-invariant both turned out to be special cases of sofic entropy [4,5].
The study of non-free measure-preserving group actions is another fruitful and active trend in dynamics. These are closely related to the notion of invariant random subgroups, that is, probability measures on the space of subgroups whose law is invariant under conjugation. Any such law can be realized as the law of the stabilizer for a random point for some probability preserving action [6]. In this note we prove the following:
Theorem. 
Suppose G ( X , B , μ ) is an action of a countable sofic group G that has positive sofic entropy (with respect to some sofic approximation). Then the set of points in X with finite stabilizer has positive measure. In particular, if the action is ergodic, almost every point has finite stabilizer.
The amenable case of Theorem 1 appears as a remark in the last section of Weiss’s survey paper on actions of amenable groups [7]. To be precise, Weiss stated the amenable case of Corollary 2 below.
Another interesting case of Theorem 1 for free groups is due to Seward [8]. The result proved in [8] applies to the random sofic approximation. By a non-trivial result of Bowen, this coincides with the f-invariant for free groups. Sewards’s proof in [8] is based on a specific formula for f-entropy, which does not seem to be available for sofic entropy in general. Our proof below proceeds essentially by proving a combinatorial statement about finite objects. In personal communication, Seward informed me of another proof of Theorem 1 that is expected to appear in a forthcoming paper of Alpeev and Seward as a byproduct of their study of an entropy theory for general countable groups.
Theorem 1 confirms the point of view that the “usual” notions of sofic entropy for sofic groups (or mean-entropy in the amenable case) are not very useful as invariants for non-free actions. A version of sofic entropy for some non-free actions of sofic groups was developed by Bowen [9] as a particular instance of a more general framework called “entropy theory of sofic groupoids”. It seems likely that both the statement of Theorem 1 and our proof should have a generalization to “sofic class bijective extensions of groupoids” (see [9] for definition of this term) . We will not pursue this direction. Thanks to Yair Glasner, Guy Salomon, Brandon Seward and Benjy Weiss for interesting discussions, and the referees for valuable remarks and suggestions.

2. Notation and Definitions

2.1. Sofic Groups

Sofic groups were introduced by Gromov [10] (under a different name) towards the end of the millennium. The name “sofic groups” is due to Weiss [11]. Sofic groups retain some properties of finite groups. They are a common generalization of amenable and residually finite groups. We include a definition below. There are several other interesting equivalent definitions. For further background, motivation and discussions on sofic groups, we refer the reader, for instance to [12].
Throughout G, we will denote a countable discrete group with identity denoted by 1. We will write F G to indicate that F is a finite subset of G. For a finite set V, let S V denote the group of permutations over V. We will consider maps from a group G to S V . These maps are not necessarily homomorphisms. Given a map ξ : G S V , g G and v V , we write ξ g S V for the image of g under ξ and ξ g ( v ) V for the image of v under the permutation ξ g .
Let V be a finite set, F G and ϵ > 0 . A map ξ : G S V is called an ( F , ϵ ) -approximation of G if it satisfies the following properties:
1 | V | # { v V : ξ g ( ξ h ( v ) ) ξ g h ( v ) } < ϵ   for   every   choice   of   g , h F ,
and
1 | V | | # { v V : ξ g ( v ) = v } < ϵ   for   every   choice   of   g F   \ { 1 } .
A sofic group is a group G that admits an ( F , ϵ ) -approximation for any F G and any ϵ > 0 . A symmetric ( F , ϵ ) -approximation of G is ξ : G S V that in addition to (1) and (2) also satisfies
ξ g ( ξ g - 1 ( v ) ) = v   for   every   choice   of   g F   \ { 1 }   and   v V .
Standard arguments show that a sofic group admits a symmetric ( F , ϵ ) -approximation for any F G and any ϵ > 0 , so from now assume our ( F , ϵ ) -approximations also satisfy (3).
Let ( V n ) n = 1 be a sequence of finite sets. A sequence ( ξ n ) n = 1 of maps ξ n : G V n is called a sofic approximation for G if
{ n N : ξ n   is   an   ( F , ϵ ) - approximation }
is co-finite in N , for every F G and every ϵ > 0 . It follows directly from the definition that G is sofic if and only if there exists a sofic approximation for G.

2.2. Sofic Entropy

Roughly speaking, the sofic entropy of an action is h if there are “approximately” e h | V | “sufficiently distinct good approximations” for the action that “factor through” a finite “approximate action” ξ : G S V . Various definitions have been introduced in the literature, that have been shown to lead to an equivalent notion. Most definitions involve some auxiliary structure. Here, we follow a recent presentation of sofic entropy by Austin [13]. Ultimately, this presentation is equivalent to Bowen’s original definition and also to definitions given by Kerr and Li. We briefly describe Austin’s definition and refer to [13] for details.
From now on we denote
X : = { 0 , 1 } N .
The space X will be equipped with the metric d defined by
d ( ω , ω ) : = 2 - min { n N : ω n ω n }   for   ω , ω X .
The above metric induces the product topology on X with respect to the discrete topology on { 0 , 1 } , making X into a compact topological space.
Let G ( X , μ ) be a probability preserving action on a standard probability space. As explained in [13], by passing to an isomorphic action we can assume without loss of generality that:
  • The space X is equal to X G , equipped the product topology;
  • The action of G on X G is the shift action: ( g x ) h : = x g - 1 h ;
  • μ Prob ( X G ) is a Borel probability measure on X G .
Note that X is a compact topological space (in fact X is homeomorphic to X ).
To see that the above assumptions are no loss of generality, start with an arbitrary measure preserving G-action on a standard Borel probability space ( X , μ ) . Choose a countable sequence ( A n ) n = 1 of Borel subsets A n X so that the smallest G-invariant σ-algebra containing { A n } n = 1 is the Borel σ-algebra. There is a G-equivariant Borel embedding of x X to x ^ X G defined by
( x ^ g ) n : = 1 g - 1 A n ( x )   for   n N   and   g G .
Let μ ^ Prob ( X G ) denote the push-forward measure of μ, it follows that the G-action on ( X G , μ ^ ) is measure-theoretically isomorphic to the G-action on ( X , μ ) .
It follows from the choice of metric in (5) that
d ( ω , ω ) { 0 } { 2 - n : n Z + }   for   every   ω , ω X .
We recall some definitions and notation that Austin introduced in [13]:
Definition 1. 
Given a finite or countable set V, ω X V , ξ : G S V and v V , the pullback name of ω at v, denoted by Π v ξ ( ω ) X G is defined to be:
( Π v ξ ( ω ) ) g - 1 : = ω ξ g ( v ) .
The empirical distribution of ω with respect to ξ is defined by:
P ω ξ : = 1 | V | v V δ Π v ξ ( ω ) .
Given a weak-* neighborhood O Prob ( X G ) of μ Prob ( X G ) , the set of ( O , ξ ) -approximations for the action G ( X G , μ ) is given by
Map ( O , ξ ) : = { ω X V : P ω ξ O } .
In [13] elements of Map ( O , ξ ) are called “good models”.
The space Map ( O , ξ ) X V , if it is non-empty, is considered as a metric space with respect to the following metric
d V ( ω , ω ) : = 1 | V | v V d ( ω v , ω v )   for   ω , ω Map ( O , ξ ) .
Given a compact metric space ( Y , ρ ) and δ > 0 we denote by sep δ ( Y , ρ ) the maximal cardinality of a δ-separated set in ( Y , ρ ) , and by cov δ ( Y , ρ ) the minimal number of ρ-balls of radius δ needed to cover 5Y. Let us recall a couple of classical relations between these quantities. Because distinct 2 δ -separated points cannot be in the same δ-ball the following holds:
sep 2 δ ( Y , ρ ) cov δ ( Y , ρ ) .
Consider a maximal δ-separated set Y 0 Y . The collection of δ-balls with centers in Y 0 covers Y. Thus:
cov δ ( Y , ρ ) sep δ ( Y , ρ ) .
Definition 2. 
Let Σ = ( ξ n ) n = 1 be a sofic approximation of G, with ξ n : G S V n . The Σ-entropy (or sofic entropy with respect to Σ) of G ( X G , μ ) is defined by:
h Σ ( μ ) : = sup δ > 0 inf O μ lim sup n 1 | V n | log sep δ Map ( O , ξ n ) , d V n ,
where the infimum is over weak-* neighborhoods O of μ in Prob ( X ) . If Map ( O , ξ n ) = for all large n’s, define h Σ ( μ ) : = - .
A curial property of the quantity h Σ ( μ ) is that it does not depend on the way we choose the topological model X G or on choice of metric d, and thus defines an isomorphism-invariant for probability preserving G-actions.
Remark 1. 
We recall a slight generalization of Σ-entropy: A random sofic approximation is Σ = ( P n ) n = 1 where P n Prob ( ( S V n ) G ) so that the conditions (1) and (2) hold “on average” with respect to P n for any ϵ > 0 and F G , if n is large enough.
In this case Σ-entropy is defined by
h Σ ( μ ) : = sup δ > 0 inf O μ lim sup n 1 | V n | log sep δ Map ( O , ξ ) , d V n d P n ( ξ ) .
For the special case where G is a free group on d generators and P n is chosen uniformly among the homomorphisms from G to the group of permutations of { 1 , , n } , Bowen proved that Σ-entropy coincides with the so called f-invariant [4].
Our proof of Theorem 1 applies directly with no changes to random sofic approximations, in particular to f-entropy.

2.3. Stabilizers and the Space of Subgroups

Let Sub G 2 G denote the space of subgroups of G. The space Sub G comes with a compact topology, inherited from the product topology on 2 G . The group G acts on Sub G by inner automorphisms. Now let G X be an action of G on a standard Borel space X. For x X let
stab ( x ) : = g G : g ( x ) = x .
It is routine to check that the map stab : X Sub G is Borel and G-equivariant. The following observation appears implicitly for instance in [7]:
Lemma 1. 
Let G ( X , μ ) be an ergodic action of a countable group. If the action has finite stabilizers, the map stab : X Sub G induces a finite factor G ( Sub G , μ stab - 1 ) .
Proof. 
Suppose stab ( x ) is finite on a set of positive measure. By ergodicity | stab ( x ) | < on a set of full measure. Since there are only countably many finite subgroups, the measure μ stab - 1 Prob ( Sub G ) must be purely atomic. To finish the proof, note that a purely atomic invariant probability measure must be supported on a single finite orbit, if it is ergodic. ☐
Here is a quick corollary of Theorem 1 that concerns the action G Sub G :
Corollary 1. 
Let G be an infinite sofic group and Σ a sofic approximation sequence. The topological Σ-entropy of the action G Sub G by conjugation is zero.
Proof. 
The variational principle for Σ-entropy states that the topological Σ-entropy of an action G X is equal to the supremum of the measure-theoretic Σ-entropy over all G-invariant measures [3]. Sub G always admits at least two trivial fixed points G and { 1 } . The delta measures δ G and δ { 1 } Prob ( Sub G ) are thus G-invariant and have h Σ ( δ G ) = h Σ ( δ { 1 } ) = 0 . It thus suffices to prove that any G-invariant measure μ Prob ( Sub G ) has h Σ ( μ ) 0 . By Theorem 1, it is enough to show that the set A = { H Sub G : | stab ( H ) | < } is null. Indeed, for any H Sub G , H stab ( H ) , because any subgroup is contained in its normalizer. Thus, groups H Sub G with finite stabilizer must be finite, so A is a countable set. Suppose μ ( A ) > 0 . Then A has positive measure for some ergodic measure and as in Lemma 1 this measure must be supported on a finite set. An action of an infinite group on a finite set cannot have finite stabilizers. This shows that μ ( A ) = 0 . ☐

3. Sampling from Finite Graphs

In this section we prove an auxiliary result on finite labeled graphs. We begin with some terminology:
Definition 3. 
A finite , simple and directed graph is a pair G = ( V , E ) where V is a finite set and E V 2 (we allow self-loops but no parallel edges).
  • The out-degree and in-degree of v V are given by
    deg out ( v ) : = w V : ( v , w ) E ,
    deg in ( v ) : = w V : ( w , v ) E .
  • We say that G is ( ϵ , k , M ) -regular if at most ϵ | V | vertices have out-degree less than k, and all vertices have in-degree at most M.
  • A set W V is ϵ-dominating if the number of vertices in v V so that { w W : ( v , w ) E } = is at most ϵ | V | .
  • A p-Bernoulli set W V for p ( 0 , 1 ) is a random subset of V such that for each v V the probability that v W is p, independently of the other vertices.
Lemma 2. 
Fix any κ ( 0 , 1 ) . Suppose k M N satisfy
( 1 - 1 k ) k < κ   a n d   N > 2 M 2 κ - 3 .
For any ( κ , k , M ) -regular graph G = ( V , E ) with | V | > N , a 1 k -Bernoulli subset is 3 κ -dominating and has size at most 2 k | V | with probability at least 1 - κ .
Proof. 
Suppose (12) holds. Let G = ( V , E ) be a graph satisfying the assumptions in the statement of the lemma, and let W V be 1 k -Bernoulli.
For v V , let n ( v ) be number of edges ( v , w ) E with w W . The random variable n ( v ) is Binomial B ( 1 k , deg out ( v ) ) . Let
Φ : = v V 1 [ n ( v ) = 0 ] .
It follows that
E ( Φ ) = v V P n ( v ) = 0 = v V , deg out ( v ) < k P n ( v ) = 0 + v V , deg out ( v ) k P n ( v ) = 0 .
Thus
E ( Φ ) κ | V | + 1 - 1 k k | V | < 2 κ | V | .
For v , w V , the random variables n ( v ) and n ( w ) are independent, unless there is a vertex u V so that ( v , u ) E and ( w , u ) E . Because the maximal in-degree is at most M, each u V can account for at most M 2 such pairs, so there are at most M 2 | V | pairs which are not independent. Also note that Var ( 1 [ n ( v ) = 0 ] ) 1 for every v V so Cov ( 1 [ n ( v ) = 0 ] , 1 [ n ( w ) = 0 ] ) 1 . It follows that
Var ( Φ ) = v , w V Cov ( 1 [ n ( v ) = 0 ] , 1 [ n ( w ) = 0 ] ) M 2 | V | .
By Chebyshev’s inequality, the probability that W is not 3 κ -dominating is at most
P Φ > 3 κ | V | ) P ( | Φ - E ( Y ) | > κ | V | Var ( Φ ) κ 2 | V | 2 M 2 κ 2 | V | < κ 2 .
Also E ( | W | ) = 1 k | V | and Var ( | W | ) < 1 k | V | , so again by Chebyshev’s inequality
P ( | W | > 2 k | V | ) k Var ( | W | ) | V | 2 k | V | κ 2 .
It follows that with probability at least 1 - κ , W is 3 κ -dominating and | W | 2 k | V | . ☐

4. Proof of Theorem 1

From now on we assume that X G with the shift action described above is a fixed topological model for an action G ( X , μ ) . Suppose stab ( x ) is infinite μ-almost-surely. Our goal is to prove that the sofic entropy of this G-action is non-positive with respect to any sofic approximation (in the case of a deterministic approximation sequence this means it is either 0 or - ). By a direct inspection of the definition of sofic entropy in (9), our goal is to show that for any η > 0 there exists a neighborhood O Prob ( X G ) of μ so that for any sufficiently good approximation ξ : G S V ,
1 | V | log sep η ( Map ( O , ξ ) , d V ) < η .
We will show that we can choose the neighborhood O Prob ( X G ) to be of the form O = O [ M , δ , ϵ , F 1 , F 2 , ψ ] (see Definition 5 below), for some parameters F 1 , F 2 G and ϵ , δ > 0 .
Definition 4. 
(Approximate stabilizer) For F G and δ > 0 and x X G let
stab δ , F ( x ) : = h F { g G : d ( x h , g ( x ) h ) < δ } .
Lemma 3. 
For any measure μ Prob ( X G ) , ϵ > 0 , F 1 G there exists F 2 G and a continuous function ψ : X F 2 2 F 1 so that
μ x X G : ψ ( x F 2 ) ( stab ( x ) F 1 ) < ϵ .
Proof. 
By Lusin’s theorem there exists a compact set E X G with μ ( X   \   E ) < ϵ so that the function x ( stab ( x ) F 1 ) is continuous on E, where ( stab ( x ) F 1 ) is considered as a discrete set. Let ψ ˜ : E ( stab ( x ) F 1 ) denote the restriction of x ( stab ( x ) F 1 ) to E, then ψ ˜ - 1 ( s ) is clopen for every s 2 F 1 . Thus there exists F 2 G and ψ : X 2 F G so that ψ ˜ ( x ) = ψ ( x F 2 ) . ☐
Definition 5. 
Let ϵ , δ , M > 0 , F 1 , F 2 G and ψ : X F 2 2 F 1 . Define
O [ M , δ , ϵ , F 1 , F 2 , ψ ] Prob ( X G )
to be the set of probability measures ν Prob ( X G ) satisfying the following conditions:
ν ( { x : | ψ ( x F 2 ) | < M } ) < ϵ ,
ν x : ψ ( x F 2 ) ( stab δ , F 2 2 ( x ) F 1 ) < ϵ .
Lemma 7. 
If δ - 1 is not an integer power of 2, then the set O [ M , δ , ϵ , F 1 , F 2 , ψ ] Prob ( X G ) is open.
Proof. 
Suppose δ - 1 is not an integer power of 2. By (6) it follows that for ω , ω X , d ( ω , ω ) < δ if and only if d ( ω , ω ) δ . So for every F G ,
stab δ , F ( x ) = h F { g G : d ( x h , g ( x ) h ) < δ } = h F { g G : d ( x h , g ( x ) h ) δ } .
It follows that for any g G and F G the set { x X G : g stab δ , F ( x ) } is a clopen set: It is both open and closed in X G .
Because F 1 and F 2 are both finite and ψ : X F 2 2 F 1 is continuous,
A : = x X G : ψ ( x F 2 ) ( stab δ , F 2 2 ( x ) F 1 )
and
B : = x X : | ψ ( x F 2 ) | < M
are also clopen in X. So the indicator functions 1 A , 1 B : X R are continuous. Now
O [ M , δ , ϵ , F 1 , F 2 , ψ ] = ν Prob ( X G ) : 1 A ( x ) d ν ( x ) < ϵ   and   1 B ( x ) d ν ( x ) < ϵ ,
so O [ M , δ , ϵ , F 1 , F 2 , ψ ] Prob ( X G ) is an open set.
  ☐
Fix η > 0 . We now specify how to choose the parameters ϵ > 0 , δ > 0 , M > 0 , F 1 , F 2 G , and ψ : X 2 F 2 F 1 .
  • Choose ϵ so that
    0 < ϵ < min { η 100 , 1 3 } .
  • Choose δ > 0 so that δ - 1 is not an integer power of 2 and so that
    3 δ < η - 100 ϵ .
  • Choose M > 0 depending on ϵ and δ, and big enough so that
    sup n M ( 1 - 1 n ) n < ϵ / 3   and   4 M log sep δ / 2 ( X , d ) < η 2 .
    It is clear that the left hand side in both expressions tends to 0 as M , so such choice of M is indeed possible.
  • Choose a finite subset F 1 G depending on M, ϵ, and the measure μ so that 1 F 1 and
    μ x X G : | stab ( x ) F 1 | M < ϵ / 2 .
    We prove the existence of such a set F 1 in Lemma 5 below.
  • By Lemma 3 choose F 2 G and ψ : X F 2 2 F 1 so that (14) holds. Furthermore, by making F 2 bigger, assume that F 1 F 2 , that F 2 = F 2 - 1 and that
    2 | F 2 | | F 1 | log ( 2 ) < η 2 .
  • Choose a finite set V big enough so that
    | V | > 2 | F 2 | 2 ( ϵ / 3 ) - 3 .
  • Choose ξ : G S V to be a symmetric ( F 2 6 , ϵ / 6 ) -approximation of G.
Lemma 5. 
Under the assumption that μ ( | stab ( x ) | < ) = 0 , for every M > 0 and ϵ > 0 there exists F 1 G so that 1 F and (20) holds.
Proof. 
Because stab ( x ) = μ-a.e, it follows that for any M > 0 ,
μ x X : | stab ( x ) | M = 0 .
Note that
x X : | stab ( x ) | M = F G x X : | stab ( x ) F | M .
So by σ-additivity of μ, it follows that (20) holds for some F 1 G . Furthermore, we can assume that 1 F 1 by further increasing F 1 . ☐
Lemma 6. 
For M > 0 , ϵ , δ > 0 and F 1 , F 2 G as above, μ O [ M , δ , ϵ , F 1 , F 2 , ψ ] .
Proof. 
Because F 1 F 2 2 , it follows that
stab ( x ) stab δ , F 2 2 ( x ) stab δ , F 1 ( x ) .
So by (14) it follows that (16) also holds with ν replaced by μ. Using (14) and (20) we see that (15) holds with ν replaced by μ. Thus μ O [ M , δ , ϵ , F 1 , F 2 , ψ ] . ☐
The following lemma shows that approximate stabilizers behave well under conjugation:
Lemma 7. 
If F 1 F 2 = F 2 - 1 and x X G satisfies
ψ ( x F 2 ) = stab δ , F 2 2 ( x ) F 1 ,
then
g ψ ( x F 2 ) g - 1 stab δ , F 1 ( g ( x ) )   f o r   e v e r y   g F 2 .
Proof. 
Suppose (23) holds. Choose any f ψ ( x F 2 ) . By (23),
d ( x h , x f - 1 h ) < δ   for   every   h F 2 2 .
Now choose any g F 2 . For any h F 1 we have g - 1 h F 2 - 1 F 1 F 2 2 so we can substitute g - 1 h instead of h in (25) to obtain
d ( x g - 1 h , x f - 1 g - 1 h ) < δ .
Now ( g ( x ) ) h = x g - 1 h and
( g f g - 1 g ( x ) ) h = x f - 1 g - 1 h .
So we have
d ( ( g ( x ) ) h , ( g f g - 1 g ( x ) ) h ) < δ .
This means that ( g f g - 1 ) stab δ , F 1 ( g ( x ) ) . We conclude that (23) implies (24). ☐
Definition 6. 
Call v V good for ω X V if the following conditions are satisfied:
| ψ ( Π v ξ ( ω ) F 2 ) | M ,
ψ ( Π v ξ ( ω ) F 2 ) = stab δ , F 2 2 ( Π v ξ ( ω ) ) F 1 ,
and
ξ g 1 ξ g 2 ξ g 3 ( v ) = ξ g 1 g 2 g 3 ( v )   for   every   g 1 , g 2 , g 3 F 2 4 .
Otherwise, say that v V is bad for ω X V .
Lemma 8. 
Let Ω Map ( O [ M , δ , ϵ , F 1 , F 2 , ψ ] , ξ ) with 2 | Ω | < . Then there exists a set C V and a function τ : V F 2 with the following properties:
(I) 
| C | < 2 | F 2 | | V | ,
(II) 
1 | V | | { v V : ξ τ ( v ) C } | ϵ ,
(III) 
1 | Ω | x Ω : | { v V : ξ τ ( v )   i s   b a d   f o r   x } | < 8 ϵ | V | 1 2 ,
where ξ τ : V V is defined by
ξ τ ( v ) : = ξ τ ( v ) ( v ) .
Proof. 
Consider the directed graph G ξ , F 2 = ( V , E ) with
E = ( u , v ) V × V : g F 2   s . t .   ξ g ( u ) = v .
We aim to apply Lemma 2 to find a small ϵ-dominating set C V in G ξ , F 2 . Let us check that G ξ , F 2 satisfies the assumptions of Lemma 2:
Because ξ g is a permutation of V for every g G , the maximal out-degree in G ξ , F 2 is at most | F 2 | . Because the approximation ξ : G S V is symmetric and F 2 = F 2 - 1 , the maximal in-degree in G ξ , F 2 is also at most | F 2 | . Let V V denote the set of v’s for which the mapping g ξ g ( v ) is injective on F 2 . Because ξ : G S V is an ( F 2 6 , ϵ / 6 ) -good approximation of G it follows that | V   \   V |     ϵ 3 | V | , so G ξ , F 2 is ( ϵ / 3 , | F 2 | , | F 2 | ) -regular.
By Lemma 2, a 1 | F 2 | -Bernoulli set C V is ϵ-dominating and has size at most 2 | F 2 | | V | with probability at least 1 - 2 3 ϵ > 1 2 . To see that Lemma 2 applies, we used the left inequality in (19) (keeping in mind that | V | > M ), and (22) to deduce that (12) is satisfied with k = M =   | F 2 | and κ replaced with ϵ / 3 and N = | V | . In this case C V satisfies ( I ) . Choose the value of τ : V F 2 at v V randomly as follows: Whenever the set N v : = { g F 2 : ξ g ( v ) C } is non-empty, choose τ ( v ) uniformly at random from N v F 2 . If N v = , then τ ( v ) be chosen uniformly at random from F 2 . We see that if C is ϵ-dominating, then ( I I ) is satisfied.
To conclude the proof we will show that ( I I I ) is satisfied with probability at least 1 / 2 .
For ω Ω and v V denote:
Ψ ω , v : = 0 if   v is   good   for   ω ; 1 if   v is   bad   for   ω .
Because Ω O [ M , δ , ϵ , F 1 , F 2 , ψ ] , it follows that for every ω Ω , all but an ϵ-fraction of the v’s are good so
1 | V | v V Ψ ω , v < ϵ   for   every   ω Ω .
Now let Z ω , v denote the indicator of the event “ ξ τ ( v ) is bad for ω”, that is,
Z ω , v : = g F 2 1 [ τ ( v ) = g ] Ψ ω , ξ g ( v ) .
Then Z ω , v is a random variable, because τ : V F 2 is a random function.
Because g ξ g ( v ) is injective for every v V , each v V has | F 2 | outgoing edges. So for v V , τ ( v ) is uniform in F 2 in case N v is empty and uniform in { g F 2 : ξ g ( v ) C } otherwise. It follows that
P τ ( v ) = g = | F 2 | - 1 for   every   v V   and   g F 2 .
It follows that for v V ,
E ( Z ω , v ) = 1 | F 2 | g F 2 Ψ ω , ξ g ( v ) .
Because | V   \   V |   < ϵ | V | it follows that
E 1 | V | v V Z ω , v 1 | V | v V 1 | F 2 | g F 2 Ψ ω , ξ g ( v ) + ϵ .
Because ξ g S V is a permutation:
v V Ψ ω , ξ g ( v ) = v V Ψ x , v .
So from (33) and (31) we get that for every x Ω
E 1 | V | v V Z ω , v 1 | V | v V Ψ ω , v + ϵ 2 ϵ .
Averaging over ω Ω we obtain:
E 1 | Ω | ω Ω 1 | V | v V Z ω , v = 1 | Ω | ω Ω E 1 | V | v V Z ω , v 2 ϵ .
Using Markov’s inequality, we get that
P 1 | Ω | x Ω 1 | V | v V Z ω , v > 4 ϵ 1 2 .
So ( I I I ) holds with probability at least 1 2 . ☐
Given a finite set V, the following “Hamming-like” metric is defined on X V :
d V ( ω , ω ) : = 1 | V | v V d ( ω v , ω v )   for   ω , ω X V .
We also have the following “uniform” metric d D on X D , where D is a finite set:
d D ( ω , ω ) : = max v D d ( ω v , ω v )   for   ω , ω X V .
We will use the following estimate:
Lemma 9. 
For any finite set D and δ > 0 we have
log sep 2 δ ( X D , d D ) | D | log sep δ ( X , d ) .
Proof. 
If S X is such that X = ω S B δ ( ω ) and | S | = cov δ ( X , d ) then the union of δ-balls in ( X D , d D ) with centers in S V covers X V . It follows that
log cov δ ( X D , d D ) | D | log cov δ ( X , d ) .
The claim now follows because sep 2 δ ( X D , d D ) cov δ ( X D , d D ) and cov δ ( X , d ) sep δ ( X , d ) . ☐
We record the following Lemma (see Lemma 3 . 1 in [13], and recall that we use a left-action):
Lemma 10. 
Suppose v V is good for ω X V and g F 2 3 . Then
g - 1 ( Π ξ g ( v ) ξ ( ω ) ) F 2 3 = Π v ξ ( ω ) F 2 3 .
Proof. 
Because v is good for ω it follows that
ξ h - 1 g - 1 ( ξ g ( v ) ) = ξ h - 1 ( v )   for   every   h F 2 3 ,
so for every h F 2 3 we have
g - 1 ( Π ξ g ( v ) ξ ( ω ) ) h = ( Π ξ g ( v ) ξ ( ω ) ) g h = ω ξ h - 1 g - 1 ( ξ g ( v ) ) = ω ξ h - 1 ( v ) = ( Π v ξ ( x ) ) h .
The following lemma is the heart of our proof of Theorem 1:
Lemma 11. 
The following holds:
1 | V | log sep η ( Map ( O [ M , δ , ϵ , F 1 , F 2 , ψ ] , ξ ) , d V ) < 4 | F 2 | · | F 1 | log ( 2 ) + 4 M log sep δ / 2 ( X , d ) .
Proof. 
Fix any subset Ω Map ( O [ M , δ , ϵ , F 1 , F 2 , ψ ] , ξ ) that is η-separated with respect to the metric d V . Let τ : V F 2 and C V be as in the conclusion of Lemma 8. By condition ( I I I ) there exists Ω Ω with 2 | Ω |     | Ω | such that
1 | V | | { v V : ξ τ ( v )   is   bad   for   ω } | < 8 ϵ   for   every   ω Ω .
Denote by S the set of functions from C to subsets of F 1 , that is S : = ( 2 F 1 ) C . For each s S , let
Ω s : = ω Ω : ψ ( Π v ξ ( ω ) F 2 ) = s v   for   every   v C .
Then Ω = s S Ω s , so
| Ω | 2 · 2 | F 1 | · | C | · max s S | Ω s | .
By ( I ) , | C | 2 | F 2 | | V | . It follows that
1 | V | log | Ω | 4 | F 2 | | F 1 | log ( 2 ) + max s S 1 | V | log | Ω s | .
So our next goal is to bound | Ω s | , for s S . For this s and v V define:
stab ( v , s ) : = ( τ ( v ) ) - 1 s ξ τ ( v ) τ ( v ) if ξ τ ( v ) C , otherwise .
We claim that if ω Ω s and v, ξ τ ( v ) are both good for ω then
stab ( v , s ) stab δ , F 1 ( Π v ξ ( ω ) ) .
Indeed, we can assume that ξ τ ( v ) C otherwise stab ( v , s ) = and (41) holds trivially. Then
s ξ τ ( v ) = stab δ , F 1 ( Π ξ τ ( v ) ξ ( ω ) ) F 1 .
Denote g v : = τ ( v ) . Because v is good for ω and g v F 2 , by Lemma 10,
g v - 1 ( Π ξ g v ( v ) ξ ( ω ) ) F 2 3 = Π v ξ ( ω ) F 2 3 .
So
stab δ , F 1 g v - 1 ( Π ξ g v ( v ) ξ ( ω ) ) F 2 3 = stab δ , F 1 Π v ξ ( ω ) F 2 3 .
Because ξ τ ( v ) is good for ω (27) holds with v replaced by ξ τ ( v ) . So by Lemma 7 applied with g = τ ( v ) - 1 ,
τ ( v ) - 1 s ξ τ ( v ) τ ( v ) stab δ , F 1 ( g v - 1 ( Π ξ τ ( v ) ξ ( ω ) ) ) F 2 3 = stab δ , F 1 ( Π v ξ ( ω ) ) F 2 3 .
This proves that (41) holds.
Consider the graph G s = ( V , E s ) where
E s : = { ( v , ξ g ( v ) ) : g stab ( v , s ) } .
Claim A: 
If ( v , u ) is an edge in G s and ω Ω s and v , ξ τ ( v ) are both good for ω then d ( ω v , ω u ) < δ .
Proof of Claim A: 
By definition of G s there exists g stab ( v , s ) so that ξ g ( v ) = u . By the argument above g stab δ , F 1 ( Π v ξ ( ω ) ) , so d ( ( Π v ξ ( ω ) ) 1 , g ( Π v ξ ( ω ) ) 1 ) < δ . Now x v = ( Π v ξ ( ω ) ) 1 and
x u = ω ξ g ( v ) = ( Π v ξ ( ω ) ) g - 1 = g ( ( Π v ξ ( ω ) ) 1 ,
so indeed d ( ω v , ω u ) < δ .
Claim B: 
The graph G s is ( 11 ϵ , M , | F 2 | 3 ) -regular.
Proof of Claim B: 
Note that by definition stab ( v , s ) F 2 - 1 F 1 F 2 F 2 3 , so ( u , v ) E s implies that v = ξ g ( u ) for some g F 2 3 . This shows that G s has maximal in-degree at most | F 2 | 3 .
The properties of C, τ and Ω assure that
| { v V : ξ τ ( v ) C } | < 2 ϵ | V |
and
v V : ξ τ ( v )   is   bad   for   ω < 8 ϵ | V | for   every   ω Ω .
It follows that | stab ( v , x ) | < M for at most 10 ϵ | V | v’s. Also, as in the proof of Lemma 8, because ξ : G S V is a sufficiently good sofic approximation the map g ξ g ( v ) is injective on F 2 3 for all but at most ϵ | V | v’s. It follows that at most 11 ϵ | V | of the vertices in G s have degree smaller than M. This completes the proof of Claim B.
By (19) and (22), the condition (12) is satisfied with M replaced by | F 2 | 3 , k replaced by M and κ replaced by 11 ϵ . So using Claim B we can apply Lemma 2 to deduce that there is a set D V of size at most 2 M | V | which is 33 ϵ -dominating in G s . As in the proof of Lemma 8, there exists a function τ : V F 2 3 so that for all but 33 ϵ v’s the pair ( v , ξ τ ( v ) ( v ) ) is an edge in G s and ξ τ ( v ) ( v ) D .
Claim C: 
If ω , ω Ω s and d ( ω v , ω v ) < δ for all v D then d V ( ω , ω ) < η .
Proof of Claim C: 
Suppose ω , ω Ω s and d ( ω v , ω v ) < δ for all v D . Fix u V . Denote v = ξ τ ( u ) ( u ) . If u and ξ τ ( u ) are both good with respect to ω and with respect to ω , and ( u , v ) is an edge in G s , it follows from Claim A that d ( ω u , ω v ) < δ and d ( ω u , ω v ) < δ . Furthermore, if v D , then d ( ω v , ω v ) < δ so in that case d ( ω u , ω u ) < 3 δ . So if d ( ω u , ω u ) > 3 δ , either v D or one of u , ξ τ ( u ) is not good for ω or for ω . Thus
| u V : d ( ω u , ω u ) > 3 δ | < 2 ( 33 + 8 ) ϵ | V | < 100 ϵ | V | .
Thus, because the diameter of X is bounded by 1,
1 | V | v V d ( ω v , ω v ) 3 δ + 100 ϵ < η ,
where in the last inequality we used (18). This completes the proof of Claim C.
Because Ω s is η-separated, Claim C implies that the restriction map π D : X V X D is injective on Ω s , and that π D ( Ω s ) is δ-separated with respect to the metric d D . Thus by Lemma 9,
log | Ω s | = log | π D ( Ω s ) | log sep δ ( X d , d D ) | D | log sep δ / 2 ( X , d ) .
We conclude that
log | Ω s |   4 M | V | log sep δ / 2 ( X , d ) .
Together with (39) this shows that
1 | V | log | Ω | 4 | F 2 | · | F 1 | log ( 2 ) + 4 M log sep δ / 2 ( X , d ) .
Since Ω was an arbitrary η-separated subset of O [ M , δ , ϵ , F 1 , F 2 , ψ ] , this completes the proof. ☐
To conclude the proof of Theorem 1, observe that the right hand side of (36) is bounded above by η because of (21) and the right inequality in (19).

5. Finite Stabilizers and Completely Positive Entropy

We conclude with a corollary regarding actions with completely positive Σ-entropy, due to Weiss [7] in the amenable case. Recall that an action G ( X , μ ) is faithful if μ ( { x X : g ( x ) x } ) > 0 for all g G , and free if μ ( { x X : stab ( x ) { 1 } } ) = 0 . Also, recall that G ( Y , ν ) is a factor of G ( X , μ ) , that is there is a G-equivariant map π : X Y with ν = μ π - 1 . An action G ( X , μ ) of a sofic group has completely positive Σ-entropy if any non-trivial factor has positive Σ-entropy.
Corollary 2. 
Let G be an infinite countable sofic group. If an ergodic action G ( X , μ ) is faithful and has completely positive entropy with respect to some sofic approximation Σ, it is free.
Proof. 
By Theorem 1, the stabilizers must be finite, thus by Lemma 1 the map x stab ( x ) induces a finite factor. But an action of an infinite group on finite probability space must have infinite stabilizers. In particular by Theorem 1 this factor has zero entropy. Because G ( X , μ ) has completely positive sofic entropy it follows that stab ( x ) is constant, and because the action is faithful it must be trivial, so the action is free. ☐

Acknowledgments

Author supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No. 333598 and by the Israel Science Foundation (grant No. 626/14).

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Bowen, L.P. A measure-conjugacy invariant for free group actions. Ann. Math. 2010, 171, 1387–1400. [Google Scholar] [CrossRef]
  2. Bowen, L. Measure conjugacy invariants for actions of countable sofic groups. J. Am. Math. Soc. 2010, 23, 217–245. [Google Scholar] [CrossRef]
  3. Kerr, D.; Li, H. Entropy and the variational principle for actions of sofic groups. Invent. Math. 2011, 186, 501–558. [Google Scholar] [CrossRef]
  4. Bowen, L. The ergodic theory of free group actions: Entropy and the f-invariant. Groups Geom. Dyn. 2010, 4, 419–432. [Google Scholar] [CrossRef]
  5. Kerr, D.; Li, H. Soficity, amenability, and dynamical entropy. Am. J. Math. 2013, 135, 721–761. [Google Scholar] [CrossRef]
  6. Abért, M.; Glasner, Y.; Virág, B. Kesten’s theorem for invariant random subgroups. Duke Math. J. 2014, 163, 465–488. [Google Scholar] [CrossRef] [Green Version]
  7. Weiss, B. Actions of amenable groups. In Topics in Dynamics and Ergodic Theory; Cambridge University Press: Cambridge, UK, 2003; Volume 310, pp. 226–262. [Google Scholar]
  8. Seward, B. Finite Entropy Actions of Free Groups, Rigidity of Stabilizers, and a Howe-Moore Type Phenomenon. 2012; arXiv:1205.5090. [Google Scholar]
  9. Bowen, L. Entropy theory for sofic groupoids I: The foundations. Journal d’Analyse Mathématique 2014, 124, 149–233. [Google Scholar] [CrossRef]
  10. Gromov, M. Endomorphisms of symbolic algebraic varieties. J. Eur. Math. Soc. 1999, 1, 109–197. [Google Scholar] [CrossRef]
  11. Weiss, B. Sofic groups and dynamical systems. Sankhyā Indian J. Stat. Ser. A 2000, 62, 350–359. [Google Scholar]
  12. Pestov, V.G. Hyperlinear and sofic groups: A brief guide. Bull. Symb. Log. 2008, 14, 449–480. [Google Scholar] [CrossRef]
  13. Austin, T. Additivity Properties of Sofic Entropy and Measures on Model Spaces. 2015; arXiv:1510.02392. [Google Scholar]

Share and Cite

MDPI and ACS Style

Meyerovitch, T. Positive Sofic Entropy Implies Finite Stabilizer. Entropy 2016, 18, 263. https://doi.org/10.3390/e18070263

AMA Style

Meyerovitch T. Positive Sofic Entropy Implies Finite Stabilizer. Entropy. 2016; 18(7):263. https://doi.org/10.3390/e18070263

Chicago/Turabian Style

Meyerovitch, Tom. 2016. "Positive Sofic Entropy Implies Finite Stabilizer" Entropy 18, no. 7: 263. https://doi.org/10.3390/e18070263

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