Borel structurability by locally finite simplicial complexes
Ruiyuan Chen

TL;DR
This paper demonstrates that countable Borel equivalence relations can be embedded into ones structurable by finite-dimensional contractible simplicial complexes with controlled vertex degrees, generalizing previous results for the case n=1.
Contribution
It extends Jackson-Kechris-Louveau's result to higher dimensions, showing embeddings with bounded vertex degrees for structurable equivalence relations.
Findings
Every countable Borel equivalence relation structurable by n-dimensional complexes embeds into one with bounded vertex degree.
The bound on vertex degree is explicitly given by a formula involving n.
The proof leverages classical Whitehead results on countable CW-complexes.
Abstract
We show that every countable Borel equivalence relation structurable by -dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most edges; this generalizes a result of Jackson-Kechris-Louveau in the case . The proof is based on that of a classical result of Whitehead on countable CW-complexes.
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 Topology and Set Theory · Topological and Geometric Data Analysis · Computability, Logic, AI Algorithms
Borel structurability by locally finite simplicial complexes
Ruiyuan Chen Research partially supported by NSERC PGS D
Abstract
We show that every countable Borel equivalence relation structurable by -dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most edges; this generalizes a result of Jackson-Kechris-Louveau in the case . The proof is based on that of a classical result of Whitehead on countable CW-complexes.
1 Introduction
A countable Borel equivalence relation on a standard Borel space is a Borel equivalence relation for which each equivalence class is countable. The class of treeable countable Borel equivalence relations, for which there is a Borel way to put a tree (acyclic connected graph) on each equivalence class, has been studied extensively by many authors, especially in relation to ergodic theory; see e.g., [Ada], [Ga1], [JKL], [KM], [HK], [Hjo]. It is a basic result, due to Jackson-Kechris-Louveau [JKL, 3.10], that every treeable equivalence relation embeds into one treeable by trees in which each vertex has degree at most 3. The purpose of this paper is to present a generalization of this result to higher dimensions.
Recall that a simplicial complex on a set is a collection of finite nonempty subsets of which contains all singletons and is closed under nonempty subsets. A simplicial complex has a geometric realization , which is a topological space formed by gluing together Euclidean simplices according to (see Section 2 for the precise definition); is contractible if is. Given a distinguished class of simplicial complexes (e.g., the contractible ones) and a countable Borel equivalence relation , a (Borel) structuring of by simplicial complexes in is, informally (see Section 2), a Borel assignment of a simplicial complex on each equivalence class . If such a structuring exists, we say that is structurable by complexes in . We are interested here mainly in -dimensional contractible simplicial complexes; when , we recover the notion of treeability. The study of equivalence relations structurable by -dimensional contractible simplicial complexes was initiated by Gaboriau [Ga2], who proved (among other things) that for these classes of countable Borel equivalence relations form a strictly increasing hierarchy under .
Recall also the notion of a Borel embedding between countable Borel equivalence relations and , which is an injective Borel map such that for all .
Theorem 1**.**
Let , and let be a countable Borel equivalence relation structurable by -dimensional contractible simplicial complexes. Then Borel embeds into a countable Borel equivalence relation structurable by -dimensional contractible simplicial complexes in which each vertex belongs to at most (or even exactly) edges.
In particular, every structurable by -dimensional contractible simplicial complexes Borel embeds into an structurable by locally finite such complexes, where a simplicial complex is locally finite if each vertex is contained in finitely many edges (or equivalently finitely many simplices). The constant above is not optimal: for we have , whereas by the aforementioned result of Jackson-Kechris-Louveau we may take instead, which is optimal; for we have , whereas by a construction different from the one below we are able to get . We do not know what the optimal is for ; however, the result of Gaboriau mentioned above implies that the optimal is at least .
The referee has pointed out that by an easy argument, one may strengthen “at most” to “exactly” in Theorem 1 (as well as in the following reformulations).
We may reformulate Theorem 1 in terms of compressible countable Borel equivalence relations, which are those admitting no invariant probability Borel measure (see e.g., [DJK] for various equivalent definitions of compressibility):
Corollary 2**.**
Let , and let be a compressible countable Borel equivalence relation structurable by -dimensional contractible simplicial complexes. Then is structurable by -dimensional contractible simplicial complexes in which each vertex belongs to at most (or even exactly) edges.
Note that by the theory of cost (see [Ga1], [KM]), Corollary 2 cannot be true of non-compressible equivalence relations, i.e., there cannot be a uniform bound on the number of edges containing each vertex.
Theorem 1 fits into a general framework for classifying countable Borel equivalence relations according to the (first-order) structures one may assign in a Borel way to each equivalence class; see [JKL], [Mks], [CK]. As with most such results, the “underlying” result is that there is a procedure for turning every structure of the kind we are starting with (-dimensional contractible simplicial complexes) into a structure of the kind we want (-dimensional contractible simplicial complexes satisfying the additional condition), which is “uniform” enough that it may be performed simultaneously on all equivalence classes in a Borel way. We state this as follows. We say that a simplicial complex is locally countable if each vertex is contained in countably many edges (or equivalently countably many simplices).
Theorem 3**.**
There is a procedure for turning a locally countable simplicial complex into a locally finite simplicial complex , such that
- (i)
* is homotopy equivalent to ;*
- (ii)
if is -dimensional, then can be chosen to be -dimensional and with each vertex in at most (or even exactly) edges.
Furthermore, given a countable Borel equivalence relation and a structuring of by simplicial complexes, this procedure may be performed simultaneously (in a Borel way) on all -classes, yielding a countable Borel equivalence relation with a structuring by simplicial complexes and a Borel embedding such that applying the above procedure to the complex on an -class yields the complex on the corresponding -class .
The theorem in this form also yields the following (easy) corollary:
Corollary 4**.**
Every countable Borel equivalence relation embeds into a countable Borel equivalence relation structurable by locally finite contractible simplicial complexes.
Again, this may be reformulated as
Corollary 5**.**
Every compressible countable Borel equivalence relation is structurable by locally finite contractible simplicial complexes.
The proof of Theorem 3 is based on a classical theorem of Whitehead on CW-complexes [Wh, Theorem 13], which states that every locally countable CW-complex is homotopy equivalent to a locally finite CW-complex of the same dimension. While the statement of this theorem is useless for Theorem 3 (every contractible complex is homotopy equivalent to a point, but one cannot replace every class of a non-smooth equivalence relation with a point), its proof may be adapted to our setting, with the help of some lemmas from descriptive set theory.
We review some definitions and standard lemmas in Section 2, then give the proofs of the above results in Section 3; the proofs are structured so that it should be possible to read the combinatorial/homotopy-theoretic argument without the descriptive set theory, and vice-versa. In Section 4 we list some other properties of treeable equivalence relations which we do not currently know how to generalize to higher dimensions.
Acknowledgments. We would like to thank Alexander Kechris, Damien Gaboriau, and the anonymous referee for providing some comments on drafts of this paper.
2 Preliminaries
We begin by reviewing some notions related to simplicial complexes; see e.g., [Spa].
A simplicial complex on a set is a set of finite nonempty subsets of such that for all and every nonempty subset of an element of is in . The elements are called simplices. The dimension of is ; if , we call an -simplex. We let be the -simplices, and call -dimensional if for . (To avoid confusion, we will sometimes call a simplicial complex with an -simplex containing all other simplices a standard -simplex.)
A subcomplex of is a simplicial complex such that and . For a simplicial complex and a subset , the induced subcomplex on is . A simplicial map between complexes and is a map such that for all .
The geometric realization of a simplicial complex is the topological space formed by gluing together standard Euclidean -simplices for each , according to the subset relation. Explicitly, can be defined as the set , where is (thought of as) the set of formal convex combinations of elements of supported on , equipped with the topology where a subset of is open iff its intersection with each is open in the Euclidean topology on . We say that is contractible if is. Likewise, a simplicial map induces a continuous map in the obvious way; we say that is a homotopy equivalence if is.
We also need the more refined notion of an ordered simplicial complex, which is a simplicial complex on a poset such that every simplex is a chain in . The product of ordered simplicial complexes and is the complex where is the usual product poset and
[TABLE]
It is standard that is canonically homeomorphic to with the CW-product topology (which coincides with the product topology if are locally countable).
In order to prove contractibility/homotopy equivalence, we use the following standard results from homotopy theory.
Lemma 6**.**
Let be simplicial complexes which are the unions of subcomplexes and over the same index set , and let be a simplicial map such that for each . If for each finite family of indices , the restriction is a homotopy equivalence, then is a homotopy equivalence.
Proof.
See e.g., [Hat, 4K.2]. ∎
Corollary 7**.**
Let be a simplicial complex which is the union of subcomplexes . If the inclusion is a homotopy equivalence, then so is the inclusion . In particular, if , , and are contractible, then so is .
Proof.
Apply Lemma 6 to the inclusion from into . ∎
Corollary 8**.**
Let and be simplicial complexes which are directed unions of subcomplexes (over the same directed poset), and let be a simplicial map such that for each . If each restriction is a homotopy equivalence, then so is .
In particular, if is contractible for each , then (taking a point) is contractible.
Proof.
In the case where is a well-ordered set, this is immediate from Lemma 6; the two places below where we use this result both follow from this case. (To deduce the general form of the result, one can appeal to Iwamura’s lemma from order theory which reduces an arbitrary directed union to iterated well-ordered unions; see e.g., [Mky].) ∎
We say that a simplicial map is a trivial pseudofibration if for each , the subcomplex is contractible.
Corollary 9**.**
A trivial pseudofibration is a homotopy equivalence.
Proof.
Apply Lemma 6 to and . ∎
Finally, we come to the notion of Borel structurability. Let be a countable Borel equivalence relation. We say that a simplicial complex on is Borel if for each the -ary relation “” is Borel, or equivalently is Borel as a subset of the standard Borel space of finite subsets of . A Borel simplicial complex on is a Borel structuring of by simplicial complexes if in addition each simplex is contained in a single -class; such an represents the “Borel assignment” of the (countable) complex to each -class . More generally, for a class of simplicial complexes (e.g., the contractible ones), is a structuring of by complexes in if for each ; if such a structuring exists, we say that is structurable by complexes in .
3 Proofs
3.1 Some lemmas
Let denote the ordered simplicial complex on with an edge between for each , whose geometric realization is a ray.
For a simplicial complex , a set , and a map , define the image complex
[TABLE]
which is a simplicial complex on ; we write for . If is an ordered simplicial complex, is a poset, and is monotone, then is also ordered.
Let be a poset and be an ordered simplicial complex on , for some . We define the telescope , an ordered simplicial complex on , by induction on as follows:
[TABLE]
where is the projection onto all but the last factors. Explicitly, we have
[TABLE]
(the last term is redundant unless ). Here are some simple properties of :
Lemma 10**.**
- (a)
. 2. (b)
The projection is a homotopy equivalence (with homotopy inverse the inclusion ). 3. (c)
For a subset , we have . 4. (d)
If is (at most) -dimensional, then is (at most) -dimensional.
Proof.
(a), (c), and (d) are straightforward. For , it is easily seen that deformation retracts onto ; a simple induction then yields (b). ∎
We need one more (straightforward) lemma:
Lemma 11**.**
A trivial pseudofibration is surjective on simplices.
Proof.
Let . Put . Since is a trivial pseudofibration, for every , is contractible; thus is a homotopy equivalence. But is the boundary of the simplex , hence not contractible; thus for to be contractible, there must be with . ∎
3.2 The main construction
We now give the main construction in the proof of Theorem 3. Let be a locally countable simplicial complex, which we may assume to be ordered by taking any linear order on . By local countability, for each we may find a function which colors the intersection graph on the -simplices , which means that for with and we have . The idea is that for each , we will multiply the complex by the ray and then attach each -simplex at position along the ray, so that distinct simplices have non-overlapping boundaries.
Let , the -skeleton of . We will inductively define ordered simplicial complexes on and for , on such that
[TABLE]
fitting into the following commutative diagram of monotone simplicial maps:
[TABLE]
The horizontal maps are the inclusions, while the vertical/diagonal maps are the projections onto all but the last factors as before; furthermore each vertical/diagonal map will be a trivial pseudofibration between the respective complexes.
Start with . Given such that is a trivial pseudofibration, put
[TABLE]
Clearly this is an ordered simplicial complex on .
Claim**.**
* is a trivial pseudofibration.*
Proof.
Let ; we must check that is contractible. We have
[TABLE]
(using Lemma 10(c)); let be as shown. The subcomplex is contractible since is a trivial pseudofibration by the induction hypothesis whence is contractible. For each such that (otherwise is empty), the subcomplex is contractible since the telescope is homotopy equivalent (by Lemma 10(b)) to the projection which is a standard simplex; and also is contractible since
[TABLE]
(the second equality since the telescope is a complex on , the third equality by Lemma 10(a)), which is contractible because again is a trivial pseudofibration. For two distinct , we have : either in which case clearly , or whence by the coloring property of we have . Now by repeated use of Corollary 7, we get that is contractible for every finite collection of , whence by Corollary 8, is contractible. ∎
Now put
[TABLE]
Claim**.**
* is an ordered simplicial complex on .*
Proof.
The only thing that needs to be checked is that for each , a nonempty subset of is still in . We may assume . Then , so since is a trivial pseudofibration, hence surjective on simplices, we have , whence . ∎
Claim**.**
* is a trivial pseudofibration.*
Proof.
Let ; we must check that is contractible. If then clearly so this follows from the previous claim that is a trivial pseudofibration. So we may assume that , in which case
[TABLE]
Since is a trivial pseudofibration, so is the restriction ; but this restriction has one-sided inverse the inclusion , which is therefore a homotopy equivalence. Now applying Corollary 7 to
[TABLE]
where the two subcomplexes on the right-hand side have intersection , yields that the inclusion is a homotopy equivalence; but is a standard simplex, hence contractible, whence is contractible. ∎
This completes the definition of the complexes and the verification that is a homotopy equivalence for each . Note that from the definition and Lemma 10(d), it is clear that each is -dimensional.
3.3 The constant bound
We next bound the number of edges containing a point in . To do so, we will define for each a constant such that for each there are at most distinct with and , and also the same holds with .
For , we have , while . Thus
[TABLE]
works: for , either , in which case we have and for some , or for some , in which case and for some , which is uniquely determined by by the coloring property of ; and similarly for .
Now suppose for that we are given ; we find by a similar argument. Let . Since , adds no [math]- or -simplices to , so . If , then we have and for some and , i.e., ; there are thus choices for given in this case. Otherwise, we have for some , whence and where and each ; by the coloring property of , is uniquely determined by , hence there are at most choices for and so at most choices for given . In total, there are thus at most
[TABLE]
choices for ; similarly for .
Solving this recurrence yields
[TABLE]
So, for each and , there are at most distinct edges or in ; that is, there are at most
[TABLE]
edges in containing . When is -dimensional, truncating the above inductive construction at and taking proves the combinatorial part of Theorem 3 (with the weaker condition “at most ” in (ii)) in this case.
3.4 Growing edges
Still in the -dimensional case, in order to modify so that each vertex is contained in exactly edges, we use the following simple construction. Put . Given , let be together with, for each vertex of with fewer than edges, a new vertex and an edge . Then clearly
[TABLE]
is still -dimensional and has each vertex contained in exactly edges. Also, clearly deformation retracts onto ; thus (by Corollary 8) the inclusion is a homotopy equivalence. So we may replace with to get the stronger form of Theorem 3(ii).
3.5 The infinite-dimensional case
Next we handle the case where is infinite-dimensional. Let be the composite
[TABLE]
From the above diagram (), we get a commutative diagram
[TABLE]
We would like to let be the direct limit of the top row of this diagram, but that might not be locally finite. Instead, we take the mapping telescope of the top row, which can be defined explicitly as follows.
Let be the direct limit of ; explicitly, can be taken as the subset of consisting of the eventually zero sequences. Then is the direct limit of the sequence , with injections
[TABLE]
and so the direct limit of the top row of () can be taken explicitly as the ordered simplicial complex on .
The mapping telescope of the top row of () is the complex where
[TABLE]
For each , let
[TABLE]
It is easy to see that the projection restricts to simplicial maps for each , yielding a commutative diagram
[TABLE]
in which the horizontal maps are inclusions and the vertical maps are homotopy equivalences by the usual argument: the (geometric realization of the) first cylinder in deformation retracts onto its base , which is contained in the second cylinder , which deformation retracts onto its base , etc. Since, as noted above, the bottom row of () may be identified with the top row of (), combining the two diagrams and applying Corollary 8 yields that is homotopy equivalent to (via the restriction of the projection ).
Since, clearly, each being locally finite implies that is locally finite, this proves the combinatorial part of Theorem 3 in the infinite-dimensional case.
3.6 The Borel case
Finally, suppose we start with a Borel structuring of a countable Borel equivalence relation by simplicial complexes. Recall that this means is a simplicial complex on with simplices contained in -classes and such that is Borel in the standard Borel space of finite subsets of . We may then simply apply the above construction to the locally countable simplicial complex , while observing that each step is Borel. To do so, we first pick a Borel linear order on to turn into an ordered simplicial complex, and then pick the coloring functions to be Borel (in fact restrictions of a single ) using the following standard lemma:
Lemma 12** (Kechris-Miller [KM, 7.3]).**
Let be a countable Borel equivalence relation, and let be the standard Borel space of finite subsets of which are contained in some -class. Then there is a Borel -coloring of the intersection graph on , i.e., a Borel map such that if with and then .
It is now straightforward to check that the definitions of are Borel; in the definition of , note that the union over is disjoint, by the coloring property of . In the -dimensional case, we end up with an ordered Borel simplicial complex such that the projection is a homotopy equivalence . Defining the countable Borel equivalence relation on by
[TABLE]
we get that is a Borel structuring of ; and we have a Borel embedding given by such that is homotopy equivalent to (via the map ) for each .
For the stronger condition that each vertex is contained in exactly edges, it is straightforward that the definition of above can be taken to be a Borel simplicial complex on a standard Borel space ; letting be the obvious equivalence relation on (so that each newly added edge in lies in one -class), is a Borel structuring of such that the composite is a homotopy equivalence on each class. So we may replace by .
Similarly, in the infinite-dimensional case, it is straightforward that the definition of the mapping telescope on is Borel; so the same definitions of as in the finite-dimensional case work (note that for all ). This completes the proof of Theorem 3, which implies Theorem 1.
To prove Corollary 2, apply Theorem 1 to get with structuring and an embedding ; since is compressible, may be modified so that its image is -invariant (see [DJK, 2.3]), whence we get the desired structuring of by restricting .
To prove Corollary 4, let be the trivial structuring of given by ; this is obviously contractible on each -class, so by Theorem 3 Borel embeds into some structurable by locally finite contractible complexes. As before, this implies Corollary 5.
3.7 Some remarks
In the dimension case, the construction of above can be seen as a slight variant of the proof of Jackson-Kechris-Louveau [JKL, 3.10]. Thus the general case of our construction can be seen as a generalization of their proof to higher dimensions.
As mentioned in the Introduction, our construction is based on the proof of Whitehead [Wh, Theorem 13] that every countable CW-complex is homotopy equivalent to a locally finite complex of the same dimension. That proof uses the same idea of “spreading out” cells along a ray to make their boundaries disjoint, but uses more abstract tools from homotopy theory in place of our explicit “telescope” construction . While it should be possible to give a more direct combinatorial transcription of Whitehead’s proof, using (for example) simplicial sets, it does not seem that such an approach would yield a uniform bound on the number of edges containing a vertex in the -dimensional case.
4 Problems
There are several other nice properties of treeable countable Borel equivalence relations, for which we do not know if they generalize to higher dimensions. Each of the following is known to be true in the case ; see [JKL, 3.3, 3.12, 3.17].
Problem 1**.**
Let be countable Borel equivalence relations such that Borel embeds into . If is structurable by -dimensional contractible simplicial complexes, then must be also?
Problem 2**.**
Let be a countable Borel equivalence relation. If is structurable by -dimensional contractible simplicial complexes, then is necessarily structurable by -dimensional locally finite contractible simplicial complexes? (As noted in the Introduction, there cannot be a uniform bound on the number of edges containing each vertex.)
Problem 3**.**
Is there a single countably infinite -dimensional contractible simplicial complex , such that every countable Borel equivalence relation structurable by -dimensional contractible simplicial complexes Borel embeds into an structurable by isomorphic copies of ?
Problem 4**.**
Is there a countable group with an -dimensional Eilenberg-MacLane complex , such that every countable Borel equivalence relation structurable by -dimensional contractible simplicial complexes Borel embeds into the orbit equivalence relation of a free Borel action of ?
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ada] S. Adams, Trees and amenable equivalence relations , Ergodic Theory Dynam. Systems 10 (1990), 1–14.
- 2[CK] R. Chen and A. S. Kechris, Structurable equivalence relations , to appear in Fund. Math., 2017.
- 3[DJK] R. Dougherty, S. Jackson, and A. S. Kechris, The structure of hyperfinite Borel equivalence relations , Trans. Amer. Math. Soc. 341(1) (1994), 193–225.
- 4[Ga 1] D. Gaboriau, Coût des relations d’équivalence et des groupes , Invent. Math. 139 (2000), 41–98.
- 5[Ga 2] D. Gaboriau, Invariants ℓ 2 superscript ℓ 2 \ell^{2} de relations d’équivalence et de groupes , Publ. Math. Inst. Hautes Études Sci. 95 (2002), 93–150.
- 6[Hat] A. Hatcher, Algebraic topology , Cambridge University Press, 2002.
- 7[Hjo] G. Hjorth, Treeable equivalence relations , preprint, http://www.math.ucla.edu/~greg/manytreeable.pdf , 2008.
- 8[HK] G. Hjorth and A. S. Kechris, Rigidity theorems for actions of product groups and countable Borel equivalence relations , Mem. Amer. Math. Soc. 177(833) (2005).
