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 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 to indicate that F is a finite subset of G. For a finite set V, let denote the group of permutations over V. We will consider maps from a group G to . These maps are not necessarily homomorphisms. Given a map , and , we write for the image of g under ξ and for the image of v under the permutation .
Let V be a finite set, and . A map is called an -approximation of G if it satisfies the following properties:
and
A sofic group is a group G that admits an -approximation for any and any . A symmetric -approximation of G is that in addition to (1) and (2) also satisfies
Standard arguments show that a sofic group admits a symmetric -approximation for any and any , so from now assume our -approximations also satisfy (3).
Let be a sequence of finite sets. A sequence of maps is called a sofic approximation for G if
is co-finite in , for every and every . 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” “sufficiently distinct good approximations” for the action that “factor through” a finite “approximate action” . 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
The space will be equipped with the metric d defined by
The above metric induces the product topology on with respect to the discrete topology on , making into a compact topological space.
Let 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 , equipped the product topology;
- The action of G on is the shift action: ;
- is a Borel probability measure on .
Note that X is a compact topological space (in fact X is homeomorphic to ).
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 . Choose a countable sequence of Borel subsets so that the smallest G-invariant σ-algebra containing is the Borel σ-algebra. There is a G-equivariant Borel embedding of to defined by
Let denote the push-forward measure of μ, it follows that the G-action on is measure-theoretically isomorphic to the G-action on .
It follows from the choice of metric in (5) that
We recall some definitions and notation that Austin introduced in [13]:
Definition 1.
Given a finite or countable set V, , and , the pullback name of ω at v, denoted by is defined to be:
The empirical distribution of ω with respect to ξ is defined by:
Given a weak-* neighborhood of , the set of -approximations for the action is given by
In [13] elements of are called “good models”.
The space , if it is non-empty, is considered as a metric space with respect to the following metric
Given a compact metric space and we denote by the maximal cardinality of a δ-separated set in , and by the minimal number of ρ-balls of radius δ needed to cover 5Y. Let us recall a couple of classical relations between these quantities. Because distinct -separated points cannot be in the same δ-ball the following holds:
Consider a maximal δ-separated set . The collection of δ-balls with centers in covers Y. Thus:
Definition 2.
Let be a sofic approximation of G, with . The Σ-entropy (or sofic entropy with respect to Σ) of is defined by:
where the infimum is over weak-* neighborhoods of μ in . If for all large n’s, define .
A curial property of the quantity is that it does not depend on the way we choose the topological model 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 where so that the conditions (1) and (2) hold “on average” with respect to for any and , if n is large enough.
In this case Σ-entropy is defined by
For the special case where G is a free group on d generators and is chosen uniformly among the homomorphisms from G to the group of permutations of , 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 denote the space of subgroups of G. The space comes with a compact topology, inherited from the product topology on . The group G acts on by inner automorphisms. Now let be an action of G on a standard Borel space X. For let
It is routine to check that the map is Borel and G-equivariant. The following observation appears implicitly for instance in [7]:
Lemma 1.
Let be an ergodic action of a countable group. If the action has finite stabilizers, the map induces a finite factor .
Proof.
Suppose is finite on a set of positive measure. By ergodicity on a set of full measure. Since there are only countably many finite subgroups, the measure 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 :
Corollary 1.
Let G be an infinite sofic group and Σ a sofic approximation sequence. The topological Σ-entropy of the action by conjugation is zero.
Proof.
The variational principle for Σ-entropy states that the topological Σ-entropy of an action is equal to the supremum of the measure-theoretic Σ-entropy over all G-invariant measures [3]. always admits at least two trivial fixed points G and . The delta measures and are thus G-invariant and have . It thus suffices to prove that any G-invariant measure has . By Theorem 1, it is enough to show that the set is null. Indeed, for any , , because any subgroup is contained in its normalizer. Thus, groups with finite stabilizer must be finite, so A is a countable set. Suppose . 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 . ☐
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 where V is a finite set and (we allow self-loops but no parallel edges).
- The out-degree and in-degree of are given by
- We say that is -regular if at most vertices have out-degree less than k, and all vertices have in-degree at most M.
- A set is ϵ-dominating if the number of vertices in so that is at most .
- A p-Bernoulli set for is a random subset of V such that for each the probability that is p, independently of the other vertices.
Lemma 2.
Fix any . Suppose satisfy
For any -regular graph with , a -Bernoulli subset is -dominating and has size at most with probability at least .
Proof.
Suppose (12) holds. Let be a graph satisfying the assumptions in the statement of the lemma, and let be -Bernoulli.
For , let be number of edges with . The random variable is Binomial . Let
It follows that
Thus
For , the random variables and are independent, unless there is a vertex so that and . Because the maximal in-degree is at most M, each can account for at most such pairs, so there are at most pairs which are not independent. Also note that for every so . It follows that
By Chebyshev’s inequality, the probability that W is not -dominating is at most
Also and , so again by Chebyshev’s inequality
It follows that with probability at least , W is -dominating and . ☐
4. Proof of Theorem 1
From now on we assume that with the shift action described above is a fixed topological model for an action . Suppose 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 there exists a neighborhood of μ so that for any sufficiently good approximation ,
We will show that we can choose the neighborhood to be of the form (see Definition 5 below), for some parameters and .
Definition 4.
(Approximate stabilizer) For and and let
Lemma 3.
For any measure , , there exists and a continuous function so that
Proof.
By Lusin’s theorem there exists a compact set with so that the function is continuous on E, where is considered as a discrete set. Let denote the restriction of to E, then is clopen for every . Thus there exists and so that . ☐
Definition 5.
Let , and . Define
to be the set of probability measures satisfying the following conditions:
Lemma 7.
If is not an integer power of 2, then the set is open.
Proof.
Suppose is not an integer power of 2. By (6) it follows that for , if and only if . So for every ,
It follows that for any and the set is a clopen set: It is both open and closed in .
Because and are both finite and is continuous,
and
are also clopen in X. So the indicator functions are continuous. Now
so is an open set.
☐
Fix . We now specify how to choose the parameters , , , , and .
- Choose ϵ so that
- Choose so that is not an integer power of 2 and so that
- Choose depending on ϵ and δ, and big enough so thatIt is clear that the left hand side in both expressions tends to 0 as , so such choice of M is indeed possible.
- Choose a finite subset depending on M, ϵ, and the measure μ so that andWe prove the existence of such a set in Lemma 5 below.
- By Lemma 3 choose and so that (14) holds. Furthermore, by making bigger, assume that , that and that
- Choose a finite set V big enough so that
- Choose to be a symmetric -approximation of G.
Lemma 5.
Under the assumption that , for every and there exists so that and (20) holds.
Proof.
Because μ-a.e, it follows that for any ,
Note that
So by σ-additivity of μ, it follows that (20) holds for some . Furthermore, we can assume that by further increasing . ☐
Lemma 6.
For , and as above, .
Proof.
Because , it follows that
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 . ☐
The following lemma shows that approximate stabilizers behave well under conjugation:
Lemma 7.
If and satisfies
then
Proof.
Suppose (23) holds. Choose any . By (23),
Now choose any . For any we have so we can substitute instead of h in (25) to obtain
Now and
So we have
This means that . We conclude that (23) implies (24). ☐
Definition 6.
Call good for if the following conditions are satisfied:
and
Otherwise, say that is bad for .
Lemma 8.
Let with . Then there exists a set and a function with the following properties:
- (I)
- ,
- (II)
- ,
- (III)
- ,
Proof.
Consider the directed graph with
We aim to apply Lemma 2 to find a small ϵ-dominating set in . Let us check that satisfies the assumptions of Lemma 2:
Because is a permutation of V for every , the maximal out-degree in is at most . Because the approximation is symmetric and , the maximal in-degree in is also at most . Let denote the set of v’s for which the mapping is injective on . Because is an -good approximation of G it follows that , so is -regular.
By Lemma 2, a -Bernoulli set is ϵ-dominating and has size at most with probability at least . To see that Lemma 2 applies, we used the left inequality in (19) (keeping in mind that ), and (22) to deduce that (12) is satisfied with and κ replaced with and . In this case satisfies . Choose the value of at randomly as follows: Whenever the set is non-empty, choose uniformly at random from . If , then be chosen uniformly at random from . We see that if C is ϵ-dominating, then is satisfied.
To conclude the proof we will show that is satisfied with probability at least .
For and denote:
Because , it follows that for every , all but an ϵ-fraction of the v’s are good so
Now let denote the indicator of the event “ is bad for ω”, that is,
Then is a random variable, because is a random function.
Because is injective for every , each has outgoing edges. So for , is uniform in in case is empty and uniform in { otherwise. It follows that
It follows that for ,
Because it follows that
Because is a permutation:
So from (33) and (31) we get that for every
Averaging over we obtain:
Using Markov’s inequality, we get that
So holds with probability at least . ☐
Given a finite set V, the following “Hamming-like” metric is defined on :
We also have the following “uniform” metric on , where D is a finite set:
We will use the following estimate:
Lemma 9.
For any finite set D and we have
Proof.
If is such that and then the union of δ-balls in with centers in covers . It follows that
The claim now follows because and . ☐
We record the following Lemma (see Lemma in [13], and recall that we use a left-action):
Lemma 10.
Suppose is good for and . Then
Proof.
Because v is good for ω it follows that
so for every we have
The following lemma is the heart of our proof of Theorem 1:
Lemma 11.
The following holds:
Proof.
Fix any subset that is η-separated with respect to the metric . Let and be as in the conclusion of Lemma 8. By condition there exists with such that
Denote by S the set of functions from C to subsets of , that is . For each , let
Then , so
By , . It follows that
So our next goal is to bound , for . For this s and define:
We claim that if and v, are both good for ω then
Indeed, we can assume that otherwise and (41) holds trivially. Then
Denote . Because v is good for ω and , by Lemma 10,
So
Because is good for ω (27) holds with v replaced by . So by Lemma 7 applied with ,
This proves that (41) holds.
Consider the graph where
Claim A:
If is an edge in and and are both good for ω then .
Proof of Claim A:
By definition of there exists so that . By the argument above , so . Now and
so indeed .
Claim B:
The graph is -regular.
Proof of Claim B:
Note that by definition , so implies that for some . This shows that has maximal in-degree at most .
The properties of C, τ and assure that
and
It follows that for at most v’s. Also, as in the proof of Lemma 8, because is a sufficiently good sofic approximation the map is injective on for all but at most v’s. It follows that at most of the vertices in 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 , k replaced by M and κ replaced by . So using Claim B we can apply Lemma 2 to deduce that there is a set of size at most which is -dominating in . As in the proof of Lemma 8, there exists a function so that for all but v’s the pair is an edge in and .
Claim C:
If and for all then .
Proof of Claim C:
Suppose and for all . Fix . Denote . If u and are both good with respect to ω and with respect to , and is an edge in , it follows from Claim A that and . Furthermore, if , then so in that case . So if , either or one of is not good for ω or for . Thus
Thus, because the diameter of is bounded by 1,
where in the last inequality we used (18). This completes the proof of Claim C.
Because is η-separated, Claim C implies that the restriction map is injective on , and that is δ-separated with respect to the metric . Thus by Lemma 9,
We conclude that
Together with (39) this shows that
Since Ω was an arbitrary η-separated subset of , 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 is faithful if for all , and free if . Also, recall that is a factor of , that is there is a G-equivariant map with . An action 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 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 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 has completely positive sofic entropy it follows that 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
- Bowen, L.P. A measure-conjugacy invariant for free group actions. Ann. Math. 2010, 171, 1387–1400. [Google Scholar] [CrossRef]
- Bowen, L. Measure conjugacy invariants for actions of countable sofic groups. J. Am. Math. Soc. 2010, 23, 217–245. [Google Scholar] [CrossRef]
- Kerr, D.; Li, H. Entropy and the variational principle for actions of sofic groups. Invent. Math. 2011, 186, 501–558. [Google Scholar] [CrossRef]
- Bowen, L. The ergodic theory of free group actions: Entropy and the f-invariant. Groups Geom. Dyn. 2010, 4, 419–432. [Google Scholar] [CrossRef]
- Kerr, D.; Li, H. Soficity, amenability, and dynamical entropy. Am. J. Math. 2013, 135, 721–761. [Google Scholar] [CrossRef]
- 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]
- 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]
- Seward, B. Finite Entropy Actions of Free Groups, Rigidity of Stabilizers, and a Howe-Moore Type Phenomenon. 2012; arXiv:1205.5090. [Google Scholar]
- Bowen, L. Entropy theory for sofic groupoids I: The foundations. Journal d’Analyse Mathématique 2014, 124, 149–233. [Google Scholar] [CrossRef]
- Gromov, M. Endomorphisms of symbolic algebraic varieties. J. Eur. Math. Soc. 1999, 1, 109–197. [Google Scholar] [CrossRef]
- Weiss, B. Sofic groups and dynamical systems. Sankhyā Indian J. Stat. Ser. A 2000, 62, 350–359. [Google Scholar]
- Pestov, V.G. Hyperlinear and sofic groups: A brief guide. Bull. Symb. Log. 2008, 14, 449–480. [Google Scholar] [CrossRef]
- Austin, T. Additivity Properties of Sofic Entropy and Measures on Model Spaces. 2015; arXiv:1510.02392. [Google Scholar]
© 2016 by the author; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC-BY) license (http://creativecommons.org/licenses/by/4.0/).