Folner tilings for actions of amenable groups
Clinton T. Conley, Steve Jackson, David Kerr, Andrew Marks, Brandon, Seward, Robin Tucker-Drob

TL;DR
This paper proves that actions of countable amenable groups can be finitely tiled with approximate invariance, leading to new results on the structure of crossed products of such actions, including Z-stability.
Contribution
It extends the tiling theorem to dynamical actions and demonstrates Z-stability of crossed products for generic free minimal actions.
Findings
Every measure-preserving action can be finitely tiled with approximate invariance.
The tiling centers form Borel sets, ensuring measurability.
Crossed products of generic free minimal actions are Z-stable.
Abstract
We show that every probability-measure-preserving action of a countable amenable group G can be tiled, modulo a null set, using finitely many finite subsets of G ("shapes") with prescribed approximate invariance so that the collection of tiling centers for each shape is Borel. This is a dynamical version of the Downarowicz--Huczek--Zhang tiling theorem for countable amenable groups and strengthens the Ornstein--Weiss Rokhlin lemma. As an application we prove that, for every countably infinite amenable group G, the crossed product of a generic free minimal action of G on the Cantor set is Z-stable.
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.
Følner tilings for actions of amenable groups
Clinton T. Conley
,
Steve C. Jackson
,
David Kerr
,
Andrew S. Marks
,
Brandon Seward
and
Robin D. Tucker-Drob
Clinton T. Conley, Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, U.S.A.
Steve Jackson, Department of Mathematics, University of North Texas, Denton, TX 76203-5017, U.S.A.
David Kerr, Department of Mathematics, Texas A&M University, College Station, TX 77843-3368, U.S.A.
Andrew Marks, UCLA Department of Mathematics, Los Angeles, CA 90095-1555, U.S.A.
Brandon Seward, Courant Institute of Mathematical Sciences, New York, NY 10012, U.S.A.
Robin Tucker-Drob, Department of Mathematics, Texas A&M University, College Station, TX 77843-3368, U.S.A.
(Date: November 9, 2017)
Abstract.
We show that every probability-measure-preserving action of a countable amenable group can be tiled, modulo a null set, using finitely many finite subsets of (“shapes”) with prescribed approximate invariance so that the collection of tiling centers for each shape is Borel. This is a dynamical version of the Downarowicz–Huczek–Zhang tiling theorem for countable amenable groups and strengthens the Ornstein–Weiss Rokhlin lemma. As an application we prove that, for every countably infinite amenable group , the crossed product of a generic free minimal action of on the Cantor set is -stable.
1. Introduction
A discrete group is said to be amenable if it admits a finitely additive probability measure which is invariant under the action of on itself by left translation, or equivalently if there exists a unital positive linear functional which is invariant under the action of on induced by left translation (such a functional is called a left invariant mean). This definition was introduced by von Neumann in connection with the Banach–Tarski paradox and shown by Tarski to be equivalent to the absence of paradoxical decompositions of the group. Amenability has come to be most usefully leveraged through its combinatorial expression as the Følner property, which asks that for every finite set and there exists a nonempty finite set which is -invariant in the sense that .
The concept of amenability appears as a common thread throughout much of ergodic theory as well as the related subject of operator algebras, where it is known via a number of avatars like injectivity, hyperfiniteness, and nuclearity. It forms the cornerstone of the theory of orbit equivalence, and also underpins both Kolmogorov–Sinai entropy and the classical ergodic theorems, whether explicitly in their most general formulations or implicitly in the original setting of single transformations (see Chapters 4 and 9 of [11]). A key tool in applying amenability to dynamics is the Rokhlin lemma of Ornstein and Weiss, which in one of its simpler forms says that for every free probability-measure-preserving action of a countably infinite amenable group and every finite set and there exist -invariant finite sets and measurable sets such that the sets for and are pairwise disjoint and have union of measure at least [17].
The proportionality in terms of which approximate invariance is expressed in the Følner condition makes it clear that amenability is a measure-theoretic property, and it is not surprising that the most influential and definitive applications of these ideas in dynamics (e.g., the Connes–Feldman–Weiss theorem) occur in the presence of an invariant or quasi-invariant measure. Nevertheless, amenability also has significant ramifications for topological dynamics, for instance in guaranteeing the existence of invariant probability measures when the space is compact and in providing the basis for the theory of topological entropy. In the realm of operator algebras, similar comments can be made concerning the relative significance of amenability for von Neumann algebras (measure) and C∗-algebras (topology).
While the subjects of von Neumann algebras and C∗-algebras have long enjoyed a symbiotic relationship sustained in large part through the lens of analogy, and a similar relationship has historically bound together ergodic theory and topological dynamics, the last few years have witnessed the emergence of a new and structurally more direct kind of rapport between topology and measure in these domains, beginning on the operator algebra side with the groundbreaking work of Matui and Sato on strict comparison, -stability, and decomposition rank [14, 15]. On the side of groups and dynamics, Downarowicz, Huczek, and Zhang recently showed that if is a countable amenable group then for every finite set and one can partition (or “tile”) by left translates of finitely many -invariant finite sets [3]. The consequences that they derive from this tileability are topological and include the existence, for every such , of a free minimal action with zero entropy. One of the aims of the present paper is to provide some insight into how these advances in operator algebras and dynamics, while seemingly unrelated at first glance, actually fit together as part of a common circle of ideas that we expect, among other things, to lead to further progress in the structure and classification theory of crossed product C∗-algebras.
Our main theorem is a version of the Downarowicz–Huczek–Zhang tiling result for free p.m.p. (probability-measure-preserving) actions of countable amenable groups which strengthens the Ornstein–Weiss Rokhlin lemma in the form recalled above by shrinking the leftover piece down to a null set (Theorem 3.6). As in the case of groups, one does not expect the utility of this dynamical tileability to be found in the measure setting, where the Ornstein–Weiss machinery generally suffices, but rather in the derivation of topological consequences. Indeed we will apply our tiling result to show that, for every countably infinite amenable group , the crossed product of a generic free minimal action on the Cantor set possesses the regularity property of -stability (Theorem 5.4). The strategy is to first prove that such an action admits clopen tower decompositions with arbitrarily good Følner shapes (Theorem 4.2), and then to demonstrate that the existence of such tower decompositions implies that the crossed product is -stable (Theorem 5.3). The significance of -stability within the classification program for simple separable nuclear C∗-algebras is explained at the beginning of Section 5.
It is a curious irony in the theory of amenability that the Hall–Rado matching theorem can be used not only to show that the failure of the Følner property for a discrete group implies the formally stronger Tarski characterization of nonamenability in terms of the existence of paradoxical decompositions [2] but also to show, in the opposite direction, that the Følner property itself implies the formally stronger Downarowicz–Huczek–Zhang characterization of amenability which guarantees the existence of tilings of the group by translates of finitely many Følner sets [3]. This Janus-like scenario will be reprised here in the dynamical context through the use of a measurable matching argument of Lyons and Nazarov that was originally developed to prove that for every simple bipartite nonamenable Cayley graph of a discrete group there is a factor of a Bernoulli action of which is an a.e. perfect matching of the graph [13]. Accordingly the basic scheme for proving Theorem 3.6 will be the same as that of Downarowicz, Huczek, and Zhang and divides into two parts:
- (i)
using an Ornstein–Weiss-type argument to show that a subset of the space of lower Banach density close to one can be tiled by dynamical translates of Følner sets, and 2. (ii)
using a Lyons–Nazarov-type measurable matching to distribute almost all remaining points to existing tiles with only a small proportional increase in the size of the Følner sets, so that the approximate invariance is preserved.
We begin in Section 2 with the measurable matching result (Lemma 2.6), which is a variation on the Lyons–Nazarov theorem from [13] and is established along similar lines. In Section 3 we establish the appropriate variant of the Ornstein–Weiss Rokhlin lemma (Lemma 3.4) and put everything together in Theorem 3.6. Section 4 contains the genericity result for free minimal actions on the Cantor set, while Section 5 is devoted to the material on -stability.
Acknowledgements. C.C. was partially supported by NSF grant DMS-1500906. D.K. was partially supported by NSF grant DMS-1500593. Part of this work was carried out while he was visiting the Erwin Schrödinger Institute (January–February 2016) and the Mittag–Leffler Institute (February–March 2016). A.M. was partially supported by NSF grant DMS-1500974. B.S. was partially supported by ERC grant 306494. R.T.D. was partially supported by NSF grant DMS-1600904. Part of this work was carried out during the AIM SQuaRE: Measurable Graph Theory.
2. Measurable matchings
Given sets and and a subset , with each we associate its vertical section and with each we associate its horizontal section . Analogously, for we put . We say that is locally finite if for all and the sets and are finite.
If now and are standard Borel spaces equipped with respective Borel measures and , we say that is -preserving if whenever is a Borel bijection between subsets and with we have . We say that is expansive if there is some such that for all Borel we have .
We use the notation to denote a partial function from to . We say that such a partial function is compatible with if .
Proposition 2.1** (ess. Lyons–Nazarov [13, Theorem 1.1]).**
Suppose that and are standard Borel spaces, that is a Borel probability measure on , and that is a Borel measure on . Suppose that is Borel, locally finite, -preserving, and expansive. Then there is a -conull and a Borel injection compatible with .
Proof.
Fix a constant of expansivity for .
We construct a sequence of Borel partial injections from to which are compatible with . Moreover, we will guarantee that the set is -conull, establishing that the limiting function satisfies the conclusion of the lemma.
Given a Borel partial injection we say that a sequence is a -augmenting path if
- •
is not in the domain of ,
- •
for all distinct , ,
- •
for all , ,
- •
for all , ,
- •
is not in the image of .
We call the length of such a -augmenting path and the origin of the path. Note that the sequence in fact determines the entire -augmenting path, and moreover that for distinct .
In order to proceed we require a few lemmas.
Lemma 2.2**.**
Suppose that and is a Borel partial injection compatible with admitting no augmenting paths of length less than . Then .
Proof.
Put . Define recursively for sets and . Note that the assumption that there are no augmenting paths of length less than implies that each is contained in the image of . Expansivity of yields and -preservation of then implies that . Consequently, , and hence . ∎
We say that a graph on a standard Borel space has a Borel -coloring if there is a Borel function such that if and are -adjacent then .
Lemma 2.3** (Kechris–Solecki–Todorcevic [12, Proposition 4.5]).**
Every locally finite Borel graph on a standard Borel space has a Borel -coloring.
Proof.
Fix a countable algebra of Borel sets which separates points (for example, the algebra generated by the basic open sets of a compatible Polish topology), and color each vertex by the least such that contains and none of its neighbors. ∎
Analogously, for , we say that a graph on a standard Borel has a Borel -coloring if there is a Borel function giving adjacent points distinct colors.
Lemma 2.4** (Kechris–Solecki–Todorcevic [12, Proposition 4.6]).**
If a Borel graph on a standard Borel has degree bounded by , then it has a Borel -coloring.
Proof.
By Lemma 2.3, the graph has a Borel -coloring . We recursively build sets for by and A_{n+1}=A_{n}\cup\{x\in X:c(x)=n+1\mbox{ and no neighbor of xA_{n}}\}. Then is a Borel set which is -independent, and moreover is maximal with this property. So the restriction of to has degree less than , and the result follows by induction. ∎
Lemma 2.5** (ess. Elek–Lippner [5, Proposition 1.1]).**
Suppose that is a Borel partial injection compatible with , and let . Then there is a Borel partial injection compatible with such that
- •
,
- •
* admits no augmenting paths of length less than ,*
- •
.
Proof.
Consider the set of injective sequences , where , such that for all we have and for all we have . Equip with the standard Borel structure it inherits as a Borel subset of . Consider also the locally finite Borel graph on rendering adjacent two distinct sequences in if they share any entries. By Lemma 2.3 there is a partition of into Borel sets such that for all , no two elements of are -adjacent. In other words, we partition potential augmenting paths into countably many colors, where no two paths of the same color intersect. Thus we may flip paths of the same color simultaneously without risk of causing conflicts. Towards that end, fix a bookkeeping function such that is infinite for all in order to consider each color class infinitely often.
Given a -augmenting path , define the flip along to be the Borel partial function given by
[TABLE]
The fact that is -augmenting ensures that is injective. More generally, for any Borel -independent set of -augmenting paths, we may simultaneously flip along all paths in to obtain another Borel partial injection .
We iterate this construction. Put . Recursively assuming that has been defined, let be the set of -augmenting paths in , and let be the result of flipping along all paths in . As each is contained in only finitely many elements of , and since each path in can be flipped at most once (after the first flip its origin is always in the domain of the subsequent partial injections), it follows that the sequence is eventually constant. Defining to be the limiting value, it is routine to check that there are no -augmenting paths of length less than .
Finally, to verify the third item of the lemma, put . With each associate the origin of the first augmenting path along which it was flipped. This is an at most -to- Borel function from to , and since is -preserving the bound follows. ∎
We are now in position to follow the strategy outlined at the beginning of the proof. Let be the empty function. Recursively assuming the Borel partial injection has been defined to have no augmenting paths of length less than , let be the Borel partial injection granted by applying Lemma 2.5 to . Thus has no augmenting paths of length less than and the recursive construction continues.
Lemma 2.2 ensures that , and thus the third item of Lemma 2.5 ensures that . As the sequence is summable, the Borel–Cantelli lemma implies that is -conull. Finally, is as desired. ∎
Lemma 2.6**.**
Suppose and are standard Borel spaces, that is a Borel measure on , and that is a Borel measure on . Suppose is Borel, locally finite, -preserving graph. Assume that there exist numbers such that for -a.e. and for -a.e. . Then for all Borel subsets .
Proof.
Since is -preserving we have . Hence
[TABLE]
3. Følner tilings
Fix a countable group . For finite sets and , we say that is -invariant if . Note this condition implies . Recall that is amenable if for every finite and there exists a -invariant set . A Følner sequence is a sequence of finite sets with the property that for every finite and the set is -invariant for all but finitely many . Below, we always assume that is amenable.
Fix a free action . For we define the lower and upper Banach densities of to be
[TABLE]
Equivalently [3, Lemma 2.9], if is a Følner sequence then
[TABLE]
We now define an analogue of ‘-invariant’ for infinite subsets of . A set (possibly infinite) is -invariant if there is a finite set such that for all . Equivalently, is -invariant if and only if for every Følner sequence we have .
A collection of finite subsets of is called -disjoint if for each there is an such that and such that the sets are pairwise disjoint.
Lemma 3.1**.**
Let be finite, let , let , and for let be -invariant. If the collection is -disjoint and has positive lower Banach density, then is -invariant.
Proof.
Set and set . Since is finite and each , there is such that each is -invariant. Fix a finite set which is (T,\frac{\text{\@text@baccent{D}}(A)}{2|T|}(\delta-\delta_{0}))-invariant and satisfies \inf_{x\in X}|A\cap Ux|>\frac{\text{\@text@baccent{D}}(A)}{2}|U|. Now fix . Let be the set of such that . Note that and thus
[TABLE]
Set . Note that the -disjoint assumption gives . Also, our definitions of , , and imply that if and then . Therefore . Combining this with the fact that each set is -invariant, we obtain
[TABLE]
Since was arbitrary, we conclude that is -invariant. ∎
Lemma 3.2**.**
Let be finite and let with . Suppose that is -invariant. If and for all , then
[TABLE]
Proof.
This is implicitly demonstrated in [3, Proof of Lemma 4.1]. As a convenience to the reader, we include a proof here. Fix . Since is -invariant, we can pick a finite set which is -invariant and satisfies
[TABLE]
Fix , set \alpha=\frac{|A\cap Ux|}{|U|}>\text{\@text@baccent{D}}(A)-\theta, and set . Notice that
[TABLE]
Since and for all , it follows that for all . Thus there are many pairs with . It follows there is with . Therefore
[TABLE]
Letting tend to [math] completes the proof. ∎
Lemma 3.3**.**
Let be a standard Borel space and let be a free Borel action. Let be Borel, let be finite, and let . Then there is a Borel set and a Borel function such that , the sets are pairwise disjoint and disjoint with , , and for all .
Proof.
Using Lemma 2.4, fix a Borel partition of such that for all and all . We will pick Borel sets and set . Set . Let and inductively assume that has been defined. Define , define , and for set . It is easily seen that has the desired properties. ∎
The following lemma is mainly due to Ornstein–Weiss [17], who proved it with an invariant probability measure taking the place of Banach density. Ornstein and Weiss also established a purely group-theoretic counterpart of this result which was later adapted to the Banach density setting by Downarowicz–Huczek–Zhang in [3] and will be heavily used in Section 5, where it is recorded as Theorem 5.2. The only difference between this lemma and prior versions is that we simultaneously work in the Borel setting and use Banach density.
Lemma 3.4**.**
[17, II.§2. Theorem 5]** [3, Lemma 4.1] Let be a standard Borel space and let be a free Borel action. Let be finite, let , and let satisfy . Then there exist -invariant sets , a Borel set , and a Borel function such that:
- (i)
for every there is with and ; 2. (ii)
the sets , , are pairwise disjoint; and 3. (iii)
\text{\@text@baccent{D}}(\bigcup_{c\in C}F_{c}c)>1-\epsilon.
Proof.
Fix satisfying . Fix a sequence of -invariant sets such that is -invariant for all .
The set will be the disjoint union of sets , . The construction will be such that and for . We will define and arrange that and
[TABLE]
In particular, we will have .
To begin, apply Lemma 3.3 with and to get a Borel set and a Borel map such that , the sets are pairwise disjoint, , and for all . Applying Lemma 3.2 with and we find that the set satisfies \text{\@text@baccent{D}}(A_{n})\geq\epsilon.
Inductively assume that through have been defined and through are defined as above and satisfy (3.1). Using and , apply Lemma 3.3 to get a Borel set and a Borel map such that , the sets are pairwise disjoint and disjoint with , , and for all . The set is the union of an -disjoint collection of -invariant sets and has positive lower Banach density. So by Lemma 3.1 is -invariant. Applying Lemma 3.2 with , we find that satisfies
[TABLE]
This completes the inductive step and completes the definition of . It is immediate from the construction that (i) and (ii) are satisfied. Clause (iii) also follows by noting that (3.1) is greater than when . ∎
We recall the following simple fact.
Lemma 3.5**.**
[3, Lemma 2.3]** If is -invariant and satisfies then is -invariant.
Now we present the main theorem.
Theorem 3.6**.**
Let be a countable amenable group, let be a standard probability space, and let be a free p.m.p. action. For every finite and every there exist a -conull -invariant Borel set , a collection of Borel subsets of , and a collection of -invariant sets such that partitions .
Proof.
Fix satisfying . Apply Lemma 3.4 to get -invariant sets , a Borel set , and a Borel function satisfying
- (i)
for every there is with and ; 2. (ii)
the sets , , are pairwise disjoint; and 3. (iii)
\text{\@text@baccent{D}}(\bigcup_{c\in C}F_{c}c)>1-\epsilon.
Set . If then we are done. So we assume and we let denote the restriction of to . Fix a Borel map satisfying for all (it’s clear from the proof of Lemma 3.4 that we may choose the sets so that ). Set and let denote the restriction of to (note that ).
Set and . Fix a finite set which is -invariant and satisfies . Since every amenable group admits a Følner sequence consisting of symmetric sets, we may assume that [16, Corollary 5.3]. Define by declaring if and only if (equivalently ). Then is Borel, locally finite, and -preserving. We now check that is expansive. We automatically have for all . By Lemma 2.6 it suffices to show that for all . Fix . Let be the set of such that . Then and thus
[TABLE]
Let be the union of those sets , , which are contained in . Notice that . Therefore
[TABLE]
hence . By construction . So . We conclude that is expansive.
Apply Proposition 2.1 to obtain a -invariant -conull set and a Borel injection with . Consider the sets as varies. These are subsets of and thus there are only finitely many such sets which we can enumerate as . We partition into Borel sets with if and only if and . Since is defined on all of , we see that the sets partition . Finally, for , if we let be such that , then
[TABLE]
Using Lemma 3.5 and our choice of , this implies that each set is -invariant. ∎
4. Clopen tower decompositions with Følner shapes
Let be an action of a group on a compact space. By a clopen tower we mean a pair where is a clopen subset of (the base of the tower) and is a finite subset of (the shape of the tower) such that the sets for are pairwise disjoint. By a clopen tower decomposition of we mean a finite collection of clopen towers such that the sets form a partition of . We also similarly speak of measurable towers and measurable tower decompositions for an action on a measure space, with the bases now being measurable sets instead of clopen sets. In this terminology, Theorem 3.6 says that if is a free p.m.p. action of a countable amenable group on a standard probability space then for every finite set and there exists, modulo a null set, a measurable tower decomposition of with -invariant shapes.
Lemma 4.1**.**
Let be a countably infinite amenable group and a free minimal action on the Cantor set. Then this action has a free minimal extension on the Cantor set such that for every finite set and there is a clopen tower decomposition of with -invariant shapes.
Proof.
Let be an increasing sequence of finite subsets of whose union is equal to . Fix a -invariant Borel probability measure on (such a measure exists by amenability). The freeness of the action means that for each we can apply Theorem 3.6 to produce, modulo a null set, a measurable tower decomposition for the p.m.p. action such that each shape is -invariant. Let be the unital -invariant C∗-algebra of generated by and the indicator functions of the levels of each of the tower decompositions . Since there are countably many such indicator functions and the group is countable, the C∗-algebra is separable. Therefore by the Gelfand–Naimark theorem we have for some zero-dimensional metrizable space and a -factor map . By a standard fact which can be established using Zorn’s lemma, there exists a nonempty closed -invariant set such that the restriction action is minimal. Note that is necessarily a Cantor set, since is infinite. Also, the action is free, since it is an extension of a free action. Since the action on is minimal, the restriction is surjective and hence a -factor map. For each we get from a clopen tower decomposition of with -invariant shapes, and by intersecting the levels of the towers in with we obtain a clopen tower decomposition of with -invariant shapes, showing that the extension has the desired property. ∎
Let be the Cantor set and let be a countable infinite amenable group. The set is a Polish space under the topology which has as a basis the sets
[TABLE]
where , is a clopen partition of , and is a finite subset of . Write for the set of actions in which are free and minimal. Then is a set. To see this, fix an enumeration of (where denotes the identity element of the group) and for every and nonempty clopen set define the set of all such that (i) for some finite set , and (ii) there exists a clopen partition of such that for all . Then each is open, which means, with ranging over the countable collection of nonempty clopen subsets of , that the intersection , which is equal to , is a set. It follows that is a Polish space.
Theorem 4.2**.**
Let be a countably infinite amenable group. Let be the collection of actions in with the property that for every finite set and there is a clopen tower decomposition of with -invariant shapes. Then is a dense subset of .
Proof.
That is a set is a simple exercise. Let be any action in . By Lemma 4.1 this action has a free minimal extension with the property in the theorem statement, where is the Cantor set. Let be a clopen partition of and a nonempty finite subset of . Write for the members of the clopen partition . Then for each the set and its inverse image under the extension map are Cantor sets, and so we can find a homeomorphism . Let be the homeomorphism which is equal to on for each . Then the action defined by for belongs to as well as to the basic open neighborhood of , establishing the density of . ∎
5. Applications to -stability
A C∗-algebra is said to be -stable if where is the Jiang–Su algebra [10], with the C∗-tensor product being unique in this case because is nuclear. -stability has become an important regularity property in the classification program for simple separable nuclear C∗-algebras, which has recently witnessed some spectacular advances. Thanks to recent work of Gong–Lin–Niu [6], Elliott–Gong–Lin–Niu [4], and Tikuisis–White–Winter [22], it is now known that simple separable unital C∗-algebras satisfying the universal coefficient theorem and having finite nuclear dimension are classified by ordered -theory paired with tracial states. Although -stability does not appear in the hypotheses of this classification theorem, it does play an important technical role in the proof. Moreover, it is a conjecture of Toms and Winter that for simple separable infinite-dimensional unital nuclear C∗-algebras the following properties are equivalent:
- (i)
-stability, 2. (ii)
finite nuclear dimension, 3. (iii)
strict comparison.
Implications between (i), (ii), and (iii) are known to hold in various degrees of generality. In particular, the implication (ii)(i) was established in [23] while the converse is known to hold when the extreme boundary of the convex set of tracial states is compact [1]. It remains a problem to determine whether any of the crossed products of the actions in Theorem 5.4 falls within the purview of these positive results on the Toms–Winter conjecture, and in particular whether any of them has finite nuclear dimension (see Question 5.5).
By now there exist highly effectively methods for establishing finite nuclear dimension for crossed products of free actions on compact metrizable spaces of finite covering dimension [20, 21, 7], but their utility is structurally restricted to groups with finite asymptotic dimension and hence excludes many amenable examples like the Grigorchuk group. One can show using the technology from [7] that, for a countably infinite amenable group with finite asymptotic dimension, the crossed product of a generic free minimal action on the Cantor set has finite nuclear dimension. Our intention here has been to remove the restriction of finite asymptotic dimension by means of a different approach that establishes instead the conjecturally equivalent property of -stability but for arbitrary countably infinite amenable groups.
To verify -stability in the proof of Theorem 5.3 we will use the following result of Hirshberg and Orovitz [8]. Recall that a linear map between C∗-algebras is said to be complete positive if its tensor product with the identity map on the matrix algebra is positive for every . It is of order zero if for all satisfying . One can show that is an order-zero completely positive map if and only if there is an embedding of into a larger C∗-algebra, a ∗-homomorphism , and a positive element commuting with the image of such that for all [24]. Below denotes the relation of Cuntz subequivalence, so that for positive elements in a C∗-algebra means that there is a sequence in such that .
Theorem 5.1**.**
Let be a simple separable unital nuclear C∗-algebra not isomorphic to . Suppose that for every , finite set , , and nonzero positive element there exists an order-zero complete positive contractive linear map such that
- (i)
, 2. (ii)
* for all and norm-one .*
Then is -stable.
The following is the Ornstein–Weiss quasitiling theorem [17] as formulated in Theorem 3.36 of [11]. For finite sets we write
[TABLE]
For , a collection of finite subsets of is said to -cover a finite subset of if . For , a collection of finite subsets of is said to be -disjoint if for each there is a set with so that the sets for are pairwise disjoint.
Theorem 5.2**.**
Let and let be a positive integer such that . Then whenever are finite subsets of a group such that for , for every -invariant nonempty finite set there exist such that
- (i)
, and 2. (ii)
the collection of right translates is -disjoint and -covers .
Theorem 5.3**.**
Let be a countably infinite amenable group and let be a free minimal action on the Cantor set such that for every finite set and there is a clopen tower decomposition of with -invariant shapes. Then is -stable.
Proof.
Let . Let be a finite subset of the unit ball of , a symmetric finite subset of containing the identity element , and . Let be a nonzero positive element of . We will show the existence of an order-zero completely positive contractive linear map satisfying (i) and (ii) in Theorem 5.1 where the finite set there is taken to be . Since is generated as a C∗-algebra by the unit ball of and the unitaries for , we will thereafter be able to conclude by Theorem 5.1 that is -stable.
By Lemma 7.9 in [18] we may assume that is a function in . Taking a clopen set on which is nonzero, we may furthermore assume that is equal to the indicator function . Minimality implies that the clopen sets for cover , and so by compactness there is a finite set such that .
Equip with a compatible metric . Choose an integer .
Let , to be determined. Take a which is small enough so that if is a nonempty finite subset of which is sufficiently invariant under left translation by and is a subset of with then .
Choose an large enough so that . By amenability there exist finite subsets of such that for . By the previous paragraph, we may also assume that for each the set is sufficiently invariant under left translation by so that for all satisfying one has
[TABLE]
By uniform continuity there is a such that for all and all satisfying . Again by uniform continuity there is an such that for all satisfying and all . Fix a clopen partition of whose members all have diameter less that .
Let be a finite subset of containing and let be such that . We will further specify and below. By hypothesis there is a collection of clopen towers such that the shapes are -invariant and the sets partition . We may assume that for each the set is large enough so that
[TABLE]
By a simple procedure we can construct, for each , a clopen partition of such that each level of every one of the towers for is contained in one of the sets as well as in one of the sets and . By replacing with these thinner towers for each , we may therefore assume that each level in every one of the towers is contained in one of the sets and in one of the sets and .
Let . Since is -invariant, by Theorem 5.2 and our choice of the sets we can find such that the collection is -disjoint, has union contained in , and -covers . By -disjointness, for every and we can find a satisfying so that the collection of sets for and is disjoint and has the same union as the sets for and , so that it -covers .
For each and write for the set of all such that , and choose pairwise disjoint subsets of such that each has cardinality . For each choose a bijection
[TABLE]
which sends to for all . Also, define to be the identity map from to itself.
Let and . Define the set , which satisfies
[TABLE]
since each is a subset of of cardinality at least . Set
[TABLE]
and, for , using the convention ,
[TABLE]
Then the sets partition . For we have
[TABLE]
while for we have
[TABLE]
for if we are given a then , while if then since is symmetric, contradicting the membership of in . Also, from (5.1) and (5.3) we get
[TABLE]
For , , and we set .
Write for the composition . Define a linear map by declaring it on the standard matrix units of to be given by
[TABLE]
and extending linearly. Then for all and the product is or [math] depending on whether , so that is a ∗-homomorphism.
For all and , all , and all we set
[TABLE]
and put
[TABLE]
Then is a norm-one function which commutes with the image of , and so we can define an order-zero completely positive contractive linear map by setting
[TABLE]
Note that .
We now verify condition (ii) in Theorem 5.1 for the elements of the set . Let . For all and , all , and all we have
[TABLE]
and so in view of (5.4) and (5.5) we obtain
[TABLE]
Since each of the elements is such that and are dominated by twice the indicator functions of and , respectively, and the sets over all , all , and all are pairwise disjoint, this yields
[TABLE]
and hence, for every norm-one element ,
[TABLE]
Next we verify condition (ii) in Theorem 5.1 for the functions in . Let . Let . Let , , , and . Then
[TABLE]
and
[TABLE]
Now let . Since and both belong to , we have . It follows that for every we have by our choice of , so that by our choice of , in which case
[TABLE]
Using (5.7) and (5.8) this gives us
[TABLE]
Set for brevity. Let . For the functions over all , , and and all have pairwise disjoint supports, so that (5.9) yields
[TABLE]
It follows that
[TABLE]
and so
[TABLE]
Therefore for every norm-one element we have
[TABLE]
Finally, we verify that the parameters in the construction of can be chosen so that . By taking the sets to be sufficiently left invariant (by enlarging and shrinking if necessary) we may assume that for every there is an such that the set has cardinality at least . Let . Take a maximal set such that the sets for are pairwise disjoint, and note that . Since , each of the sets for intersects , and so the set of all such that has cardinality at least . Define , which is the set of all such that the function takes the value on . Set . Since for every and , by (5.2) we have
[TABLE]
Since for all and and all we have by (5.6), it follows, putting , that
[TABLE]
By taking and small enough we can guarantee that and hence
[TABLE]
so that there exists an injection . Define
[TABLE]
A simple computation shows that is the indicator function of , which is the support of , and so putting we get
[TABLE]
This demonstrates that , as desired. ∎
Combining Theorems 5.1 and 4.2 yields the following.
Theorem 5.4**.**
Let be a countably infinite amenable group and the Cantor set. Then the set of all actions in whose crossed product is -stable is comeager, and in particular nonempty.
Question 5.5**.**
Do any of the crossed products in Theorem 5.4 have tracial state space with compact extreme boundary (from which we would be able to conclude finite nuclear dimension by [1] and hence classifiability)? For a generic action in is uniquely ergodic, so that the crossed product has a unique tracial state [9]. However, already for nothing of this nature seems to be known. On the other hand, it is known that the crossed products of free minimal actions of finitely generated nilpotent groups on compact metrizable spaces of finite covering dimension have finite nuclear dimension, and in particular are -stable [21].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Bosa, N. Brown, Y. Sato, A. Tikuisis, S. White and W. Winter. Covering dimension of C ∗ -algebras and 2-coloured classification. To appear in Mem. Amer. Math. Soc. .
- 2[2] T. Ceccherini-Silberstein, P. de la Harpe, and R. I. Grigorchuk. Amenability and paradoxical decompositions for pseudogroups and discrete metric spaces. (Russian) Tr. Mat. Inst. Steklova 224 (1999), 68–111; translation in Proc. Steklov Inst. Math. 224 (1999), 57–97.
- 3[3] T. Downarowicz, D. Huczek, and G. Zhang. Tilings of amenable groups. To appear in J. Reine Angew. Math.
- 4[4] G. Elliott, G. Gong, H. Lin, and Z. Niu. On the classification of simple amenable C ∗ -algebras with finite decomposition rank, II. ar Xiv:1507.03437.
- 5[5] G. Elek and G. Lippner. Borel oracles. An analytic approach to constant time algorithms. Proc. Amer. Math. Soc. 138 (2010), 2939–2947.
- 6[6] G. Gong, H. Lin, and Z. Niu. Classification of finite simple amenable 𝒵 𝒵 {\mathcal{Z}} -stable C ∗ -algebras. ar Xiv:1501.00135.
- 7[7] E. Guentner, R. Willett, and G. Yu. Dynamic asymptotic dimension: relation to dynamics, topology, coarse geometry, and C ∗ -algebras. Math. Ann. 367 (2017), 785–829.
- 8[8] I. Hirshberg and J. Orovitz. Tracially 𝒵 𝒵 {\mathcal{Z}} –absorbing C ∗ -algebras. J. Funct. Anal. 265 (2013), 765–785.
