
TL;DR
This paper extends local stable group theory from topological dynamics to model-theoretic stability, analyzing subsets of groups that avoid infinite half-graphs using advanced stability characterizations.
Contribution
It introduces a new framework connecting topological dynamics and model-theoretic stability for groups, generalizing existing results to the setting of stability in models.
Findings
Characterization of stable sets via Grothendieck's double-limit theorem
Extension of stable group theory to model-theoretic context
Analysis of subsets avoiding infinite half-graphs in groups
Abstract
We develop local stable group theory directly from topological dynamics, and extend the main results in this subject to the setting of stability "in a model". Specifically, given a group , we analyze the structure of sets such that the bipartite relation omits infinite half-graphs. Our proofs rely on the characterization of stability via Grothendieck's "double-limit" theorem (as shown by Ben Yaacov), and the work of Ellis and Nerurkar on weakly almost periodic -flows.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Stability in a group
Gabriel Conant
DPMMS
University of Cambridge
Cambridge, CB3 0WB, UK
(Date: January 22, 2021)
Abstract.
We develop local stable group theory directly from topological dynamics, and extend the main tools in this subject to the setting of stability “in a model”. Specifically, given a group , we analyze the structure of sets such that the bipartite relation omits infinite half-graphs. Our proofs rely on the characterization of model-theoretic stability via Grothendieck’s “double-limit” theorem (as shown by Ben Yaacov), and the work of Ellis and Nerurkar on weakly almost periodic -flows.
Partially supported by NSF grant DMS-1855503
1. Introduction
One of the most well established and fruitful areas of model theory is the study of groups definable in stable first-order theories, which connects mathematical logic to algebraic geometry, topological dynamics, and combinatorial number theory. At the heart of this connection is the notion of a generic subset of a group. Given a group , we say is generic if can be covered by finitely many left translates of . An important fact in stable group theory is that the generic definable subsets of a stable group are partition regular, i.e., the union of two non-generic definable sets is non-generic. Consequently, there exist generic types (i.e., ultrafilters of generic definable sets), which provide a model theoretic analogue of generic points in the sense of algebraic groups and of group actions on compact Hausdorff spaces.
Let us recall the basic definitions of stability theory (although we note that no model theory will be required for our main results). Given a complete first-order theory in a language , we say that an -formula is stable in if for some , there is no model containing tuples such that if and only if (in this case, we also say is -stable in ). A theory is stable if every formula is stable in . A stable group is a group whose underlying set and group operation are definable in a stable theory.
A canonical example of a stable theory is the complete theory of an algebraically closed field. So algebraic groups provide natural examples of stable groups. The model-theoretic study of algebraic groups motivated much of the early work in stable group theory, and has now developed into an entire industry focusing on groups of “finite Morley rank”. Another important example of a stable group is any abelian group (in the pure group language). These are special cases of “-based” groups, whose theory was developed by Hrushovski and Pillay [21]. This notion is related to the Mordell-Lang Conjecture which, in model-theoretic language, says that if is a finite rank subgroup of a semiabelian complex variety, then the first-order structure on induced from the complex field is stable and -based. In [18], Hrushovski combined the study of -based groups and groups of finite Morley rank to prove the Mordell-Lang Conjecture for function fields in all characteristics.
A great deal of stability theory can also be developed “locally”, i.e., for a single stable formula (see, e.g., Shelah’s “Unstable Formula Theorem” [37, Theorem 2.2]). In [22], Hrushovski and Pillay use stable formulas to prove that any group definable in a pseudofinite field (whose complete theory is necessarily unstable) is virtually isogenous with , where is an algebraic group defined over . An especially spectacular display of the effectiveness of local stability is Hrushovski’s work from [19] on the structure of approximate groups, which uses a very general “Stabilizer Theorem” modeled after early work of Zilber on groups of finite Morley rank.
More recently, interactions with functional analysis have motivated the study of stability “in a model”. Given a first-order structure , we say that a formula is stable in if there do not exist sequences and from , indexed by an infinite linear order , such that if and only if . This is weaker than stability of in a theory (which is equivalent to stability in an -saturated model of ). In [3], Ben Yaacov established a direct connection between stability in a model and Grothendieck’s characterization in [14] of relatively weakly compact sets in certain Banach spaces. A natural question, which we address here, is how this connection applies to stable group theory.
Topological dynamics has played a major role in the model theory of groups since the work of Newelski [27], which provided a model-theoretic interpretation of the “Ellis semigroup” of a -flow (i.e., a compact space with an action of by homeomorphisms). Moreover, certain parts of a recent preprint of Hrushovski, Krupiński, and Pillay [20] indicate a close connection between stable group theory and results of Ellis and Nerurkar [9] on weakly almost periodic -flows. In this paper, we will develop stable group theory entirely from [9] and in the more general setting of local stability “in a model”. It is interesting to note that the original development of (global) stable group theory was roughly contemporaneous with [9] and related work on almost periodic minimal flows (e.g., [2], [11]).
Given a group , we call a set stable in if there do not exist sequences and from , indexed by an infinite linear order , such that if and only if (i.e., the “formula” is stable in the structure obtained by expanding with a predicate naming ). One of our main results is the following structure theorem for stable subsets of groups.
Theorem 1.1**.**
Let be a group, and suppose that is a left-invariant Boolean algebra such that every set in is stable in .
There is a unique left-invariant probability measure on . 2.
If , then if and only if is generic. 3.
Suppose . Then there is a finite-index subgroup , which is in , and a set , which is a union of left cosets of , such that \mu(A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0. So if is the set of left cosets of contained in , then .
Moreover, if is bi-invariant then is bi-invariant and is also the unique right-invariant probability measure on ; and in part one may choose to be a normal subgroup of .
Although we have focused on left-invariant Boolean algebras in previous theorem, note that if is a right-invariant Boolean algebra of stable sets in then, by applying Theorem 1.1 to the left-invariant Boolean algebra , one can obtain analogous results for . Theorem 1.1 is modeled after [8, Theorem 2.3], which focuses on the case of a single -stable invariant formula. The motivation in [8] was to prove a “stable arithmetic regularity lemma” for finite groups, which qualitatively generalized a combinatorial result of Terry and Wolf [39] on .
To prove Theorem 1.1, we apply various results from [9] (see Theorem 2.5) to the action of on the Stone space of “types” (or ultrafilters) over the Boolean algebra . We will use a combinatorial formulation of the “fundamental theorem of local stability theory” (Theorem 2.18) to show that every function in the Ellis semigroup of is continuous, and so is weakly almost periodic by a result of Ellis and Nerurkar [9]. Moreover, has a unique minimal closed -invariant subset, which is precisely the space of generic types in (i.e., types containing only generic sets in ). These results form the foundation for the proof of Theorem 1.1.
Note that Theorem 1.1 includes the “global” setting where is a group definable in a stable theory and is the Boolean algebra of definable subsets of . It also includes the case where is the Boolean algebra of sets that are -stable for some (i.e., is -stable with respect to the theory of ). The “-stable case” generalizes the local setting of Hrushovski and Pillay [22], which applies to the Boolean algebra generated by the instances of a single left-invariant stable formula in an ambient theory . This is also the setting for the weaker version of Theorem 1.1 from [8] mentioned above. Thus our results extend (and in some sense complete) the work in [8] on -stable subsets of groups. In addition to Theorem 1.1, we also analyze local connected components, stabilizers of generic types, and measure-stabilizers of sets, along the lines of the results obtained in [7] for “-NIP” sets in pseudofinite groups. Among other things, we prove:
Theorem 1.2**.**
Let be a group, and suppose is a left-invariant Boolean algebra. Suppose that every set in is stable in , and contains a smallest finite-index subgroup of , denoted . Given , set .
There is an action-preserving bijection between and the set of left cosets of , which sends to the unique left coset of in . 2.
If , and then .
Moreover, if is bi-invariant then is normal, the map in part is a group isomorphism, and for any .
We also show that the previous theorem applies when is defined from a single left-invariant stable relation or “formula” (see Definitions 2.15 and 5.6).
Theorem 1.3**.**
Let be a group, and suppose is a left-invariant stable relation on for some set . Let be the Boolean algebra generated by all sets of the form for all . Then every set in is stable in , and contains a smallest finite-index subgroup of .
The paper is organized as follows. In Section 2, we recall preliminaries from topological dynamics, as well as the combinatorial formulation of definability of types and symmetry of forking for stable formulas in terms of bipartite graphs. In Section 3, we establish some initial results on the Ellis semigroup of a Stone space.
Theorems 1.1, 1.2, and 1.3 are proved in Sections 4 and 5. For Theorem 1.1, part is Theorem 4.4, part follows from Theorem 4.7, part is Corollary 4.15, and the final statement follows from Lemma 4.6. Theorem 1.2 is an abridged version of Theorem 5.4, and Theorem 1.3 appears again as Theorem 5.8.
Finally, in Section 6, we make some remarks on additive combinatorics of stable subsets of groups.
2. Preliminaries
2.1. Topological dynamics
Let be a (discrete) group. In this subsection, we briefly recall the material from topological dynamics necessary for our main results.
Definition 2.1**.**
- (1)
A -flow is a nonempty compact Hausdorff space together with a (left) action of on by homeomorphisms. 2. (2)
Given a -flow , a subflow is a nonempty closed -invariant subset of . 3. (3)
A -flow is minimal if it has no proper subflows. 4. (4)
Let be a -flow, and consider with the product topology.
Given , define such that . 2.
Define to be the closure of in .
Proposition 2.2** (Ellis).**
Let be a -flow. Then is a semigroup under composition of functions, and a -flow under the action .
Proof.
This is an exercise (or see, e.g., [11, Proposition 3.2], [16, Theorem 2.29]). ∎
Definition 2.3**.**
The Ellis semigroup of a -flow is .
Definition 2.4**.**
Let be a -flow and let be the space of continuous complex-valued functions on . A function is weakly almost periodic if the set is relatively compact in the weak topology on where, given and , . The flow is weakly almost periodic if every is weakly almost periodic.
Although the previous definition is rooted in functional analysis, we will not need to delve further into these underlying notions, thanks to the following theorem.
Theorem 2.5** (Ellis-Nerurkar [9]).**
Let be a -flow.
* is weakly almost periodic if and only if every is continuous.* 2.
If is weakly almost periodic then:
* has a unique minimal subflow ;* 2.
* contains a unique idempotent , and for any ;* 3.
* is a compact group with identity .* 4.
If has a unique minimal subflow then there is a unique -invariant Borel probability measure on (i.e., is uniquely ergodic).
Proof.
See Propositions II.2, II.5, and II.10 of [9]. ∎
Definition 2.6**.**
Let be a -flow.
- (1)
A set is generic if for some finite . 2. (2)
A point is generic if every open set containing is generic.
Proposition 2.7** (Newelski [27]).**
Let be a -flow. The following are equivalent.
* has a unique minimal subflow.* 2.
There is a generic point in . 3.
The set of generic points in is the unique minimal subflow of . 4.
Every generic open set in contains a generic point.
Proof.
and follow from [27, Lemma 1.7]. is [27, Corollary 1.9]. and are trivial. ∎
2.2. Stone spaces and generic types
Definition 2.8**.**
Let be a set, and let be a Boolean algebra. A subset is a -type if , is closed under finite intersections, and for any either or . The Stone space of , denoted , is the set of all -types. Given , define .
In the setting of the previous definition, if then -type is also called an ultrafilter on . So one can think of -types as ultrafilters relativized to an arbitrary Boolean algebra . A “trivial” example of a -type is , where , which we call the principal -type on .
We now state some basic exercises, which justify our use of the word “space” in Definition 2.8, and connect Stone spaces over groups to topological dynamics.
Exercise 2.9**.**
Let be a set, and let be a Boolean algebra.
* is a totally disconnected compact Hausdorff space under the topology with basic open sets of the form for all .* 2.
A subset of is clopen if and only if it is of the form for some . 3.
The set of principal -types is dense in .
A standard fact is that a topological space is profinite (i.e., a projective limit of finite discrete spaces) if and only if it is compact, Hausdorff, and totally disconnected [34, Theorem 2.1.3]. Thus the Stone space of a Boolean algebra is profinite.
Exercise 2.10**.**
Let be a group, and suppose is a left-invariant Boolean algebra. If and , then is in . Moreover, is a -flow under the action .
Note that in the previous exercise, if is instead right-invariant, then we have a corresponding right action . Although our focus is on left-invariance, we will also use this right action on a few occasions.
Recall that in Definition 2.6, we defined generic subsets and points in -flows. The next definition defines genericity for subsets of groups, and the subsequent exercise explains the connection to flows arising from Stone spaces.
Definition 2.11**.**
A subset of a group is generic if can be covered by finitely many left translates of , i.e., for some finite .
Exercise 2.12**.**
Let be a group, and let be a left-invariant Boolean algebra. Then a set is generic if and only if is a generic subset of . Moreover, a type is generic if and only if every is generic.
Definition 2.13**.**
Let be a group, and suppose is a left-invariant Boolean algebra. Define to be the set of generic -types. Given , define .
Let be a group, and let be a left-invariant Boolean algebra. Then is a closed subset of since, if is not generic then, by choosing some non-generic , we obtain an open neighborhood of disjoint from . In the subsequent work, we will focus on as a topological space in its own right. So we point out that is a profinite space with a basis consisting of the clopen sets for all (note that ).
It will be helpful for later results to have the following restatement of Proposition 2.7 in the setting of Stone spaces.
Corollary 2.14**.**
Let be a group and suppose is a left-invariant Boolean algebra of subsets of . The following are equivalent.
* has a unique minimal subflow.* 2.
* is nonempty.* 3.
* is the unique minimal subflow of .* 4.
If is generic then is nonempty. 5.
If is closed under finite intersections and contains only generic sets, then there is some such that .
Proof.
By Exercise 2.12, properties through are translations of the corresponding properties in Proposition 2.7. Clearly . For note that is a collection of nonempty closed subsets of with the finite intersection property. So the result follows from compactness of . ∎
2.3. Stable relations
Let and be fixed sets, and fix a binary relation on . Given , we write to denote that the relation holds on . If then denotes the fiber . Dually, if then . Combinatorially, one can view as a bipartite graph on , and the fibers of as edge neighborhoods.
Definition 2.15**.**
- (1)
Let be a linearly ordered set. Then codes if there are sequences in and in , such that if and only if . 2. (2)
is stable if it does not code an infinite linear order. 3. (3)
Given , is -stable if it does not code a linear order of size .
Remark 2.16**.**
In the model-theoretic setting, and would typically be sorts in some first-order structure (e.g., ), and would be a first-order formula. In this case, our definition of stability for is referred to as stability “in a model”. If is -saturated, then is stable (as defined above) if and only if it is -stable for some , and this can be expressed as a first-order property of the theory of . On the other hand, if is not -saturated, then there may be formulas that are stable but not -stable for any . Thus stability in a model is more general than what is usually considered in model-theoretic literature. So we caution the reader that when we use the word “stable” in this paper, we will mean the weaker notion of stability in a model.
Next we use the fibers of to define Boolean algebras on and .
Definition 2.17**.**
- (1)
Define to be the Boolean algebra generated by . 2. (2)
Define to be the Boolean algebra generated by . 3. (3)
Given a type , set . 4. (4)
Given a type , set .
Note that if , then the set uniquely determines by definition of . This notation draws from the model-theoretic notion of type definitions. One of the fundamental results of model-theoretic stability theory is that, when is stable, the sets are themselves “definable” using . We now state this result precisely, along with a second important fact related to the model-theoretic notion of “forking” (which we will not need to discuss here).
Theorem 2.18**.**
Suppose is stable, and fix and .
(definability of types)* and .* 2.
(symmetry of forking)* if and only if .*
In the model-theoretic context, part of Theorem 2.18 is evident from work of Pillay [29]. However, in [3], Ben Yaacov proves Theorem 2.18 as a corollary of Grothendieck’s characterization in [14] of relatively weakly compact sets in the Banach space of bounded continuous functions on some fixed topological space. See also [30] and [38] for expositions of this result. Part of Theorem 2.18 follows easily from the Grothendieck approach to part (see [38]). It is also worth noting that Grothendieck’s work is a key ingredient in the proof of Theorem 2.5.
When is -stable for some , part of Theorem 2.18 was proved by Shelah (see [37, Theorem II.2.2]) and, given part , part is not hard to prove directly (see, e.g., [22, Lemma 5.7]).
We have now reviewed all of the preliminaries needed to prove Theorems 1.1 and 1.2. For Theorem 1.3, we will also need a result on measures. Given a Boolean algebra (on some set ), let denote the compact Hausdorff space of probability measures on (i.e., finitely additive functions with ), with the subspace topology from . We may view as a closed set in by identifying with a -valued measure. A well-known result of Keisler [23] is that if is -stable, then any is a weighted sum of countably many -types (see also [31, Fact 1.1]). In [13], Gannon uses Theorem 2.18, together with the Sobczyk-Hammer Decomposition Theorem from measure theory, to generalize this to the case that is stable.
Theorem 2.19**.**
Suppose is stable and . Then there are and , for , such that .
3. Semigroups on Stone spaces
Throughout this section, we let be a fixed group. The goal of this section is to formulate assumptions on a left-invariant Boolean algebra under which is isomorphic to a more natural semigroup. So let us first precisely define the kind of semigroup we are interested in.
Definition 3.1**.**
A -semigroup is a -flow equipped with a semigroup operation , so that if and then .
Example 3.2**.**
If is a -flow then is a -semigroup by Proposition 2.2.
Our aim is to give a more natural description of as a -semigroup, under certain assumptions on . To motivate these assumptions, we first recall a well-known example of a Stone space with a canonical -semigroup structure.
Example 3.3**.**
The Stone space is denoted and is called the Stone-Čech compactification of . Given , set
[TABLE]
Then is a well-defined semigroup operation on and, moreover, is a -semigroup under the usual action of . We will prove a generalization of this fact in Proposition 3.6 below. See also [16, Section 4.1] for further details.
Toward adapting the previous example to more general situations, let us first redefine for an arbitrary left-invariant Boolean algebra.
Definition 3.4**.**
Let be a left-invariant Boolean algebra.
- (1)
Given and , define . 2. (2)
Given , define .
The set above can be connected to the “type definitions” discussed in Section 2.3. In particular, let be the Boolean algebra generated by the left translates of a fixed set , and let be the relation on . Then and, given , we have .
Remark 3.5**.**
In the context of Definition 3.4, we view as a map . As a good warm-up exercise, the reader should verify that is a left-invariant homomorphism of Boolean algebras.
Note that if is a left-invariant Boolean algebra, and , then is only defined to be a subset of . There is no reason to expect that is a -type, let alone that determines a semigroup operation on . Indeed, given , the set may not even be in . However, if we impose this assumption, then we can recover a semigroup structure on as in the case of .
Proposition 3.6**.**
Let be a left-invariant Boolean algebra such that for all and . Then is a -semigroup.
Proof.
Given our assumptions on , it follows easily from Remark 3.5 that is closed under . To prove associativity, fix and . Then
[TABLE]
Therefore
[TABLE]
Finally, given and , we have by similar calculations (in particular, the fact that for any ). ∎
We will soon see that in the setting of the previous proposition, and are isomorphic as -semigroups. So a natural question is how easily one can find Boolean algebras satisfying the hypotheses of this result. In light of the discussion after Definition 3.4, Theorem 2.18 looks promising for the case of Boolean algebras of stable sets (see Definition 4.1), which will be our main focus. However, there is one concrete obstacle. In particular, suppose is a left-invariant Boolean algebra. Given and , if is the principal -type on , then . Therefore, any left-invariant Boolean algebra satisfying the hypotheses of Proposition 3.6 is automatically bi-invariant. Let us record this conclusion, along with some other basic observations (left to the reader).
Proposition 3.7**.**
Let be a group, and suppose is a left-invariant Boolean algebra such that for all and . Then is bi-invariant. Moreover, if and , then and .
Our task now is to find a weaker version of the assumption in Proposition 3.6, which does not force to be bi-invariant, but still leads to control of . To motivate this investigation, we first consider an example.
Example 3.8**.**
Fix a finite-index subgroup , and let be the Boolean algebra generated by all left cosets of . Then a subset of is in if and only if it is a union of such cosets. Also, is bi-invariant if and only if is normal. Indeed, if is not normal then some conjugate does not contain . So is not in since any set in containing the identity must contain .
Now consider the Stone space . From basic properties of types, one can see that any contains a unique left coset of , which completely determines . So is in bijection with the set of left cosets of . Since is finite, where . Altogether, isomorphic to the image of under the left regular representation in , and so is the group , where is kernel of this representation. The appearance of can also be predicted by analyzing the maps for . In particular, given , if is the unique type containing , then . So is contained in the Boolean algebra generated by the cosets of , which is also the smallest bi-invariant Boolean algebra containing .
Definition 3.9**.**
Given a left-invariant Boolean algebra , define to be the smallest bi-invariant Boolean algebra containing .
Motivated by Example 3.8, we now study left-invariant Boolean algebras such that for all . This will be a natural weakening of the assumption in Proposition 3.6 suitable for left-invariant Boolean algebras that are not necessarily bi-invariant.
Lemma 3.10**.**
Suppose is a left-invariant Boolean algebra such that for all and .
If and then , and so is a -semigroup. 2.
Given and , define . Then for all .
Proof.
Part . Note that the second claim follows from the first and Proposition 3.6. So fix and . We want to show . By Remark 3.5, we may assume is of the form for some and . Let . Then , and by assumption on .
Part . Note the similarity between , as defined here for and , and for as in Definition 3.4. With this in mind, the verification that for any is essentially the same as the first part of the proof of Proposition 3.6. ∎
We can now prove the main result of this section.
Theorem 3.11**.**
Suppose is a left-invariant Boolean algebra such that for all and . Then the map , where is as in Lemma 3.10, is a -semigroup isomorphism between and
Proof.
By Lemma 3.10, is a map from to . We first show is continuous. Fix and , and let be the corresponding sub-basic open set in . Then if and only if , and so , which is open in .
Recall that is the closure in of where . One easily checks that for any . Since is dense in and is continuous, it follows that is a dense subset of . Therefore . Since is continuous, and is compact, it follows that is compact, and hence closed in . Altogether, .
From now on, we view as a surjective function from to . To show is injective, fix such that . To show that , it suffices to fix and , and show if and only if . To see this, let , and note that . Therefore
[TABLE]
Since is a continuous bijection between compact Hausdorff spaces, it is a homeomorphism. So to show that is an isomorphism of -flows, we just need to check that it preserves the actions of on and , i.e., for any and . So fix and . Then, given , we have that for any ,
[TABLE]
and so . This shows .
Finally, we show that preserves the semigroup operations on and . Fix . For any and , we have (similar to the proof of Proposition 3.6) and so
[TABLE]
Therefore for any . ∎
4. Stable subsets of groups
Throughout this section, we work with a fixed group .
4.1. Boolean algebras of stable sets
Definition 4.1**.**
A set is stable (in ) if the relation on is stable (see Definition 2.15). Define to be the collection of stable subsets of .
The following fact is well-known and left as an exercise.
Fact 4.2**.**
* is a bi-invariant Boolean algebra, which contains all subgroups of and is closed under .*
The primary goal of this paper is Theorem 1.1, which gives a structure theorem for arbitrary left-invariant sub-algebras of . The main reason we consider sub-algebras of , rather than just working with itself, is due to issues with “definability”. In particular, Theorem 1.1 shows that if is a left-invariant sub-algebra of , then any set in can be approximated by cosets of a finite-index subgroup of , which is also in . So a stable subset of can be approximated by a subgroup that has some connection to original set. This kind of control is important in applications. For example, [8] uses stable subsets of pseudofinite groups to prove results about stable subsets of finite groups. In order for this to work, one needs restrict to the Boolean algebra of internal stable subsets of a pseudofinite group (e.g., so that an internal stable set is approximated by an internal subgroup).
We will also focus on the general setting of left-invariant sub-algebras of , despite the fact that bi-invariant Boolean algebras are easier to work with. In addition to an overall motivation for more general results, the main reason for this focus is to capture the right notion of “local stability theory” as formulated in the model-theoretic literature and, in particular, the work of Hrushovski and Pillay [22, Section 5]. For example, unlike the “global” setting groups definable in stable theories, the “bi-stratification” of a left-invariant stable formula need not be stable (see Example 5.11). A full analysis of this setting will be done in Section 5.
Let us now start the journey toward our main results. We first establish some properties of left-invariant sub-algebras of . For instance, we show that they satisfy the assumptions of Theorem 3.11, and they also behave nicely with respect to a dual version of the map.
Lemma 4.3**.**
Suppose is a left-invariant sub-algebra of . Fix and, given , set .
If then . 2.
If then . 3.
If and , then if and only if .
Proof.
Let be the relation on . Then is stable, is the Boolean algebra generated by , and is the Boolean algebra generated by . In particular, and .
Part . Fix and set . Then , and so by Theorem 2.18.
Part . Fix and set . Then , and so by Theorem 2.18.
Part . Fix and , and set and . Then and . By Theorem 2.18, if and only if . It follows that if and only if , i.e., if and only if . ∎
We can now prove our first main result on stable subsets of groups.
Theorem 4.4**.**
Let be a left-invariant Boolean algebra.
* is a -semigroup, and is isomorphic to the Ellis semigroup of .* 2.
* is a weakly almost periodic -flow.* 3.
* is the unique minimal subflow of .* 4.
* is a profinite group.* 5.
There is a unique left-invariant probability measure on .
Proof.
Part follows from Theorem 3.11 and Lemma 4.3.
Part . Given and , let . By Theorem 3.11 and Lemma 4.3, every element of is of the form for some . Therefore, to show that is weakly almost periodic, it suffices by Theorem 2.5 to show that is continuous for all . So fix . We use the dual notation from Lemma 4.3. Given , it follows from Lemma 4.3 that (recall also that for any by Lemma 4.3). So for any , we have , which implies that is continuous.
Part . By parts and applied to , is weakly almost periodic and . So by Theorem 2.5 and Corollary 2.14, is the unique minimal subflow of . Now, if then . So is the unique minimal subflow of by Corollary 2.14.
Part follows from Theorem 2.5 since is weakly almost periodic, with unique minimal subflow .
Part . By Theorem 2.5, and parts and , there is a unique -invariant Borel probability measure on . So the claim follows from the usual correspondence between regular Borel (-additive) probability measures on and (finitely additive) probability measures on (see, e.g., [12, Proposition 416Q]). One only needs to check that this correspondence preserves -invariance. ∎
For later reference, we note the following consequence of Theorem 4.4 and Corollary 2.14.
Corollary 4.5**.**
Suppose is a left-invariant Boolean algebra, and is closed under finite intersections and contains only generic sets. Then there is some such that .
4.2. Measures and generic stable sets
Note that if is a bi-invariant sub-algebra of , then and so Theorem 4.4 provides a full picture of the topological and algebraic behavior of the -flow . In particular, is a well-defined semigroup and is a profinite group. In this subsection, we will use these results in the bi-invariant case to obtain some initial conclusions about the behavior of stable subsets of .
We start by noting that if is a bi-invariant sub-algebra of then, since is a profinite group, it admits a unique bi-invariant Borel probability measure (i.e., the normalized Haar measure). The next lemma makes an explicit connection between this measure and the measure given by Theorem 4.4.
Lemma 4.6**.**
Let be a bi-invariant sub-algebra of , and let be the unique left-invariant probability measure on (which exists by Theorem 4.4(e)). Then is bi-invariant and, for any , is the normalized Haar measure of .
Proof.
Let denote the normalized Haar measure on , and define such that . Then is a probability measure on (this uses the fact that if then and ). We will show that is bi-invariant. Given this, it will follow from Theorem 4.4 that , which gives us the desired results.
Toward proving that is bi-invariant, fix and . We want to show . Let be the identity in . Given , we have
[TABLE]
Since , it follows that , where is the inverse of in . Similarly, , where is the inverse of . So we have the desired result by bi-invariance of . ∎
Note that if is the unique bi-invariant probability measure on , and is a left-invariant sub-algebra of , then must be the unique left-invariant probability measure on . So we can think of a stable set as having a uniquely defined measure ), which is independent of then ambient sub-algebra of .
Theorem 4.7**.**
Let be the unique bi-invariant probability measure on .
If and is generic, then is generic or is generic. 2.
If then is generic or is generic. 3.
If then . 4.
Given , the following are equivalent:
* is generic (i.e, for some finite );* 2.
* for some finite ;* 3.
* for some finite ;* 4.
.
Proof.
Part . If is generic then, by Corollary 4.5 there is some generic type such that . Now or since is a type.
Part is immediate from part .
Part . By Lemma 4.6, is a left-invariant probability measure on . So the claim follows from Theorem 4.4.
Part . follows from left invariance and finite additivity of .
. By Lemma 4.6, is the normalized Haar measure of . So if then is nonempty, and thus is generic.
. Suppose is generic. Then is generic by and part . Thus for some finite , and so .
is trivial.
. If for some finite then, by finite additivity, there are such that . So by Lemma 4.6. ∎
Remark 4.8**.**
In part of the previous theorem, the equivalence of and is trivial if is abelian. So we note that it is nontrivial in general. For example, let be the free group on two generators and , and let be the set of words in that start with . Then is (left) generic since , but not right generic (i.e., fails condition ).
4.3. Algebraic structure of
Let be a left-invariant sub-algebra of . We have seen that if is bi-invariant then is a profinite group. The goal of this subsection is to show that even without bi-invariance, still exhibits algebraic structure compatible with the topology. We first set some terminology.
Definition 4.9**.**
Let be compact Hausdorff group. A homogeneous -space is a Hausdorff space together with a transitive continuous group action .
Given an arbitrary group and an arbitrary subgroup , we let denote the set of left cosets of in . By the general theory, any homogeneous -space can be identified with for some closed subgroup (see, e.g., [17, Proposition 1.10]). We will show that if is as above, then is a profinite homogeneous -space. This will be a specific instance of the following general fact, which is largely due to Auslander [2].
Lemma 4.10**.**
Let be a weakly almost periodic -flow, and a minimal subflow. Let be the unique minimal subflow of , and recall that is a compact Hausdorff group (see Theorem 2.5). Then is a homogeneous -space, witnessed by the action . Therefore, if is a fixed point and is the stabilizer of , then is closed subgroup of , and and are isomorphic as homogeneous -spaces via .
Proof.
The -flow is “almost periodic”, and so this statement elaborates slightly on [2, Theorem 3.6]. We include details for the sake of clarity. First, note that since is closed and -invariant, it is closed under any by definition of . For the rest of the proof, we restrict to and .
To verify that is a group action, we just need to check that the identity is the identity map on . We follow the proof of [9, Proposition II.8(1)]. Recall that for , denotes the map , which is in . Now fix some . Then, for any , we have
[TABLE]
where the second and third equalities use Theorem 2.5. So is the identity on the -orbit of , which is dense in since is minimal. Since is continuous (by Theorem 2.5), it follows that is the identity on .
Next, note that for a fixed , is continuous by Theorem 2.5; and for a fixed , is continuous by definition of the topology on . So the action is separately continuous and thus continuous by a result of Ellis [10]. (However, separated continuity will suffice for the remaining claims here, and thus for all of our main results.)
We now prove transitivity. Fix , and set . We show that . Since is continuous, and is compact, it follows that is closed in . Since is a -flow via , it also follows that is -invariant. So since is minimal.
The rest now follows from basic facts about group actions, and only requires continuity of (see, e.g., [17, Proposition 1.10]). ∎
We now apply Lemma 4.10 to the -flow , where is a left-invariant sub-algebra of . In order to obtain a more explicit statement, we will make a special choice for the fixed point referenced in the previous lemma.
Corollary 4.11**.**
Suppose is a left-invariant sub-algebra of . Then is a profinite homogeneous -space. In particular, let be the identity in , and set . Then is closed subgroup of , and is isomorphic to , as a homogeneous -space, via the map .
Proof.
By Theorem 4.4 and Lemma 4.10, is a profinite homogeneous -space. This goes through the -semigroup isomorphism given by Theorem 3.11 (via Lemma 4.3). In particular, let be the identity in , and set and . Then is a closed subgroup of , and is isomorphic to , as a homogeneous -space, via the map . Therefore, to prove the claim, we only need to verify that if then . So fix and . Then by definition of . By definition of , we have
[TABLE]
Therefore . ∎
4.4. The structure of stable sets
We are now ready to start discussing subgroups of . Let be a left-invariant Boolean algebra, and suppose is a finite-index subgroup of , which is in . Then is partitioned into finitely many left cosets of , each of which is in . Therefore, any type must contain a unique left coset of . This motivates the following notation.
Definition 4.12**.**
Let be a left-invariant Boolean algebra. We write to denote that is a finite-index subgroup of and . Given and , we let denote the unique left coset of in .
For example, if is the principal -type on , then .
Lemma 4.13**.**
Let be a bi-invariant sub-algebra of . Fix and . Then if and only if . Moreover, if is normal, then (where denotes the group operation in ).
Proof.
Fix such that and . Note that . So if , then , which implies , and thus . Conversely, if then , and so . Finally, if is normal then , and so . ∎
We now state and prove the main technical result that will allow us to approximate stable sets using finite-index subgroups of .
Proposition 4.14**.**
Let be a left-invariant sub-algebra of . Then
[TABLE]
is a basis for the topology on .
Proof.
It suffices to show that for any nonempty open set and , there is a subgroup such that . To do this, we will exploit the description of as a profinite homogeneous -space. So let be the identity in and let . Then is a closed subgroup of , and is isomorphic to , as a homogeneous space, via the map (see Corollary 4.11). Now, if then is -invariant and, moreover, . So this allows us to translate the main goal to . In particular, we want to show that for any nonempty open set , and with , there is some such that . So fix such and .
Let be the pullback of to . Then is open in , and , i.e., . Since is a profinite group and is a closed subgroup, it follows that is the intersection of all open subgroups containing (see [34, Proposition 2.1.4]). Since is open, and any open subgroup is also closed, it follows that there is an open subgroup of such that . Note that has finite index in since is compact. Altogether, is a finite-index clopen subgroup of .
We will use to obtain our desired subgroup . To do this, we need to represent as a compactification of . In particular, define such that . Then is dense in since is a minimal flow. Given , if we let be the principal -type on , then
[TABLE]
So is a homomorphism.
Since is clopen in , it follows that for some . Let . Then is a finite-index subgroup of . We show that . First, if , then for some , and so since . Conversely, suppose . Then , and so . Therefore for some , and thus . So , i.e., .
By Theorem 2.5, for any . Using the notation of Lemma 4.3, we now have . So by Lemma 4.3.
Next, we show that . Suppose is nonempty. Since is open, and is dense in , there is some such that . Since , we have , and so by Lemma 4.13. Since , we have , which is a contradiction.
We now have . By Lemma 4.13, we also have and . So , and thus . ∎
We again let denote the unique bi-invariant probability measure on . The following is our main result on the approximate structure of stable subsets of .
Corollary 4.15**.**
Let be a left-invariant sub-algebra of , and fix . Then there is a finite-index subgroup , which is in , and a set , which is a union of left cosets of , such that \mu(A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0. Consequently, if is the set of left cosets of contained in , then .
Proof.
By Proposition 4.14, there are and such that
[TABLE]
Let and let . Then , is a union of left cosets of , and . If A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y is generic then, by Corollary 4.5, there is some such that A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y\in p, which contradicts . So A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y is not generic, and thus \mu(A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0 by Theorem 4.7. The remaining claims follow from invariance and finite additivity of . ∎
4.5. A note on -stable sets
We say that is -stable if the relation on is -stable (see Definition 2.15). Using similar methods as in Fact 4.2, one can show that the collection of subsets of that are -stable for some forms a bi-invariant sub-algebra of , which includes all subgroups of . (In fact, a nonempty subset of a group is -stable if and only if it is a coset of a subgroup.) The next example demonstrates that the -stable sets may form a proper sub-algebra.
Example 4.16**.**
Let be the group of integers . For each , choose an -term arithmetic progression , with common difference , so that . Let . Then is stable but not -stable for any . (We leave this as an exercise for the reader.)
On the other hand, stable sets are “close” to -stable sets.
Corollary 4.17**.**
For any stable there is such that \mu(A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0 and is -stable for some .
Proof.
By Corollary 4.15, we have , which is a union of cosets of a fixed finite-index subgroup , such that \mu(A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0. It is easy to show that is -stable for some (see, e.g., [36, Lemma 1.5]). ∎
4.6. Profinite completions
In this subsection, we explicitly describe as a projective limit of finite coset spaces, where is a left-invariant sub-algebra.
Definition 4.18**.**
Given a Boolean algebra , define .
We first make some observations on the bi-invariant case. Suppose is a bi-invariant Boolean algebra, and let be the collection of all finite-index normal subgroups of in . Then is co-initial in the the collection of all , and so is a profinite group isomorphic to (see, e.g., [34, Lemma 1.19]). For example, note that if contains all finite-index normal subgroups of , then is the classical profinite completion of . See [34, Section 3.2] for details.
Corollary 4.19**.**
Let be a left-invariant sub-algebra of .
If is bi-invariant then and are isomorphic profinite groups. 2.
* and are isomorphic homogeneous -spaces.*
Proof.
We first show that and are homeomorphic. Let denote the collection of all . Define such that . It is straightforward to check that is continuous. Moreover, is injective by Proposition 4.14 and surjective by Corollary 4.5.
Now suppose for a moment that is bi-invariant, and let be the collection of all normal . As indicated above, any element of is completely determined by its restriction to , and so we can identify with the profinite group . In this case, is a group isomorphism by Lemma 4.13.
Finally, we return to the case that is only left-invariant. By the previous arguments and Corollary 4.11, is a homogeneous -space. Now redefine to be the collection of all finite-index normal subgroups of in . Given , let , and note that . For any , if , then and . So any element of is completely determined by its restriction to . Altogether, can be identified with , which is a homogeneous -space isomorphic to , where . Finally, one checks that the homeomorphism is an isomorphism of homogeneous -spaces. ∎
Next we make some remarks motivated by certain notions from the model theory of groups. This will also be in preparation for the results in Section 5.
Definition 4.20**.**
Given a Boolean algebra , define to be the intersection of all finite-index subgroups of that are in .
Note that if is a bi-invariant Boolean algebra, then coincides with the intersection of all finite-index normal subgroups of that are in (in particular, is a normal subgroup of ).
Remark 4.21**.**
Suppose is a bi-invariant sub-algebra of , and let denote the collection of all finite-index normal subgroups of in . Then we have a canonical homomorphism such that . Note that , and so embeds as a dense subgroup of via the induced quotient map . The coarsest topology on that makes continuous is the -profinite topology, whose basic open sets are cosets of . Note that is closed in this topology and, moreover, the topology on induced from by coincides with the quotient of the -profinite topology. In fact, is a homeomorphism if and only if the -profinite topology on is compact. Now suppose . Then , where is as in the proof of Proposition 4.14 and is as in the proof of Corollary 4.19. So embeds as a dense subgroup of via . Once again, is a homeomorphism if and only if the -profinite topology on is compact.
An example from model theory is when is definable (say, over ) in some model of a stable theory , and is the Boolean algebra of definable subsets of . Then is an intersection of at most groups in (see [32, Chapter 5]; this also follows from Theorem 5.8 below). Now suppose is -saturated. Then the -profinite topology on has a basis of cardinality at most , and hence is compact. So is homeomorphic to and .
Definition 4.22**.**
Let be a left-invariant Boolean algebra. Given , define .
Corollary 4.23**.**
Suppose is a left-invariant sub-algebra of , and . Given , let , where . Then . Moreover, if is bi-invariant then .
Proof.
Note that the second claim follows from the first by the observation made after Definition 4.20. For the first claim, fix and . By Proposition 4.14, if and only if for all . Also, if then if and only if . ∎
5. Connected components
Let be a group. As usual, we let denote the unique bi-invariant probability measure on . In this section, we analyze left-invariant sub-algebras of that contain a smallest finite-index subgroup of . Recall that for a Boolean algebra , denotes intersection of all finite-index subgroups of in .
Lemma 5.1**.**
Let be a Boolean algebra. The following are equivalent.
* contains only finitely many finite-index subgroups of .* 2.
* contains a smallest finite-index subgroup of .* 3.
* is the smallest finite-index subgroup of in .* 4.
* has finite index in .*
Proof.
The following implications are trivial: . For , note that any subgroup is a union of cosets of . ∎
As previously stated, the focus of this section will be on Boolean algebras satisfying the equivalent conditions of the previous lemma. So, for the sake of brevity, we will usually invoke these conditions using the formulation in .
Definition 5.2**.**
Let be a left-invariant sub-algebra of . Given , define \operatorname{Stab}_{\mu}(X)=\{g\in G:\mu(gX\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}X)=0\}.
Remark 5.3**.**
Note that in the context of the previous definition, is a subgroup of . Moreover, by Theorem 4.7 and Corollary 4.5, we have
[TABLE]
The following is the main result of this section.
Theorem 5.4**.**
Let be a left-invariant sub-algebra of , and suppose has finite index in .
(Generic -types and their stabilizers)**
The map is an action-preserving bijection from to . 2.
If then for some/any . 2.
(Structure for sets in )* If then, for any left coset of , either or . Moreover, if is the set of cosets of such that , and , then .* 3.
(Stabilizers of sets in )* If then is a finite-index subgroup of in . Moreover,*
[TABLE]
and so is a finite-index normal subgroup of in . 4.
(The bi-invariant case)* Assume is bi-invariant. Then is normal and the map in is a group isomorphism. Moreover, if then ; and if then is a finite-index subgroup of in .*
Proof.
Part . Claims and follow from Corollaries 4.19 and 4.23.
Part . For the first statement, it suffices to show that for any and any left coset of , exactly one of or is generic. For this, let be the unique type in containing (which exists by part ). By uniqueness and Corollary 4.5, if and , then is generic if and only if . Moreover, since , we have that exactly one of or is in , as desired.
For the second statement, it follows from Corollary 4.15, that there is a set , which is a union of cosets of such that \mu(X\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0. So by finite additivity, a coset of is contained in if and only if .
Part . We first prove the chain of equalities for . By part (1) and the definition of , we have . So it suffices to show
[TABLE]
For the first containment, fix , and suppose for some . Then gX\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}X is generic (recall Remark 5.3), and so there is some containing gX\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}X by Corollary 4.5. It follows that . For the second containment, fix . We claim that for any . To see this, it suffices by definition of to assume for some and . In this case, we have \mu(gX\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}X) by assumption, and so \mu(gY\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0 by right-invariance of . So . Now, notice that , which yields the desired result.
Finally, fix . Then has finite index in since it contains by the above. So it remains to show that is in . Since is finite (by part (1)), it suffices by Remark 5.3 to fix and show that the set A=\{g\in G:g^{\text{-}1}X\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}X\in p\} is in . Let be the relation x\in y^{\text{-}1}X\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}X on . Note that is stable and . Let . Then by Theorem 2.18. So it suffices to show that for any . To see this, note that if then if , and if .
Part follows easily from parts through . ∎
Corollary 5.5**.**
Let be a left-invariant sub-algebra of . The following are equivalent.
* has finite index in .* 2.
* is finite.* 3.
* has finite index in .* 4.
* is finite.*
Proof.
follow from Theorem 5.4 and Corollary 4.19.
. By Corollary 4.5, restriction from to is surjective.
. Suppose is finite and fix . Then is open in and so, by Proposition 4.14, there is some such that is the unique type in containing . Without loss of generality, assume . Toward a contradiction, suppose . Then some is a proper subgroup of . Fix . By Corollary 4.5, there are such that and . So , , and , which contradicts the uniqueness of . ∎
We now focus on finding concrete examples of left-invariant Boolean algebras such that has finite index in . The following is a combinatorial version of [22, Definition 5.13].
Definition 5.6**.**
Let be a set. A relation on is left-invariant if, for any and , there is some such that .
Remark 5.7**.**
The canonical example of a left-invariant relation is where and is defined by for some fixed . More generally, this a natural setting for the study of a group definable in some first-order structure . In this case, one often considers invariant formulas where the variable concentrates on and the variable is from an arbitrary sort in (e.g., ).
Theorem 5.8**.**
Suppose is a left-invariant stable relation on . Then is a left-invariant sub-algebra of , and has finite index in .
Proof.
Let be the Boolean algebra generated by . It is straightforward to show that is left-invariant and contained in . By Theorem 2.19, there are and , for , such that . Fix such that , and let . For any , we have , which implies that . So we may choose some of maximal index in . It follows that . ∎
Remark 5.9**.**
Gannon’s proof of Theorem 2.19 in [13] uses the Löwenheim-Skolem Theorem to reduce to the case of countable structures. We can do the same and give another proof of Theorem 5.8. In particular, suppose is a left-invariant stable relation on . By Corollary 5.5, it suffices to show is finite. So suppose is infinite. Without loss of generality, we may assume is countable (view as a two-sorted structure in the group language with a predicate for , and apply Löweinheim-Skolem to obtain a countable elementary substructure containing parameters for instances of that distinguish infinitely many generic -types). Now, the map from to is injective by construction, and has image in by Theorem 2.18. Since is countable, is countably generated, and thus countable. Altogether, is a countably infinite compact Hausdorff homogeneous space. But such spaces do not exist.
We also note that if is actually -stable for some , then is finite by a result of Hrushovski and Pillay (see [22, Lemma 5.16]).
As an application, we now give an explicit structure statement for stable subsets of groups, which is formulated entirely using genericity.
Corollary 5.10**.**
Suppose is stable, and set
[TABLE]
* is a finite-index normal subgroup of , and is in the Boolean algebra generated by .* 2.
For any coset of , exactly one of or is generic. Moreover, there is a set , which is a union of cosets of , such that A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y is not generic. 3.
If is generic then .
Proof.
Let be the Boolean algebra generated by . Then is the Boolean algebra generated by . Note also that if we define on such that , then . Therefore, has finite index in by Corollary 5.5 and Theorem 5.8 (via Remark 5.7). Note that . By definition of , it follows that , and so by Theorem 5.4. So parts and follow from Theorem 5.4. For part , suppose is generic. So there is some containing by Corollary 4.5. By Theorem 5.4, we have . So if then , and so , hence . It follows that . Moreover, if then and so, by Theorem 5.4, if and only if and contain the same coset of . By normality of , we have if and only if . So by a similar argument. ∎
Part of the previous corollary is reminiscent of results on stabilizers and simple groups of finite Morley rank (see also Corollary 6.8), and was also motivated by [24]. One might wonder why we did not try to apply Theorem 5.8 directly to in the proof by choosing a different relation. More generally, if on is left-invariant then , where is the relation on defined by . So if is stable then is a bi-invariant sub-algebra of . However, may be unstable, as we see in the following examples.
Example 5.11**.**
(from [7]) Let , and let . Then is -stable. Given , let be the transposition and let be any permutation that fixes if and only if . Then if and only if , and so is unstable. 2.
Let , and let . Then is -stable. Let be an increasing enumeration of the primes and, for , set . Then if and only if , and so is unstable.
In both examples, one can also show that has the independence property and the strict order property in the structure .
Remark 5.12**.**
The use of Theorem 5.8 (and Löwenheim-Skolem in particular) can be avoided in the proof of Corollary 5.10. In fact, given a finite set , if is the Boolean algebra generated by , then one can prove that has finite index in as follows. By Corollary 4.15, there is some such that, for any , there is a union of left cosets of such that \mu(A\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0. By induction, one can show that the same is true for any set . Now, if , then there is some which is a proper subgroup of . So \mu(K\raisebox{0.4pt}{{\scriptsize{~{}\!\triangle\!~{}}}}Y)=0 for some union of left cosets of , which is a contradiction.
6. Remarks on stable additive combinatorics
We say that a group is amenable if there is a left-invariant probability measure on . A fundamental result is that is amenable if and only if it admits a Følner net, i.e., a net of nonempty finite subsets of such that, for any , . For example, in any sequence of intervals of diverging length is a Følner net. Given , we let and . The upper and lower Banach density of a subset of an amenable group are (respectively)
[TABLE]
A good exercise is to show that a subset of an amenable group is generic if and only if . In general, one has , and this inequality may be strict. However, for stable sets this does not happen.
Lemma 6.1**.**
Suppose is an amenable group and . Then , and this density is rational. In particular, if then is generic.
Proof.
Let and . Fix . Then there is a Følner net such that (see [15, Theorem 4.16]). Let be a nonprincipal ultralimit of counting measures normalized on . Then is a left-invariant probability measure on , and . So by Theorem 1.1, and this value is rational by Theorem 1.1. ∎
It was shown in [6] that if is definable in a (globally) stable expansion of , then has upper Banach density [math]. Since no subset of is generic (in ), the previous lemma generalizes this result to the “local and in a model” case.
Corollary 6.2**.**
If is stable in , then it has upper Banach density [math].
The next proposition is motivated by Erdős’s sumset conjecture, which says that if has positive upper Banach density, then there are infinite such that (this was recently proved in [25]). In [1], there is a short proof that if is a countable amenable group and has positive upper Banach density, then there are infinite such that . Together with Lemma 6.1, the next proposition gives a different proof this result, which works for any amenable group and yields a much stronger conclusion.
Proposition 6.3**.**
Let be a group and suppose is generic. Then there is a finite set such that, for any infinite , there are and infinite and such that .
Proof.
Fix a finite set such that . Fix and . Let . Given , choose some such that . Define such that if , and if . By Ramsey’s Theorem, there is an infinite set , and some , such that for all with . Since is stable in , we cannot have . So , and we have for all distinct . Partition into two infinite sets, and let and . Then . ∎
Remark 6.4**.**
The previous result does not hold without the assumption of stability. For example, let and . Then is generic in , but there do not exist infinite and such that for some .
We say that a subset of a group is:
- (1)
thick if for any finite there is some such that . 2. (2)
weakly generic if is thick for some finite ; 3. (3)
supergeneric if is generic for any finite .
The first notion is standard in combinatorial number theory (where generic sets are called syndetic and weakly generic sets are called piecewise syndetic), the second is from [27], and the third is from [33]. It is not hard to show that is generic if and only if is not thick, and is supergeneric if and only if is not weakly generic. In particular, if a set is supergeneric then it is generic and thick, and if a set is generic or thick then it is weakly generic.
In the model theoretic context, it was observed by Newelski and Petrykowski in [28] (and later by Poizat in [33]) that ultrafilters of weakly generic sets always exist. Indeed, weakly generic sets are partition regular, i.e., if is weakly generic then or is weakly generic. This fact is well-known in combinatorial number theory, and was shown by Bergelson, Hindman, and McCutcheon [4], with origins in even earlier work of Brown [5]. It also yields the following characterization of when genericity and weak genericity coincide (see, e.g., [28, Lemma 1.5]).
Fact 6.5**.**
Let be a group, and suppose is a left-invariant Boolean algebra. The following are equivalent.
For any , is generic if and only if it is weakly generic. 2.
For any , is supergeneric if and only if it is thick. 3.
There is a generic type in .
Let be a group. By Theorem 4.4, the conditions in Fact 6.5 hold for . Let be the unique bi-invariant probability measure on . Then is supergeneric if and only if is non-generic, and this also coincides with . Altogether, “non-genericity” is a canonical notion of smallness for . Recall that contains all subgroups of (see the proof of Corollary 4.17). The Boolean algebra generated by cosets of subgroups of is also called the “coset ring” of , and a more quantitative account of stability for the coset ring of an abelian group is given by Sanders in [36]. When is abelian, its coset ring coincides with the Fourier algebra of , i.e., the algebra of subsets such that (the Fourier-Stieljtes transform of ) for some Borel measure on the compact group of characters on as a discrete group (see [35, Theorem 3.1.3]). Theorem 1.1 says that, for arbitrary , is essentially controlled by the coset ring of “up to small sets”. By restricting , we also obtain a bi-invariant probability measure on the coset ring of any group . In this way, we can view the existence of as an extension of the following classical result of B. H. Neumann (see [26, Section 4]).
Proposition 6.6**.**
Let be a group and suppose , where each is a coset of a subgroup . Let be the set of such that has finite index in . Then and for some .
Proof.
We have , which immediately implies the latter claim. Without loss of generality, each is a left coset of (note that any right coset of is a left coset of some conjugate of ). Let . Then , and so since is a union of left cosets of the finite-index subgroup . ∎
In model theory, a definable group is called definably connected if it has no definable finite-index subgroups. We have a natural analogue of this notion in the local setting. Given a group and a left-invariant Boolean algebra , we say is -connected if no proper finite-index subgroup of is in (i.e., ). For example, is -connected if and only if it has no proper finite-index subgroups (equivalently, the profinite completion of is trivial). Examples of -connected groups include divisible groups and infinite simple groups.
Corollary 6.7**.**
Let be a group and suppose is a left-invariant sub-algebra of . The following are equivalent.
* is -connected.* 2.
* is -connected.* 3.
There is a unique generic type in . 4.
If then exactly one of or is supergeneric. 5.
If then is generic if and only if it is supergeneric. 6.
Then unique left-invariant measure on is -valued.
Proof.
follows from Corollary 4.15, and follows from Fact 6.5 (and the subsequent discussion). For , note that any proper finite-index subgroup of in is generic and not supergeneric. We have by Theorem 5.4, by Theorem 5.4, and is trivial. Finally, and are equivalent by Theorem 4.7. ∎
A classical result from the model theory of groups is that if is a definably connected group definable in a stable theory, then for any definable generic subsets . Let us prove this in our general setting.
Corollary 6.8**.**
Let be a group, and suppose is a left-invariant sub-algebra of such that is -connected. Then for any generic .
Proof.
Suppose are generic, and fix . Let be the unique generic type. Then , and so , which implies . ∎
Acknowledgements
I would like to thank Anand Pillay for directing me to the work of Ellis and Nerurkar in [9], and also Kyle Gannon, Jason Long, and Joe Zielinski for helpful conversations. Some parts of Section 6 relate to discussions with Artem Chernikov, James Freitag, Isaac Goldbring, and Frank Wagner at the 2017 AIM workshop “Nonstandard methods in combinatorial number theory”. I am also indebted to the referee for their comments and suggestions, which led to significant improvement to the exposition.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Uri Andrews, Gabriel Conant, and Isaac Goldbring, Definable sets containing productsets in expansions of groups , J. Group Theory 22 (2019), no. 1, 63–82.
- 2[2] Joseph Auslander, Minimal flows and their extensions , North-Holland Mathematics Studies, vol. 153, North-Holland Publishing Co., Amsterdam, 1988, Notas de Matemática [Mathematical Notes], 122.
- 3[3] Itaï Ben Yaacov, Model theoretic stability and definability of types, after A. Grothendieck , Bull. Symb. Log. 20 (2014), no. 4, 491–496.
- 4[4] Vitaly Bergelson, Neil Hindman, and Randall Mc Cutcheon, Notions of size and combinatorial properties of quotient sets in semigroups , Proceedings of the 1998 Topology and Dynamics Conference (Fairfax, VA), vol. 23, 1998, pp. 23–60.
- 5[5] T. C. Brown, An interesting combinatorial method in the theory of locally finite semigroups , Pacific J. Math. 36 (1971), 285–289.
- 6[6] Gabriel Conant, Stability and sparsity in sets of natural numbers , Israel J. Math. 230 (2019), no. 1, 471–508.
- 7[7] Gabriel Conant and Anand Pillay, Pseudofinite groups and VC-dimension , to appear in J. Math. Log., ar Xiv:1802.03361.
- 8[8] Gabriel Conant, Anand Pillay, and Caroline Terry, A group version of stable regularity , ar Xiv:1710.06309, accepted to Mathematical Proceedings of the Cambridge Philosophical Society.
