Uniformly recurrent subgroups and simple $C^*$-algebras
Gabor Elek

TL;DR
This paper explores uniformly recurrent subgroups (URS), establishing their connection to minimal actions and invariant measures, and investigates the properties of associated simple $C^*$-algebras, including conditions for simplicity, exactness, and nuclearity.
Contribution
It demonstrates that any URS of a finitely generated group can be realized as a stability system of a minimal action and characterizes when these actions admit invariant measures, also analyzing the structure of associated $C^*$-algebras.
Findings
Any URS of a finitely generated group is a stability system of a minimal $Z$-proper action.
For a sofic URS, there exists a $Z$-proper action with an invariant measure.
If a URS is generic, its associated $C^*$-algebra is simple.
Abstract
We study uniformly recurrent subgroups (URS) introduced by Glasner and Weiss \cite{GW}. Answering their query we show that any URS of a finitely generated group is the stability system of a minimal -proper action. We also show that for any sofic there is a -proper action admitting an invariant measure. We prove that for a all -proper actions admits an invariant measure if and only if is coamenable. In the second part of the paper we study the separable -algebras associated to URS's. We prove that if an URS is generic then its -algebra is simple. We give various examples of generic URS's with exact and nuclear -algebras and an example of a URS for which the associated simple -algebra is not exact and not even locally reflexive, in particular, it admits both a uniformly amenable trace and a nonuniformly amenable trace.
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.
Taxonomy
TopicsAdvanced Operator Algebra Research · Noncommutative and Quantum Gravity Theories · Advanced Topics in Algebra
Uniformly recurrent subgroups and simple -algebras111AMS
Subject Classification: 37B05, 20E99, 46L05. Partially supported by the ERC Consolidator Grant ”Asymptotic invariants of discrete groups, sparse graphs and locally symmetric spaces” No. 648017.
Gábor Elek
Abstract
We study uniformly recurrent subgroups (URS) introduced by Glasner and Weiss [18]. Answering their query we show that any URS of a finitely generated group is the stability system of a minimal -proper action. We also show that for any sofic there is a -proper action admitting an invariant measure. We prove that for a all -proper actions admits an invariant measure if and only if is coamenable. In the second part of the paper we study the separable -algebras associated to URS’s. We prove that if a URS is generic then its -algebra is simple. We give various examples of generic URS’s with exact and nuclear -algebras and an example of a URS for which the associated simple -algebra is not exact and not even locally reflexive, in particular, it admits both a uniformly amenable trace and a nonuniformly amenable trace.
Keywords. uniformly recurrent subgroups, simple -algebras, amenable traces, graph limits
Contents
1 Introduction
Let be a countable group and be the compact space of all subgroups of . The group acts on by conjugation. Uniformly recurrent subgroups (URS) were defined by Glasner and Weiss [18] as closed, invariant subsets such that the action of on is minimal (every orbit is dense). Now let be a -system (that is, is a compact metric space and is a homomorphism). For each point one can define the topological stabilizer subgroup by
[TABLE]
Let us consider the -invariant subset such that if and only if The closure of the invariant subset is called the stability system of (see also [21],[23]). If the action is minimal, then the stability system of is a URS. Glasner and Weiss proved (Proposition 6.1,[18]) that for every URS there exists a topologically transitive (that is there is a dense orbit) system with as its stability system. They asked (Problem 6.2., [18]), whether for any URS there exists a minimal system with as its stability system. Recently, Kawabe [21] gave an affirmative answer for this question in the case of amenable groups.
Definition 1.1**.**
Let be a countable group and be a URS. A system is -proper if for any and .
Before stating our first result we prove a lemma for the sake of completeness.
Lemma 1.1**.**
If is a -proper system, then the map is continuous.
Proof.
Let be a sequence in converging to an element . We need to show that if and only if there exists some constant such that if then . Clearly, if , then by the continuity of , for large enough . In other words, for any -system the map is upper-semicontinuous. It is important to note that for -systems in general the map is not necessarily continuous at all points . Let be the standard Bernoulli shift. That is, and is the left translation by . Let be defined the following way. For , let if and let , otherwise. Also, let for any . Then, . On the other hand, for all and . Now, if is -proper for some URS and , then for some neighborhood . Hence, there exists some constant such that provided that . Therefore our lemma follows. ∎
Theorem 1**.**
If is a finitely generated group and is a URS, then there exists a minimal -proper system (that is, is the stability system of ).
In fact, we will show that can be chosen as a -proper minimal Bernoulli subshift (see Definition 2.1). In the proof we will use the Lovász Local Lemma technique of Alon, Grytczuk, Haluszczak and Riordan [3] to construct a minimal action on the space of rooted colored -Schreier graphs. This approach has already been used to construct free -Bernoulli subshifts by Aubrun, Barbieri and Thomassé [2] . Very recently, Matte Bon and Tsankov [24] completely answered the query of Glasner and Weiss for uniformly recurrent subgroups of discrete and locally compact groups. The next result of the paper is about the existence of invariant measures on -proper Bernoulli subshifts. For a long time all finitely generated groups that had been known to have free Bernoulli subshifts were residually-finite. Then Dranishnikov and Schroeder [15] constructed a free Bernoulli subshift for any torsion-free hyperbolic group. Somewhat later Gao, Jackson and Seward proved that any countable group has free Bernoulli subshifts [16], [17]. On the other hand, Hjorth and Molberg [20] proved that for any countable group there exists a free continuous action of on a Cantor set admitting an invariant probability measure. We will prove the following result.
Theorem 2**.**
Let be a finitely generated group and be a sofic URS (see Definition 4.1) then there exists a -proper Bernoulli shift with an invariant probability measure. In particular, for every finitely generated sofic group there exists a free Bernoulli subshift with an invariant probability measure.
Immediately after the first version of our paper appeared, using a measurable version of the Local Lemma, Bernhsteyn [5] proved that free Bernoulli subshift admitting an invariant probability measure exists for any countable group. He also noted that this result follows from a deep theorem of Seward and Tucker-Drob [26]. We can actually characterize those uniformly recurrent subgroups for which all the -proper actions admit invariant probability measures (Theorem 6).
The second part of the paper is about -algebras. For any finitely generated group and uniformly recurrent subgroup , we associate a separable -algebra . For any group , if , the associated -algebra is just the reduced -algebra of the group. It is known that the reduced -algebra of a group is simple if and only if the group admits no non-trivial amenable uniformly recurrent subgroups [22]. We prove (Theorem 7) that if the URS is generic (see Subsection 2.3) then the -algebra is always simple. Using the coloring scheme developed in the first part of the paper, we will show how to construct generic URS’s from a single infinite graph of bounded vertex degrees. By this construction we obtain examples of generic URS’s with nuclear (Theorem 8) and exact( but not nuclear) -algebras (Proposition 7.1). Finally, we will construct a generic for which the simple -algebra is not locally-reflexive (hence not exact). In fact, this algebra admits both a uniformly amenable and a non-uniformly amenable trace. We will see that the URS above is not Borel equivalent to a free minimal action of any countable group.
2 Schreier graphs
2.1 The space of rooted Schreier graphs
Let be a finitely generated group with a generating system . Let Then the Schreier graph associated to is constructed as follows.
- •
The vertex set of the Schreier graph of is the coset space (that is the group acts on the vertex set of the Schreier graphs on the left).
- •
The vertices corresponding to the cosets and are connected by a directed edge labeled by the generator if , or by if (note that we allow loops and multiply labeled directed edges).
The coset class of is called the root of the Schreier graph associated to . The set of all rooted Schreier graphs will be denoted by . So, we have a map such that is the rooted Schreier graph associated to the subgroup . We will consider the usual shortest path distance on the graph and denote the ball of radius around the root by Note that is a rooted edge-labeled graph. The space of all Schreier graphs is a compact metric space, where
[TABLE]
if is the largest integer for which the -balls and
are rooted-labeled isomorphic. We can define the action of the group on the compact metric space in the following way. If and , then
[TABLE]
The graph can be regarded as the same graph as with the new root . We will use the root-change picture of the -action on later in the paper. If is a Schreier graph and is another vertex of , then will denote the Schreier graph with underlying labeled graph and root . In this case is isomorphic to as rooted Schreier graphs. Clearly, , is a homeomorphism commuting with the -actions defined above. Let , then is a closed -invariant subspace of rooted Schreier graphs.
2.2 Schreier graphs and uniformly recurrent subgroups
Proposition 2.1**.**
Let and be as above, and be the corresponding rooted Schreier graph. Then for any and there exists such that for any , there is a so that
- •
**
- •
The rooted labeled balls and are isomorphic.
Conversely, if has the repetition property as above, then its orbit closure in is a uniformly recurrent subgroup.
Proof.
We proceed by contradiction. Suppose that there is some such that for all there exists such that if , then and are not isomorphic. Let be a rooted Schreier graph that is a limitpoint of the sequence of rooted Schreier graphs . Then, if , the rooted balls and are not isomorphic. Hence, the orbit closure of in the -space does not contain the Schreier graph in contradiction with the minimality of .
Now we prove the converse. Let be a subgroup satisfying the condition of our lemma. Let be elements of the orbit closure of . It is enough to show that the orbit closure of contains . Let be an integer. We need to show that there exists such that is rooted-labeled isomorphic to Since is in the orbit closure of , we have such that is rooted-labeled isomorphic to By our condition, if is in the orbit closure of , there exists so that is rooted-labeled isomorphic to . This finishes the proof of our proposition. ∎
2.3 Genericity
Let be as above and be a URS. We say that is generic if for every , the coset space and the orbit of in are -isomorphic sets under the map , . That is, all the elements of are self-normalizing subgroups. We will give several examples of generic URS’s in Section 5.
Proposition 2.2**.**
Let be a generic URS of . Then for each , That is, is a -proper system, where is the conjugation action of on . Hence, the stability system of a generic is itself.
Proof.
Let . Then by genericity, is the stabilizer of the root in , that is, Also, if , then fixes the root of every element of that is close enough to , hence ∎
Proposition 2.3**.**
The uniformly recurrent subgroup is generic if and only if the following statement holds. For any there exists such that if , , , then the rooted balls and are not rooted-labeled isomorphic.
Proof.
Suppose that for any , there exists and such that
- •
- •
the -balls around and are rooted-labeled isomorphic.
Let be a limitpoint of the sequence in . Then, there exists , so that and are rooted-labeled isomorphic. Hence is not a bijective map. On the other hand, it is clear that if the condition of our proposition is satisfied for any , then is always bijective, hence is generic. ∎
2.4 The Bernoulli shift space of uniformly recurrent subgroups
Let be as in the previous subsection, and let be a finite alphabet. A rooted -colored Schreier graph of is the rooted Schreier graph equipped with a vertex-coloring . Let be the set of all rooted -colored Schreier-graphs. Again, we have a compact, metric topology on :
[TABLE]
if is the largest integer such that the -balls around the roots of the graphs and are rooted-colored-labeled isomorphic. We define if the -balls around the roots are nonisomorphic and even the colors of the roots are different. Again, acts on the compact space by the root-changing map. Hence, we have a natural color-forgetting map that commutes with the -actions. Notice that if a sequence converges to , then for any there exists some integer such that if then the -balls around the roots of the graph and the graph are rooted-colored-labeled isomorphic. Let and be a vertex coloring that defines the element . Then of course, if . On the other hand, if and then we have the following lemma that is immediately follows from the definitions of the -actions.
Lemma 2.1**.**
Let and . Then there exists a colored-labeled graph-automorphism of the -colored labeled graph moving the vertex representing to the vertex representing .
Note that we have a continuous -equivariant map , where Let be a URS of . We say that the element is -regular if and , where is the left action of on . Note that if and is a -coloring the Schreier graph , then by Lemma 2.1, is -regular if and only if there is no non-trivial colored-labeled automorphism of .
Proposition 2.4**.**
Let be a closed -invariant subset consisting of -regular elements. Let be a minimal -subsystem. Then is -proper, that is, for any , . Also, .
Proof.
Let . Then by -regularity fixes the root of . Therefore, fixes the root of provided that is small enough. Thus, . Since is a -equivariant continuous map and is a closed -invariant subset, . ∎
Definition 2.1**.**
Let be as above and be a finite alphabet. Let be the -invariant subset of all elements of such that the underlying Schreier graph is in . We call the -Bernoulli shift space of . A closed -invariant subset of is called a Bernoulli subshift of .
Note that if , then -properness is just the classical notion of -freeness, and the -subshifts are the Bernoulli subshifts of .
3 Lovász’s Local Lemma and the proof of Theorem 1
Let be a URS of . By Proposition 2.4, it is enough to construct a closed -invariant subset for some alphabet such that all the elements of are -proper. This will give us a bit more than just a continuous action having stability system , will be a minimal -proper Bernoulli subshift. It is quite clear that the stability system of a minimal -proper Bernoulli subshift is always itself. Let and consider the Schreier graph . Following [2] and [3] we call a coloring nonrepetitive if for any path in there exists some such that We call all the other colorings repetitive.
Theorem 3**.**
[Theorem 1 [3]] For any there exists a constant such that any graph (finite or infinite) with vertex degree bound has a nonrepetitive coloring with an alphabet , provided that .
Proof.
Since the proof in [3] is about edge-colorings and the proof in [2] is in slightly different setting, for completeness we give a proof using Lovász’s Local Lemma, that closely follows the proof in [3]. Now, let us state the Local Lemma.
Theorem 4** (The Local Lemma).**
Let be a finite set and be a probability distribution on the subsets of . For let be a set of events, where an “event” is just a subset of . Suppose that for all , . Let . Suppose that there are real numbers and , such that the following conditions hold:
- •
for any event there exists a set with for all such that is independent of
- •
* for all *
Then .
Let be a finite graph with maximum degree . It is enough to prove our theorem for finite graphs. Indeed, if is a connected infinite graph with vertex degree bound , then for each ball around a given vertex we have a nonrepetitive coloring. Picking a pointwise convergent subsequence of the colorings we obtain a nonrepetitive coloring of our infinite graph .
Let be a large enough number, its exact value will be given later. Let be the set of all random -colorings of . Let and for and for any path of length let be the event that is repetitive. Set
[TABLE]
Then . The number of paths of length that intersects a given path of length is less or equal than . So, we can set . Let . Since , we have that . In order to be able to apply the Local Lemma, we need that for any
[TABLE]
That is
[TABLE]
or equivalently
[TABLE]
Since the infinite series converges to , we obtain that for large enough , the conditions of the Local Lemma are satisfied independently on the size of our finite graph . This ends the proof of Theorem 3. ∎Let and let be a nonrepetitive -coloring that gives rise to an element . The following proposition finishes the proof of Theorem 1.
Proposition 3.1**.**
All elements of the orbit closure of in are -regular.
Proof.
Let with underlying Schreier graph and coloring . Since is a URS, . Indeed, is a closed -invariant set and . Clearly, if . Now suppose that and (that is is not -proper). By Lemma 2.1, there exists a colored-labeled automorphism of the graph moving to . Note that if is a vertex of , then . Indeed, if a labeled automorphism of a Schreier graph fixes one vertex, it must fix all the other vertices as well. Now we proceed similarly as in the proof of Lemma 2 [3] or in the proof of Theorem 2.6 [2]. Let be a vertex such that there is no such that . Let be a shortest path between and . For , let Then let Since is a colored-labeled automorphism, for any
[TABLE]
Lemma 3.1**.**
The walk is a path.
Proof.
Suppose that the walk above crosses itself, that is for some , . If then On the other hand, if then Therefore, is a path. ∎By (1) and the previous lemma, the -colored Schreier-graph contains a repetitive path. Since is in the orbit closure of , this implies that contains a repetitive path as well, in contradiction with our assumption. ∎
4 Sofic groups, sofic URS’s and invariant measures
4.1 Sofic groups
First, let us recall the notion of a finitely generated sofic group. Let be a finitely generated infinite group with a symmetric generating system and a surjective homomorphism from the free group with generating system mapping to . Let be the Cayley graph of with respect to the generating system , that is the Schreier graph corresponding to the subgroup . Let be a sequence of finite -Schreier graphs. We call a vertex a -vertex if there exists a rooted isomorphism
[TABLE]
such that if is a directed edge in the ball labeled by , then the edge is labeled by . We say that is a sofic approximation of , if for any and a real number there exists such that if then there exists a subset consisting of -vertices such that . A finitely generated group is called sofic if the Cayley-graphs of admit sofic approximations. Sofic groups were introduced by Gromov in [19] under the name of initially subamenable groups, the word “sofic” was coined by Weiss in [30]. It is important to note that all the amenable, residually-finite and residually amenable groups are sofic, but there exist finitely generated sofic groups that are not residually amenable (see the book of Capraro and Lupini [14] on sofic groups). It is still an open question whether all groups are sofic.
4.2 Sofic URS’s and the proof of Theorem 2
We can extend the notion of soficifty from groups to URS’s in the following way. Let ,, be as above and let be a uniformly recurrent subgroup. Again, let be a sequence of finite -Schreier graphs. We call a vertex be a -vertex if there exists a rooted isomorphism , where such that if is a directed edge in the ball labeled by , then the edge is labeled by . Similarly to the case of groups, we say that is a sofic approximation of the uniformly recurrent subgroup if or any and a real number there exists such that if then there exists a subset consisting of -vertices such that .
Definition 4.1**.**
A uniformly recurrent subgroup is sofic if it admits a sofic approximation system (note that soficity does not depend upon the choice of the generating system)
In Section 5 we will construct a large variety of generic and non-generic URS’s. The rest of this subsection is devoted to the proof of Theorem 2. Let be a sofic URS and be a sofic approximation of . Using Theorem 3, for each let us choose a nonrepetitive coloring , where . We can associate a probability measure on the space of -colored -Schreier graphs , where is the generating system of the free group . Note that the origin of this construction can be traced back to the paper of Benjamini and Schramm [7]. For a vertex we consider the rooted -colored Schreier graph . The measure is defined as
[TABLE]
where is the Dirac-measure on concentrated on the rooted -colored Schreier graph . Clearly, is invariant under the action of . Since the space of -invariant probability measures on the compact space is compact with respect to the weak-topology, we have a convergent subsequence converging weakly to some probability measure . We consider the -Bernoulli shift space as an -space, where for and
[TABLE]
where is the left -action on . Hence, we have an injective -equivariant map .
Lemma 4.1**.**
The probability measure is concentrated on the -invariant closed set of nonrepetitive -colorings in .
Proof.
Let be the clopen set of -colored Schreier graphs such that the ball is not rooted-labeled isomorphic to for some . By our assumptions on the sofic approximations, hence Now let be the clopen set of -colored Schreier graphs such that the ball contains a repetitive path. By our assumptions on the colorings , for any . Hence . Therefore is concentrated on . ∎
Now we can finish the proof of Theorem 2. We can identify with a -invariant closed subset of on which the -action is -proper by Proposition 3.1. That is, our construction gave rise to a -proper Bernoulli subshift with an invariant measure. ∎
Note that we have a -equivariant continuous map from the -proper space above to itself mapping into . Recall that a -invariant measure on is called an invariant random subgroup.
Proposition 4.1**.**
Any sofic URS admits an invariant measure.
Recall that a -invariant measure on is called an invariant random subgroup [1]. Example 3.3 in [18] shows that there exists a uniformly recurrent subgroups that does not admit invariant random subgroups, hence is not sofic. In Section 5, we provide further examples of uniformly recurrent subgroups that does not carry invariant measures.
5 Coamenable uniformly recurrent subgroups
5.1 Colored graphs
Let be the -fold free product of cyclic groups of rank , with free generators . Let be an arbitrary infinite, simple connected graph of bounded vertex degrees and a proper edge-coloring by -colors . Observe that the edge-coloring of (and picking an arbitrary root) gives rise to a -Schreier graph . The action of on is defined the following way. If and , then
- •
If there is no -colored edge adjacent to , then .
- •
If there there exists an edge colored by , then .
Let be the orbit closure of the rooted Schreier graph above. Then it contains a minimal system . Then is a uniformly recurrent subgroup, where is the map defined in Subsection 2.1.
Proposition 5.1**.**
For any infinite simple, connected graph of bounded vertex degree, there exists and a edge-coloring of with colors such that all the uniformly recurrent subgroups that can be obtained as above are necessarily generic.
Proof.
First, consider an arbitrary proper edge-coloring and a proper nonrepetitive vertex-coloring by some finite sets and (the product of a nonrepetitive and a proper vertex-coloring is always a proper nonrepetitive vertex-coloring). Now we construct a new proper edge-coloring of by the set , where is the set of -elements subset of . Let , where are the endpoints of . Since is proper, . Hence we obtain a Schreier graph , where and Let be a minimal subsystem in the orbit closure of . By Proposition 2.3, it is enough to show that if and , then and are not rooted-labeled isomorphic. We construct a nonrepetitive vertex-coloring in the following way. If , let , where is the unique element in the intersection of the -components of the edges adjacent to . If , then let , where the -component of is and , for the only neighbour of . Since is in the orbit closure of , the coloring is nonrepetitive, hence by Proposition 3.1, and are not rooted-labeled isomorphic. ∎.
5.2 Coamenability
Let be a finitely generated group and . Recall that is coamenable if the action of on is amenable. That is, there exists a sequence of finite subsets such that for any ,
[TABLE]
We call a URS coamenable if for all , is coamenable.
Proposition 5.2**.**
Let be a URS such that there exists so that is coamenable. Then is coamenable.
Proof.
Fix a generating system for . Let be finite subsets in such that for any , Let and such that if then contains Let . Since is a URS, for any , there exists such that is rooted-labeled isomorphic to . For , let be the image of by the isomorphism above. If then provided that is large enough (depending on ). Hence, ∎
Let be an arbitrary graph that is amenable in the sense that there exists a sequence of subsets such that where if either or there exists adjacent to . Repeating the proof of the previous proposition one can immeadiately see that all the -URS’s constructed from as in Subsection 5.1 are coamenable. Barlow [Proposition 4.[4]] has shown that for any there exists a bounded degree infinite graph and positive constants and such that
[TABLE]
holds for all . Such graphs are clearly amenable. Hence we can see that as opposed to finitely generated group case, for any there exist generic coamenable uniformly recurrent subgroups so that the volume growth rate of the individual Schreier graphs are always .
5.3 Coamenable uniformly recurrent subgroups are sofic
The following theorem (or rather the construction in the proof) will be crucial in Section 9.
Theorem 5**.**
Let be a finitely generated group and be a coamenable URS. Then is sofic.
Proof.
Fix a generating system . Again, let be the free group with free generating system and be the corresponding quotient map. Every continuous action of can be regarded as a -action . In particular, we have a -invariant embedding Now let and consider the Schreier graph . Since is coamenable, the isoperimetric constant of is zero, that is, we have a sequence of finite induced subgraphs so that
[TABLE]
where is the set of vertices in for which there exists
with or for some . Now we construct a sequence of -Schreier graphs that form a sofic approximation of :
- •
.
- •
If for some , then .
- •
Then the action of is extended to the set arbitrarily.
Let be the set of vertices for which . Clearly, if then is rooted-labeled isomorphic to . That is, all the vertices of are -vertices. Since, , we have that . Hence the Schreier graphs form a sofic approximation of the URS Z. ∎As in Subsection 4.2, for each we have an -invariant probability measure on
[TABLE]
Let be a weakly convergent sequence converging to an -invariant measure on . By our previous lemma, the measure is concentrated on . Note that the probability measure depends only on the sequence of subgraphs . We say that the sequence of subgraphs is convergent in the sense of Benjamini and Schramm if the associated probability measures converge to some invariant measure on . In this case the measure preserving action is called the limit of the sequence . Also note, that if is a generic URS, then is a totally nonfree action in the sense of Vershik [29].
5.4 A characterization of coamenability
As in the previous sections let be a finitely generated group with generating system and be a URS. The goal of this subsection is to prove the following characterization of coamenability.
Theorem 6**.**
The URS is coamenable if and only if every -proper continuous action of admits an invariant measure.
Proof.
First, let be coamenable and be a continuous -proper action. Let and Then the orbit graph of is isomorphic to . Let be a sequence of finite sets such that for any ,
[TABLE]
Now we proceed in exactly the same way as in the proof of the classical Krylov-Bogoliubov Theorem. Fix an ultrafilter on the natural numbers and let be the corresponding ultralimit. We define a bounded linear functional in the following way. For a continuous function set
[TABLE]
Then, by (3), for all , , therefore is a -invariant bounded functional associated to a -invariant Borel probability measure . Now, let be a URS that is not coamenable and let . Then the graph has positive isoperimetric constant so by Theorem 3.1 [9], we have maps , so that and there exists a positive constant so that for all
[TABLE]
Now we build a vertex-coloring for the graph to encode and . First, we pick a nonrepetitive coloring , where is some finite set. Then we choose a coloring for some finite set so that , whenever
[TABLE]
We need two more colorings of the vertices of :
[TABLE]
and
[TABLE]
satisfying the following properties. If there exists so that and , then . If such does not exist, set . If there exists so that and , then . If such does not exist, set . Let . Our final coloring is defined by
[TABLE]
Let be the orbit closure of the -colored graph in the space Observe that is nonrepetitive since even its first component is nonrepetitive, that is the action on is -proper. Now we need to show that admits no -invariant measure. We define continuous injective maps and such that
- •
- •
For each ,
Thus the equivalence relation defined by the action is compressible, so it cannot admit an invariant measure [10]. The construction of and goes as follows. If , then is well-defined and there exist a unique and a unique such that
- •
,
- •
, .
We set , , Clearly, and are continuous and ∎
Let be as above and be a URS that is not coamenable and is a -proper action without invariant measure as above. Let be a minimal -proper -Bernoulli subshift. Let be the -fold free product of the finite group of two elements with free generator system . Then we can associate to a nonsofic generic URS in the following way. Let be an element of . Let . We define an action of the group as follows. The group acts on as acts on . Also, the group acts on trivially. If , , then and . Otherwise, let and . It is not hard to see that the resulting -Schreier graph satisfies the conditions of Proposition 2.1 and 2.3, hence the associated URS is generic and does not admit invariant measures.
6 The -algebras of uniformly recurrent subgroups
6.1 The algebra of local kernels
Let be a finitely generated group with generating system and be a URS of . Let and be the Schreier graph of . A local kernel is a function satisfying the following properties.
- •
There exists an integer (depending on ) such that if .
- •
If is rooted-labeled isomorphic to then provided that .
We will call the smallest satisfying the two conditions above the width of . It is easy to see that the local kernels form a unital -algebra with respect to the following operations:
- •
- •
- •
.
By minimality, the algebra does not depend on the choice of or the generating system only on the URS itself. We will call the concrete realization of the algebra of local kernels az above the representation of on . One can observe that if consists only of the unit element, then is the complex group algebra of .
6.2 The construction of
Let be a finitely generated group (with a fixed generating system ) and be a URS. Let and consider the algebra as above represented on the vector space . The we have a bounder linear representation of on by
[TABLE]
where .
Definition 6.1**.**
The -algebra of , is defined as the norm closure of in .
Note that we used a specific subgroup in order to equip the algebra with a norm. However, we have the following proposition.
Proposition 6.1**.**
The norm on and hence the definition of does not depend on the choice of the subgroup .
Proof.
Let be a local kernel of width and let . Let respectively be the representation of on respectively on . We need to show that . Let and such that is supported on a ball and Observe that is supported on the ball and By Proposition 2.1, there exists such that the balls and are rooted-labeled isomorphic. Hence, there exists supported on , such that Therefore, . Similarly, , that is, .∎
6.3 The -algebras of generic URS’s are simple
The goal of this section is to prove the following theorem.
Theorem 7**.**
Let be as above and be a generic URS. Then the -algebra is simple.
Proof.
Let . For each we define an equivalence relation on in the following way. If , then if the balls and are rooted-labeled isomorphic. The following lemma is a straightforward consequence of Proposition 2.1 and Proposition 2.3.
Lemma 6.1**.**
Let be the equivalence relation as above. Then:
For any there exists such that if and , then 2. 2.
For every there exists such that for any the ball intersects all the equivalence classes of (in particular, the number of equivalence classes is finite). 3. 3.
If , then implies . 4. 4.
Let denote the classes of . Then we have an inverse system of surjective maps
[TABLE]
and a natural homeomorphism , between the compact space and the uniformly recurrent subgroup .
Note that if , then is the clopen set of Schreier graphs , , such that the ball is rooted-labeled isomorphic to the ball , where
Now let us consider the commutative -algebra . For any and we have a projection , where if and zero otherwise. The projections generates a *-subalgebra in and by the previous lemma the closure of in is isomorphic to (the -algebra of continuous complex-valued functions on the compact metrizable space ). Indeed, under this isomorphism , is the characteristic function of the clopen set . It is easy to see that the isomorphism commutes with the respective -actions. Now let us consider the representation of on . For let , be the kernel of . We have a bounded linear map given by
[TABLE]
Lemma 6.2**.**
For any ,
Proof.
Let , . For any we have that
[TABLE]
[TABLE]
Therefore ∎Observe that we have a natural injective homomorphism defined in the following way.
- •
- •
if .
Clearly, is preserving the norm, so we can extend it to a unital embedding Also, we have a map such that , whenever and otherwise.
Lemma 6.3**.**
For any ,
First, we have that
[TABLE]
Hence, if and otherwise. Therefore, ∎
Lemma 6.4**.**
For any and
[TABLE]
Proof.
On one hand, if ,
otherwise On the other hand,
[TABLE]
Also, if . ∎
Let us consider the linear operator such that for , if . The operator is bounded with norm since
[TABLE]
Lemma 6.5**.**
Let . Then provided that is large enough.
Proof.
Let be the width of and let be so large that if and , then . Then, if we have that if or , otherwise . Therefore, ∎
Lemma 6.6**.**
Let . Then
Proof.
Let such that . Then, by the previous lemma , provided that is large enough. Since , we have that ∎
Lemma 6.7**.**
Let be a closed ideal. Suppose that . Then .
Proof.
Recall that , so by Lemma 6.4 we have a nonzero, -invariant closed ideal in . However, any -invariant closed ideal in is in the form of , where is a -invariant closed set in and is the set of continuous functions vanishing at . By minimality, must be empty, hence contains the unit, that is, . ∎
Now, we finish the proof of our theorem. Let be a closed ideal of and . Then and . Since and for any , we have that . ∎
Remark Let be a not necessarily generic URS, where is a finitely generated group as above. Let be a minimal -proper Bernoulli subshift. Then the local kernels on can be defined using the rooted-labeled-colored neighborhoods and the resulting -algebra is always simple.
7 Exactness and nuclearity
7.1 Property A vs. Local Property A
First let us recall the notion of Property from [25]. Let be an infinite graph of bounded vertex degrees. We say the has Property A if there exists a sequence of maps such that
- •
Each has length .
- •
If , then
- •
For any we have such that the vector is supported in the ball .
We also need the notion of the uniform Roe algebra of the graph . First, we consider the -algebra of bounded kernels , that is
- •
there exists some positive integer depending on such that if ,
- •
there exists some positive integer depending on such that
.
The uniform Roe algebra is the norm closure of the bounded kernels in . Observe that if is a unformly recurrent subgroup and , , then . According to Proposition 11.41 [25], if has Property then the algebra is nuclear. All -subalgebras of a nuclear -algebra are exact, hence we have the following proposition.
Proposition 7.1**.**
Let and as above, such that has Property . Then is exact.
Example: Let be the underlying graph of the Cayley graph of an exact group (say, a hyperbolic group or an amenable group) and let be a colored graph associated to a generic URS as in Proposition 5.1. Then by the previous proposition, is a simple exact -algebra.
Now we introduce the notion of Schreier graphs with Local Property .
Definition 7.1**.**
Let be a Schreier graph. We say that has Local Property , if the sequence can be chosen locally, that is for any , there exists so that for the balls and are rooted-labeled isomorphic under the map , then .
The main result of this section is the following theorem.
Theorem 8**.**
Let be a finitely generated group, a uniformly recurrent subgroup and so that has local Property A. Then is nuclear.
Proof.
We closely follow the proof of Proposition 11.41 [25]. The nuclearity of the uniform Roe algebra for a graph having Property has been proved the following way (we will denote by the vertex set of ). First, a sequence of unital completely positive maps were constructed, where is the algebra of -matrices. Then, a sequence of unital completely positive maps were given in such a way that tends to the identity in the point-norm topology. Hence, the nuclearity of the uniform Roe algebra follows. It is enough to see that maps the subalgebra into and maps into . Then the nuclearity of automatically follows. So, let us examine the maps . For each , we choose such that for all . Then, for each we choose a subset of size “locally”. That is, if and are rooted-labeled isomorphic under the map , then . Now for each let be the orthogonal projection. We set
[TABLE]
by mapping to in the same way as in [25]. The only difference between the approach of us and the one of [25] is the local choice of the projections . Clearly, if is a local kernel, then , where is the algebra defined in Subsection 6.3. Hence, maps the algebra into .
The maps are defined by mapping , to , where denotes the operator of pointwise multiplication by the function . By the definition of Local Property A, the vectors are a priori locally defined, hence maps into . That is, maps into . Now our theorem follows. ∎
7.2 Two examples for Local Property
A tracial example. Let be the generic URS constructed at the end of Subsection 5.2. That is, if , then is a colored graph satisfying
[TABLE]
uniformly for some positive constants and .
Proposition 7.2**.**
The graph has Local Property .
Proof.
For a fixed vertex the unit vector is defined the following way.
- •
if .
- •
otherwise.
Lemma 7.1**.**
Let be arbitrary adjacent vertices. Then
Proof.
Let be a bound for the vertex degrees of and let
[TABLE]
We can suppose that . Then we have that
[TABLE]
Now, . Therefore,
[TABLE]
hence our lemma follows. ∎
Thus, in order to prove our proposition, it is enough to show that for every , there exists such that for each
[TABLE]
Note that (4) implies that has the doubling condition, hence (5) follows from Theorem 4 [28]. ∎
A non-tracial example. Let be a -regular tree. It is well-known that has Property . The construction goes as follows. First, we pick an infinite ray towards the infinity. Then for each , there is a unique adjacent vertex towards (if , ). Then for a vertex , we choose the path
[TABLE]
The unit vector is associated to the path as above, that is if and otherwise.
Proposition 7.3**.**
One can properly color by finitely many colors to obtain a Schreier graph of Local Property that generates a generic URS.
Proof.
Our goal is to choose a coloring that encodes . First, pick any finite proper coloring for some finite set such that if and the distance of and is less than . Now we recolor the edge by . Hence, we obtained a proper coloring such that is encoded in the coloring so the paths (and thus the unit vectors ) can be chosen locally. Now let be the coloring given in Proposition 5.1. Then provides a proper coloring of , such that the resulting Schreier graph has Local Property and generates a generic . ∎
8 The Feldman-Moore construction revisited
Let be a measure preserving action of a finitely generated group on a standard probability measure space . The following construction is due to Feldman and Moore [13]. We call a bounded measurable function an -kernel if
- •
implies that and are on the same orbit.
- •
There exists a constant such that if and are on the orbit graph , then implies that
The -kernels for the unital -algebra , where
- •
- •
.
- •
The trace function is defined on by
[TABLE]
Then, by the GNS-construction we can obtain a tracial von Neumann-algebra in such a way that the trace on is the extension of . Let us very briefly recall the construction. We define a pre-Hilbert space structure on by . Then defines a map of into . Then is the weak closure of the image. In particular, converges to weakly if and only if for any , Now, let be a URS and be a -invariant Borel probability measure on . Again, denotes the -action on . By definition, we have a natural homomorphism: .
Proposition 8.1**.**
The map is injective and is weakly dense in the von Neumann algebra . Furthermore, the map extends to a continuous embedding .
Proof.
First note, that if is an -kernel, then can be written as , where
- •
For any , is a bounded -measurable function.
- •
is supported on the diagonal and .
- •
and if , otherwise .
Let . In order to prove that is injective, it is enough to show that . Let
[TABLE]
Then is a nonempty open set, so by minimality of the action , since is -invariant. Therefore, . Now we show that is weakly dense in the von Neumann algebra .
Lemma 8.1**.**
Let , such that
- •
**
- •
**
- •
For -almost every , for all .
then holds for any pair , hence by the GNS-construction weakly converges to .
Proof.
Recall that
[TABLE]
By our condition, for almost every ,
[TABLE]
hence by Lebesgue’s Theorem
[TABLE]
Now, let . We need to find a sequence that weakly converges to . Let . By Lemma 6.1, for every we have a clopen set such that and forms a partition of . Furthermore, if is an open set, then we have a sequence so that
[TABLE]
and
[TABLE]
Since is homeomorphic to the Cantor set and is a Borel measure, for any -measurable set we have a sequence of open sets such that
[TABLE]
-almost everywhere. Therefore, by (6) and (7), for any , we have a uniformly bounded sequence of functions tending to almost everywhere, such that for any , . For , let Then for -almost every
[TABLE]
provided that . Therefore by Lemma 8.1, weakly converges to . Hence, is weakly dense in and thus is weakly dense in as well. Now we prove that extends to First note that is a continuous trace on extending . Indeed, Let be the von Neumann algebra obtained from by the GNS-construction using the continuous trace . The weak closure of in is isomorphic to , hence it is enough to prove that is weakly dense in . Let , , such that in norm. Then by the continuity of the trace, Hence is in fact weakly dense in . ∎
9 Coamenability and amenable traces
9.1 Amenable trace revisited
First, let us recall the notion of amenable traces from [6]. Let be a -algebra of bounded operators on the standard separable Hilbert space . Let be a sequence of finite dimensional projections in such that
- •
For any
[TABLE]
- •
[TABLE]
defines a continuous trace on , where for Hilbert-Schmidt operators.
Then is called an amenable trace. Now let be a finitely generated group as above and be a coamenable generic URS. Let , and consider the usual representation of on by kernels. Let be a sequence of induced subgraphs in such that Also, let us suppose that the sequence is convergent in the sense of Benjamini and Schramm as defined in Subsection 5.3. Observe that convergence means that for any and
[TABLE]
exists and (see Subsection 6.3) , where the -invariant probability measure on is the limit of the sequence . We define the amenable trace similarly as in [11]. For , let be the orthogonal projection.
Proposition 9.1**.**
For any
[TABLE]
exists and (as defined in Subsection 8). Also, for any ,
[TABLE]
hence is an amenable trace.
Proof.
Let us start with a simple observation.
Lemma 9.1**.**
Let be a sequence of maps such that
- •
There exists , , for any and .
- •
* where*
[TABLE]
Then
Lemma 9.2**.**
Let . Then
[TABLE]
Proof.
First we have that
[TABLE]
[TABLE]
For , let be defined in the following way. if , otherwise, That is, for any , is a trace-class operator. Now, we have that
[TABLE]
[TABLE]
Sublemma 9.1**.**
Both the sequences
[TABLE]
satisfy the conditions of our Lemma 9.1.
Proof.
Notice that
[TABLE]
Observe that implies that , , . Since our sublemma immediately follows. ∎
Repeating the arguments of our sublemma it follows that
[TABLE]
[TABLE]
[TABLE]
since , are trace-class operators. ∎
Now let and . Let such that . By the previous lemma, there exists such that if , then . We have that
[TABLE]
and
[TABLE]
Therefore, if , . Hence our proposition follows. ∎
9.2 Uniformly amenable traces
Recall from [6] that an amenable trace is uniformly amenable if the resulting von Neumann algebra is hyperfinite. Let be the Benjamini-Schramm limit of the graph sequence as in the previous subsection. Since is dense in , is a uniformly amenable trace if and only if the equivalence relation generated by the action is hyperfinite. By Theorem 1. [12], the equivalence relation above is hyperfinite if and only if is a hyperfinite graph sequence. That is, for any there exists such that for any one can remove from the graph edges in such a way that all the components of the remaining graph has at most elements. Therefore we have the following proposition.
Proposition 9.2**.**
Let be a generic URS and . If admits a convergent hyperfinite sequence of finite subgraphs such that , then has a uniformly amenable trace. If admits a convergent nonhyperfinite sequence of finite subgraphs such that , then has a non-uniformly amenable trace, that is, by Theorem 4.3.3. is not locally reflexive, hence it is a nonexact -algebra.
10 A nonexact example
10.1 The construction
In Section 4.3.3 of [8], we constructed a Schreier graph of a group such that that the orbit closure of is a generic URS. Also, contains a convergent, hyperfinite sequence of finite subgraphs with and a convergent nonhyperfinite sequence of finite subgraphs with . Let be the orbit closure of in . Then by Proposition 9.2, is not a locally reflexive (hence nonexact) simple, unital separable -algebra with both uniform amenable and non-uniform amenable traces. For completeness, we present a somewhat slicker construction, that is very similar to the one given in [8] Step 0. For , let be the cycle of length . Let be the free group of three cycle groups of rank . Let be a sequence of finite index normal subgroups. For let be the underlying graph of the Cayley-graph of . That is, the sequence itself is a convergent nonhyperfinite sequence of finite graphs. Step 1. Let and . Step n. Let us suppose that the graphs , and are already defined in such a way that
- •
If , then for some , for some .
- •
For any we have disjoint subsets
so that
[TABLE]
- •
We have positive integers such that for any
[TABLE]
for all
- •
The graph is constructed in such a way that for any a copy of is connected to all the vertices of . The graph is constructed in such a way that for any a copy of is connected to all the vertices of . Connecting a graph to a graph means that we add a disjoint copy of to plus an extra edge beween a vertex of and a vertex of .
Now we construct the graphs and . We pick a graph and in such a way that
[TABLE]
We define as the maximum of the diameters of the graphs and . Now we use the fact that we have normal covering maps and . For , set and . That is,
[TABLE]
Now for any , we connect a copy of to the vertices of and a copy of to the vertices of . Finally, we connect a copy of to a single vertex of not covered by any and a copy of to a single vertex of not covered by any . Then we set , . Then, for any , and , for all and . Also, we have that
[TABLE]
Now, we have graphs and set . By the self-similar nature of our construction, it is easy to see that for any and , there exists such that if , then there is a such that and are isomorphic as rooted graphs. Notice that are forming a hyperfinite sequence of subgraphs. so that . Also, we have subgraphs , ,…connected by one single edge to , that are forming such a sequence of finite graphs that no subsequence of them is hyperfinite and . Indeed, in the construction , and the sequence of finite graphs is a large girth graph sequence so no subsequence of can be hyperfinite (since that would mean that a subsequence of is hyperfinite as well). Now we can apply the coloring construction of Proposition 5.1 to obtain the colored graph (and hence a URS we are sought of. In the graph there is a convergent hyperfinite sequence of finite subgraphs with and there is a convergent nonhyperfinite sequence of finite subgraphs with
10.2 Two more interesting properties of the nonexact URS
Let be the generic URS constructed above.
Proposition 10.1**.**
There is no free continuous action of any countable group that is Borel orbit equivalent to .
Proof.
Suppose that is Borel orbit equivalent to a free continuous action of the countable group . If is amenable, then any invariant measure of the action makes the equivalence relation hyperfinite. However, admits invariant measure that makes it a nonhyperfinite measurable equivalence relation. If is nonamenable then all the invariant measures make the equivalence relation of the action nonhyperfinite. However, has an invariant measure that makes its equivalence relation hyperfinite (see also [20] for a minimal action of a group that is not Borel equivalent to a free continuous action). ∎
If then their Schreier graphs are locally indistinguishable. However, it is possible that their Schreier graphs look globally quite different.
Proposition 10.2**.**
There exists such that is one-ended and is two-ended.
Proof.
Clearly, there must be an element in such that the underlying graph of is isomorphic to the graph in our construction and is clearly one-ended. Now we pick a sequence of points . Consider a limitpoint of the rooted Schreier graphs in the compact space . It is easy to see that has multiple ends. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Abért, Y. Glasner and B. Virág , Kesten’s theorem for Invariant Random Subgroups. Duke Math. J. 163 (2014) 465–488.
- 2[2] N. Aubrun, S. Barbieri and S. Thomassé , Realization of aperiodic subshifts and uniform densities in groups. (preprint, https://arxiv.org/pdf/1507.03369.pdf).
- 3[3] N. Alon, J. Grytczuk, M. Haluszczak and O. Riordan , Nonrepetitive colorings of graphs. Random Structures and Algorithms 21 (2002), no.3-4, 336–346.
- 4[4] M.T. Barlow , Which values of the volume growth and escape time exponent are possible for a graph? Rev.Iberoamericana 20 , no.1, (2004), 1–31.
- 5[5] A. Bernshteyn , Free subshifts with invariant measures from the Lovász Local Lemma. (preprint, https:/arxiv.org/pdf/1702.02792.pdf)
- 6[6] N. P. Brown , Invariant means and finite representation theory of C ∗ superscript 𝐶 C^{*} -algebras. Mem. Am. Math. Soc 865 (2006)
- 7[7] I. Benjamini and O. Schramm , Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6 (2001), no. 23, (electronic).
- 8[8] T. Ceccherini-Silberstein and G. Elek , Minimal topological actions do not determine the measurable equivalence class. Groups, Geometry and Dynamics 2 , (2008), 139–163.
