Cubulating one-relator products with torsion
Benjamin Stucky

TL;DR
This paper extends the understanding of group actions on CAT(0) cube complexes by showing that certain one-relator products with torsion admit proper, cocompact actions, generalizing previous results to a broader class.
Contribution
It generalizes prior work by Lauer and Wise, demonstrating that one-relator products with torsion and factors acting on CAT(0) cube complexes also admit such actions.
Findings
One-relator products with relator exponent ≥ 4 act on CAT(0) cube complexes.
The result applies to locally indicable groups.
Proper and cocompact actions are established for these groups.
Abstract
We generalize results of Lauer and Wise to show that a one-relator product of locally indicable groups whose defining relator has exponent at least 4 admits a proper and cocompact action on a CAT(0) cube complex if the factors do.
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.
Cubulating one-relator products with torsion
Ben Stucky
Abstract
We generalize results of Lauer and Wise to show that a one-relator product of locally indicable groups whose defining relator has exponent at least admits a proper and cocompact action on a cube complex if the factors do.
1 Introduction
Much effort has been devoted to studying groups which act properly and cocompactly on cube complexes, henceforth referred to as cubulable groups, in recent years. Their most famous appearance is in the resolution of the Virtual Haken Conjecture by Agol and Wise, building on work of Bergeron-Wise, Kahn-Markovic, Perelman, Thurston, and others, in which the cubulation of hyperbolic -manifold groups is featured prominently [BW12, KM12, Per03, Per02, Thu82]. Simply knowing that a group is cubulable is sufficient to conclude a good deal of structural information about it. For instance, these groups satisfy a Tits alternative [SW05], admit a quadratic-time solution to the word problem [Bri02], and satisfy the Novikov and Baum-Connes conjectures [HP84, CCJ*+*01]. Cubulable groups which have the stronger property of being virtually special, i.e., possess a finite index subgroup which embeds into a right-angled Artin group, enjoy stronger properties still, including separability of quasiconvex subgroups and linearity [Wis12, HW99].
Aside from hyperbolic 3-manifold groups, many classes of groups have been shown to be cubulable, including small cancellation groups [Wis04]. One-relator groups with torsion of exponent , groups which admit a presentation of the form with , were cubulated by Lauer and Wise in 2013 [LW13]. These groups are when . An extension of Wise’s result for groups was pursued by Martin and Steenbock in 2014 when they successfully cubulated small cancellation free products of cubulable groups [MS17]. In 2017, Jankiewicz and Wise gave an alternative proof of Martin and Steenbock’s result relying on Wise’s cubical small cancellation theory developed in [Wis09], though they only proved it for small cancellation free products [JW17]. In the present article, we generalize Lauer and Wise’s cubulation results for one-relator groups with torsion to the free product setting.
A group is locally indicable if every finitely generated subgroup admits as a homomorphic image. For an element of a group , let denote the normal closure of in . The following is our main theorem.
Theorem 1.1**.**
Let and be locally indicable, cubulable groups, a word in which is not conjugate into or , and . Then is cubulable.
We remark that this is implied by the results of [MS17] when and [JW17] when .
To prove Theorem 1.1, we are motivated to pass to a broader class of groups; namely, we consider “staggered” quotients of a free product of finitely many locally indicable, cubulable groups. The topological models for these groups are staggered generalized -complexes. See Section 2 for the definition of such a complex and its minimal exponent . Theorem 1.1 follows from the more general statement below by taking to be a dumbell space for the free product with a -cell corresponding to glued to it.
Theorem 1.2**.**
Let be a staggered generalized -complex. Suppose that has locally indicable, cubulable vertex groups and that . Then is cubulable.
Wise uses his theory of quasiconvex heirarchies to directly prove a strong generalization of the main result in [LW13], namely that all one-relator groups with torsion are virtually special [Wis09, Corollary 18.2]. One-relator groups with torsion are Gromov hyperbolic, so when the exponent of the defining relator in a one-relator group is at least , this result also follows from [LW13] and Agol’s theorem that a hyperbolic, cubulable group is virtually special [Ago13, Theorem 1.1].
Local indicability of and also implies that is hyperbolic relative to , a fact we will recover in the present article. Thus if and are hyperbolic themselves, then so is [Osi06, Corollary 2.41], and [Ago13, Theorem 1.1] gives the following as a corollary to Theorem 1.1:
Corollary 1.3**.**
Suppose that and are locally indicable, hyperbolic, and cubulable. Let be a word in which is not conjugate into or , and . Then is virtually special.
Though we suspect that Theorem 1.2 is true when , we unfortunately find it necessary to impose the restriction that , just as Lauer and Wise do, when seeking to prove properness of the action. In contrast to Lauer and Wise’s setting, it also appears that the condition that is necessary for the cocompactness argument.
Question 1.4**.**
Do Theorems 1.1 and 1.2 hold when ?
In view of the fact that one-relator groups with torsion are virtually special, the following question is intriguing but well beyond the scope of the present article.
Question 1.5**.**
Let and be locally indicable, virtually special groups, a word in which is not conjugate into or , and . Is virtually special?
1.1 Methods
Our methods are topological, and we follow [LW13] whenever possible. Briefly, the argument for proving Theorem 1.1 is as follows. We first build a model space for by starting with a dumbell space of non-positively curved cube complexes with and , and then attaching a -cell to a path corresponding to the word , so that . See figures 1 and 2. The task, then, is to build a -invariant collection of walls in the universal cover, invoke a construction of a dual cube complex with a -action due to Sageev [Sag95], and prove that the walls are geometrically nice enough to conclude properness and cocompactness of the action.
1.2 Outline
We define staggered generalized -complexes in Section 2. We also define the notion of a tower in this section, a fundamental tool for studying these complexes.
Let be the fundamental group of a staggered generalized -complex with locally indicable, cubulable vertex groups and minimal exponent . We prove geometric small cancellation results about exposed and extreme -cells in generalized van Kampen diagrams over in Sections 3 and 4. These are strong statements about the local geometry of staggered generalized -complexes on which the rest of this work depends. These sections are direct generalizations of the work of [LW13]. Here the importance of the hypothesis of local indicability will be made clear. The work in this section relies heavily on work of James Howie [How81, How82, How87].
In Section 5, we prove statements about the local geometry of a space which is essentially the universal cover of , and we develop a tool called patchings for producing the kinds of diagrams we can work with to prove results in later sections.
In Section 6, we recover relative hyperbolicity of using Osin’s idea of linear relative Dehn functions [Osi06], which will be important for later arguments. The results up to this point in the outline do not depend on the fact that has cubulable vertex groups.
We define the walls in in Section 7, combining the Lauer-Wise walls of [LW13] with the natural walls in the portions of the universal cover which are already cube complexes. Ladders are defined as well – these are a convenient way to focus our study of the walls on the -skeleton of . We prove that walls embed and separate in Section 8.
We establish necessary conditions for the action on the dual cube complex to be cocompact in Section 9. Here the present work diverges from [LW13] significantly in order to deal with the fact that is not a Gromov hyperbolic group, in general. The fact that and one-relator groups with torsion are hyperbolic was used critically in [Wis04] and [LW13] to get that the action of on the dual cube complex is cocompact, in part because quasiconvexity is much easier to characterize in hyperbolic groups. This was also a concern for Martin and Steenbock [MS17]. We prove that wall stabilizers satisfy a property called relative quasiconvexity; this turns out to be the key to cocompactness of the action. Importantly, this argument involves attaching combinatorial horoballs (defined in [GM08]) to to obtain a hyperbolic space.
In Section 10, we show that the walls in satisfy a properness criterion called linear separation, which roughly means that the number of walls separating two points grows linearly in the distance between them.
We put everything together in Section 11. We use the Sageev construction to produce a dual cube complex with a -action. Since our group is hyperbolic relative to the factors and our walls are relatively quasiconvex, a little more work allows us apply a theorem of Hruska and Wise and prove cocompactness in this more general setting [HW14, Theorem 7.12]. Linear separation is used to show that the action is proper. Theorem 1.2 is proved in Theorem 11.5 and Theorem 1.1 is Corollary 11.6.
1.3 Acknowledgments
The author wishes to thank Max Forester for his invaluable guidance throughout the duration of this project and without whom this work would not have been possible. He also wishes to thank Paul Plummer and Jing Tao for helpful discussions, and Noel Brady for helpful comments and questions during the post-production phase. Finally, he wishes to thank the faculty and graduate students of Temple University for their hospitality and generosity in providing a place for him to work and discuss mathematics during the 2018 – 2019 academic year.
2 Preliminaries
Definition 2.1**.**
(Regular map). Let be a CW complex. A continuous map is called regular if there is a decomposition of such that the map takes vertices to vertices and edges to edges.
Definition 2.2**.**
(Cyclically reduced edge path). Let be the total space of a graph of spaces where the vertex spaces are CW complexes and the edge spaces are trivial. A cyclically reduced edge path is a regular edge path in with no backtracking and with the property that if it contains a path of the form where is an oriented edge between two vertex spaces and maps to a single vertex space, then represents a nontrivial element of of that vertex space.
The following is a more topological definition of a staggered generalized -complex than that given in [HP84].
Definition 2.3**.**
(Staggered generalized -complex). A staggered generalized -complex consists of:
- •
The total space : A graph of spaces where the vertex spaces are CW complexes and the edge spaces are trivial;
- •
A set of -cells attached to whose attaching maps are regular, map to cyclically reduced edge paths, and contain an edge of in their image.
- •
A staggering:
A linear order on ,
A linear order on ,
For , if then and , where is defined to be the least edge from occurring in the attaching map for , and similarly for .
We call the essential -cells of and the essential edges. When comparing cells of we will sometimes use the notation to refer to the linear orders in the staggering. We will also sometimes write instead of to emphasize the staggering to which we are referring.
Definition 2.4**.**
(Exponent/proper power/minimal exponent ). For an essential -cell of , the assumptions on the attaching map of imply that , viewed as an element of for some choice of base-point, is not conjugate into the fundamental group of any vertex space. This implies that acts loxodromically on the Bass-Serre tree corresponding to , i.e., it has positive translation length. This implies that is not infinitely divisible in . Thus there is a well-defined exponent . If we say that is attached by a proper power. We define the minimal exponent .
For any cell , we are free to adjust the attaching map by free homotopy in without affecting . If the exponent of is , then the attaching map of is freely homotopic to an edge path of the form . We thus adopt the convention that the attaching map of is periodic with period .
Definition 2.5**.**
(Indicable/locally indicable). A group is called indicable if it has as a quotient, and locally indicable if every nontrivial finitely generated subgroup is indicable.
Definition 2.6**.**
(Tower/tower lift/height/maximal). A tower is a map between connected CW complexes such that where each is an inclusion of a finite subcomplex and each is an infinite cyclic cover. The number is called the height of . Let and be connected CW complexes and be a map. A tower lift is a map such that there is a tower and . The map is called maximal if any tower lift of has the property that the associated tower is a homeomorphism.
Let be compact and be a combinatorial map between connected CW complexes, that is, the restriction of to the interior of each cell is a homeomorphism. Howie shows [How81, Lemma 3.1] that has a maximal tower lift . Note that a tower lift is not maximal if is not indicable and is. Otherwise, admits an infinite cyclic cover corresponding to the kernel of a nontrivial map , and will lift since must lie in this kernel.
The following remark is straightforward, since it is easily verified for infinite cyclic covers and inclusions of finite subcomplexes (even with the free homotopy considerations of Definition 2.4).
Remark 2.7**.**
If the attaching map of a -cell in is a proper power of exponent , then for any -cell in with under a tower , the attaching map of will be a proper power of the same exponent.
The following lemma connects staggered generalized -complexes and towers.
Lemma 2.8**.**
(cf [How87, Lemma 2]). If is a tower and is a staggered generalized -complex, then so is .
Proof.
We induct on the number of maps comprises, so it suffices to assume that is an inclusion of a connected subcomplex or an infinite cyclic cover. In the first case, note that the staggering of restricts to a staggering of any subcomplex of . In the second case, let be a generator of the deck group of the cover, and define a staggering on both the -cells and -cells of by the prescription that if (if ), or for some positive integer (if ). This gives a “lexicographic” staggering for .∎
There may be multiple ways to stagger . Whenever is a tower, we make the convention that the staggering on arises in the manner just described.
3 Some extreme -cells
In this section let be a staggered generalized -complex.
Convention 3.1**.**
In what follows, when we refer to an -cell of a CW complex, it should be understood that refers to the interior of that -cell. When we need to explicitly refer to the closure of a cell , we will use the notation .
Lemma 3.2**.**
(cf [How87, Lemma 3]; [HW01, Lemma 2.6]). Suppose is compact, has locally indicable vertex groups, and has at least one essential -cell and no infinite cyclic cover. If the greatest essential -cell of is not attached along a proper power in , then collapses across with free edge , i.e., is homotopy equivalent to the complex obtained after removing and from through a homotopy supported on .
Proof.
We follow Howie’s proof in [How87] – only minor changes are necessary.
Note that if some essential -cell is attached by a proper power in , then replacing with the -cell attached by will not affect , and giving the same position as in the ordering of the -cells will not affect the staggering of . So we may assume no essential -cell is attached by a proper power.
We induct on the number of essential -cells in . If there is only one, then the rank of is at most one, since . If is a tree of spaces, then at most one vertex space can have nontrivial first homology by the Mayer-Vietoris theorem. Also, since the attaching map of is reduced, cyclically reduced and has positive length, there exists a closed subpath of the attaching map of which lies in a vertex space of for which . Since is reduced and cyclically reduced, represents a nontrivial element of . Since is locally indicable and finitely generated since is compact, we obtain a surjective map from to , giving us an infinite cyclic cover of and contradicting that . On the other hand, if is not a tree of spaces, then we must have for each vertex space and there is a unique simple cycle in . The attaching map of must travel exactly once around this cycle, so that it uses exactly once, and we can see that collapses across with free edge .
For the inductive step, consider the Mayer-Vietoris sequence
[TABLE]
associated to attaching to the rest of . Exactness shows that the rank of is at most one. Let be the subcomplex of formed by removing and from . If is connected, then , so . Otherwise has two components and (say), and ; assume without loss of generality that . In this case, note that must contain at least one essential -cell whose attaching map lies entirely inside it. If not, then would imply that were a tree of spaces, with each vertex space having trivial first cohomology. Then since the attaching map of uses and is reduced/cyclically reduced, we could find a closed subpath of lying in some vertex space of such that represents a nontrivial element of . As before (using compactness of ), indicability of would lead to an infinite cyclic cover of , contradicting that .
Thus we may apply the inductive hypothesis either to (in case is connected) or (in case is not connected), but using the staggering opposite to that inherited from (i.e., the orderings of the -cells and -cells are reversed). Then the complex in question collapses across its least essential -cell (in the original ordering) with free edge . But does not involve since , so also collapses across with free edge . Let be the result of this collapse.
Now has fewer essential -cells than , so again apply the inductive hypothesis to (using the original ordering) to see that collapses across with free edge . But does not involve since . Thus also collapses across with free edge . ∎
Lemma 3.3**.**
(cf [LW13, Lemma 3.10]; [HW01, Lemma 2.7]). Suppose is compact, has locally indicable vertex groups, and has no infinite cyclic cover. Let be the greatest essential -cell of . Then is attached along a path where is a closed path in passing through exactly once. Moreover, no other 2-cell is attached along .
Proof.
The proof is identical to the proof of [HW01, Lemma 2.7], except that we appeal to Lemma 3.2 rather than [HW01, Lemma 2.6]. ∎
We will now prove some helpful results about van Kampen diagrams in . For our purposes it will be useful to allow diagrams which are not planar. In what follows, the boundary of a -complex , denoted , is the closure of the set of -cells in which occur in the attaching map of at most one -cell of .
Definition 3.4**.**
(Cancelable pair/reduced/diagram). Let be a CW complex and a compact -complex. Let be a combinatorial map. Let and be a pair of -cells of with attaching maps and . We say that and form a cancelable pair if there is a decomposition of as a loop for some edge and a decomposition of as a loop for some edge such that and . The map is called reduced if does not contain a cancelable pair. It is called a diagram if is simply connected.
The following remark is straightforward.
Remark 3.5**.**
Let be a CW complex, a diagram, and a lift of to a cover. Then is reduced if and only if is reduced.
Thus we have the following.
Remark 3.6**.**
Let be a CW complex, a reduced diagram, and a maximal tower lift. Then is reduced if and only if is reduced.
The following fundamental result is due to van Kampen:
Theorem 3.7**.**
Let be a CW complex and let be a closed path in . Then is null-homotopic if and only if there exists a diagram with a planar -complex such that there is a parametrization of mapping to .
In the above theorem, we may assume is reduced if is a cyclically reduced path, as there are standard moves that we can do to make reduced without affecting .
Definition 3.8**.**
(Position). Two -cells and on the boundary of an essential -cell in are in the same position in if they are attached to the same -cell of , and a path in from the terminal [math]-cell of to the terminal [math]-cell of is a cyclic conjugate of for some . For a -cell in we let denote the collection of the -cells in the same position as in . If is a combinatorial map, we extend these definitions to -cells and -cells of by considering their images under .
Definition 3.9**.**
(External/internal/exposed). Let be a combinatorial map. An essential -cell in is external if there is an essential -cell in ; otherwise it is called internal. An essential -cell in is exposed if there is an essential -cell in such that every -cell in lies in . We also say is an exposed edge. By definition, only essential edges can be exposed.
Note that if is a combinatorial map, then a total order of some cells of induces an order of the preimages of those essential cells of in , which we will also denote by . Since two cells of may map to the same cell of , it may be the case that for cells and of . In this sense, is a quasi-order. Note that by our convention for staggerings associated to towers, if is a tower lift of and , then for essential cells and of .
Lemma 3.10**.**
(cf [LW13, Lemma 4.7]; [HW01, Lemma 4.1]). Suppose has locally indicable vertex groups. Let be a maximal tower lift of a reduced diagram . If is a greatest (resp. least) -cell of (under ), then is exposed with exposed edge (resp. ). In particular, every reduced diagram with at least one essential -cell has an exposed essential -cell.
Proof.
Note that is compact by definition. Let be the unique greatest -cell of . By Lemma 3.3, is the unique -cell whose attaching map uses the edge , and it uses it exactly times if is the exponent of . Let be an essential -cell of mapping to . If is not exposed in , then there is a -cell of adjacent to along some essential -cell which also maps to . Since is the unique -cell using , we must have . Since the attaching map of uses exactly times and is a proper power of exponent , we must have that , the longer path from the terminal to the initial vertex of in , and , the analogous path in , must map to the same path in . This shows that and form a cancelable pair and contradicts that the map is reduced (by Remark 3.6). ∎
Definition 3.11**.**
(Auxiliary diagram/extreme). Let be a combinatorial map. The auxiliary diagram associated to is obtained from by collapsing all regions of which map to vertex spaces of to points. For any set of , denote the image of in by . We say that an essential -cell of is extreme if there is a subpath of (also called extreme) such that contains every -cell in for some exposed edge in , and does not intersect the closure of a -cell in other than the closure of , except possibly at its endpoints.
Remark 3.12**.**
All extreme -cells are exposed. When the definitions of exposed and extreme coincide.
The following basic topological fact will be quite useful throughout this paper. The proof is straightforward.
Lemma 3.13**.**
(Snipping Lemma) Let be a simply connected -complex. Let be an embedded, locally separating arc in between two points and in , and suppose that the interior of does not intersect . We call a snipping arc. Then is disconnected (i.e, is separating). In particular, suppose is contained in a single -cell , and fix a parametrization . Let and be two points of which lie in distinct components of . Then there is no path from to in .
Lemma 3.14**.**
(cf [LW13, Lemma 4.9]). Suppose is a combinatorial map, is simply connected, and a -cell of is external. Let be a component of . Then is connected, is simply connected, and is simply connected.
Proof.
Suppose is disconnected and pick points and in distinct components therein. Let be the component containing . Fix a parametrization and subdivide so that is a combinatorial map. Let be a maximal arc of (under inclusion) such that . Let be the last edge of before and be the first edge after . It follows that and lie in . Connect two points on the interior of and by a snipping arc through the interior of . The fact that there is a path from to in (thus avoiding ) contradicts the Snipping Lemma. Thus is connected.
Note that is the union of and , and that . Since is simply connected, so is by van Kampen’s theorem. This proves the second statement of the lemma.
Note that is also simply connected by van Kampen’s theorem. Proceeding inductively, let be components of and observe that decomposes as the union of and with connected intersection . By inductive hypothesis and van Kampen’s theorem again, is simply connected. After finitely many steps we obtain that is simply connected, proving the lemma. ∎
Definition 3.15**.**
(Branch). Let be a reduced diagram. If is an exposed -cell of with exposed edge , then the components of which contain at least one essential -cell are called the branches of at .
The following is immediate by Lemma 3.14 and van Kampen’s Theorem:
Lemma 3.16**.**
Let be a reduced diagram, and suppose is an exposed -cell of with exposed edge . Let be a branch of at . Then is simply connected.
We can now prove our first diagram result:
Proposition 3.17**.**
(cf [LW13, Theorem 4.11]). Let be a reduced diagram where has locally indicable vertex groups, and suppose that contains at least two essential -cells. Then contains at least two extreme essential -cells.
Proof.
The proof is quite similar to that of [LW13, Theorem 4.11].
We induct on the number of essential -cells in . Let be a maximal tower lift of , and note that is compact by definition.
First suppose there are exactly two essential -cells in , and . Then and are both either greatest or least essential -cells, and so Lemma 3.10 implies that they are both exposed. We claim that and are both extreme. To see is extreme, let be an exposed essential edge of . Let be the branch of at which contains . By Lemma 3.14, is contained in an arc of between two consecutive elements of , and . Let be the arc of containing and which does not intersect . Note that contains . Collapse to the auxiliary diagram , which will have exactly two -cells, and . Note that . Since does not intersect except possibly at its endpoints, does not intersect the closure of except possibly at its endpoints. Thus is extreme. An identical argument shows is extreme.
For the inductive step, note first that we can find two exposed -cells and in . Indeed, if has only one essential -cell, then every essential -cell of is a greatest -cell and so is exposed by Lemma 3.10, so choose and arbitrarily. On the other hand if has two or more essential -cells, and since is surjective, we can find a -cell in (, say) mapping to the greatest -cell of , and a -cell in (, say) mapping to the least -cell of ; Lemma 3.10 will imply that and are exposed. If and are extreme we are done, otherwise assume without loss that is not extreme. Then for an exposed edge of , there are at least two branches of at (by Lemma 3.14). Call them and . Now and are simply connected by Lemma 3.16, and thus is a reduced diagram for with fewer essential -cells than . By the inductive hypothesis there is an extreme essential -cell in . Observe that is also extreme in since separates from all other branches of at . Similarly, we can find an extreme cell in which lies in . They are distinct since lies in and lies in . ∎
Note: This generalizes part of the Spelling Theorem of Howie and Pride [HP84, Theorem 3.1(iii)], since the diagrams considered in that paper are planar.
The following is a simple criterion for identifying when an essential -cell in a diagram is not extreme. It is straightforward to verify. We will not use it until later.
Lemma 3.18**.**
Let be a combinatorial map and let be an essential -cell of with boundary path , where the loop is not a proper power. Suppose that there are two vertices and lying in with the following properties:
- (i)
Both paths from to in contain at least as many edges as .
- (ii)
Each of the vertices and lies in the closure of at least two essential -cells in .
Then is not extreme in .
Proof.
Let be a subpath of such that contains every -cell in for some essential edge in . Condition (i) implies that either or lies in the interior of , and condition (ii) implies that the interior of touches the closures of some -cell of other than the closure of . Thus is not extreme. ∎
4 Many extreme -cells
In this section let be a staggered generalized -complex with locally indicable vertex groups.
Definition 4.1**.**
(Magnus subcomplex) (cf [LW13, Definition 3.6]). A Magnus subcomplex is a subcomplex with the following properties:
- (i)
The subcomplex contains the disjoint union of all vertex spaces.
- (ii)
If is an essential -cell of with the property that all essential boundary -cells of lie in , then lies in .
- (iii)
The essential -cells of contained in form an interval.
The following lemma is equivalent to Howie’s “locally indicable” Freiheitssatz [How81, Theorem 4.3]. We will reprove it for completeness.
Lemma 4.2**.**
(cf [HW01, Theorem 6.1]). If is a Magnus subcomplex of , then the inclusion is -injective for any choice of base-point in .
Proof.
We follow the proof in [HW01] – minimal modifications are necessary.
Let . Then any loop representing is nullhomotopic in , so we may apply Theorem 3.7 to construct a reduced diagram where is a disk and . We will show that every -cell of maps to ; this will imply is nullhomotopic in and so in .
If every essential -cell in maps to (or no essential -cells appear in ), then conditions (i) and (ii) imply that every -cell in maps to and we are done. So suppose there is an essential -cell in not mapping to (for brevity, say “ has a -cell not in ”). Reversing the staggering of if necessary, we may assume by condition (iii) that has a -cell not in which is greater than any essential -cell in . Let be a maximal tower lift of . Note that for any edge with the property that is greater (under ) than any essential -cell in , is greater (under ) than any essential -cell of mapping to by the tower . Thus the greatest essential -cell of , which we call , does not map to . Therefore no edge in lies in .
Since is in the image of the surjective map , this last fact implies that must lie on the boundary of some essential -cell in . Thus is for the greatest essential -cell of . Applying Lemma 3.10, is exposed in with exposed edge . This contradicts that no edge in lies in . ∎
Recall the following fact, the proof of which is technical but requires only Bass-Serre theory and Howie’s Freiheitssatz (see [How82]):
Lemma 4.3**.**
[How82, Corollary 3.4]** Let be a graph of groups with trivial edge groups and locally indicable vertex groups. Let be a cyclically reduced closed word of positive length in , and let be the normal closure of the subgroup generated by . Then no proper closed subword of represents an element of .
A topological interpretation of this gives the following:
Lemma 4.4**.**
(cf [LW13, Corollary 3.9]). In , let be a nontrivial proper subpath of the attaching map of an essential -cell , and suppose that is a closed path in . Then is not nullhomotopic in .
Proof.
Let be the Magnus subcomplex of consisting of all vertex spaces and the -cell . Let be the component of containing . Then decomposes as a graph of groups satisfying the hypotheses of Lemma 4.3. Let . Since is cyclically reduced, we realize as a proper closed subword of . Applying Lemma 4.3, is not nullhomotopic in . But for appropriate choice of base-point, and injects into by Lemma 4.2. Thus is not nullhomotopic in . ∎
Also recall the main theorem from [How82]:
Lemma 4.5**.**
[How82, Theorem 4.2]** Let and be locally indicable groups, and let be the quotient of by the normal closure of a cyclically reduced word of positive length. Then the following are equivalent:
- (i)
* is locally indicable;*
- (ii)
* is torsion free;*
- (iii)
* is not a proper power in .*
Howie mentions the following corollary [How82]:
Corollary 4.6**.**
(cf [How82, Corollary 4.5]). Suppose is such that the attaching map of each essential -cell is not a proper power. Then is locally indicable.
Proof.
Consider the set of all staggered generalized -complexes which have all of the same data as , except that is a finite subset of . Then the set of the groups forms a directed system for which is the direct limit. Since a direct limit of locally indicable groups is locally indicable, it suffices to assume is finite.
Induct on the number of essential -cells in .
If there is only one essential -cell, then there are two cases. If uses some essential edge which separates , then let and be the two components. Let , , and . Note that and decompose as free products of locally indicable groups and are thus locally indicable (by, e.g., the Kurosh subgroup theorem). Now apply Lemma 4.5 to get the result. Otherwise let be an essential edge used by . We can see that decomposes as a free product , where and corresponds to a loop with winding number over . Let , , and . Again observe that is locally indicable. Lemma 4.5 again applies to give the result.
For the inductive step, let be the greatest essential -cell of and let . Then no other essential -cell uses . If separates , then let and be the two components. Let , , and . Now and are staggered generalized -complexes with locally indicable vertex groups and fewer essential -cells, and so and are locally indicable by induction. Now apply Lemma 4.5. If does not separate , we can see that decomposes as a free product , where ) and corresponds to a loop with winding number over , since no essential -cell uses except . Let , , and . Again observe that is locally indicable by the inductive hypothesis. Lemma 4.5 again applies to give the result. ∎
We can put these results together and get a strong amplification of Remark 3.6:
Lemma 4.7**.**
(cf [LW13, Lemma 4.6]). Let be a reduced diagram. Let be a maximal tower lift of . If and are adjacent essential -cells of then .
Proof.
The proof is in the same spirit as that of [LW13, Lemma 4.6].
Suppose that and let be a -cell in (essential or not). Observe that . Let be the boundary path of , where is not a proper power. By Remark 2.7, the boundary path of is of the form where is a lift of to . Let be the path of length in which begins at the initial point of and traverses in the positive direction. The path is a closed loop, and we claim that there is a proper closed subpath of in . If the statement “the path is embedded except possibly at its endpoints” is false, then this is obvious, so in order to prove the claim, we may assume that is embedded in except possibly at its endpoints. Consider the set of edges in which belong to , which is nonempty since it contains . If this set has exactly one element, then is the only orbit of edges in mapping to the edge . Since , this implies that so that and form a cancelable pair, which contradicts that is reduced. Thus contains two distinct elements, and so there are two distinct edges of which become identified under . This proves the claim. Thus there is a proper closed subpath of in . See figure 3.
Let be the -complex associated with having nonperiodic attaching maps, and consider the map which is the identity on the -skeleton of , and an -fold branched cover on each essential -cell if is the exponent of that -cell. Let be the image of in . By Lemma 4.4, represents a nontrivial element of . Thus maps to a nontrivial subgroup of , and that subgroup is finitely generated since is compact. Since is locally indicable by Corollary 4.6, is indicable. Thus has an infinite cylic cover and the tower lift is not maximal, a contradiction. ∎
Now we can study connected subdiagrams of a reduced diagram:
Lemma 4.8**.**
(cf [LW13, Lemma 5.1]). Let be a maximal tower lift of a reduced diagram . Let be a connected subcomplex of , and let be a greatest -cell of . Then is exposed in .
Note: The proof below is slightly more complicated than Lauer and Wise’s proof of [LW13, Lemma 5.1]. There, the authors seem to assume that the subcomplex defined in the proof below is simply connected without justification.
Proof.
By Lemma 4.7 applied to the map , each essential -cell adjacent to in is strictly below (under ). Let be the smallest subcomplex of containing and all -cells adjacent to . Let be a minimal simply connected subcomplex of containing (under inclusion). Let be a maximal tower lift of the composition , and let be a greatest essential -cell of under . Now Lemma 3.10 implies is exposed in . Note that since all essential -cells in are below under , they are also below under . Thus . If , then consider the component of containing . This subcomplex of contains , is simply connected (by Lemma 3.14), and it is strictly contained in . This violates minimality of . Thus , so is exposed in . But contains all -cells in adjacent to , so is also exposed in . ∎
For an essential -cell in a reduced diagram , let be the preimage in of the disjoint union of the vertex spaces of , and define the following subcomplexes of :
[TABLE]
[TABLE]
Let and be the components of and , respectively, containing .
Lemma 4.9**.**
(cf [LW13, Lemma 5.3]). The components of and are simply connected.
Proof.
The proof is nearly identical to that of [LW13, Lemma 5.3]. We obtain by successively removing the closure of a least essential -cell from and passing to components of the closure of what remains. Reversing the staggering, Lemma 4.8 ensures that each successive essential -cell will be exposed, and Lemma 3.14 implies that removing each successive cell leaves simply connected components. In finitely many steps we obtain , and the argument is essentially the same for . ∎
We are ready to prove our second main diagram theorem:
Proposition 4.10**.**
(cf [LW13, Theorem 5.4]). Let be a reduced diagram. If has an internal essential -cell that maps to an exponent -cell of , then contains at least extreme -cells.
Proof.
The proof is essentially the same as that of [LW13, Theorem 5.4].
Let be a maximal tower lift of , and let be an internal essential -cell of of exponent . Define and with respect to . Now Lemma 4.8 implies that is exposed in both and , so there exist essential -cells and in such that each -cell in lies in and each -cell in lies in . Since is internal, this last statement implies that and must be distinct. Since the elements of are internal in , and because each branch of at intersects in an arc (Lemma 3.14), there are exactly branches of at . Call them . Let be the component of containing . Note that contains at least one essential -cell strictly greater than since contains an essential -cell adjacent to (applying Lemma 4.7 to ). So any greatest -cell of lies in . Now Lemma 4.8 implies that there exists an essential -cell in which is exposed in . Note that is exposed in since if is a -cell of adjacent to and doesn’t lie in , then is essential and , so lies in . Thus we obtain distinct exposed -cells in , one in each , and all strictly greater than .
We repeat almost the same argument for to obtain more distinct exposed -cells in , all strictly less than (in this case, the argument is actually simpler, as we don’t need to apply Lemma 4.7). Thus we obtain exposed -cells in . This completes the proof in the case , as the definitions of exposed and extreme coincide.
Thus assume , and let be exposed -cells of . If is not extreme, then has at least two branches at for some by Lemma 3.14. Let be a branch not containing , and note that is simply connected by Lemma 3.16. By Proposition 3.17, there are at least two extreme essential -cells in ; any one of these not equal to is extreme in . Repeating for each , we obtain extreme -cells. They are distinct since for , lies in the branch of at containing . ∎
5 Geometry of the universal cover
From now on, we assume that each essential -cell of is attached by a proper power, that is, .
Let be a staggered generalized -complex with locally indicable vertex groups and such that . We will soon be assuming that the vertex groups of are cubulated. This section contains a collection of results about the geometry of which do not depend on this assumption.
In what follows, we will be working in the universal cover of (denoted by ), or at least a space with the same one skeleton.
By Lemma 4.2, embeds naturally in for each vertex space of , and thus (the preimage of in ) decomposes as a graph of spaces with trivial edge spaces, where each vertex space is for some vertex space of . Let be the space obtained from by identifying elevations of essential -cells of which have the same boundary; it may be viewed as a subcomplex of which contains . Give the combinatorial metric in which every edge has length . All of the metric statements in this section are really about , and all paths of interest are edge paths. From now on, let be the graph metric on .
Once and for all, for each essential -cell , arrange that lifts of maximal subpaths of mapping to a vertex space are geodesics in each as follows: Suppose that the exponent of is , so the boundary is a path of the form , where is a loop in . For each maximal subpath of mapping entirely to a vertex space of , note that is a loop. We modify by replacing by a loop in with the properties that has the same basepoint as , and represent the same element of , and uses a minimal number of edges. Let be the result of modifying in this way. Replace by a -cell with attaching map . Doing this for all essential -cells does not affect , and the resulting staggered generalized -complex has the desired property. Thus we may assume that has the property that lifts of maximal subpaths of mapping to a vertex space are geodesics in each for each essential -cell .
In what follows, we refer to cells in as essential or not according to whether their images in are essential or not.
5.1 Admissible pseudometrics and relative geodesics
We will need to work with paths in which generalize geodesics. The idea of relative geodesics as defined below is that they allow for the possibility that paths can be “shorter than they look,” but only in vertex spaces. At certain times in what follows, we will be “augmenting” and allowing for this sort of behavior.
Definition 5.1**.**
(Admissible pseudometrics/relative length/relative geodesic). Let denote the metric on where every edge has length one. For each vertex space , choose a pseudometric on . We require that this choice of pseudometrics is invariant with respect to the action of on . If this holds we say the choice of pseudometrics is admissible.
Let be a path whose endpoints are [math]-cells and of . Decompose as a concatenation , where each is a (possibly degenerate) maximal edge path mapping to a vertex space of , and the are essential edges. We define the relative length of , , by the following formula:
[TABLE]
where and denote the initial and terminal vertices, respectively, of a path or edge . We say is a relative geodesic if the restriction of to each vertex space is a geodesic in the one-skeleton of that vertex space, and is minimal among all paths from to . If we have not made an explicit choice of admissible pseudometrics on vertex spaces, the statement that is a relative geodesic should be taken to mean that there is a choice of admissible pseudometrics which makes a relative geodesic.
Some examples of admissible choices of pseudometrics are as follows (provided that the choices are made in a -invariant manner):
- •
Make no change: For some/all , define for some/all . Thus geodesics are relative geodesics.
- •
“Electrify” some/all by defining for all .
- •
“Cone off” some/all by adding a new vertex and connecting all vertices of to it by an edge of length 1/2, and define by the metric this procedure induces, so that for all distinct .
- •
For some/all , choose so that there is a constant such that
[TABLE]
for all . This is the choice we will end up making later on.
5.2 Local geometry of essential -cells
The following fact is a crucially important statement about the boundaries of essential -cells in .
Lemma 5.2**.**
Suppose is a staggered generalized -complex with locally indicable vertex groups and . Let a relative geodesic in . Let be an essential edge of an essential -cell . Then there exists an element of not contained in .
Proof.
Suppose that the lemma is false. Among all triples with the property that all members of lie in the relative geodesic , choose one for which the number of edges in is minimal. Note that will contain at least two edges.
Label the elements of , (where is the exponent of ) in the order that they occur along , and orient them consistently with . Let and be the initial and terminal vertices, respectively, of for . By minimality, the initial point of is and the terminal point is . Let be the subpath of between and , for . Choose such that is minimal. See figure 4. Decompose the image of in as a path where is not a proper power. The closed path corresponds to an order element of which acts on by “rotation” through a point in the interior of . Consider the paths for . Each path will connect two elements of and the orbits will chain together to form an -pointed star shape with corners on members of (there are two cases according to whether the meet at their endpoints or have endpoints separated by the elements of ).
Now, find a shortest relative path in connecting to using only -orbits of and members of . See figure 5. It is clear that . On the other hand, since is a relative geodesic with the same endpoints as , we have that . Unless , this contradicts the inequality
[TABLE]
which holds when and .
Thus we have reduced to the case . We may also assume that connects antipodal points of , for otherwise connects to and since avoids and .
Observe by Lemma 4.4 that embeds in , so the two paths and of do not intersect in (labeled so that ). Since starts in and ends in , we can find an innermost subpath of whose endpoints lie in and , respectively, and whose interior does not intersect . Note that does not cross or , as this would provide an obvious way to decrease the relative length of .
Consider the compact subcomplex of . By choice of , . Let be a reduced path in which represents a generator of , and a reduced disk diagram with boundary . Let . If is not reduced, then there is an essential -cell of such that and form a cancelable pair and share an edge in their common boundary. If this happens, then “fold” over by identifying the paths and and deleting from . This is a homotopy equivalence and has the effect of modifying and deleting an essential -cell from . This process terminates after finitely many steps, so we may assume that is reduced. We may also assume that is contained in , since any -cell contributing an edge to not in may simply be removed from without affecting that is simply connected. Note that at most one of and lies in . Otherwise, connect a point of to a point of by a snipping arc running across the interior of , and observe that the path contradicts Lemma 3.13. Without loss of generality, assume that is internal in . Thus lies in the boundary of at least two distinct essential -cells of .
Thus there exist at least two essential -cells in . Consider the natural reduced map . By Proposition 3.17, there is an extreme essential -cell of distinct from with exposed edge , say. Since is contained in , all elements of are contained in this subcomplex of as well. In fact, all elements of are contained in since otherwise they could not lie on the boundary of . Now is a counterexample to the lemma. The fact that contradicts minimality of , and the lemma is proved. ∎
5.3 Patchings
The following construction is of critical importance for later arguments. It shows that certain non-simply connected subcomplexes of can be made simply connected without introducing extra exposed or extreme -cells, as follows.
Definition 5.3**.**
(Patching). Let be reduced, where is compact but not necessarily simply connected. A patching for is a simply connected -complex and a reduced diagram such that contains as a subcomplex, , and none of the essential -cells of are exposed in .
Remark 5.4**.**
In view of the unique composition , where the first map is any inclusion of into , reduced diagrams give rise to reduced diagrams and vice versa by Remark 3.5. Whenever we have a patching , we will casually confuse it with the corresponding diagram in order to apply Propositions 3.17 and 4.10.
Lemma 5.5**.**
Let be an inclusion of a compact connected -complex. Suppose that there is a path in with the property that contains every isolated edge of and maps to a relative geodesic in . Then a patching for exists.
Proof.
If is simply connected, then is a reduced diagram so set and we are done. Otherwise let be generators of . Let and . For each , Let be a reduced path in such that . Let be a reduced disk diagram such that . Inductively define , and observe that there is a natural combinatorial map . If is not reduced, then there is a cancelable pair of -cells in , but the cancelable pair cannot both lie in or in for any , since restricted to and to is reduced. We can make reduced as follows: First suppose that there is a cancelable pair of -cells and in and , respectively. Let denote the shared edge between and , and let and be the paths in and , respectively, from the terminal to the initial vertex of , which are identified under . Modify and by removing from and identifying with . Note that this process preserves as a subcomplex of , and that, although we are modifying , is homotopic to in . It preserves homotopy type of because it is a homotopy equivalence. Repeating as many times as necessary, we may assume that there is no cancelable pair between and for any . On the other hand, suppose that there is a cancelable pair of -cells and in and , respectively, for some . Similarly to the first case, let denote the shared edge between and , and let and be the paths in and , respectively, from the terminal to the initial vertex of , which are identified under . Modify and by removing from and identifying with . Again, note that this process preserves as a subcomplex of , and that, although we are modifying , is homotopic to in . It preserves homotopy type of because it is a homotopy equivalence. Repeating as many times as necessary, we may assume that there is no cancelable pair between and for any , and thus that is reduced. Now contains , and since is simply connected, is a reduced diagram. By construction, it is also clear that .
It remains to prove that any essential -cell belonging to is not exposed in . To that end, let be an essential -cell belonging to . Then belongs to the complex for some . Consider the complex to which has been attached by its boundary, and assume that folds have been performed as described in the previous paragraph so that is reduced. Observe that contains every isolated edge of and maps to a relative geodesic in , which is true by assumption for . Indeed, it is obvious that maps to a relative geodesic in , and for , every isolated edge of must belong to , so attaching to by its boundary cannot create new isolated edges in . Now, if is exposed in , then there is some exposed edge in such that lies in . Since each edge of also lies in , it must be the case that every edge of is an isolated edge of . Thus each edge of belongs to , contradicting Lemma 5.2. ∎
5.4 More local geometry of essential -cells
With patchings as the fundamental tool, we now prove some other statements about the local geometry of essential -cells.
Lemma 5.6**.**
Let and be distinct essential -cells of . Let be an essential edge of . Then at most one element of lies in .
Proof.
Suppose that two elements and of lie in . Then the complex satisfies the hypotheses of Lemma 5.5, so let be a patching. By Proposition 3.17, is extreme in with exposed edge . Note that since and are internal in . Thus there are two elements of , and , lying in distinct components of . Connect midpoints of and by a snipping arc running through the interior of , and observe that any path between and through the interior of contradicts Lemma 3.13. ∎
The following strong statement rules out several more pathologies for a relative geodesic which intersects the boundary of an essential -cell in .
Lemma 5.7**.**
Let be an essential -cell in with boundary path , and let be relative geodesic which uses at least essential edges of . With respect to the orientation of , let and be the first and last essential edges in (labeled so that their orientations are consistent with ). Index the essential edges of from to . The following statements hold:
- (i)
Each lies in .
- (ii)
There is a path in connecting to which does not use any essential edges.
- (iii)
The orientations of the are consistent with an orientation of .
Proof.
(i): Assume that some does not lie in . Let be the last essential edge of before which lies in , and let be the first essential edge of after which lies in . Let be the subpath of whose first edge is and last edge . Consider the complex . Then satisfies the hypothesis of Lemma 5.5, so let be a patching for . The fact that is simply connected implies is contained in an essential -cell of distinct from , since otherwise is isolated and non-separating. Thus contains at least two essential -cells. This contradicts Proposition 3.17, since is the only essential -cell of which can be extreme.
(ii): Assume there is no path in connecting to which does not use any essential edges. Let and be the two subpaths of connecting to . The subcomplex satisfies the hypotheses of Lemma 5.5, so let be a patching. Note that at least one of or has the property that all essential edges therein lie in the interior of , otherwise we may join two boundary essential edges of and by a snipping arc running across the interior of , and observe that the portion of between and contradicts Lemma 3.13. Without loss of generality, all essential edges of are internal in . Also, at least one essential edge exists there by assumption. Thus there is an essential -cell of distinct from . This contradicts Proposition 3.17, since is the only essential -cell of which can be extreme.
(iii): If this statement is false, then there is a pair of edges and which have opposite orientations in . Let be the subpath of starting with and ending with , and let . This subcomplex satisfies the hypotheses of Lemma 5.5, so let be a patching. Now, observe that at least one of or is internal in . Indeed, if this is not the case then connect and together by a snipping arc running across the interior of . The portion of between and now contradicts Lemma 3.13. Thus at least one of or is internal. This shows that there is an essential -cell in the diagram distinct from , but this contradicts Proposition 3.17, since is the only essential -cell of which can be extreme. ∎
The following is also useful:
Lemma 5.8**.**
Let be an essential -cell in , and let be a relative geodesic. Then the number of essential edges in is at most half the number of essential edges in .
Proof.
Let and be the first and last essential edges of , if they exist, and labeled so that they are oriented consistently with . By Lemma 5.7, it makes sense to orient consistently with . We may assume that and are distinct, for otherwise is a single edge and there is nothing to prove. Let be the (possibly degenerate) arc of between and but not including either of these edges, and let be the other (possibly degenerate) arc of . Lemma 5.7 also implies that uses every essential edge of , every essential edge of lies in , and the orientations and order in which these edges are visited are the same in both and . Suppose the boundary path of the image of in is of the form , where is not a proper power. The path is a loop in which corresponds to an order element in which acts by “rotation” of through a point in the interior of .
Let be the portion of running from to . If uses strictly more than half of the essential edges in , then there is some integer such that properly contains all essential edges of as well as and . Let be the subpath of running from to ; note since uses and but does not. Since by -invariance of , the path is an “-shortcut;” this contradicts that is a relative geodesic. ∎
5.5 Convexity of vertex spaces
The following fact will also be useful.
Lemma 5.9**.**
The vertex spaces of are convex.
Reminder: We are using the path metric on .
Proof.
Let be a geodesic edge path between vertices and of a vertex space . By passing to an innermost subpath outside of , we may assume that . Let be a shortest path from to in . Note that neither nor backtrack. Also, the first edges of and are not identified by the innermost subpath assumption; neither are the last edges. Thus the loop is reduced, so we may fill it with a reduced diagram . If contains an essential -cell, then by Lemma 3.10, there as an exposed essential -cell with exposed edge . Since consists only of edges which are not essential, all elements of lie on . This contradicts Lemma 5.2. Thus contains no essential -cells and so also maps to , which is also a contradiction. ∎
6 Relative hyperbolicity
Let be a staggered generalized -complex with locally indicable vertex groups and . From this point onward, assume that the total space is a finite graph of spaces, i.e., the graph obtained by collapsing each vertex space of to a point is finite. Note that this does not imply that is compact as vertex spaces may not be. However, it does imply that is finite. A result of crucial importance later on is that is relatively hyperbolic with these assumptions. We prove this now.
We will use a definition of relative hyperbolicity in terms of relative Dehn functions, introduced in a more general form by Osin in [Osi06], which Hruska shows is well-defined and equivalent to no fewer than five others ([Hru10]) in the case that the set of peripheral subgroups is finite.
Definition 6.1**.**
(Finite relative presentation/finite relative generating set). Suppose is a finite collection of infinite subgroups of a countable group (called peripheral subgroups) and let be the union of all . We say that has a finite relative presentation with finite relative generating set if is finite and symmetrized (), is a generating set for , and the kernel of the natural map from is finitely normally generated, where denotes the free group on the set .
Definition 6.2**.**
(Linear relative Dehn function). Suppose has a finite relative presentation with finite relative generating set . Let be the union of all . Let and be a finite normal generating set for the kernel of the natural map . For any word over representing the identity of (called a trivial word), we have an equation in of the form where and for each . The smallest such is called the area of and denoted by . We say has a linear relative Dehn function for this relative presentation if there is a linear function such that for each trivial word of length at most in , .
Definition 6.3**.**
(Relatively hyperbolic) [Hru10, Definition 3.7]. Suppose has a finite relative presentation. If has a linear relative Dehn function for some finite relative presentation of , then we say is relatively hyperbolic (or is hyperbolic relative to ).
Lemma 6.4**.**
Suppose is a staggered generalized -complex with locally indicable vertex groups, , and the total space is a finite graph of spaces. Let be the collection of vertex groups of . Then is relatively hyperbolic.
Proof.
We first construct a finite relative generating set for . Choose a maximal spanning tree of essential edges in . Orient the essential edges of . Now the finite relative generating set is in one-to-one correspondence with the set of these oriented edges and their formal inverses. Moreover, a normal generating set for the kernel of the natural map from can be identified with the set of boundary paths of each essential -cell of , after choice of base-point in .
Let be a reduced, cyclically reduced path in such that represents the trivial element of . Let be the union of all , and let denote the word length of in . Note that we can compute by counting the number of essential edges of in , plus the number of maximal subloops of which lie entirely in a single vertex space. Let be a reduced diagram for which uses a minimal number of essential -cells, and call the number of essential -cells in such a diagram . By Lemma 3.7, having a linear relative Dehn function with respect to the finite relative generating set above is equivalent to requiring that there exist constants such that for each such with .
To find such constants, we will also need to consider the “Bass-Serre length” of , denoted by , which is just the number of essential edges occurring in . We claim that:
- (1)
is bounded above by a linear function of , and
- (2)
is bounded above by a linear function of .
To see the first claim, note that since is finite, there is a constant such that any reduced path which stays entirely inside it (using only essential edges) can use at most essential edges. In particular any reduced path in with will either use an essential edge of or contain a subloop representing a nontrivial element of some vertex space. Thus if is a subpath of with , contributes at least one unit of length to . This shows that
[TABLE]
i.e.
[TABLE]
For the second claim, use Dehn’s algorithm: Let be a reduced diagram for which uses a minimal number of essential -cells. Suppose first that contains at least two essential -cells. Then contains an extreme essential -cell by Proposition 3.17. Since , has exponent at least two, and thus strictly more than half of the essential edges of lie on . Let be the unique component of which contains essential -cells (it is unique since is extreme). The path has the property that . Also, uses a minimal number of essential -cells since does. By induction on , we may assume that there exist positive constants and such that . Assume without loss that . We have that
[TABLE]
as well. On the other hand, if contains one or fewer essential -cells, then . In particular, we again have that .
Stacking the inequalities from claims (1) and (2) gives us our linear relative Dehn function. ∎
7 Walls and ladders
From now on, assume that the staggered generalized -complex with has the additional property that each of the vertex groups of admits a proper and cocompact action on a cube complex. We also continue to assume that is a finite graph of spaces.
Since locally indicable groups are necessarily torsion-free, our assumption that the vertex groups are cubulable in fact allows us to assume that each vertex space is a compact non-positively curved (NPC) cube complex, and the universal cover is a cube complex. Note that this implies in particular that each vertex group is finitely presented since is a finite for its vertex group. Since is finite, this also implies that the complex is locally finite. For metric statements in what follows, we will always be using the metric in the -skeleton of .
Note that acts geometrically (properly and cocompactly) on (though no longer freely, since there is a fixed point in each elevation of an essential -cell). We will define our walls as codimension- immersed hyperspaces in and then prove that they satisfy the necessary properties to apply the Sageev construction.
Similarly to the description in [Man16], we define walls as components of a “midcube complex,” . The cube complex and its natural map to are defined as follows.
We first describe the disjoint union of the cubes of . Fix . Each cell of is either a cube of some dimension or an essential -cell. Each -dimensional cube of contains midcubes of codimension obtained by setting exactly one coordinate equal to . For us, each of these midcubes will give rise to exactly two -dimensional cubes of equipped with homeomorphisms to two parallel copies of distance from on opposite sides of . On the other hand, each essential -cell of contributes edges to as follows. Suppose that is of exponent . Each edge in is either an essential edge or a -dimensional cube in some . In either case, consider two points in the interior of which are distance from the midpoint of . After choosing an orientation of we may label them and . There are an analogous pair of points in each edge of , and we add edges (-dimensional cubes) to where each edge maps to a path in running from the in each edge of to the in the next edge of through , and such that the images of these edges are disjoint. Moreover, we require that the image of edges of mapping to essential -cells is invariant with respect to the action of on .
Now identify faces of cubes of as follows: Whenever one of the face identifications of identifies the images of two faces of cubes of , we identify those faces in . The walls of are defined as the components of . Figure 6 shows an illustration of some portions of walls in .
Note that the action of on preserves the system of walls just defined. Also note that there are two types of walls in :
- (i)
The walls which are dual to essential edges and do not intersect any ; these walls are graphs.
- (ii)
The walls which intersect some . These walls may be higher dimensional. More precisely, these walls are graphs of hyperplanes, i.e., they consist of hyperplanes of vertex spaces which are joined to each other by edges crossing essential -cells, with the property that the endpoints of each edge are connected to vertices of hyperplanes.
A straightforward observation about walls is that they are locally determined:
Lemma 7.1**.**
For any cell of , if is nonempty and , then .
It is not clear that the walls we have just defined are well-behaved in . For example, a priori, a wall could travel in some vertex space , leave the space through some essential -cell , and later come back to that same vertex space so that its image in intersects itself. However, note that each wall is an NPC cube complex and so it makes sense to speak of a local geodesic in the -skeleton of a wall.
Definition 7.2**.**
(Carrier/wall segment/ladder). For a wall , the carrier of is the smallest subcomplex of containing the image of . A wall segment in a wall is a local geodesic in , embedded except possibly at its endpoints. The ladder associated to is the smallest subcomplex of containing the image of .
Note that ladders are necessarily -dimensional.
8 Walls embed and separate
In Lauer and Wise’s setting, ladders turn out to be simply connected. This is not necessarily true in our case, but they can be patched:
Lemma 8.1**.**
Let be the ladder associated to a wall segment. Then contains at most two extreme essential -cells, and there is a patching for .
Proof.
Consider the inclusion of into , which is a reduced map. Note that the first and last essential -cells of are the only candidates for extreme -cells. Indeed, let be the wall segment for which is the associated ladder, and observe that Lemma 3.18 may be applied to any essential -cell of which is not the first or last (taking the points and to be respective endpoints of the two edges of dual to and on opposite sides of ). Note also that has no isolated -cells, unless is a single edge. Thus the hypotheses of Lemma 5.5 are satisfied and exists. ∎
The fact that walls embed and separate is a consequence of the following lemma.
Lemma 8.2**.**
Let be a -cell of (essential or not). If is a wall segment with both endpoints in , then is contained in .
Proof.
Let be the ladder associated to and let . Note that embeds in . If is essential this follows from Lemma 4.4, and if is a square then this is a general fact about cube complexes. We will show that contains no -cells besides , which proves the lemma. If contains a -cell besides then we may choose distinct points and in such that the portion of (of positive length) between and (which we denote by ) does not internally intersect . Let be the ladder associated to , and note that is itself a ladder (by possibly extending across if necessary). By Lemma 8.1, has a patching .
Note first that cannot be a square. Indeed, if it is, then the wall segment passes through an essential -cell, for otherwise we have found a wall segment in a single cube complex which leaves and comes back to the same square, and this contradicts the known behavior of hyperplanes in these spaces. Let and be the first points along from and , respectively, which lie in the boundary of some essential -cells and , which may or may not be distinct. Note that and are the only candidates for extreme essential -cells of . On the other hand, and become identified in the auxiliary diagram, so in fact neither nor can be extreme by Lemma 3.18. The complex contradicts Proposition 3.17.
Thus is an essential -cell. By extending through if necessary, we see that is both the first and last essential -cell through which passes. Since is the only candidate for an extreme -cell of by Lemma 8.1, Proposition 3.17 implies that is the only essential -cell of , and is exposed by Lemma 3.10. Thus is made entirely of squares. Let and be the edges of containing and . Let and be the two arcs of . Suppose one of these arcs, say , contains no essential edges. The arc is a geodesic in a cube complex, and the wall segment shows that some wall segment (lying entirely in that cube complex) crosses it twice. This also contradicts behavior of hyperplanes in these spaces. Thus there are essential edges and in and respectively. On the other hand, and lie on by the fact that is the only essential -cell of and Lemma 4.4. Connect midpoints of and by a snipping arc running through the interior of and observe that the wall segment contradicts Lemma 3.13.
It follows that contains no -cells besides , and the lemma is proved. ∎
Proposition 8.3**.**
(cf [LW13, Theorem 7.4]). Each wall is a tree of hyperplanes and embeds in .
Proof.
If some wall is not simply connected, then there exists a wall segment of positive length in which is a loop. Let be the ladder associated to . Note that contains at least two -cells since the boundaries of -cells of embed. Pick a -cell in . The previous Lemma implies that every wall segment connecting any pair of points in passes through the interior of . This contradicts that contains at least two -cells.
Thus is simply connected. Since it is an NPC cube complex, it is in fact a cube complex. We thus see that is a tree if it is a wall of type (i), and a tree of hyperplanes if it is a wall of type (ii).
Now suppose that a wall does not embed in . Then intersects itself in some essential -cell or some cube . In the latter case, there is some -dimensional face of in which we will witness the intersection of with itself. Thus we may choose a wall segment which intersects itself exactly once in a -cell (essential or not) and let be the ladder associated to . Note that contains at least two -cells since the boundaries of -cells of embed. The previous Lemma implies that every wall segment connecting any pair of points in passes through the interior of . This contradicts that contains at least two -cells. ∎
This result permits us to casually confuse a wall with its image in , a liberty we will take freely in what follows.
Corollary 8.4**.**
Each wall in is separating.
Proof.
For any point in a wall , separates a neighborhood of into exactly two components, by Lemma 8.3 and construction. Thus each wall is locally separating and has an -bundle neighborhood. And since each wall is a tree of hyperplanes (also Lemma 8.3), each wall is contractible. Thus each -bundle neighborhood is actually a product. Thus for each wall, decomposes as a graph of spaces with a single simply connected edge space. Since , this graph of spaces is a dumbell space (not a loop), and each wall is separating. ∎
Here are some miscellaneous convenient lemmas about the geometry of walls.
Lemma 8.5**.**
Let be a relative geodesic edge path in a vertex space of . Let be a wall. Then is either empty or a single point.
Proof.
Since lies in a vertex space, it is in fact a geodesic by definition. Suppose intersects in two distinct points and . Let be a wall segment connecting to and let be the associated ladder. The complex is a subcomplex of which has a natural reduced map to , and it satisfies the hypotheses of Lemma 5.5, so let be a patching for . Note has a maximum of two extreme -cells by Lemma 8.1 applied to . If has an essential -cell, then contains essential -cells and the first one through which passes is extreme in by Proposition 3.17. Let be an exposed essential edge lying in the boundary of , and choose two elements and of which lie on opposite sides of . Connect and by a snipping arc across the interior of , and observe that this snipping arc is non-separating, contradicting the snipping lemma. Indeed we can get from one side to the other by following to , traversing from to (or to ), and then going through the other portion of until reaching the snipping arc. This works because there are no essential edges in . Thus there are no essential -cells in . But this means that a connected component of (which is a hyperplane in by Proposition 8.3) crosses the geodesic twice, which contradicts the behavior of hyperplanes in cube complexes. ∎
We record the following immediate corollary.
Corollary 8.6**.**
For each wall and each vertex space , is either empty or consists of a single hyperplane in .
Lemma 8.7**.**
Let be a relative geodesic in and suppose consists of at least two distinct points and . If is a wall segment in connecting to , then passes through at least one essential -cell.
Proof.
Let be the ladder associated to , and let . Then satisfies the hypotheses of Lemma 5.5, so let be a patching. If does not pass through an essential -cell, then is made entirely of squares, and thus so is by Lemma 3.10. This implies that there are no essential edges in , because any such edge would be isolated and nonseparating in . Thus maps to a single vertex space of . Since is a relative geodesic mapping to a single vertex space, it is a geodesic in that vertex space. The fact that crosses twice is a contradiction. ∎
9 Walls are relatively quasiconvex
In Lauer and Wise’s setting, walls turn out to be quasi-convex. This is used in conjunction with the fact that one-relator groups with torsion are Gromov hyperbolic to apply a theorem of Sageev and conclude that the action of these groups on their associated dual cube complexes are cocompact.
We will use a relative version of this argument. As we argued in Lemma 6.4, is hyperbolic relative to the vertex groups. In this secton, this will be an ingredient in a proof that each wall stabilizer is quasiconvex relative to the vertex groups. This result will be used in Section 11 when we apply a generalization of Sageev’s theorem by Hruska-Wise to conclude that the action on the dual cube complex is cocompact.
9.1 Geometric relative quasiconvexity
We will first prove the following geometric relative quasiconvexity statement about wall carriers and then translate it to the algebraic relative quasiconvexity of wall stabilizers. In this lemma, we only use the metric on . The -cells are irrelevant for the argument.
Lemma 9.1**.**
Suppose that . Let be a wall in . There is a uniform constant such that if is a relative geodesic in between vertices in the carrier of , then every vertex of which lies in an essential edge is within distance of .
Proof.
First note that since is a finite graph of spaces, the set is finite, and there is an upper bound on the number of edges (essential or not) in the attaching map of the elements of .
Let be a relative geodesic in whose endpoints and are vertices in . If is contained in , then we are done. By passing to an innermost subpath of which lies outside of , we may assume that . Since and lie in , there is a ladder in containing and with associated wall segment , and does not internally intersect . The subcomplex satisfies Lemma 5.5, so let be a patching. When choosing generators of to perform the patching, choose them so that there is exactly one generator which uses the path . Call the disk associated to this generator and make the choice that this is , the first disk, in the patching construction. With this choice we may assume there is a planar subcomplex of , homeomorphic to a disk, such that is one arc of and the other arc lies in . Note also that has no edges on .
Note has a maximum of two extreme -cells since does (by Lemma 8.1). Thus Proposition 4.10 implies that every essential -cell of is external (since the exponent of each essential -cell is at least two). In particular, this holds for every essential -cell of , and in fact every essential -cell of has an essential edge lying along .
Let be the union of essential -cells of whose closures intersect (i.e., their boundaries intersect ). Let be a point in an essential edge of . These are the points we will show are uniformly close to . If , then . If , let be the maximal connected subpath of containing such that is empty. Since every -cell of has an edge on , the complex is a tree of disks. Let be the maximal subcomplex of which contains and is homeomorphic to a disk. Let be the path (the other boundary arc of ), and label the endpoints of , and in such a way that lies on the subpath of between and .
We claim that at most two essential -cells in are adjacent to along essential edges. Indeed, if there are three or more let be one which is not the first, , or the last, (with respect to a chosen orientation of ). Since is external in , there is an essential edge of on , and because lies in , lies on . Without loss of generality, suppose that lies in the portion of between and . Because is planar, whichever of or intersects the subpath of between and cannot also intersect , contradicting that it lies in . This proves the claim.
The above claim shows that decomposes as a path , where and are (possibly degenerate) paths, each of which lies along the boundary of an essential -cell of , and is a (possibly degenerate) subpath of which does not use any essential edges and maps to a single vertex space. See figure 7 for the general picture.
Next, we claim that contains at most one essential -cell. To see this claim, suppose that contains two or more essential -cells. Then contains at least two extreme -cells and by Proposition 3.17, with, say, exposed edges and , respectively. Note that all elements of and lie along since contains no essential edges. In fact, it must be the case that at least two elements and of lie along . Indeed, otherwise elements of along , where is the exponent of . Lemma 5.7 implies that visits every essential edge of some subpath of containing these elements of . Since , this subpath contains strictly more than half of the essential edges of . This contradicts Lemma 5.8 since is a relative geodesic. Similarly, at least two elements and of lie along . Now consider the following statements:
- •
lies in .
- •
lies in .
- •
lies in .
- •
lies in .
If none of these statements hold then both and have boundary intersecting both and , so either or is internal in by planarity of , which contradicts Proposition 4.10. On the other hand, if any of these statements hold, we immediately obtain a contradiction to Lemma 5.6, since and both lie in the boundary of a single essential -cell. This contradiction proves the claim.
Since , contains a single essential -cell , and . By Lemma 3.10, is exposed in with exposed edge , say. By Lemma 5.2, some element of lies in . This shows that and , so setting proves the lemma. ∎
Problem: Does Lemma 9.1 hold when ? One seems to run into trouble when trying to rule out the case where contains a “fat” region of squares in its interior. Lauer and Wise do not experience this difficulty in their setting.
To apply the Hruska-Wise cocompactness criterion, we also need to know that wall stabilizers act cocompactly on their associated walls:
Lemma 9.2**.**
Let be a wall of . Then acts cocompactly on the carrier of , and thus on .
Proof.
Let be the carrier of in . We claim that there are finitely many -orbits of cells of , which implies the result. Let be the natural map. Let be any cell of which intersects . Now consists of finitely many codimension-1 (in ) “subwalls” of . Enumerate these subwalls . By Lemma 8.2, any cell of which maps to has a well-defined type , defined to be the unique index for which lies in . Let and be cells of the same type. Since the action of is essentially the universal covering space action (except on essential -cells where the following is still true), there is an element which takes to . Moreover, because these cells are the same type, lies in both and (in case and are essential -cells, we may need to compose with a finite-order “rotation” in ). Now, since walls are locally determined (Lemma 7.1), this shows that in fact stabilizes , i.e. . Thus the number of -orbits of is bounded above by . Since was arbitrary, this proves the claim and the lemma. ∎
9.2 Algebraic relative quasiconvexity
To show wall stabilizers are relatively quasiconvex, we will use the following definition of relative quasiconvexity, which we quote from [Hru10]. In that paper, Hruska shows that this notion of relative quasiconvexity is well-defined and equivalent to no fewer than four others, at least in the case that the peripheral groups are finitely generated and there are finitely many peripheral groups. See [Hru10] for the definitions of cusp-uniform action and truncated space.
Definition 9.3**.**
(Relatively quasiconvex) [Hru10, Definition 6.6] (“QC-3”) Suppose is countable, is a finite collection of subgroups, and that is relatively hyperbolic. A subgroup is relatively quasiconvex (with respect to ) if the following holds. Let be a proper -hyperbolic metric space on which has a cusp-uniform action. Let be a truncated space for acting on . For some base-point , there is a constant such that whenever is a geodesic in with endpoints in the orbit , we have
[TABLE]
where the -neighborhood of is taken with respect to the metric on .
Proposition 9.4**.**
The stabilizer of each wall in is quasiconvex relative to the collection of vertex groups of when .
Proof.
We will proceed by “augmenting” the space , which is decidedly not -hyperbolic, in general, by attaching “combinatorial horoballs” to form a space which is -hyperbolic and on which acts in a cusp uniform manner, as follows.
As in Section 6, let be the vertex groups of and choose a maximal spanning tree of essential edges of . Let be the set of oriented essential edges of not in and their formal inverses. Then is a finite relative generating set for . The Cayley graph of with respect to is disconnected, in general.
Now, attach Groves-Manning “combinatorial horoballs” to to form the “augmented space” associated to the data . See [Hru10, Definitions 4.1 and 4.3] for the precise construction. To each is associated a cube complex which induces a natural left-invariant metric on it. The rough idea is that for each coset , we take countably many copies of indexed by the naturals, attach “vertical edges” between each element of in every level and the corresponding element above and below it, and “horizontal edges” between elements of in the same level of -distance less than or equal to , where is the level. The original coset sits at level [math]. Let be the combinatorial horoball above the coset , which by convention includes the original at level [math], as well as any edges added there. By [Hru10, Theorem 4.4] (originally proved by Groves and Manning) and relative hyperbolicity of , the augmented space is connected and -hyperbolic.
On the other hand, let be the space obtained by collapsing to a point. This collapse lifts to a -equivariant quotient map , where the target is obtained by collapsing each copy of in ; this map is a quasi-isometry.
Now, acts naturally on , and each vertex space of is stabilized by some . We label this vertex space . We now form the augmented space by building a combinatorial horoball above the one-skeleton of , again with respect to the cube complex metric, for each (as before, includes the one-skeleton of by convention). We can identify the group elements of with vertices of via the orbit map (choosing the image of in as a base-point). Thus, is a full subgraph of for each .
Observe now that the Cayley graph includes naturally inside of . By the observation of the previous paragraph, there is also a natural inclusion , which we now claim is a quasi-isometry. Assuming this claim, we have that is -hyperbolic (after possibly modifying ).
To see the claim, first choose . It is clear that is -cobounded in . It remains to show that is quasi-isometrically embedded. For points and of , it is also clear that . In the other direction, we seek a constant such that . Let be a geodesic in between and . Then decomposes as a path of the form where each is an essential edge and each is a (possibly empty) edge path in some . By [GM08, Lemma 3.10], we may assume that each consists of at most two vertical segments and a single horizontal segment of length at most . Moreover, since the endpoints of lie in the image of the orbit map, these vertical segments also lie in . Now, the horizontal segment may not belong to , but because its endpoints are connected by a path of length at most , there is a path of length in between its endpoints, where consists of two vertical segments of length and a single horizontal edge two levels above . Replacing each by , we obtain a path between and in , and since , we have that . But also and , so . Setting proves the claim.
Finally, build the augmented space . For each vertex space of which is stabilized by , build a combinatorial horoball above it using the cube complex metric as in the case of . In fact, since the map is the identity on , the horoball just added will be an isometric copy of . The map thus extends to a quasi-isometry which is the identity on combinatorial horoballs, so that is -hyperbolic (after possibly modifying ).
Now, we claim that has a cusp-uniform action on with truncated space the disconnected union of all essential edges of . In other words, the vertex spaces of , along with their combinatorial horoballs, form a collection of disjoint -equivariant horoballs (in the cusp-uniform sense) centered at the parabolic points of . It is clear that acts coboundedly on this truncated space.
To see this, one can construct explicit horofunctions on these horoballs. For each vertex space of , let be the combinatorial horoball above it. Let be the natural metric on . Define a function by
[TABLE]
It is easy to check using elementary hyperbolic geometry that is a horofunction centered at the parabolic point in the Gromov boundary of which can be identified with any geodesic ray starting in and using only vertical edges. This proves the claim.
For each vertex space of , define for all . The property of -invariance is clear, so this is an admissible choice of pseudometrics.
To complete the proof, pick a basepoint in the carrier of and let , so that lies in . Let in , and let be a relative geodesic in between and (with respect to the admissible choice of pseudometrics above). Let be a geodesic in which agrees with on essential edges (it is clear by the construction of the pseudometrics that such a geodesic exists). Note that the intersection of with the truncated space is precisely the set of essential edges of . Applying Lemma 9.1 to , we see that every essential edge of lies uniformly close to . Thus the same is true for , and the proposition is proved. ∎
10 Walls satisfy linear separation
In order to conclude that the action of on its associated dual cube complex is proper, we will argue that the walls in satisfy the “linear separation property,” which roughly means that the number of walls separating pairs of points in grows at least linearly with their distance. Hruska and Wise describe how the linear separation property leads to properness of the dual cube complex action in [HW14, Theorem 5.2].
The precise statement we will prove is as follows:
Proposition 10.1**.**
Suppose that . There are constants and such that for any vertices , the number of walls separating and is at least .
We will be assuming for contradiction that walls frequently “double-cross” geodesics. We will use the following definition.
Definition 10.2**.**
(Double-crosses/double-crossed ladder). Let be a geodesic in between two [math]-cells and of . For every edge of , there are two dual walls to which intersect in the points and , labeled so that . Call the wall which passes through , , and the wall passing through , . We say that double-crosses if there is a wall segment in between and another distinct point along . If this behavior occurs we will pass to an initial such wall segment emanating from and assume that does not cross between and . There is a unique ladder associated to . Let be the subsegment of connecting the edges containing and . Let . We call the subcomplex a double-crossed ladder of at , if it exists. See figure 8 for an illustration.
Definition 10.3**.**
(Returns). Let be a double-crossed ladder of at , with associated ladder . We say that (or ) returns through an essential -cell if that -cell is the first or last essential -cell of through which the wall segment passes, as we traverse starting from . We use the notation for the first -cell through which returns, and for the last.
Lemma 8.7 implies that whenever is a double-crossed ladder, and always exist, and they are clearly unique. It is possible that .
Definition 10.4**.**
(Bends in the direction of). Let be a double-crossed ladder of at with associated ladder . We say that (or ) bends in the direction of if . Otherwise we say that (or ) bends in the direction of . We make analogous definitions for (or ) with and interchanged.
The following lemma allows us to determine the direction in which walls bend, but only when . The lemma is false for .
Lemma 10.5**.**
Suppose that . For some edge of , suppose that a wall double-crosses . Then there is a double-crossed ladder of at with associated ladder which bends in the direction of .
Proof.
Suppose that every double-crossed ladder bends in the direction of . Let be a double-crossed ladder with the property that does not cross between and . By Corollary 8.4, decomposes into two components and , labeled so that maps to .
Let and be the edges of which are dual to (they may be essential or not), labeled so that there is a path from to inside . Suppose in , where is not a proper power. Orient so that it crosses in the same direction that crosses it, and extend this orientation to . Let and be the two subpaths of , oriented consistently with , and labeled so that maps to and maps to (we may do this since consists only of the arc by Lemma 8.2). Thus no point of lies along .
Note that satisfies the hypotheses of Lemma 5.5 and let be a patching for . Note that and are the only essential -cells of which can be extreme, and in fact they are extreme by Lemma 3.10 (if they are distinct). We claim that is not internal in . To see this, let be an exposed essential edge of . Since has length , either some element of lies along , in which case we are done, or . In the latter case, and both and lie along . Lemma 5.7 implies that every element of lies along , which contradicts Lemma 5.2. This proves the claim.
Since and do not lie in , we may choose to be the element of which lies in . The other elements of lie in . Note that every such element must lie along . Indeed, if this is not the case then given an element which lies in but not along , we may join and by a snipping arc running through the interior of . The graph now contradicts Lemma 3.13.
Thus the geodesic visits elements of . Lemma 5.7 implies that visits each essential edge of in turn. Let and be the first and last elements of along . Since , the minimal subpath of containing these two edges contains strictly more than half of the essential edges of . This contradicts Lemma 5.8. ∎
The following definition describes an impossible configuration of a pair of double-crossed ladders in . We will show that if linear separation fails we can find such a configuration.
Definition 10.6**.**
(Double-crossed pair of ladders). Let be a geodesic in with endpoints [math]-cells and . Let and be adjacent edges along . Suppose that and are double-crossed ladders at and , respectively, where . Suppose further that and bend in the same direction and that and are distinct. In this case we call the subcomplex of a double-crossed pair of ladders. We denote by the last essential -cell through which returns, the wall segment associated to , its associated ladder, etc. Similarly define , , and , etc.
Lemma 10.7**.**
There does not exist a double-crossed pair of ladders in .
Remark: This lemma is true when . This is what makes the following proof so technical.
Proof.
Let be a double-crossed pair of ladders. Suppose without loss of generality that and bend in the direction of . Note that satisfies the hypotheses of Lemma 5.5, and let be a patching. The only candidates for extreme -cells of are , , , and . We know that contains at least two essential -cells since and are distinct. Observe that and embed in , but they may overlap with each other.
We will prove the following statements:
- (i)
If , then is not extreme.
- (ii)
If , then is not extreme.
- (iii)
If , then at most one of and can be extreme.
Taken together, these statements imply that contains at most one extreme essential -cell. This contradicts Proposition 3.17.
To see statement (i), temporarily orient and so that their terminal points coincide. Let and be the edges of which are dual to (they may be essential or not), labeled so that there is a path from to inside which does not internally intersect . Suppose in , where is not a proper power. Orient so that it crosses in the same direction that crosses it, and extend this orientation to . Now the terminal points and of and are the length of apart in . Moreover, in the auxiliary diagram , lies in and lies in for some essential -cell of distinct from , since . Lemma 3.18 proves the claim. Note that this argument does not depend on the direction in which bends. Switching the symbols and , an identical argument shows that is not extreme if , and statement (ii) is proved. See figure 9.
The following fact will be useful in proving statement (iii): Suppose is extreme with exposed essential edge . Then some element of lies along . To see this, not that in case some element of contains the terminal point of along , this is obvious. Otherwise, we may pick two elements from on opposite sides of , neither of which lies along , for contradiction. Connect these two edges by a snipping arc running across . This arc is non-separating in , since there is a path from one side to the other in the graph ; this contradicts Lemma 3.13. Similarly, if is extreme with exposed essential edge , then some element of lies along .
Finally, we prove statement (iii). Suppose for contradiction that , but both are extreme. Among all exposed essential edges of (meaning that all members of lie on the boundary of ), choose the one which is on and closest to along and call it . Define similarly. Note since all elements of both and lie in . There are two cases according to whether is closer to than or vice-versa.
Suppose first that is closer to than . In this case we will show that there are two edges in which can be connected together by a non-separating snipping arc through , contradicting Lemma 3.13. Orient so that it points towards along and extend this orientation to . Let be the next element of after . Note that does not lie along . Indeed, if it does, then by choice of , lies closer to along than by Lemma 5.7. Lemma 5.7 also implies that every element of lies along , which contradicts Lemma 5.2.
Connect midpoints of and together by a snipping arc that runs across and let be a closed neighborhood of this arc which includes the vertices , , , and but is small enough so that . Orient by declaring that the edge of running from to is the front edge of , and the edge running from to is the back edge. Let denote the first point (with respect to the orientation of ) in . Note that does not lie in , for otherwise runs through the center of connecting to , but because lies on the boundary of this would mean , contradicting that does not lie on . Note also that , as this scenario would imply and either force to lie on or give rise to another contradiction to Lemma 5.7.
There are now some cases to consider.
- •
Case 1: The vertices and lie in different components of . This case is illustrated in figure 10. In this case we find a path from to the back edge of in as follows:
Starting from , travel along until reaching . From , travel inside the interior of to reach . Next, travel backwards along all the way through until reaching . If at any point we cross , then it means that is identified with an essential -cell in the ladder distinct from , but this cannot happen since we already know that none of these -cells are extreme. Once arriving at , travel within to – here we will not touch because and since does not lie on , since but lies on the boundary of , and as previously observed. Finally, continue along all the way through until entering through and reaching the back edge of in (we will not touch in any other essential -cell since is a subcomplex of ). The path we have found connects the front and back edges of in and contradicts Lemma 3.13.
- •
Case 2: The vertices and lie in the same component of . This case further breaks into two subcases. Note that as previously observed.
- •
Subcase 1: The edge is strictly closer to along than is. This subcase is illustrated in figure 11. In this case we find a path from to the back edge of in as follows:
Starting from , travel along until reaching , and then through the interior of to reach . Travel backwards through to reach (for the same reasons as the previous case, this path does not touch the interior of ). Since is adjacent to and (as in the previous case), it is the case that is strictly closer to along than is. Thus there is a path in from the initial point of to which avoids . We have again contradicted Lemma 3.13.
- •
Subcase 2: The edge is strictly closer to along than is. This subcase is illustrated in figure 12. Let be the edge of which is dual to the terminal edge of , and oriented so that it points in the direction of . Note that (for example by Lemma 8.5), and is strictly closer to along than . Let and be the vertices of , labeled according to whether they are on the front or back edge of . In this case we find a path from to in as follows:
Travel from to along in the forward direction, and travel backwards along from to . Then simply travel forward along through until reaching . This again contradicts Lemma 3.13.
For the case in which is closer to than , the argument is identical, except that we exchange the roles of and in the above argument. Note that the above argument does not depend on the order in which and occur along , but only uses that these edges are adjacent in . ∎
Lemma 10.8**.**
Let be a geodesic in with endpoints [math]-cells and . Suppose that . For any -cell of , there exists a wall that intersects exactly once, and the point of intersection is within edges of .
Proof.
As in the proof of Lemma 9.1, let be an upper bound on the number of edges (essential or not) in the attaching map of the elements of .
If either wall dual to does not double-cross , then we are done. Thus, assume that double-crosses . Fix a wall segment associated to this double crossing and let be the associated double-crossed ladder. By Lemma 10.5, we may assume that bends in the direction of . By Lemma 8.7, the first essential -cell through which returns, , exists. Let be the subsegment of between and , including . Consider the sequence of successive edges of starting with and moving towards , . Let be the largest integer with the property that double crosses and such that is the first essential -cell through which some wall segment returns. Since there are at most wall segments passing through , . Define to be the double-crossed ladder associated to . By Lemma 10.5, we may assume bends in the direction of . In particular, exists.
Now, observe that the wall crosses exactly once. Indeed, if not then there is a double-crossed ladder at which bends in the direction of by Lemma 10.5, and by definition of . Thus is a pair of double-crossed ladders, contradicting Lemma 10.7. ∎
Proposition 10.1 follows easily (assuming of course that ).
Problem: Just as Lauer and Wise do, we wonder – Does satisfy the linear separation property relative to its walls when ? It appears difficult to produce a pair of double-crossed ladders in this situation, since one has less control over the direction in which double-crossed ladders bend.
11 Existence of the action
In this section we will prove the main theorem, that is that acts properly and cocompactly on a cube complex. We first invoke the so-called “Sageev contruction” to obtain an action of on a cube complex.
Definition 11.1**.**
(Wallspace/dual cube complex). Let be a metric space and let be a collection of closed, connected subspaces of , each of which separates into two components. We call a (geometric) wallspace. If a group acts properly and cocompactly on preserving both its metric and wallspace structures, then Sageev shows that acts on a cube complex , called the dual cube complex [Sag95]. A summary can be found in [HW14, Construction 3.2, Theorem 3.7, Remark 3.11].
Properness of this action in our setting will follow immediately from what we proved in Section 10. Cocompactness will follow by an application of [HW14, Theorem 7.12]. We state a simplified version of this theorem below.
Theorem 11.2**.**
*(cf [JW17, Theorem 3.1]).
Let be a wallspace. Suppose acts properly and cocompactly on preserving both its metric and wallspace structures, and the action on has only finitely many -orbits of walls. Suppose is hyperbolic relative to with finite. Suppose acts cocompactly on and is relatively quasiconvex for each wall . For each let be a nonempty -invariant -cocompact subspace. Let be the cube complex dual to and for each let be the cube complex dual to , where consists of all walls with the property that for some .*
Then there exists a compact subcomplex such that . In particular, acts cocompactly on provided that each is -cocompact.
For us, , , is the collection of walls we defined in , and is the finite collection of vertex groups of . Each vertex group has an associated vertex space in (a compact NPC cube complex). Fix a base-point in and let to be the copy of the universal cover of in (a cube complex) with .
In order to apply this theorem, it remains to show that each is -cocompact, as we will see. The following key lemma says, roughly, that a relative geodesic with large projection to comes very close to .
Lemma 11.3**.**
Fix . Suppose is a relative geodesic in with endpoints [math]-cells and . Let and be nearest-point projections of and to the vertex set of . For all , there exists such that if , , and , then there is an essential edge of within edges of (where is an upper bound on the lengths of attaching maps of essential -cells in ).
Proof.
First, note that if any edge of maps to , then the closest essential edge along to this edge satisfies the conclusion of the lemma with .
Let be given and assume and . Assume that and are far enough apart that . By the triangle inequality, this will imply in particular that .
Form a quadrilateral as follows: Let (resp. ) be a geodesic edge path from to (resp. to ), and let be a geodesic edge path from to . Orient everything so that is a closed loop. Note that lies in by Lemma 5.9. Also note that there is no backtracking in any of , , , or , so there can only be backtracking at the corners. We make cyclically reduced as follows. First note that there is no backtracking of at or by the fact that these points are nearest-point projections of and to and lies in . Now, there may be backtracking at , so let be the last vertex along (from ) in the image of , and similarly define to be the last vertex along (from ) in the image of . The fact that ensures that there will remain at least one edge of running from to . Note also that if or , then is nonempty and we are done with as before. Let , , and . Redefine . It is clear that there is no folding of at or so is reduced and cyclically reduced.
Fill with a reduced disk diagram using Lemma 3.7. If has no essential -cells then all of maps to , so set and we are done. Otherwise, Suppose is an exposed -cell of with exposed edge . We make the following observations:
- •
It is not the case that there exist with along and along , otherwise offers a shortcut between and so that , a contradiction.
- •
It is the case that , , and , since all of these paths are relative geodesics (by Lemma 5.2).
- •
No element of lies along (since by Lemma 5.9 no edge of is essential).
Thus must “straddle” , i.e. at least one element of lies in and at least one in , and all elements of lie in . Alternatively, could straddle .
Now we claim that contains at most extreme -cells. To see this, first note that there is a natural linear order on the extreme two cells of induced by the order in which their boundaries are encountered while traversing from to . If there are three or more extreme essential -cells, then we may choose one which is not the first or last with respect to this order. Call this -cell and suppose that is exposed with exposed edge . Without loss of generality, we may assume that straddles . Let be an element of along and an element of along . Let and be the two minimal paths in containing and , and labeled so that the component of which contains also contains . Now any candidate for an extreme subpath of containing all elements of must contain or . But note that the image of in the auxiliary diagram internally intersects an essential -cell of which lies before in the order determined by . Similarly, the image of in internally intersects an essential -cell of which lies after in the order determined by . Since was arbitrary, this shows that no extreme subpath of exists, i.e., is not extreme.
Using this claim and applying Proposition 4.10 and Lemma 3.10, we see that every essential -cell of is external.
Now, let be the maximal connected subdiagram of containing and mapping to . Call the other arc of from to , . Note that no edge of lies in or since and are nearest-point projections. If any edge of belongs to , then some edge of maps and we are done. Thus we may assume that every edge of belongs to an essential -cell of lying in .
Since , we may choose an edge of with the property that and . Let be the essential -cell of with in its boundary. The observation above implies is external with essential edge (say) along . Observe that does not lie along , as this would offer a shortcut through from to of length less than or equal to , contradicting the triangle inequality. Similarly, does not lie along . Thus lies along . Now the shorter path along from to maps to a path in from to an essential edge of of length less than or equal to , and we see that satisfies the conclusion of the lemma. See figure 13. ∎
Lemma 11.4**.**
Each is -cocompact.
Proof.
Supppose that is a wall of with the property that for some . Consider points and which are very far apart in . Let and be their projections to , and let be a relative geodesic between them. By the triangle inequality, grows with . Choose and far enough apart that , where is chosen according to Lemma 11.3. By that lemma, there is a point in within distance of an essential edge of . By geometric relative quasiconvexity of wall carriers (Lemma 9.1), the distance from to the carrier of is uniformly bounded, which also means the distance from to is uniformly bounded since any point in the carrier is within of . So passes uniformly close to independently of , say within some distance .
Now, since acts cocompactly on (its action is a covering space action and the vertex space for is a compact NPC cube complex), also acts cocompactly on by local finiteness of . Since every wall with for some meets , there are finitely many -orbits of such walls. This is exactly what it means for to be -cocompact. ∎
Putting everything together, we have the main theorem for staggered generalized -complexes with locally indicable vertex groups and .
Theorem 11.5**.**
Let be a staggered generalized -complex. Suppose that has locally indicable vertex groups and that . Suppose that for each vertex space of , acts properly and cocompactly on a cube complex. Then acts properly and cocompactly on a cube complex.
Proof.
As before, let . Let be the collection of walls in coming from the construction of Section 7. Let be the cube complex dual to the action of on the wallspace .
By Proposition 10.1, the wallspace satisfies linear separation. By [HW14, Theorem 5.2], the action of on is proper.
Let be the finite collection of vertex groups of . Each vertex group has an associated vertex space in (a compact NPC cube complex). Fix a base-point in and let to be the copy of the universal cover of in (a cube complex) with .
Observe that all hypotheses of Theorem 11.2 are satisfied. Indeed, it is clear that acts properly and cocompactly on preserving both its metric and wallspace structures, and the action on has only finitely many -orbits of walls. Relative hyperbolicity of was shown in Lemma 6.4. For each wall , Lemma 9.2 implies acts cocompactly on it, and we showed is relatively quasiconvex in Proposition 9.4. Finally, each is -cocompact by Lemma 11.4.
Applying Theorem 11.2, the action of on is cocompact and the theorem is proved. ∎
Corollary 11.6**.**
Let and be locally indicable, cubulable groups, a word in which is not conjugate into or , and . Then is cubulable.
Proof.
We may assume that is cyclically reduced. Build a model space for by starting with a dumbell space of non-positively curved cube complexes with and , and then attaching a -cell to a path corresponding to the word , so that . Observe that is trivially staggered generalized and Theorem 11.5 applies. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ago 13] Ian Agol, The virtual Haken conjecture , Doc. Math. 18 (2013), 1045–1087, With an appendix by Agol, Daniel Groves, and Jason Manning. MR 3104553
- 2[Bri 02] Martin R. Bridson, The geometry of the word problem , Invitations to geometry and topology, Oxf. Grad. Texts Math., vol. 7, Oxford Univ. Press, Oxford, 2002, pp. 29–91. MR 1967746
- 3[BW 12] Nicolas Bergeron and Daniel T. Wise, A boundary criterion for cubulation , Amer. J. Math. 134 (2012), no. 3, 843–859. MR 2931226
- 4[CCJ + 01] Pierre-Alain Cherix, Michael Cowling, Paul Jolissaint, Pierre Julg, and Alain Valette, Groups with the Haagerup property , Progress in Mathematics, vol. 197, Birkhäuser Verlag, Basel, 2001, Gromov’s a-T-menability. MR 1852148
- 5[GM 08] Daniel Groves and Jason Fox Manning, Dehn filling in relatively hyperbolic groups , Israel J. Math. 168 (2008), 317–429. MR 2448064
- 6[How 81] James Howie, On pairs of 2 2 2 -complexes and systems of equations over groups , J. Reine Angew. Math. 324 (1981), 165–174. MR 614523
- 7[How 82] , On locally indicable groups , Math. Z. 180 (1982), no. 4, 445–461. MR 667000
- 8[How 87] , How to generalize one-relator group theory , Combinatorial group theory and topology (Alta, Utah, 1984), Ann. of Math. Stud., vol. 111, Princeton Univ. Press, Princeton, NJ, 1987, pp. 53–78. MR 895609
