Hyperfiniteness of boundary actions of hyperbolic groups
Timoth\'ee Marquis, Marcin Sabok

TL;DR
This paper proves that the boundary action of any finitely generated hyperbolic group results in a hyperfinite equivalence relation, advancing understanding of the group's boundary dynamics.
Contribution
It establishes the hyperfiniteness of boundary actions for all finitely generated hyperbolic groups, a novel result in geometric group theory.
Findings
Boundary actions induce hyperfinite equivalence relations
Applicable to all finitely generated hyperbolic groups
Enhances understanding of boundary dynamics in hyperbolic groups
Abstract
We prove that for every finitely generated hyperbolic group , the action of on its Gromov boundary induces a hyperfinite equivalence relation.
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.
Hyperfiniteness of boundary actions of hyperbolic groups
Timothée Marquis*(∗)*
UCLouvain, IRMP-MATH, Chemin du Cyclotron 2, 1348 Louvain-la-Neuve, Belgium
and
Marcin Sabok†
McGill University, Department of Mathematics and Statistics, 805 Sherbrooke Street W, Montreal, QC, H3A 0B9 Canada and Instytut Matematyczny PAN, Sniadeckich 8, 00-656 Warszawa, Poland
Abstract.
We prove that for every finitely generated hyperbolic group , the action of on its Gromov boundary induces a hyperfinite equivalence relation.
*(∗)*Corresponding author (ORCID 0000-0003-0541-8302, [email protected]); F.R.S.-FNRS Postdoctoral Researcher
† This research was partially supported by the NSERC through the Discovery Grant RGPIN-2015-03738, by the FRQNT (Fonds de recherche du Québec) grant Nouveaux chercheurs 2018-NC-205427 and by the NCN (National Science Centre, Poland) through the grants Harmonia no. 2015/18/M/ST1/00050 and 2018/30/M/ST1/00668
1. Introduction
The complexity theory of Borel equivalence relations has been developed in the last forty years as an attempt to measure the difficulty of classification problems ([Kan08]). A particularly active part of the theory is concerned with the structure of countable Borel equivalence relations. As all countable Borel equivalence relations are induced by Borel actions of countable groups, this has a close relationship with the study of Borel or measurable group actions on standard Borel spaces.
The interplay between the structure of measurable actions of countable (or finitely generated) groups and the algebraic properties of the groups is one of the main themes appearing at the intersection of group theory, ergodic theory and descriptive set theory. The classical result [Gao09, Theorem 7.2.4] of Slaman–Steel ([SS88]) and Weiss ([Wei84]) characterises the equivalence relations induced by the actions of (i.e. by a single automorphism) as the hyperfinite equivalence relations: those which can be written as an increasing union of finite equivalence relations. This notion has been studied both from the Borel and measurable point of view.
The above characterisation holds in a pure Borel context, where there is no probability measure around. Given a Borel probability measure , an equivalence relation is -hyperfinite if it is hyperfinite restricted to a certain subset of measure . In the presence of an invariant probability measure , every amenable group action induces a -hyperfinite equivalence relation. It is one of the notorious open problems whether the latter holds in the pure Borel setting.
Hyperbolic groups and spaces were introduced and studied by Gromov (see [Gro87]) and have attracted a lot of attention in geometric group theory. To every (geodesic) proper hyperbolic metric space one associates a compact metric space , called its Gromov boundary, which is a quasi-isometry invariant of . One then also defines the Gromov boundary of a finitely generated hyperbolic group as the Gromov boundary of its Cayley graph (with respect to a finite generating set), and the -action on its Cayley graph naturally induces a -action by homeomorphisms on .
Boundary actions of hyperbolic groups have also been studied from the point of view of their complexity. In the case of the free group , Connes, Feldman and Weiss [CFW81, Corollary 13] and Vershik [Ver78] showed that the action of on its Gromov boundary is -hyperfinite for every Borel quasi-invariant probability measure on . This was later generalised by Adams in [Ada94] to all finitely generated hyperbolic groups.
On the other hand, in [DJK94, Corollary 8.2] Dougherty, Jackson and Kechris proved that the boundary action of the free group is hyperfinite (in the pure Borel sense) by studying the so-called tail equivalence relation. More recently, Huang, Sabok and Shinko showed in [HSS19] that every cubulated hyperbolic group (i.e. acts geometrically on a hyperbolic CAT(0) cube complex ) has a hyperfinite boundary action. Their proof is based on an analysis of geodesic ray bundles in hyperbolic CAT(0) cube complexes. More precisely, given a point and a vertex of the 1-skeleton of , the geodesic ray bundle consists of all vertices that appear on a geodesic ray starting at and converging to . The hyperfiniteness of the -action on (or equivalently, on since and are quasi-isometric) is then established as a consequence of the following geometric condition (see [HSS19, Theorem 1.4]): for every and , the sets and have a finite symmetric difference.
In [HSS19, Question 1.5] it was asked whether this condition holds in Cayley graphs of arbitrary hyperbolic groups. However, Touikan constructed in [Tou18] hyperbolic groups (or rather, appropriate sets of generators for the free group) with an associated Cayley graph in which this condition does not hold. On the other hand, even though this condition turned out to be quite restrictive, Marquis provided in [Mar18] a large class of examples (including groups having the Kazhdan property) which act geometrically on hyperbolic graphs where the condition does hold, thereby establishing the hyperfiniteness of the corresponding boundary actions.
In this paper we solve the problem of hyperfiniteness of boundary actions of hyperbolic groups in full generality, by proving the following unconditional theorem.
Theorem A**.**
Let be a finitely generated hyperbolic group. Then the action of on its Gromov boundary is hyperfinite.
Note that for a finitely generated hyperbolic group , any geometric action of on a space induces a boundary action on and for all such actions there exists a -equivariant homeomorphism of and [Gro87]. Therefore, by Theorem A, all such boundary actions of also induce hyperfinite equivalence relations.
To prove Theorem A, we establish a new hyperfiniteness criterion of geometric nature and we show that it holds in every (uniformly) locally finite hyperbolic graph. More precisely, given such a graph with set of vertices , we construct for each and a subset of containing a sub-geodesic ray of every geodesic ray from to , and such that and have a finite symmetric difference for every (see Proposition 5.8 and Theorem 5.9). We then show, in §6, that if is the Cayley graph of a finitely generated hyperbolic group , then this property implies the hyperfiniteness of the boundary action of .
As illustrated by Touikan’s examples [Tou18] (see also Examples 3.6 and 5.7 below), establishing the finite symmetric difference property for the sets in arbitrary (hyperbolic, uniformly locally finite) graphs is a rather subtle problem. The key idea to tackle this problem is to consider the horoboundary of , which is a refinement of allowing for a better control of geodesic rays (and generalising the combinatorial compactification of the chamber graph of a building introduced in [CL11]), and to prove the existence of so-called straight geodesic rays (see Definition 4.9).
Acknowledgement
We would like to thank the referee for many valuable comments.
2. Preliminaries
2.1. Graphs
Throughout this paper, will denote a connected locally finite graph, with vertex set and edge set .
Two distinct vertices are adjacent if . A path in is a (possibly infinite) ordered sequence of vertices of such that and are distinct and adjacent for each . The path metric on will be denoted . Given two vertices , we let
[TABLE]
be the union of all geodesic paths from to . Given a (finite) path ending at some vertex , and a (possibly infinite) path starting at , we denote by the path obtained by concatenating with .
A geodesic ray is an infinite geodesic path . Two geodesic rays are asymptotic if they are at bounded Hausdorff distance . The visual boundary of is the set of equivalence classes of asymptotic geodesic rays. A CGR from to is a geodesic ray starting at and pointing towards (i.e. belonging to the equivalence class ); their set is denoted . [The letters CGR stand for “combinatorial geodesic ray”, emphasising the combinatorial nature of the metric.] We also let denote the union of all CGR from to .
2.2. Cayley graphs
If is the Cayley graph of a finitely generated group with respect to a finite symmetric generating set (so that ), then given a path (resp. ) in , we define the type of as
[TABLE]
2.3. Hyperbolicity
The graph is called (Gromov) hyperbolic if there is some such that every geodesic triangle in is -slim, that is, such that each side of is contained in the -neighbourhood of the other two sides. In that case, we also call -hyperbolic. A finitely generated group is called hyperbolic if it has a hyperbolic Cayley graph (with respect to a finite generating set ); since hyperbolicity is a quasi-isometry invariant, this does not depend on the choice of .
The key property of hyperbolic graphs that we will need is the following.
Lemma 2.1**.**
Assume that is -hyperbolic for some . Let , and . Then for all . In particular, .
Proof*.*
This follows from [BH99, Lemma III.3.3]. ∎
If is hyperbolic, one can equip its visual boundary with a compact (metrisable) topology, defined as follows: given a base point , a sequence converges to some if and only if there exist CGR such that every subsequence of subconverges (i.e. admits a subsequence that converges) to a CGR . The resulting topological space, which we again denote by , is called the Gromov boundary of (see [BH99, Section III.3]).
2.4. Horoboundary
Throughout this paper, we fix a base point . Set
[TABLE]
We equip with the topology of pointwise convergence. To each , we attach the function
[TABLE]
so that . The map
[TABLE]
is then continuous and injective, and we identify with its image (see e.g. [CL11, §3]). The horofunction compactification of is the closure of in ; it is independent of the base point (as can be canonically identified with the space of -Lipschitz functions , modulo the constant functions). The horoboundary of is .
2.5. Descriptive set theory
A standard Borel space is a set equipped with a -algebra which can be obtained as the -algebra of Borel sets from some Polish topology on . Examples of standard Borel spaces include the discrete finite sets, the discrete infinite countable set or the Cantor set . Given a standard Borel space , by a Borel set in we mean any set which belongs to the -algebra. If are standard Borel spaces, there is a canonical standard Borel space structure on , as well as on and .
We will use the simple observation that the sets of the form are Borel if is a first-order formula where the predicates correspond to closed or open subsets of Polish spaces and all the quantifiers range over finite or countable sets. We provide the following example for the benefit of readers not familiar with descriptive set theory.
Example 2.2**.**
Let be a finitely generated group with a finite symmetric generating set . Fix a total order on and consider the induced lexicographical order on . Let and be the set of pairs such that is a geodesic ray starting at (the neutral element of ) and is the lexicographically least string which appears infinitely often as a substring of . Then the set is Borel in as witnessed by the following formula : writing and , we have if and only if
[TABLE]
Note that the predicate stating that is a geodesic path from corresponds to a closed set in , the conditions on describe open and closed sets in , and the conditions on describe open and closed sets in . Hence, setting for each , and denoting by and the natural projections from to and , respectively, we have an explicit Borel description of as
[TABLE]
In the above example we refer to the formula as a Borel definition of . In Section 6 we will use more sophisticated computations similar to the one in the example above.
An analytic subset of a standard Borel space is an image of a Borel set by a Borel function (or equivalently, a projection to of a Borel set for some standard Borel space ). In other words, a subset of is analytic if it can be written as for a Borel set . So analytic subsets are those sets which are definable by formulas which have at most one existential quantifier whose range is an uncountable standard Borel space. Analytic sets are closed under countable unions and intersections but not under complements. In other words, if are analytic for , then and are also analytic. A subset of a standard Borel space is coanalytic if its complement is analytic. In other words, coanalytic sets are those sets which are definable by formulas which have at most one universal quantifer whose range is an uncountable Borel space. A classical result of Souslin [Kec95, Theorem 14.11] states that a set is Borel if and only if it is both analytic and coanalytic.
Given a Borel set with countable vertical sections , the projection is still Borel by the Lusin–Novikov theorem [Kec95, Theorem 18.10]. The same theorem says that in that case contains the graph of a Borel function from to . This implies that is the union of countably many graphs of Borel functions from to , and if the sections () are of size at most , then is the union of Borel functions. This is the version of the Lusin–Novikov theorem that we will use in Section 6.
A Borel equivalence relation is an equivalence relation on a standard Borel space such that is Borel as a subset of . If , we will write for the restriction of to . An equivalence relation is countable (resp. finite) if all of its equivalence classes are countable (resp. finite). An equivalence relation is hyperfinite if it can be written as an increasing union of finite equivalence relations.
Given two Borel equivalence relations on and on , a Borel function is a homomorphism if for all . The Borel map is a Borel reduction from to if for all . We say that a Borel equivalence relation is Borel reducible to a Borel equivalence relation if there exists a Borel reduction from to .
A Borel equivalence relation is smooth if it is Borel reducible to the identity relation on a standard Borel space. Every finite Borel equivalence relation is smooth. The simplest non-smooth countable Borel equivalence relation is defined on by if . The relation is hyperfinite. A countable Borel equivalence relation is hyperfinite if and only if it is Borel reducible to .
A Borel equivalence relation is hypersmooth if it can be written as an increasing union of smooth Borel equivalence relations. For instance, the relation , defined on by if , is hypersmooth. A Borel equivalence relation is hypersmooth if and only if it is Borel reducible to .
In the realm of countable Borel equivalence relations, the classes of hyperfinite and hypersmooth equivalence relations coincide: if a countable equivalence relation is hypersmooth, then it is hyperfinite.
An analytic equivalence relation on is an equivalence relation such that is analytic as a subset of .
We will use the following consequence of the Second Reflection theorem [Kec95, Theorem 35.16]
Lemma 2.3**.**
[HSS19, Lemma 4.1]** Let be a standard Borel space, be analytic and let be an analytic equivalence relation on such that there is some such that every -class has size less than . Then there is a Borel equivalence relation on with such that every -class has size less than .
For more details regarding notation and standard facts in descriptive set theory we refer the reader to [Kec95] or [Kan08].
3. Preliminary lemmas and basic definitions
Lemma 3.1**.**
Let , and let be a CGR. Then there exists some such that is a CGR for any geodesic path from to .
Proof*.*
Note that the function is non-increasing, as , and bounded from below, as . Hence is eventually constant, that is, there is some such that for all , as desired. ∎
Lemma 3.2**.**
If is a CGR, then converges in . We denote its limit by and we say that converges to .
Proof*.*
Let , and let us show that is eventually constant, as desired. By Lemma 3.1, there is some such that and are CGR for some geodesic path from to and some geodesic path from to . In particular, if , then
[TABLE]
yielding the claim. ∎
Definition 3.3**.**
Given , we set
[TABLE]
Note that is independent of the choice of by Lemma 3.1: if and , then for some if and only if for some .
Definition 3.4**.**
For and , define the combinatorial sector
[TABLE]
Note that is nonempty by Lemma 3.1.
Example 3.5**.**
Consider the Coxeter complex of type (see e.g. [AB08, §3]), that is, the tiling of the Euclidean plane by congruent equilateral triangles (see Figure 1). Let be the associated chamber graph, namely, the graph with vertex set the barycenters of these triangles, and with an edge between two barycenters if the corresponding triangles share a common edge.
In this situation, the horofunction compactification of coincides with the combinatorial compactification of introduced in [CL11, §2], and can be thought of as a refinement of (see [CL11, §3], and also [Mar18, Example 3.1]).
An example of a CGR for some vertex and some direction is depicted on Figure 1. The set can be viewed as the set of “strips” delimited by two adjacent lines in the direction of , or else as the set of vertices of a simplicial line “transversal” to the direction (the dashed line on Figure 1) — see also [Mar18, Appendix A].
An example of combinatorial sector for some is depicted as the coloured area in Figure 1 (note that in this example, the notion of combinatorial sector coincides with that introduced in [CL11, §2.3] — see [Mar18, Theorem 3.11]).
Example 3.6**.**
Consider the graph pictured in Figure 2, with vertex set . Then has a unique element , whereas has two elements , respectively corresponding to the (limits of the) CGR and . Here are some examples of combinatorial sectors:
[TABLE]
Note also that and have infinite symmetric difference, and hence does not satisfy the hyperfiniteness criterion given in [HSS19, Theorem 1.4]. This “bad ladder” is at the basis of the counter-example to [HSS19, Question 1.5] described in [Tou18].
4. Special vertices
Throughout this section, we fix some .
Lemma 4.1**.**
Let and . Let be converging to and let . Then there is some such that for all .
Proof*.*
Let be converging to and passing through (say for some ). Since and both converge to , there exists some with such that
[TABLE]
for all . Hence, for each , we have
[TABLE]
yielding the claim. ∎
Lemma 4.2**.**
Let and . Let be converging to . Then
[TABLE]
Proof.
The inclusion is clear. Conversely, let . Then Lemma 4.1 yields some such that , so that . ∎
Lemma 4.3**.**
Let and . If , then .
Proof*.*
Let be a geodesic path from to and let be converging to and such that is a CGR. Since for each , the lemma follows from Lemma 4.2. ∎
Lemma 4.4**.**
Let and . Let , and let be such that . Then the concatenation of any geodesic path from to with is a CGR.
Proof*.*
Let be a CGR from to passing through and converging to (see Figure 3). Let . We have to show that
[TABLE]
Since , we find by Lemma 4.1 some such that
[TABLE]
Similarly, since , we have by Lemma 4.3, and hence we find by Lemma 4.1 some such that
[TABLE]
Let . Then
[TABLE]
as desired. ∎
Lemma 4.5**.**
Let and , and let . If , then .
Proof*.*
Write , and let . By Lemma 4.1, we find some such that
[TABLE]
Let converge to . Since , we find by Lemma 4.1 some such that
[TABLE]
Hence
[TABLE]
so that , as desired. ∎
Lemma 4.6**.**
Let . If for some , then .
Proof*.*
For any two vertices , we fix a geodesic path from to . Let be converging to , and be converging to (see Figure 4). We claim that for each , there exists some such that
[TABLE]
This will imply that for each ,
[TABLE]
for all , yielding the lemma.
Let thus . Let be such that and for all , and such that
[TABLE]
(see Lemma 3.1). We will prove that , yielding (1).
Since , we find by Lemma 4.1 some such that
[TABLE]
In particular,
[TABLE]
Similarly, since , we find by Lemma 4.1 some such that
[TABLE]
It then follows from (3) and (5) that
[TABLE]
In particular, is on the CGR , so that . As by (2), it then follows from Lemma 4.4 (applied to , , and ) that
[TABLE]
As
[TABLE]
by (2), we deduce from (6) that
[TABLE]
where the last equality follows from (4), as desired. ∎
Lemma 4.7**.**
Let . If contains a CGR from to , then there exists a unique such that .
Proof*.*
Let be contained in . Then by Lemma 4.5, and hence . The uniqueness statement follows from Lemma 4.6. ∎
Definition 4.8**.**
Call -special if contains a CGR from to . We let denote the set of -special vertices. If , we let be the unique element of such that (see Lemma 4.7).
Definition 4.9**.**
Let . We call straight if for all .
Example 4.10**.**
In the context of Example 3.5, every vertex is -special (see [Mar18, Lemma 3.3]). The element is represented on Figure 1; the combinatorial sector in this case coincides with the unique straight CGR from to (contained in the “stripe” between the two adjacent lines in the direction of that are on each side of ).
Example 4.11**.**
In the context of Example 3.6 (see Figure 2), the vertices and () are -special: we have and for all . The vertices (), on the other hand, are not -special, as for each .
Lemma 4.12**.**
Let and . Then the following assertions are equivalent:
- (1)
* is straight.* 2. (2)
. 3. (3)
For any and any , there is some such that for all . 4. (4)
Every sub-CGR of (i.e. CGR of the form for some ) is straight.
Proof*.*
(1)(2): Let , and let be converging to . Then by assumption and by Lemma 4.2, yielding (2).
(2)(3): Let and let . By assumption, . By Lemma 3.1, there is some such that the concatenation of a geodesic from to with the CGR is again a CGR. Hence (3) follows from Lemma 4.4 (with , , and ).
(3)(1): Let . By assumption, we find for any some such that . Hence , yielding (1).
(4)(1): The implication (4)(1) is trivial, and the converse is clear in view of the equivalence (1)(3) that we have just established. ∎
Lemma 4.13**.**
Let . Then the following assertions are equivalent.
- (1)
* is -special.* 2. (2)
There exists a straight .
If the above assertions hold, then .
Proof*.*
This readily follows from the equivalence (1)(2) in Lemma 4.12. ∎
Lemma 4.14**.**
Let and let be -special. Then for any geodesic path from to and any CGR from converging to .
Proof*.*
Since where is a CGR from to passing through , and since , this follows from Lemma 4.4. ∎
Lemma 4.15**.**
Let . Then and for all .
Proof*.*
Let , and let be a CGR from converging to and passing through . Thus and hence is straight by Lemma 4.12(1)(2). In particular, the sub-CGR of starting at is straight by Lemma 4.12(1)(4), so that and by Lemma 4.13. ∎
Definition 4.16**.**
For and , we define the function
[TABLE]
Lemma 4.17**.**
Let and . Let also .
- (1)
The sequence is non-decreasing. 2. (2)
* for any and for any converging to .* 3. (3)
There is some such that for all . 4. (4)
If is as in (3), then for any converging to , and for any , there exists some such that for all .
Proof*.*
(1) Let be converging to . For all large enough , we have
[TABLE]
(2) Let be converging to . Let . Then for all large enough , we have
[TABLE]
as desired.
(3) Let be converging to . Since , it follows from (2) that the set is finite. In view of (1), this implies that is eventually constant, as desired.
(4) Let be converging to and . Let be such that and for all . Then for all , we have
[TABLE]
and hence
[TABLE]
yielding the claim. ∎
Lemma 4.18**.**
Let and . If is finite, then there is some such that is straight.
Proof*.*
Assume that is finite. For each , let be such that for all (see Lemma 4.17(3)). Set . Then is straight, as follows from Lemma 4.12(1)(3) and Lemma 4.17(4). ∎
5. Consequences of hyperbolicity
Throughout this section, we fix some , and we assume that is hyperbolic.
Lemma 5.1**.**
Let , and let be a sequence of CGR from to . Then subconverges to some .
Proof*.*
Since is locally finite, subconverges to some CGR from . Moreover, is contained in a tubular neighbourhood of by Lemma 2.1, as desired. ∎
is called uniformly locally finite if there exists a constant such that each is contained in at most edges.
Proposition 5.2**.**
Assume that is uniformly locally finite. Then is finite. Moreover, there is a constant independent of such that has at most elements.
Proof*.*
Let be such that is -hyperbolic, and let be such that each ball of radius in contains at most vertices. We claim that has at most elements. Indeed, assume for a contradiction that there is some subset with elements. Let . For each , let converge to (see Figure 5). By Lemma 4.17(3), there is some such that
[TABLE]
Set . Then by Lemma 2.1, the ball centered at and of radius contains the vertex of for each . We claim that the vertices for are pairwise distinct, yielding the desired contradiction. Assume that for some , and let us show that . By Lemma 4.6, it is sufficient to show that . By Lemma 4.5, it is then sufficient to show that (the converse inclusion being obtained by exchanging the roles of and ). Let thus . In view of (7), we can apply Lemma 4.17(4) (with , , and ) to conclude that there exists some such that for all . Thus, , as desired. ∎
Corollary 5.3**.**
Assume that is uniformly locally finite. Let . Then there is some such that is a straight CGR. In particular, is finite.
Proof*.*
By Proposition 5.2, the set is finite. Hence Lemma 4.18 yields some such that is straight. The second claim then follows from Lemma 4.13. ∎
Lemma 5.4**.**
Let and . Then is finite.
Proof*.*
Assume for a contradiction that there exists an (unbounded) sequence . In particular, and for all by Lemma 4.15. For each , let converge to and passing through (see Figure 6). By Lemma 5.1, we may assume, up to extracting a subsequence, that converges to a CGR from to . Note that , so that by Lemma 4.5. Hence by definition of , and by Lemma 4.6. Let be such that (see Lemma 3.1), and let be such that . Thus . On the other hand, Lemma 4.3 yields . Therefore, , yielding the desired contradiction. ∎
Definition 5.5**.**
Assume that is uniformly locally finite. Let . For , we let denote the set of with and such that is minimal for these properties. Note that is finite (because is locally finite) and nonempty by Corollary 5.3. We set
[TABLE]
Example 5.6**.**
In the context of Example 3.6 (see Figure 2), if for some , then .
Example 5.7**.**
Consider the graph depicted on Figure 7, with vertex set . As in Example 3.6, has a unique element , while has two elements , respectively corresponding to the (limits of the) CGR and . However, in this case, all vertices are -special: if , then , and
[TABLE]
are straight CGR. On the other hand, the sets and have an infinite symmetric difference. Note, however, that the sets and have finite symmetric difference.
Proposition 5.8**.**
Assume that is uniformly locally finite. Let . Then , and for any , the set is finite.
Proof*.*
The inclusion readily follows from Lemma 4.14, and the inclusion from Lemma 4.15. Let now . By Corollary 5.3, there is some such that is a straight CGR. Note that and that by Lemma 4.13. Moreover, . Let . Then is finite by Lemma 5.4, and hence is finite, yielding the claim. ∎
Theorem 5.9**.**
Assume that is hyperbolic and uniformly locally finite. Let . Then is finite.
Proof*.*
Assume for a contradiction that there exists an infinite sequence . Since is finite by Proposition 5.2, and since is finite for each (because is locally finite), we may assume, up to extracting a subsequence, that for some and some with . Let , so that . Then Lemma 5.4 implies that is finite, and hence is finite, yielding the desired contradiction. ∎
We conclude this section with an easy observation that will be used in §6.
Lemma 5.10**.**
Assume that is uniformly locally finite. Let be a subgroup of . Then for all and .
Proof*.*
Let . Since preserves geodesic paths and CGR, it acts on and , and we have , (, ), , (), (), (, ), and hence (). ∎
6. Endgame
This section is devoted to the proof of Theorem A.
Let be a finitely generated hyperbolic group. Write for the neutral element of . Let be a finite symmetric set of generators of , and let be the Cayley graph of with respect to . Thus is a uniformly locally finite -hyperbolic graph (for some ) with , and we keep the notions and notations relative to that we developed in the previous sections, choosing as base point (we will also write and instead of and ). In addition, given a path (resp. ) in , we denote the -th entry of by . Fix a total order on (and hence, in particular, on ) such that
[TABLE]
Definition 6.1**.**
Given a boundary point , we define as
[TABLE]
Write for the lexicographically least string of length which appears infinitely many times in , i.e. such that for infinitely many (note that contains infinitely many elements of for every by Proposition 5.8). Note also that for each , the sequence is an initial segment of the sequence (because if , then also ). In particular, is well-defined. Write
[TABLE]
and let (with respect to the total order on ). Finally, set
[TABLE]
and note that the sequence is nondecreasing in .
We will now establish the Borelness of a number of subsets of standard Borel spaces constructed from the standard Borel spaces , and . We recall that has the discrete topology, the topology defined in §2.3, and the topology of pointwise convergence.
Claim 6.2**.**
The set
[TABLE]
is closed in , and each set () is compact.
Proof*.*
Each is compact by Lemma 5.1, and hence is closed, as its intersection with each clopen subset () of is compact (hence closed). ∎
Claim 6.3**.**
The set
[TABLE]
is closed in .
Proof*.*
Indeed, if converges to and converges to , then by definition of the topology on , there is a sequence of CGR subconverging to a CGR . As by Lemma 2.1, this implies that , and hence that , as desired. ∎
Claim 6.4**.**
The set
[TABLE]
is Borel in .
Proof*.*
Since , where , it is sufficient to check that is closed for each . Let thus . Note that is the projection of the subset
[TABLE]
of to . As is closed by Claim 6.3, and as the projection of a closed set along a compact space is also closed, is indeed closed by Claim 6.2. ∎
Claim 6.5**.**
The set
[TABLE]
is Borel in .
Proof*.*
We will show that is both analytic and coanalytic, hence Borel.
Note first that if and , then if and only if
[TABLE]
As if and only if , which is a Borel definition of the subset of , we deduce from Claim 6.3 that is analytic (because the above formula defining has only one existential quantifier, , ranging over an uncountable standard Borel space).
Now, to see that is coanalytic, note that if and only if for every , we can find a sequence of geodesic paths starting at and contained in the -neighbourhood of (such a sequence subconverges to some by local finiteness of ), and such that for all vertices and all large enough (i.e. so that ). (The forward implication follows from Lemma 2.1.) In other words, if and only if
[TABLE]
Note that the three subformulas “”, “” and “” in the above formula correspond to closed or closed and open sets (in appropriate standard Borel spaces) and all the quantifiers except for one range over countable sets. This single quantifier is the universal one , and thus the above formula defines a coanalytic set. ∎
Definition 6.6**.**
By Proposition 5.2, each is finite and there exists such each has at most elements. Since is Borel in by Claim 6.5 and has finite sections of size at most , the Lusin–Novikov theorem yields Borel functions such that is the union of their graphs .
Claim 6.7**.**
For each , the set
[TABLE]
is Borel in .
Proof*.*
By Lemma 4.2, for some, or equivalently every CGR converging to . This easily gives both analytic and coanalytic definitions of , because if and only if (resp. ) with and and . ∎
Claim 6.8**.**
The set
[TABLE]
is Borel in .
Proof*.*
This follows from the definition of special vertices (see Definition 4.8) and the fact that the sets and are Borel (see Claims 6.4 and 6.7). Indeed, is -special if and only if
[TABLE]
The “if” in the above equivalence follows by local finiteness of , since the sequence with will subconverge to some . ∎
Claim 6.9**.**
The set
[TABLE]
is Borel in .
Proof*.*
Note that if and only if and and . Hence is Borel by Claims 6.7 and 6.8. ∎
Claim 6.10**.**
The set
[TABLE]
is Borel in .
Proof*.*
Note that if and only if and and and is minimal for these properties. Hence is Borel by Claims 6.4, 6.5 and 6.9. ∎
Claim 6.11**.**
The set
[TABLE]
is Borel in .
Proof*.*
Note that if and only if and and . Hence is Borel by Claims 6.7 and 6.10. ∎
Claim 6.12**.**
The set
[TABLE]
is Borel in .
Proof*.*
Recall that
[TABLE]
so that if and only if . In other words, is obtained as the projection on of the Borel set (see Claim 6.11). However, vertical sections of are finite by Proposition 5.2. Thus, is Borel by the Lusin–Novikov theorem. ∎
Claim 6.13**.**
The set
[TABLE]
is Borel in .
Proof*.*
Note that if and only if and . Hence is Borel by Claims 6.4 and 6.12. ∎
Recall from Definition 6.1 the definition of the sequences .
Claim 6.14**.**
For each , the set
[TABLE]
is Borel in .
Proof*.*
Note that if and only if and and and is minimal in for these properties. Hence is Borel by Claim 6.13. ∎
Let now denote the orbital equivalence relation for the -action on . To prove Theorem A, we have to show that is hyperfinite.
Definition 6.15**.**
Set . In other words, since is locally finite, is the set of such that there exists some belonging to for all , i.e. for which there exists some CGR of type .
Lemma 6.16**.**
The map is a Borel reduction.
Proof*.*
Note first that
[TABLE]
Indeed, if there are infinitely many couples , then there are infinitely many couples with the type of the initial segment of length of a CGR with (see Lemma 5.10), and hence there are infintely many couples in as the symmetric difference between and is finite by Theorem 5.9.
In particular, is constant on -orbits, as it maps the class of to the class of , and is the unique CGR from of type . This shows that is a reduction from to the identity, and it remains to see that is Borel. But this boils down to the Borelness of the set , which follows from Claim 6.14 as if and only if . ∎
Lemma 6.17**.**
* is smooth on the -saturation of .*
Proof*.*
Lemma 6.16 implies that is smooth on , whence the claim. ∎
It now remains to check that is hyperfinite on the complement of in .
Definition 6.18**.**
Let be the complement of in , i.e.
[TABLE]
For each , we define the function by
[TABLE]
Let be the equivalence relation on which is the restriction of the shift action of on .
The following lemma has exactly the same proof as [HSS19, Lemma 5.2] and we reproduce it here for completeness.
Lemma 6.19**.**
There exists a constant such that for each , the relation on has equivalence classes of size at most .
Proof*.*
We will prove the lemma for the size of the ball centred at and of radius in . Let . Let and suppose are -related as witnessed by . Then . We will show that , as desired.
Note that since (resp. ) is an infinite subset of (resp. ), it uniquely determines the boundary point (resp. ). In particular,
[TABLE]
[TABLE]
As , there exist a CGR passing through , say for some , and a CGR passing through , say for some . Note that by Lemma 2.1. Moreover, : indeed, as , the minimality of in implies that
[TABLE]
Similarly, , and hence there exist passing through , say for some , and passing through , say for some . Again, by Lemma 2.1, and because and hence the minimality of in implies that
[TABLE]
Applying Lemma 2.1 one more time to the sub-CGR of and starting at , and using the fact that , we find some such that .
Note that
[TABLE]
Thus,
[TABLE]
where the inequality follows from . ∎
Lemma 6.20**.**
Let . Then the map is Borel. In particular, the set is analytic.
Proof*.*
The sets , , , and are easily seen to be definable using only formulas with countable quantifiers and references to the Borel set (see Claims 6.13 and 6.14). In particular, these sets are Borel. Hence is Borel (as its graph is Borel) and is analytic, as desired. ∎
By Lemma 2.3 (applied to , , the shift action of on , and the constant from Lemma 6.19), we find a finite Borel equivalence relation on with . Let be a reduction from to (such a reduction exists as every finite Borel equivalence relation is smooth) and define by . Let (i.e. for all ).
Lemma 6.21**.**
The relation is hyperfinite.
Proof*.*
Note first that is Borel, because each is Borel by Lemma 6.20. Note next that is a countable equivalence relation. To see this, let () be the relation on defined by if for all . Note that each is a countable equivalence relation. Indeed, if , then in particular . However, the function is countable-to-one as is countable-to-one (namely, if then , and hence ) and is finite-to-one, yielding the claim. Thus, is indeed countable. Also, is by definition hypersmooth. Thus, by [Gao09, Theorem 8.1.5], the relation is hyperfinite. ∎
Lemma 6.22**.**
The function is a homomorphism from to .
Proof*.*
Suppose are such that for some . By Theorem 5.9 (and Lemma 5.10), the sets and differ by a finite set. Since both are in and is locally finite, there is some such that for all . Since by (8), we then have and hence for all . Thus , and hence for all . Therefore, for all , that is, . ∎
Proof of Theorem A: By Lemma 6.22, the relation is a subrelation of . A subrelation of a hyperfinite equivalence relation is also hyperfinite, so is hyperfinite by Lemma 6.21. On the other hand, is smooth, and hence also hyperfinite, on by Lemma 6.17. Therefore, is hyperfinite on , thus concluding the proof of Theorem A. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AB 08] Peter Abramenko and Kenneth S. Brown, Buildings , Graduate Texts in Mathematics, vol. 248, Springer, New York, 2008, Theory and applications.
- 2[Ada 94] S. Adams, Boundary amenability for word hyperbolic groups and an application to smooth dynamics of simple groups , Topology 33 (1994), no. 4, 765–783.
- 3[BH 99] Martin R. Bridson and André Haefliger, Metric spaces of non-positive curvature , Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 319, Springer-Verlag, Berlin, 1999.
- 4[CFW 81] A. Connes, J. Feldman, and B. Weiss, An amenable equivalence relation is generated by a single transformation , Ergodic Theory Dynamical Systems 1 (1981), no. 4, 431–450 (1982).
- 5[CL 11] Pierre-Emmanuel Caprace and Jean Lécureux, Combinatorial and group-theoretic compactifications of buildings , Ann. Inst. Fourier, Grenoble 61 (2011), no. 2, 619–672.
- 6[DJK 94] R. Dougherty, S. Jackson, and A. S. Kechris, The structure of hyperfinite Borel equivalence relations , Trans. Amer. Math. Soc. 341 (1994), no. 1, 193–225.
- 7[Gao 09] Su Gao, Invariant descriptive set theory , Pure and Applied Mathematics (Boca Raton), vol. 293, CRC Press, Boca Raton, FL, 2009.
- 8[Gro 87] M. Gromov, Hyperbolic groups , Essays in group theory, Math. Sci. Res. Inst. Publ., vol. 8, Springer, New York, 1987, pp. 75–263.
