
TL;DR
This paper presents a new streamlined construction of a minimal model-universal flow for countable groups, demonstrating that such flows are not unique, and advancing the understanding of invariant measures in dynamical systems.
Contribution
It introduces a simplified method for constructing minimal model-universal flows, showing their non-uniqueness and expanding the theoretical framework for measure-preserving group actions.
Findings
A new streamlined construction of minimal model-universal flows.
Proof that minimal model-universal flows are not unique.
Enhanced understanding of invariant measures in dynamical systems.
Abstract
Given a countable group , we say that a metrizable flow is model-universal if by considering the various invariant measures on , we can recover every free measure-preserving -system up to isomorphism. Weiss has constructed a minimal model-universal flow. In this note, we provide a new, streamlined construction, allowing us to show that a minimal model-universal flow is far from unique.
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.
A note on minimal models for pmp actions
Andy Zucker
(July 2019)
Abstract
Given a countable group , we say that a metrizable flow is model-universal if by considering the various invariant measures on , we can recover every free measure-preserving -system up to isomorphism. Weiss in [5] constructs a minimal model-universal flow. In this note, we provide a new, streamlined construction, allowing us to show that a minimal model-universal flow is far from unique. ††2010 Mathematics Subject Classification. Primary: 37B05; Secondary: 28D15. ††The author was supported by NSF Grant no. DMS 1803489.
In this paper, we consider actions of an infinite countable group on a standard Borel probability space by Borel, measure-preserving bijections. When an action is understood, we will suppress the action notation, and given and just write or for . We will refer to as a -system. A -system is free if for -almost every , we have , where is the stabilizer of . By passing to a subset of measure , we will often implicitly assume that every point in a free -system has trivial stabilizer. If and are two -systems, we say that is a factor of if there is a Borel with and a Borel -equivariant map with . If we can find as above that is also injective, then we call and isomorphic -systems.
A -flow is an action of by homeomorphisms on a compact Hausdorff space. We similarly suppress the action notation. Given a -system , a model for is a compact metric -flow and an invariant Borel probability measure so that and are isomorphic -systems. We will be most interested in minimal -flows, those -flows in which every orbit is dense. Notice that any minimal model of a free -system must be essentially free, where a -flow is essentially free if for each , the set is nowhere dense.
We say that a metrizable -flow is model-universal if by considering the various invariant measures on , the -systems recover every (standard) free -system up to isomorphism. In [5], Weiss constructs for every countable group a minimal model-universal flow. It is natural to ask in what sense a minimal model-universal flow must be unique. Here, we prove a strong negative result. Given a family of minimal -flows, we say that is mutually disjoint if the product is minimal. In particular, this implies that the are pairwise non-isomorphic -flows.
Theorem 1**.**
For any countable group , there is a mutually disjoint family of minimal model-universal flows.
Let us call a -flow weakly model-universal if for every free -system , there is an invariant measure on so that is a factor of . In [5], Weiss first constructs a minimal, essentially free, weakly model-universal flow, then proves that any flow with these properties admits an almost 1-1 extension which is model-universal. We instead build our model-universal flows in one step.
A recent result of Elek in [1] shows the existence of a free minimal model-universal flow. Recall that a -flow is free when for any and any , we have . In the last section of this paper, we show how one can deduce this result using rather soft arguments.
Theorem 2**.**
Let be a minimal, model-universal, Cantor flow. Then there is an almost 1-1 extension so that is free, minimal, and model-universal.
As almost 1-1 extensions always preserve minimality and disjointness, we can strengthen Theorem 1 as follows.
Theorem 3**.**
For any countable group , there is a mutually disjoint family of free, minimal, model-universal flows.
I would like to thank Benjamin Weiss for many helpful comments on an earlier draft, as well as the anonymous referee for suggesting many improvements.
1 Basic examples of model-universal flows
We briefly collect a few simple examples which will be important in what follows. Let be a compact space. Then is a -flow with the right shift action, where given and , we have . Mostly we take or .
Proposition 4**.**
The flow is model-universal.
Proof.
Let be a free -system, and fix a Borel bijection. Now define via . Then is injective, and . ∎
A subshift of is a closed, -invariant subspace. The following family of subshifts of will be an important source of weakly model-universal flows. Let be a finite symmetric set. We say that is -spaced if whenever with , then . We say that is -syndetic if we have . Notice that maximal -spaced sets exist and are -syndetic. Conversely, any -syndetic -spaced set is a maximal -spaced set. We define
[TABLE]
Proposition 5**.**
The flow is weakly model-universal.
Remark*.*
This proposition is also one of the key ingredients used by Weiss (see [5], Lemma 2.2).
Proof.
Let be a free -system. By freeness, we can find for every Borel with a Borel subset with and with for any . Let us call a Borel set with this property a -disjoint set. Now if doesn’t have full measure, we can find a -disjoint Borel set with and for every . As is assumed symmetric, it follows that is also -disjoint.
Thus using a measure exhaustion argument, we can find a -disjoint Borel set so that . We now let be the map given by iff . Then for almost every , is both -syndetic and -spaced, so a maximal -spaced set. It follows that contains the closed support of , so is a factor of . ∎
We end the section by noting a simple closure property of (weakly) model-universal flows.
Proposition 6**.**
Let be weakly model-universal -flows. Then is weakly model-universal. If at least one of the is model-universal, then so is .
Proof.
Let be a free -system, and for each , let be a Borel, -equivariant map, where satisfies . Set . Then , and the map given by is Borel and -equivariant. If for some , the map is injective, then will also be injective. ∎
2 Strongly irreducible subshifts
The key technical tool we use here is the notion of a strongly irreducible subshift. First, we introduce some general terminology. Write for the collection of finite subsets of . Given and symmetric with , we say that and are -apart if . Let be a finite set. If is a subshift and , we define the -patterns of to be the set . Given , we define the basic clopen neighborhood . If , , , and , we say that appears in if there is with and for each . We say in this case that appears at .
We say that is strongly irreducible if there is so that for any which are -apart and any , there is with . We sometimes say that is -irreducible. We will frequently use the following facts about strongly irreducible subshifts. Here and are finite sets.
If is -irreducible and is -irreducible, then is -irreducible. 2. 2.
Suppose is -irreducible and is continuous and -equivariant. By continuity, there is so that depends only on . Then is -irreducible.
We will also need a method of making explicit choices of patterns in . To that end, suppose that is linearly ordered, and enumerate the group in some fashion. This allows us to order lexicographically. We will use this ordering in the following two ways. Fix a -irreducible subshift.
If are pairwise -apart, , and contains each , then we let be the lexicographically least -pattern satisfying . 2. 2.
Every strongly irreducible subshift is topologically transitive. In particular, fix . Then for any containing at least many disjoint right translates of , there is so that every appears in . We let be the lexicographically least -pattern with this property.
Most of the time, we take for some , and we take the lexicographic ordering on as the ordering on .
3 The operator
A subset is called syndetic if is -syndetic for some . Given with and a subshift, we say that is -minimal if for every , every appears in . Equivalently, for every , every appears syndetically often. The following observation will be useful; suppose is -minimal and that every appears -syndetically for some . Then every such appears in every .
The following is our main method of producing strongly irreducible, -minimal flows. First, recalling the flow from section 1, we note that is -irreducible. Now let be -irreducible. Let be symmetric, contain , and be large enough to contain at least many disjoint right translates of . Let be symmetric with . We define a continuous, -equivariant map as follows. Suppose , and write . Let .
- •
If , where and , set .
- •
If there are not and with and , set
- •
If , where and , set
.
The idea behind this definition is to reprint most of the time, using to tell us where to overwrite with the pattern , and using strong irreducibility to blend everything together. This construction is a slight modification of a construction in [2]; see their Figure 3 for a good illustration.
It is routine to verify that as defined is continuous and -equivariant. Denote by the image of . Then is -irreducible.
Lemma 7**.**
We have .
Proof.
The direction is clear. For the direction, suppose with . It is enough to show that . If there is with and , then , so we have
[TABLE]
If there is no such , then we have . ∎
For any , the -pattern appears in , so in particular every pattern in appears in . Hence is -minimal. Indeed, every -pattern appears -syndetically, since maximal -spaced sets are -syndetic. So every pattern in appears in every pattern in .
4 A tree of subshifts
We now use the operator to produce a tree of strongly irreducible flows. We will construct for each a strongly irreducible flow by induction. This tree will be controlled by rapidly increasing sequences , , and of finite symmetric subsets of . We will continue to add assumptions about how rapid this needs to be, but for now, we assume that
- •
.
- •
contains at least -many pairwise disjoint translates of
- •
- •
Let be the trivial flow. If and is defined, and , then we set . Suppose we are given , , and . Then we set .
In order to discuss the key properties of this construction, we think of as embedded into by adding zeros to the end. In this way, we can refer to the -patterns of a subflow , the set , whenever .
Each is -irreducible. 2. 2.
For any with , we have . 3. 3.
Suppose is such that and . Then every pattern in appears in every pattern in . 4. 4.
Suppose . Then . This is because the conclusion of item 3 is true for and false for .
We can now consider taking limits along the branches. It follows from item 2 above that for any , the flow is well defined. We can think of as a point in the space of compact subsets of . The subshifts form a closed subspace, and given subshifts and , we have iff for each finite and , we eventually have . With this topology, the map given by is continuous. Item 4 shows that is injective. Whenever has infinite, then item 3 implies that is a minimal flow.
Proposition 8**.**
For any with and infinite, the flow is a minimal, model-universal flow.
Proof.
Having already discussed minimality, we focus on model-universality. Write , and form the flow . Then is model-universal. We have a continuous -map given inductively as follows. First let and be infinite-to-one surjections. Let , and write with and . Then we write with each . We let be the unique member of the trivial flow . If has been defined and , then . If , then , where .
Notice that if the sequence converges to some , then . Let be the subset of those for which is convergent. Then the map with is Borel. It suffices to show that if the grow rapidly enough, then has measure for any -invariant measure on . To that end, fix , and consider some . A sufficient condition for the sequence to be convergent is that for a tail of , we have whenever . This condition ensures that for suitably large , we have . Define to be those for which on a tail of , we have for any . Notice that is also Borel and -invariant.
Fix an invariant measure on . Then letting , we have . This is because , so by definition of the subshift , we have that the collection is pairwise disjoint. Then by invariance and a union bound, we have . We now add our last assumption to the growth of the .
- •
.
From this assumption, it follows from the Borel-Cantelli lemma that for any invariant measure on that .
Furthermore, we claim that is injective on . To see this, suppose that , with and . First suppose that for some and . Then for some large enough and any , we have , and same for . Now pick some suitably large with . Then , and similarly for . It follows that . In the case that for some , the argument is almost the same. For a suitably large with , we use the assumption that and are in to see that , and similarly for . Once more, we have . ∎
To prove Theorem 1, we need to recall some results from [3] (in particular, see Corollary 6.8). There, it is shown that every minimal flow is disjoint from every strongly irreducible subshift. From this, it follows that every minimal flow is disjoint from any where has a tail of zeros. Since disjointness is a condition ([3], Proposition 6.4), it follows that every minimal flow is disjoint from for comeagerly many . We are now in a position to apply Mycielski’s theorem (see [4], 19.1) to find our mutually disjoint family of minimal, model-universal shifts.
5 From essentially free to free
Recall that if is a minimal metrizable flow, then an extension is called almost 1-1 if the set is comeager. Notice that must also be minimal. To see this, let and be non-empty open. Then find with . We can find a net with . It follows that . In particular, the orbit of meets .
One method of producing almost 1-1 extensions of a given minimal -flow is to consider , the Boolean algebra of regular open subsets of . Recall that is regular open if . We remind the reader that in this Boolean algebra, we have , , and . If is a subalgebra, then , the space of ultrafilters on , is a compact, zero-dimensional space whose basic clopen neighborhood has the form , where . If is also -invariant, then is a -flow. If is countable, then is homeomorphic to Cantor space. Now suppose that contains a basis for the topology on . Then we have a -map given by iff every with satisfies . Furthermore, the map is pseudo-open, meaning that images of open sets have non-empty interior. For , we have iff for every , we have or . So when is countable, the set is comeager. Since is pseudo-open, it follows that is also comeager.
In general, an almost 1-1 extension can have very different measure-theoretic behavior than the base flow. Indeed, this fact is heavily exploited in [5]. For us however, we will seek to build almost 1-1 extensions which preserve the measure-theoretic properties of the base flow. For the remainder of the section, fix a minimal, model-universal flow whose underlying space is a Cantor set. Recall that this implies that is essentially free. We will call an invariant measure on free if for every , we have , where .
Definition 9**.**
Given , we call strongly regular open if is regular open and for every free invariant measure , we have . Denote by the collection of strongly regular open sets.
Proposition 10**.**
* is a -invariant subalgebra of .*
Proof.
Clearly is -invariant and closed under complements, so it is enough to check closure under intersection. Given , we have
[TABLE]
Since and are both strongly regular open, the last entry must have measure zero for any free invariant measure . ∎
Of course, we have yet to prove the existence of any interesting strongly regular open sets. We do this in the next lemma.
Lemma 11**.**
For every , there is a partition of into three relatively clopen pieces , , and with the property that , and likewise for and . In particular, , , and are all strongly regular open sets.
Proof.
Write with each compact open. We may assume that the are pairwise disjoint, and by further partitioning each into finitely many clopen pieces if needed, we may assume that for each . We will inductively partition into pieces , , and with the property that for , likewise for and . We then set , and likewise for and .
We set . Assume , , and have been defined for some . We will form clopen sets , , and so that . Partition into finitely many clopen sets with the property that for each and for each , we either have , , , or . Add each to the set , , or in such a way so that if for some as above, then is not added to , and likewise for and . We then set , and likewise for and .
Notice that for each , we have , and likewise for and . Hence will also satisfy as desired, and likewise for and . ∎
The last lemma we will need shows that metrizable, almost 1-1 extensions of using strongly regular open sets preserve the measure-theoretic properties of .
Lemma 12**.**
Let be a countable -invariant subalgebra of extending the clopen algebra of . Let , and let be the associated almost 1-1 extension. Then for any free invariant measure on , we have .
Proof.
By the discussion at the beginning of the section, we have
[TABLE]
Since is a countable collection of strongly regular open sets, this set must have measure for any free . ∎
Proof of Theorem 2.
Let be a countable, -invariant subalgebra containing all of the sets , , from Lemma 11. Then will be the desired flow. To see that is free, let and . Then contains one of , , or , WLOG say . Then since , we must have . To see that is model-universal, we note that on the set , the map is well defined. By Lemma 12, this set has measure for all free invariant measures on . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Elek, Free minimal actions of countable groups with invariant probability measures, preprint , https://arxiv.org/abs/1805.11149.
- 2[2] J. Frisch, O. Tamuz, and P. Vahidi-Ferdowsi, Strong amenability and the infinite conjugacy class property, Invent. Math. , to appear.
- 3[3] E. Glasner, T. Tsankov, B. Weiss, and A. Zucker, Bernoulli disjointness, submitted , https://arxiv.org/abs/1901.03406.
- 4[4] A. Kechris, Classical Descriptive Set Theory , Graduate Texts in Mathematics, 156 , Springer-Verlag, New York, 1995.
- 5[5] B. Weiss, Minimal models for free actions, Contemporary Mathematics , 567 (2012), 249–264.
