WorksMathematics
CAT(0) Coxeter cell complexes, Bipodality and the Parallel Wall Property
Abstract
Coxeter cell complexes are a simultaneous generalization to cube complexes and the Davis complex of a Coxeter group. We show that 1-skeleta of CAT(0) Coxeter cell complexes isometrically embed into a CAT(0) cube complex. When the resulting cube complex is finite dimensional, we show that the condition of bipodality (satisfied by both CAT(0) cube complexes and Davis complexes of Coxeter groups) implies local finiteness of the cubulation. To this end, we show a Parallel Wall Theorem for bipodal CAT(0) Coxeter cell complexes satisfying a uniform bound on the size of a collection of pairwise intersecting walls. In particular, our methods give a new, purely geometric proof of the Parallel Wall Theorem for Coxeter groups.
Introduction
A Coxeter cell complex is a cell complex built out of polytopes whose symmetry groups are finite Coxeter groups. More precisely, Coxeter cells are Davis complexes of finite Coxeter groups, in the sense of [5]. We say a Coxeter cell complex is CAT(0) if it is built out of finitely many types of Coxeter cells and its induced piecewise Euclidean metric is a CAT(0) metric. Motivating examples of such complexes are finite dimensional cube complexes, whose -cells correspond the Davis complex of the Coxeter group , and the Davis complex of any Coxeter group, whose cells are formed by the Coxeter cells associated to the group’s finite parabolic subgroups. As in these examples, CAT(0) Coxeter cell complexes come equipped with a natural wallspace structure. For Coxeter groups, this wallspace structure has been thoroughly studied to deduce combinatorial properties of the groups. At the heart of this study lie two key properties:
The BPI Property (Bounded Pairwise Intersections): There is a bound, depending only on the complex, on the number of pairwise intersecting walls.
The PW Property (Parallel Wall Property): There is a constant , depending only on the complex, such that for any wall and vertex at distance from , there is a wall separating from .
These two properties were first shown to hold for Coxeter groups by Brink and Howlett in [1]. In general, the PW Property is difficult to establish. We have shown the PW Property always holds in the 2-dimensional case in [10]. The question is currently open in higher dimensions. Here, we give a criterion allowing us to guarantee the PW Property.
We say that is bipodal if it satisfies the following: Suppose that are intersecting walls sharing a common adjacent vertex , and that is a vertex not separated from by and . If is separated from by a wall , then for any wall containing , there is a wall separating from . It is shown by Dyer and Hohwleg in [6] that the Davis complex of a Coxeter group is bipodal (see also [13] for an elementary proof).
Theorem 1.1. Suppose that is a bipodal CAT(0) Coxeter cell complex satisfying the BPI Property. Then satisfies the PW Property.
We emphasize that the original proof of the Parallel Wall theorem for Coxeter groups makes extensive use of the algebraic language coming from root systems. As such, the proof of Theorem 1.1 gives a new, geometric proof of the Parallel Wall theorem.
Using the BPI and PW Properties, it can be deduced from [12] and [4] that Coxeter groups act properly on finite dimensional, locally finite CAT(0) cube complexes. In general, Sageev’s construction allows us to isometrically embed the 1-skeleton of a CAT(0) Coxeter cell complex into a cube complex , whose -cubes correspond to collections of pairwise intersecting walls in . In [9 Thm 5.7], Hruska and Wise show that if the complex is itself locally finite, then local finiteness of is equivalent to having compact-wall separation, an analog of the PW Property for compact sets. We show that for locally finite CAT(0) Coxeter cell complexes, the PW Property implies the compact-wall separation (Corollary 3.5). In particular, we obtain the following:
Corollary 1.2. Suppose that is a bipodal locally finite CAT(0) Coxeter cell complex satisfying the BPI Property. Then isometrically embeds into a finite dimensional, locally finite CAT(0) cube complex.
Furthermore, metrically proper group actions on extend to metrically proper actions on [9]. It follows, for example, that if is a group acting properly on , and has a bound on the size of its finite subgroups (e.g. when the action is cocompact or, more generally, when is uniformly locally finite), then satisfies the Tits alternative [15].
Corollary 1.3. If acts properly by automorphisms on a bipodal locally finite CAT(0) Coxeter cell complex satisfying the BPI Property, then acts properly on a locally finite, finite dimensional CAT(0) cube complex.
Contrary to much of the theory of CAT(0) cube complexes, we rely on the CAT(0) metric in most of our proofs. Basic results in CAT(0) geometry, as well as background on Coxeter cell complexes, can be found in Section 2. In Section 3, we recall Sageev’s construction and show Corollary 1.2 under the assumption of Theorem 1.1. In Section 4, we introduce the notion of angle between walls, and use this to give a CAT(0)-like inequality for “wall triangles”. We also generalize [1 Lem 1.7], showing that these angles can be used to compute the distance between a vertex and a wall. Finally, we prove Theorem 1.1 in Section 5.
Acknowledgements. The author would like to thank Piotr Przytycki for his helpful discussions throughout this project, and for reviewing preliminary versions of this paper. The author would also like to thank Dani Wise for providing initial feedback on the author’s thesis, which served as the foundation for this work. We acknowledge that AI was not used in any capacity in the process of writing this paper, or proving the results therein.
Background
CAT(0) Geometry
Let be a geodesic metric space. We denote by a geodesic segment connecting and . A geodesic triangle in consists of a triple of points , together with geodesic segments between the three points. We denote by the union of these segments. For every geodesic triangle in with vertices , there is a unique (up to isometry) Euclidean triangle in , called the comparison triangle, with vertices and side lengths , and . A point (resp and ) is called a comparison point for (resp and if .
Definition 2.1. A geodesic space is CAT(0) if for any geodesic triangle and comparison points for , we have . We say that is non-positively curved if it is locally CAT(0).
It is a standard exercise to show that CAT(0) spaces are uniquely geodesic and thus contractible. Conversely, the Cartan-Hadamard theorem states that if is complete, non-positively curved and simply connected, then is CAT(0) [2 Thm II.4.1].
There is also an equivalent definition for CAT(0) spaces in terms of angles. Given , the comparison angle is the Euclidean angle in the comparison triangle at the vertex . Given geodesics with , we may then define the Alexandrov angle between and as
We denote by the Alexandrov angle between segments and .
Proposition 2.2 ([2 Prop II.1.7]). is CAT(0) if and only if for all . In particular, the sum of Alexandrov angles in a geodesic triangle of a CAT(0) space is bounded by .
The metric of a CAT(0) space is convex, and due to this CAT(0) spaces behave nicely with respect to their convex subsets.
Proposition 2.3 ([2 Prop II.2.4]). Let be a complete CAT(0) space, and a closed convex subset of . Then for , there is a unique point such that . Furthermore, if then is the unique point in satisfying for all .
As a consequence, one can show that the function is a convex function [2 Cor II.2.5], and therefore the -neighborhood of , defined by , is convex in for any .
Coxeter groups and Coxeter cell complexes
Let be a simplicial graph with edge labels taking values in . Then the Coxeter group with defining graph is
A Coxeter group has an associated faithful representation called the Tits representation. We consider a vector space with basis , equipped with the symmetric bilinear form
Then acts faithfully on via
for [5 Sec 6.12]. A Coxeter group is finite if and only if the bilinear form arising from the Tits representation is positive definite [5 Thm 6.12.9]. In this case, the representation gives an action of by isometries on a Euclidean space , where conjugates of elements in act by reflections along hyperplanes in . These hyperplanes partition into a set of cones, on which acts transitively. The fundamental cone in is the cone supported by the hyperplanes fixed by the generators of . We denote by the point at distance from each supporting hyperplane in the fundamental cone.
Definition 2.4. The Coxeter cell of type , denoted by , is the convex hull of .
The cell structure on can be described in terms of the Coxeter subgroups generated by subgraphs . As shown in [5 Lem 7.3.3], every codimension-1 face of a Coxeter cell corresponds to a coset , where is a full subgraph with size . The face corresponding to is isometric to the convex hull of . Thus each embeds into , allowing us to inductively define the cell structure on . In particular, the vertices of correspond to elements of , and we have a clear vertex-transitive action of on .
Definition 2.5. A Coxeter cell complex is a Euclidean polyhedral complex whose cells are isometric to Coxeter cells. A Coxeter cell complex is CAT(0) if its set of isometry classes of cells is finite, and its induced piecewise Euclidean metric is a CAT(0) metric (as defined in [2 Def I.7.4]).
Note that in general, the induced piecewise Euclidean (pseudo)metric on a polyhedral complex may fail to be complete or even geodesic. In fact, it may fail to be a metric at all. However, these pathologies are avoided when the cell complex has a finite set of isometry classes of cells [2 Thm I.7.19]. We denote the set of isometry classes of cells in a Coxeter cell complex by .
Figure 1. Coxeter cells of type , with labels , , and , and (generated using SageMath [14]).
Example 2.6. Let be a Coxeter group. The Davis complex (or Davis–Moussong complex) has a Coxeter cell of type for each coset , where is the defining graph of a finite Coxeter subgroup . The faces of Coxeter cells in are identified whenever they correspond to the same coset. Note that acts freely and transitively on the vertices of .
Example 2.7. If is the complete graph on vertices with edge labels all equal to , then and is an -dimensional cube. Thus cube complexes are also examples of Coxeter cell complexes.
The work of Moussong in [11] provides a combinatorial condition on the links of vertices in that guarantees that is CAT(0). The combinatorial link of a vertex has an -simplex for each -cell incident to , where each face of the simplex corresponding to a cell corresponds to a lower dimensional cell of incident to . Vertices of the combinatorial link correspond to edges of and these vertices are connected by an edge whenever the corresponding edges in bound a -gon. The labeled link, denoted by is the combinatorial link of , where edges of corresponding to -gons in have label .
If is the Davis complex of the Coxeter group , then has as 1-skeleton , and has an -simplex for each full subgraph with finite. In [11 Cor 10.2], Moussong shows that the metric link of the identity in is CAT(1). As a consequence of Moussong’s work and [2 Thm II.5.4], we obtain:
Theorem 2.8. Let be a Coxeter cell complex with finite. Then is non-positively curved if and only if every vertex in is labelled-flag:
is a simplicial complex,
every full subgraph with finite spans a simplex.
Figure 2. Examples of walls in a CAT(0) Coxeter cell complex
When is a cube complex, then a full subgraph has finite if and only if is a clique. Simplicial complexes for which every clique spans a simplex are called flag complexes. As such, Theorem 2.8 is a natural generalization of the flag link condition typically given as the defining property of non-positively curved cube complexes [2 Thm II.5.20].
Walls in CAT(0) Coxeter cell complexes
Here, we develop the basic theory of walls in CAT(0) Coxeter cell complexes. As we will show, many of the definitions and properties in this section bear a striking resemblance to those present in both the theories of Coxeter groups and CAT(0) cube complexes. Most of the results in this section are direct generalizations of those in [10], and so their proofs will be omitted. We reiterate that throughout will be assumed to be a Coxeter cell complex built out of finitely many types of Coxeter cells. In particular, is a complete geodesic metric space.
A midcell in a Coxeter cell is the fixed point set of a reflection in . Note that each edge in intersects a unique midcell in , denoted by . We say two edges are equivalent if . We may then extend this equivalence relation to all edges of .
Definition 2.9. The wall in dual to an edge of is the abstract complex , where the cell is naturally identified with the appropriate subcomplex of whenever is a face of .
Remark 2.10. In the case where is the Davis complex of a Coxeter group, walls are fixed point sets of reflections. Therefore, they are closed, convex [2 Prop II.6.2] and separate into two connected components. Furthermore, the combinatorial distance between vertices in (defined by the path metric on the 1-skeleton of ) is exactly the number of walls separating them. Note that two walls in a Davis complex intersect if and only if the underlying reflections generate a finite dihedral subgroup.
Proposition 2.11 ([10 Prop 3.6]). Let be a CAT(0) Coxeter cell complex, and a wall in . Then
The map that sends cells in to their appropriate midcells in is an isometric embedding. In particular, can be identified with a closed and convex subset of .
Under this identification, convex, and isometric to ,
separates into two convex components, called (open) halfspaces.
In what follows, the wall will always be identified with its image .
Corollary 2.12 ([10 Cor 3.7]). The combinatorial distance (denoted by ) between vertices is equal to the number of walls in , where is the set of walls separating from .
The carrier of a wall , denoted by is defined to be the union of all cells in intersecting . In contrast to cube complexes, the carrier is in general distinct from , and may fail to be convex both with the CAT(0) metric and the combinatorial metric on (Figure 3). However, the inclusion remains an isometric embedding [10 Lem 3.10].
Figure 3. fails to be convex in both the CAT(0) metric and the combinatorial metric.
Many of the properties enjoyed by walls are inherited by intersections of walls.
Definition 2.13 (c.f. [9 Def 2.5]). Let be a CAT(0) Coxeter cell complex. A codimension- wall is an intersection of walls in such that for any cell intersecting , is a codimension- subspace of .
In particular, a codim-1 wall is a wall as previously defined. We will also consider to be a codim-0 wall. Note that if is a codim- wall, then is still closed and convex in and is isometric to , where is the ball of radius in .
Lemma 2.14. Let be a codim- wall, and a wall such that is a non-empty, proper subset of . Then is a codim- wall, and separates into two connected components.
Proof. Let be the two halfspaces of . Let be a cell whose interior intersects . Then , so is codim- in and are non-empty. Since and are convex, the sets are also convex and therefore connected. It follows that separates into two components.
Cubulating Coxeter cell complexes
We briefly summarize the description of Sageev’s construction by Hruska and Wise in [9], which in our setting associates to each CAT(0) Coxeter cell complex a connected, CAT(0) cube complex :
Definition 3.1 (c.f. [7 Def 2.3, 2.6]). Let be a (possibly infinite) set of walls in . A coorientation of walls in is an map that assigns to each wall one of its halfspaces . A coorientation is consistent if for any pair . We say a coorientation satisfies the Descending Chain Condition (DCC) if every sequence of halfspaces with has a minimal halfspace .
The vertex set of is the set of all consistent coorientations of walls in satisfying the DCC. We put an edge between two coorientations if and only if the two maps differ on a single wall of . Finally, vertices in span a cube if and only if they span the 1-skeleton of a cube in . There is a natural bijection between the hyperplanes of and the walls in . By Corollary 2.12, we have an isometric embedding .
Observe that the edges in incident to a vertex are in 1-1 correspondence with the set of walls that are not separated from by any other wall in . We call this set the set of -elementary walls, and denote it by . If is locally finite and satisfies the PW Property, then this set is finite for any . However, this does not a priori give us local finiteness for all of . More precisely, the following is a special case of [9 Thm 5.7] (see also [12 Thm 3]):
Theorem 3.2. Suppose is locally finite. Then is locally finite if and only if has compact-wall separation: there is a constant for each compact such that any wall at distance from a compact subset is separated from by another wall.
Under the assumption that is equipped with a geometric group action, it can be deduced from [8 Prop 3.7, Thm B] that the PW Property implies compact-wall separation. In general, we will need the following lemma:
Lemma 3.3. Suppose that satisfies the PW Property. Then there is a constant such that for any vertices and separating from , there is a vertex lying on a combinatorial geodesic from to separated from by at combinatorial distance from .
Proof. The proof is identical to that of [13 Lem 4.3]. We reformulate their proof in the language of CAT(0) Coxeter cell complexes. Let be a vertex as desired at minimal combinatorial distance from . Note that by minimality of , is the only wall adjacent to separating from .
Since is quasi-isometric to , it suffices to uniformly bound the CAT(0) distance . We use the following quantities to do so:
Let be the minimal angle formed by a geodesic in the midcell of a cell and a geodesic connecting to a vertex of .
Let be the maximal distance between a vertex in a cell and a point in a midcell of .
Let be the uniform bound for guaranteed by the PW Property.
Now, let be the intersection of the CAT(0) geodesic with . Since is the unique wall adjacent to intersecting , the segment must be contained in a cell (see Figure 4). Let be the unique such cell containing in its interior. Then we see that , and so by the CAT(0) inequality,
!The geodesic passes through the union of cells in containing bbox=0.30,0.09,0.70,0.32
Figure 4. The geodesic passes through the union of cells in containing .
giving us the desired bound.
Proposition 3.4. Suppose satisfies the PW Property. Then there are constants such that any vertex at combinatorial distance from a wall is separated from by at least distinct walls.
Proof. We claim that we can take , where and are the constants from the PW Property and Lemma 3.3 respectively. Indeed, suppose that is at distance from a wall . By the PW Property, there is an -elementary wall separating from . By Lemma 3.3, there is a vertex lying on a combinatorial geodesic from to of length such that separates from , and . By induction, is separated from by at least walls. But such walls must also separate from , and so is separated from by at least walls.
Corollary 3.5. If is locally finite and satisfies the PW Property, then is locally finite.
Proof. If is locally finite, then the number of walls that can intersect a given compact set is also bounded. Therefore, Proposition 3.4 implies that has ball-wall separation (i.e. compact-wall separation, where the value of depends only on ). Thus is locally finite by Theorem 3.2.
Angles between walls
In analogy to Coxeter groups, we have a well-defined notion of angle between two intersecting codim- walls and , provided they are contained in a common codim- wall . Fix first a cell of whose interior intersects . Then and correspond to Euclidean hyperplanes in intersecting at the center of . There are now two choices of normal vectors for each hyperplane which, by Lemma 2.14, are determined by a coorientation of and in . The angle between and in with respect to is minus the angle between the associated normal vectors in , and is denoted by . Since this quantity does not change when restricting to a face of containing , the angle does not depend on our choice of .
Remark 4.1. If , and are codim--walls contained in a common codim- wall and is a codim- wall, then the angle between and can be written in terms of the angles between , and . Indeed, let and let . Then by the spherical law of cosines,
As such, if has finitely many types of Coxeter cells, the set of values taken by angles between codim- walls is finite.
Remark 4.2. Suppose that is the Davis complex of a Coxeter group and that are intersecting walls fixed by reflections . Let be the coorientation of the and containing the identity in . Then , where are the positive roots associated to and in the Tits representation of .
Proposition 4.3. Let , be intersecting codim- walls lying in a codim- wall , and let , be geodesics in respectively, such that the union is a geodesic in , with the intrinsic path metric. Then
where is the coorientation such that contains and contains .
We first prove Proposition 4.3 for arbitrary hyperplanes in . Here, we reuse the notation of to refer to the angle between cooriented hyperplanes in .
Lemma 4.4. Let be distinct intersecting hyperplanes and let be a coorientation of and . Let , , and let minimize . Then .
Proof. Assume without loss of generality that , that , and that is the -axis. Let and be the projections of and onto the -plane. Note that

Figure 5. Proof of Lemma 4.4
. Write and . By our assumption, the function
is minimized at . Thus we have , and so . Now, letting and , we see that
Additionally, the Pythagorean theorem gives us the relation .
Combining the three equalities above gives us that
and so .
Proof of Proposition 4.3. Set , so that , and assume without loss of generality that are contained in and respectively. Note that we have an isometric embedding , under which gets mapped into for some distinct intersecting lines and in . Since the projection of a geodesic onto a factor is itself geodesic, is isometric to either a line segment or a point. This gives us a further isometric embedding of , under which and map into and respectively. Now, and are hyperplanes in , with coorientations determined by , and . Therefore, by Lemma 4.4 we have that .
Corollary 4.5 (CAT(0) inequality for walls). Suppose that , , and are three pairwise intersecting codim- walls contained in a codim- wall . Suppose further that the walls have empty global intersection, and let be the unique coorientation of walls such that for distinct. Then
Proof. Let be the union , endowed with the intrinsic path metric. By [2 Thm II.11.1], is non-positively curved. Also, has fundamental group , generated by geodesic triangles with vertices in . By [3], the action of on the universal cover is hyperbolic, and so there is a geodesic line in fixed by . Projecting this line onto yields a geodesic triangle with edges . Since is a local isometry, is geodesic in for each . By Proposition 4.3, we thus have that . Since is CAT(0), Proposition 2.2 yields
The angles between walls provide a method to easily calculate the combinatorial distance between a vertex and a given wall, generalizing [1 Lem 1.7]:
Proposition 4.6. Let be adjacent vertices separated by a wall , and let be a wall intersecting . Take to be the coorientation of and containing . Then
The idea of the proof of Proposition 4.6 is to show that a vertex of close to the CAT(0) projection minimizes . More precisely, we choose a particular vertex lying in the same closed halfspaces as , where is the midpoint of the edge . Note that there are many choices for such , specified by the choice of halfspaces of the walls containing . We then use Proposition 4.3 to show that the halfspace of containing is determined by (Lemma 4.8). Finally, to compare with , we introduce the notion of a reflection and show that each wall separating from has a reflection that does not separate from , except possibly for in the case where is perpendicular to .
Definition 4.7. Suppose that and are intersecting walls in a CAT(0) Coxeter cell complex . Let be a cell whose interior intersects . Then the intersection of and with are midcells in . Thus is the fixed point set of a (unique) reflection . The midcell is the cell of a new wall in called the reflection of along . One may check that the wall obtained through this procedure does not depend on our choice of .
Lemma 4.8. Let , let be a wall that does not contain , and let be a vertex of lying in all the same closed halfspaces as . Suppose is a wall intersecting that either

Figure 6. Proof of Lemma 4.8
separates from , or
contains but not .
Then , where is chosen to contain and is chosen to contain . Furthermore, the reflection of along does not satisfy either of the conditions (1) and (2) above.
Proof. We distinguish two cases. If does not contain , then the segment intersects at some point distinct from . By the CAT(0) inequality for angles (Proposition 2.2), for any . Picking lying on the geodesic between and in (with the intrinsic path metric on ) and applying Proposition 4.3 then gives us that . Additionally, and lie in the same halfspace of (as a codim-2 wall in ), and therefore they lie in the same halfspace of . So, if satisfied (1) or (2), then after choosing to be the halfspace containing , we would have that , which is a contradiction.
Now, if contains , then is contained in the interior of some cell , and is the midpoint of an edge of . We may assume without loss of generality that lies in . Choose so that the projection of onto is . Then separates from , and so the segment intersects at some point . But then
as desired. A similar argument as in the first case then shows that does not separate from , and therefore does not separate from .
Proof of Proposition 4.6. Suppose that minimizes . Let be the midpoint of the edge , and let be the vertex of lying in the same closed halfspaces as and separated from by the walls containing .
We claim that if , then , and otherwise. Observe that to compare with , it suffices to look at the walls in the symmetric difference . Furthermore, the only wall in that may contain both and is in the special case where .
Figure 7. The three cases in Proposition 4.6.
Case 1: . If separates from , then it either separates from or equals . By Lemma 4.8, the reflection of along neither separates from , nor does it contain and not . Consequently, does not separate from and since , separates from . It follows that at least half of the walls in lie in , and thus , giving us the desired claim.
Now, if contained , then by Lemma 4.8, we would have , a contradiction. Therefore, separates from , and so
Case 2: . Similarly to the previous case, any wall in separating from has a reflection that separates from . Therefore, if separates from and if separates from . But then by minimality of , we must have . Therefore, separates from and
The other inequality follows from interchanging and , so .
Finally, the remaining case where follows from the first case by interchanging and as well.
Bipodality and the Parallel Wall theorem
Let be a CAT(0) Coxeter cell complex, and let be distinct walls in sharing a common adjacent vertex . The intersection of the halfspaces of containing is called a sector of bounded by and . A sector is said to be sharp-angled if its bounding walls are not perpendicular to one another.
Definition 5.1. Let and let and be two intersecting walls. Consider , the set of all walls containing the codim-2 wall , and choose to be the halfspace of containing for every . Then
is a sector containing , called the canonical sector for containing .
Remark 5.2. Note that contain for all , and that the size of is bounded by the largest number of sides of a polygon in . As such, the number of walls that may pair to give the same canonical sector is bounded by a constant depending only on .
Definition 5.3 ([6 Def 4.14]). Fix a basepoint . A set of walls is said to be bipodal if it satisfies the following: if and bound a sector containing , and is a wall containing , then implies that .
Recall that a wall is -elementary if it is not separated from by another wall of . The definition for bipodality of a CAT(0) Coxeter cell complex given in the introduction is equivalent to requiring that the set of -elementary walls is bipodal for any basepoint . Note that bipodality does not hold for arbitrary CAT(0) Coxeter cell complexes (see Figure 8). The following is a slightly stronger version of Theorem 1.1:
Figure 8. is -elementary, but and are not.
Theorem 5.4. Let be a CAT(0) Coxeter cell complex satisfying the Bounded Pairwise Intersection Property. Then there is a bound , depending only on , such that for any with bipodal, the walls in are at distance from .
Proof. Let be such that is bipodal, and let be a wall. Fix a point minimizing , and assume that each wall in intersects . Then for each wall in , we may consider the canonical sector containing for the pair of walls and . Since is not perpendicular to by Proposition 4.6, the sectors we obtain are sharp-angled, and their bounding walls are distinct from . By Remark 5.2, the number of distinct sectors obtained this way increases as the size of increases. Enumerate these sectors as . Note that one of the walls bounding , say , separates from .
Let be the bound on the number of pairwise intersecting walls in , and choose so that whenever . Then there is a pair of disjoint walls and such that separates from . But then , and since contains the intersection of the two walls bounding , we obtain under the assumption of bipodality that . We therefore conclude that for any wall with .
References
- [1][BH93] Brigitte Brink and Robert B. Howlett, A finiteness property and an automatic structure for Coxeter groups, Math. Ann. 296 (1993), no. 1, 179–190.
- [2][BH99] Martin R. Bridson and André Haefliger, Metric spaces of non-positive curvature, Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 319, Springer-Verlag, Berlin, 1999.DOI
- [3][Bri99] Martin R. Bridson, On the semisimplicity of polyhedral isometries, Proc. Amer. Math. Soc. 127 (1999), no. 7, 2143–2146.DOI
- [4][Cap06] Pierre-Emmanuel Caprace, Conjugacy of 2-spherical subgroups of Coxeter groups and parallel walls, Algebr. Geom. Topol. 6 (2006), 1987–2029.
- [5][Dav08] Michael W. Davis, The geometry and topology of Coxeter groups, London Mathematical Society Monographs Series, vol. 32, Princeton University Press, Princeton, NJ, 2008.
- [6][DH16] Matthew Dyer and Christophe Hohlweg, Small roots, low elements, and the weak order in Coxeter groups, Adv. Math. 301 (2016), 739–784.arxiv.org/abs/1505.02058
- [7][Gur05] Dan P. Guralnik, Coarse decompositions for boundaries of CAT(0) groups, PhD thesis, Haifa, 2005. Available at arXiv: 0611006.arxiv.org/abs/math/0611006
- [8][Gur06] ———, Local finiteness of cubulations and CAT(0) groups (2006), available at arXiv:0610950v2.
- [9][HW14] G. C. Hruska and Daniel T. Wise, Finiteness properties of cubulated groups, Compos. Math. 150 (2014), no. 3, 453–506.DOI
- [10][KT25] Carl Kristof-Tessier, The parallel wall theorem for CAT(0) even 2-complexes (2025), available at arXiv:2510.07448.
- [11][Mou88] Gabor Moussong, Hyperbolic Coxeter groups, ProQuest LLC, Ann Arbor, MI, 1988. Thesis (Ph.D.)–The Ohio State University.
- [12][NR03] G. A. Niblo and L. D. Reeves, Coxeter groups act on CAT(0) cube complexes, J. Group Theory 6 (2003), no. 3, 399–413.DOI
- [13][OP25] Damian Osajda and Piotr Przytycki, Coxeter groups are biautomatic, Invent. Math. 242 (2025), no. 3, 627–637.arxiv.org/abs/2206.07804
- [14][Sag23] Sage Developers, Sagemath, the Sage Mathematics Software System (Version 10.2), 2023. https://www.sagemath.org.
- [15][SW05] Micah Sageev and Daniel T. Wise, The Tits alternative for CAT(0) cubical complexes, Bull. London Math. Soc. 37 (2005), no. 5, 706–710.DOI




