Alternating quotients of right-angled Coxeter groups
Michal Buran

TL;DR
This paper characterizes when right-angled Coxeter groups have certain alternating quotients, linking graph connectivity to subgroup separability, and applies these ideas to right-angled Artin groups and hyperbolic surface groups.
Contribution
It establishes a new criterion connecting graph connectivity with the existence of alternating quotients for right-angled Coxeter groups and related groups.
Findings
Connectedness of the complement graph characterizes alternating quotients.
Right-angled Artin groups can be decomposed into factors with many alternating quotients.
Finitely generated subgroups of hyperbolic surface groups can be separated from finite sets in alternating quotients.
Abstract
Let be a right-angled Coxeter group corresponding to a finite non-discrete graph with at least vertices. Our main theorem says that is connected if and only if for any infinite index quasiconvex subgroup of and any finite subset there is a surjection from to a finite alternating group such that . A corollary is that a right-angled Artin group splits as a direct product of cyclic groups and groups with many alternating quotients in the above sense. Similarly, finitely generated subgroups of closed, orientable, hyperbolic surface groups can be separated from finitely many elements in an alternating quotient, answering positively a conjecture of Wilton.
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.
Alternating quotients of right-angled Coxeter groups
Michal Buran
Abstract
Let be a right-angled Coxeter group corresponding to a finite non-discrete graph with at least vertices. Our main theorem says that is connected if and only if for any infinite index convex-cocompact subgroup of and any finite subset there is a surjection from to a finite alternating group such that . A corollary is that a right-angled Artin group splits as a direct product of cyclic groups and groups with many alternating quotients in the above sense.
Similarly, finitely generated subgroups of closed, orientable, hyperbolic surface groups can be separated from finitely many elements in an alternating quotient, answering positively the conjecture of Wilton [Wil12].
1 Introduction
It is often fruitful to study an infinite discrete group via its finite quotients. For this reason, conditions that guarantee many finite quotients can be useful.
One such notion is residual finiteness. A group is said to be residually finite if for every , there exists a homomorphism , where is a finite group and .
We could try to strengthen this notion by requiring that any finite set of non-trivial elements is not killed by some map to a finite group. But these two notions are equivalent as we could simply take product of maps, which don’t kill the individual elements.
Another way to modify this is to require that the image of avoids the image of a specified subgroup , which does not contain . If this is true for all finitely generated subgroups , we say that is subgroup separable.
Finitely generated free groups are subgroup separable [Hal49, Theorem 5.1]. The finite quotient of a free group could be a priori anything. Wilton proved that (for a free group with at least two generators) we can require to be a surjection onto a finite alternating group, thus giving us some control over the maps which ‘witness’ subgroup separability [Wil12].
Scott showed that closed, orientable, hyperbolic surface groups are subgroup separable [Sco78].
Extending and combining methods from both papers, our main theorem shows that even in the case of hyperbolic surface groups, we can require the image to be a finite alternating group.
Definition 1.1**.**
Let be a subgroup of a finitely generated group , let be a class of groups. We say that is -separable if for any choice of there is a surjection from to a group in such that for all .
Note the difference between this terminology and the one above. We talk about subgroups as -separable in contrast with subgroup separability, which is a property of the entire group.
We will usually take to be the class of alternating groups or symmetric groups. We will denote these classes by and , respectively.
In this case, there is a difference between taking a single and multiple group elements as a product of maps surjecting alternating groups is not a map onto an alternating group. In particular, if then any does not map to under at least one of the projections onto factors. However, if we take to be an enumeration of , then the image of any map injective on these elements is isomorphic to and hence not an alternating group.
The following is our main result.
Theorem A** (Main Theorem).**
Let be a non-discrete finite simplicial graph of size at least . Every infinite index convex-cocompact subgroup of a right-angled Coxeter group associated to is -separable (and -separable) if and only if is connected.
If was a discrete graph, there would be difficulties in controlling a permutation parity of the images of generators. It is possible that this can be resolved. A weaker preliminary result, where we can’t control parities, still applies in the discrete case. Here ()-separable means that the quotient is required to be either an alternating or a symmetric group.
Lemma B**.**
Let be a finite simplicial graph of size at least . Every infinite index convex-cocompact subgroup of a right-angled Coxeter group associated to is ()-separable if and only if is connected.
We require infinite index as otherwise the finite quotient by the normal subgroup contained in could potentially have no alternating quotients.
Convex-cocompactness is required as not all finitely generated subgroups of RACG are -separable, where is the set of finite groups [HW08, Example 10.3].
Corollary C**.**
Every finitely generated right-angled Artin group is a direct product of cyclic group and groups whose infinite index convex-cocompact subgroups are -separable.
Corollary D**.**
Infinite index finitely generated subgroups of closed, orientable, hyperbolic surface groups are -separable.
To prove theorem A we’ll construct a specific finite sheeted cover of the presentation complex of the RACG; this cover will correspond to a finite index subgroup of the right-angled Coxeter group and the action on the cosets of this subgroup will demonstrate the -separability.
A right-angled Coxeter group acts on Davis-Moussong complex - which is essentially the Cayley complex with -cells uniquely specified by their boundary and with some higher dimensional cells. A convex-cocompact subgroup acts cocompactly on some convex subcomplex of the Davis-Moussong complex. The group generated by the reflections in the hyperplanes, which bound , tiles the complex with the translates of . Together and generate a subgroup, which has index in the RACG. This finite-index subgroup depends on the choice of the convex subcomplex. We will iteratively modify the subcomplex until we arrive at one with quotient of prime size with a long protrusion, which does not contain edges with a certain generator as a label (this is where we use the conditions on ). That generator will fix cosets corresponding to the vertices of the protrusion. Prime size and the element fixing many cosets are ingredients of Jordan’s theorem, which says that the action on cosets is symmetric or alternating. Finally, we’ll tinker a bit to control the parities of the actions and hence whether the image is symmetric or alternating.
2 Preliminaries
2.1 -separability
We will establish some properties of -separability.
Lemma 2.1**.**
Let and be non-trivial finitely generated groups. Then is not -separable.
Proof.
There are only finitely many surjections from onto and . If is infinite, then there is a non-identity element in the kernel of all these maps. Consider elements , where , . Suppose is a surjection, which does not map these elements to .
By the choice of , we have . The group is a normal subgroup of , so it is or . Similarly for . However is not commutative, so one of is mapped to .
If both and are finite and is -separable, enumerate as . Applying the -separability condition with respect to this set, we get an isomorphism . However, is not a direct product, so one of is and the other is trivial. ∎
This implies that passing to a finite degree extension does not in general preserve -separability of convex-cocompact subgroups. However passing to a finite-index subgroup does:
Lemma 2.2**.**
Let be a finitely generated group, let be a finite-index subgroup of , and let be an infinite index subgroup of . If is -separable in , then it is -separable in .
We need to be infinite index in , as otherwise it is possible that in the notation of the proof below. E.g. take , a proper subgroup, .
Proof.
Suppose .
Let be a normal subgroup contained in . Then is still finite index and let be this index. Since is finitely generated, there are only finitely many surjections with . The intersection of preimages of over such surjections is a finite intersection of finite index subgroups, hence a finite index subgroup. So there exists some such that for all with .
As is -separable in , there exists a surjection , such that for all . By the choice of we have . But , so . In particular, and is the desired surjection. ∎
2.2 Cube complexes
For further details of the definitions from this section, the reader is referred to [HW08].
Definition 2.3** (Cube, face).**
An -dimensional cube is , where . A face of a cube is a subset , where , .
Definition 2.4** (Cube complex).**
Suppose is a set of cubes and is a set of maps between these cubes, each of which is an inclusion of a face. Suppose that every face of a cube in is an image of at most one inclusion of a face . Then the cube complex associated to is
[TABLE]
where is the smallest equivalence relation containing for every , .
Definition 2.5** (Midcube).**
A midcube of a cube is a set of the form for some .
If is an inclusion of a face and is a midcube of , then is contained in unique midcube of . Moreover is an inclusion of a face.
Definition 2.6** (Hyperplane).**
Let be a cube complex associated to . Let be the set of midcubes of cubes of . Let be the set of restrictions of maps in to midcubes.
The pair satisfies that every face is an image of at most one inclusion of a face, so there is an associated cube complex . Moreover, inclusions of midcubes descend to a map . A hyperplane is a connected component of together with a map .
Hyperplanes are analogous to codimension-1 submanifolds.
Definition 2.7** (Elementary parallelism, wall).**
Suppose is a cube complex.
Define a relation of elementary parallelism on oriented edges of by if they form opposite edges of a square. Extend this to the smallest equivalence relation. The wall is the equivalence class containing . Similarly, we can define an elementary parallelism on unoriented edges and an unoriented wall .
We denote by the edge with the opposite orientation.
There is a bijective correspondence between unoriented walls and hyperplanes, where corresponds to , a hyperplane which contains the unique midcube of . We say is dual to . By abuse of notation, we sometimes identify with its image.
The following notion was invented by Haglund and Wise and was originally called A-special [HW08, Definition 3.2].
Definition 2.8** (Special cube complex).**
A cube complex is special if the following holds.
For all edges . We say the hyperplanes are -sided. 2. 2.
Whenever , then and are not consecutive edges in a square. Equivalently, each hyperplane embeds. 3. 3.
Whenever , , then the initial point of is not the initial point of . We say that no hyperplane directly self-osculates. 4. 4.
Whenever and and and form two consecutive edges of a square, if and start at the same vertex, then and are two consecutive edges in some square, and if and start at the same vertex, then and are two consecutive edges in some square. We say that no two hyperplanes inter-osculate.
Haglund and Wise have shown that cube complexes are special [HW08, Example 3.3.(3)]. In this paper, we will only ever use specialness of these complexes.
Every special cube complex is contained in a nonpositively curved complex with the same -skeleton [HW08, Lemma 3.13]. The hyperplane separates a cube complex into two connected components.
Definition 2.9** (Half-space, [Hag08]).**
Suppose is a cube complex and is a hyperplane. Let be the union of cubes disjoint from . If is , has two connected components. Call them half-spaces and
Definition 2.10**.**
Define to be the union of all cubes intersecting . Let consist of cubes of that do not intersect . In the case of a simply connected special cube complex has two components; call them and .
Definition 2.11** (Convex subcomplex).**
A subcomplex of a cube complex is (combinatorially geodesically) convex if any geodesic in with endpoints in is contained in .
The components of the boundary of a hyperplane , and half-spaces are combinatorially geodesically convex [Hag08, Lemma 2.10]. Any intersection of half-spaces is convex [Hag08, Corollary 2.16] and a convex subcomplex of a cube complex coincides with the intersection of all half-spaces containing it [Hag08, Proposition 2.17].
Definition 2.12** (Bounding hyperplane).**
A hyperplane bounds a convex cubical subcomplex if it is dual to an edge with endpoints and .
2.3 Right-angled Coxeter and Artin groups
Definition 2.13** (Right-angled Coxeter group).**
Given a graph with vertex set , let . The right-angled Coxeter group associated to is the group given by the presentation .
The right-angled Coxeter group acts on the Davis–Moussong Complex [HW08]. Throughout the paper if we talk about the action of on a cube complex, we mean this action. The Davis–Moussong complex is similar to Cayley complex, but it does not contain ‘duplicate squares’ and it contains higher dimensional cubes.
Fix a vertex . There is a bijection between the vertices of and the elements of given by . Vertices and are connected by an edge labelled . If the generators pairwise commute, there is an -cube with the vertex set .
Note that acts on the left on as a reflection in . There is also a right action of on , where sends to – the vertex to which is connected by an edge labelled . This action does not extend to unless the Coxeter group is abelian.
More generally, if is a subgroup of , the action of on the right cosets of can be realised geometrically as an action of on . This action is given by . If acts on co-compactly, this gives a finite permutation action. We will use this to construct maps from to .
Definition 2.14** (Convex-cocompact subgroup).**
If acts on a cube complex , we say is convex-cocompact if there is a non-empty convex subcomplex , which is invariant under and moreover acts on cocompactly. We say, that acts on with core .
If is hyperbolic, this coincides with the usual notion of convex-cocompactness [Hag08].
Definition 2.15** (Right-angled Artin group).**
The right-angled Artin group associated to a simplicial graph is .
The next lemma relates RAAGs and RACGs.
Lemma 2.16**.**
[DJ00]** Given a graph , define a graph as follows:
- •
**
- •
* and are connected by an edge if is an edge of . The vertices and are connected by an edge if and are distinct. Similarly, and are connected by an edge if and are distinct.*
The right-angled Artin groups is a finite-index subgroups of the right-angled Coxeter group via the inclusion extending .
Definition 2.17** (Salvetti complex).**
A right-angled Artin group acts on Salvetti complex , which consists of the following:
- •
- •
If generators pairwise commute and , there is a unique -cube with the vertex set .
The action of the right-angled group on the vertex set is by the left multiplication and it extends uniquely to the entire cube complex.
For the rest of the paper whenever we talk about the action of a RACG or RAAG on a cube complex, we mean the canonical action on the associated Davis-Moussong Complex or Salvetti complex, respectively.
2.4 Jordan’s Theorem
Definition 2.18** (Primitive subgroup).**
A subgroup is called primitive if it acts transitively on and it does not preserve any nontrivial partition.
If is a prime and is transitive, then the action is primitive.
Our main tool is the following.
Theorem 2.19** (Jordan’s Theorem).**
[DM96, From theorems 3.3A and 3.3D]** For each there exists such that if , is a primitive subgroup and there exists , which moves less than elements, then or .
3 The Main Theorem and its consequences
Our main theorem relates the combinatorics of to the -separability of .
Theorem 3.1** (Main Theorem).**
Let be a non-discrete finite simplicial graph of size at least . Then all infinite-index convex-cocompact subgroups of the right-angled Coxeter group associated to are -separable and -separable if and only if is connected.
Recall that here convex-cocompact means that it acts cocompactly on a convex subcomplex of the Davis-Moussong complex. A similar result holds for RAAGs.
Corollary 3.2**.**
Let be a finite simplicial graph of size at least . Then all infinite index convex-cocompact subgroups of the right-angled Artin group associated to are -separable if and only if is connected.
Here convex-cocompact means that the subgroup acts cocompactly on a convex subcomplex of the Salvetti complex.There is another action of the Artin group on a cube complex given by embedding the group in right-angled Coxeter group as described in the Lemma 2.16. We will first show that convex-cocompactness with respect to the Salvetti complex implies convex-cocompactness with respect to the Davis-Moussong complex.
Lemma 3.3**.**
Suppose is a simplicial complex, and a convex-cocompact subgroup of with respect to the action on . Let be as in Lemma 2.16 and identify with a subgroup of in the same lemma. Then is convex-cocompact in with respect to the action on .
Proof.
Recall that is the union of all cubes intersecting a hyperplane . For a hyperplane in a cube complex , . We can collapse onto . Formally, say for all and . Collapse of neighbourhood of is the quotient map . We can collapse multiple neighbourhoods simultaneously by quotienting by the smallest equivalence relation, which contains the equivalence relation for each hyperplane.
Let be a specified vertex in the Davis-Moussong complex, which under the bijection between vertices and group elements corresponds to the identity. Let be the simultaneous collapse of all hyperplanes labelled by for all . See Figure 1. Here, the base point is the image of . The equivalence relation commutes with the action of , so there is an induced action of on .
We collapsed all edges with labels from so for all and all , we have .
Let be defined as follows
- •
Vertices: Send to .
- •
Edges: Send the edge between and to the edge between and . It is indeed an edge as and
- •
Squares: Send the square with vertices to the square with vertices .
- •
Higher dimensions: Extend analogously.
The right-angled Artin group acts on by . The map is -equivariant cube complex isomorphism since .
No two hyperplanes of labelled and osculate since either the neighbourhoods of the associated hyperplanes do not intersect or is distinct from , is connected to and the associated hyperplanes intersect.
I want to prove that if acts cocompactly on a convex subcomplex of , then it acts cocompactly on . The collapsing map sends cubes to cubes (of potentially lower dimension), therefore is a cube complex. To prove cocompactness, it is enough to show that every vertex has finitely many vertices in its preimage under . Suppose and are vertices of and that they both map to . Then there is some sequence of hyperplanes with labels from and vertices such that , and maps to the same element as under the collapse of for all . But then and intersect and as they do not osculate, and intersect. Since they do not interosculate, and are successive vertices in some square. But now and by induction intersects whenever . Therefore have distinct labels and and the preimage of contains at most vertices.
It remains to show that is convex. Let be an edge in with exactly one endpoint in . The edge is labelled by some as all edges labelled by either lie entirely in or have an empty intersection with it. The collapsing map sends parallel edges to parallel edges (unless it sends them both to a vertex) and any sequence of elementary parallelisms in codomain lifts to the domain, so . In particular, if intersects , then intersects and by the convexity of , lies entirely in , which contradicts that does not lie entirely in .
So convex-cocompactness with respect to the action on implies convex-cocompactness with respect to the action on . ∎
Proof of Corollary 3.2.
: If are components of , then so by Lemma 2.1 the trivial subgroup is not -separable in .
: Let be as in Lemma 2.16.
Suppose is a proper component of . The vertices and are not connected by an edge in , so is of the form for some . But then looking at gives that is a vertex set of a proper component of .
So being connected implies that is connected.
By Lemma 3.3 is convex-cocompact in and hence by 3.1 it is -separable in . By Lemma 2.2 is also -separable in . ∎
Lemma 3.4**.**
[Sco85, Correction to the proof of Theorem 3.1]** A closed, orientable, hyperbolic surface group is a finite index subgroup of , where is a cycle of length . Moreover, for a suitable embedding , all finitely generated subgroups of are convex-cocompact in with respect to the action on .
Remark 3.5* (Idea of proof).*
Scott uses a different terminology, so it makes sense to summarise the proof. The natural generators of act on the hyperbolic plane by reflections in the sides of a right-angled pentagon. Translates of the pentagon give a tiling of the hyperbolic plane. Dual to this cell complex is a square complex . Under this identification, the geodesic lines bounding the pentagons of the tiling become hyperplanes of .
Suppose is a finitely generated subgroup of the surface group . Let be the covering space associated to . By Lemma 1.5 in [Sco78], there exists a closed, compact, incompressible subsurface such that the induced map is surjective. Moreover, by [Sco85, Correction to the proof of Theorem 3.1] we can require to have a geodesic boundary.
Let be the lift of to . Let be the intersection of all half-spaces containing . Suppose lies in , but not in and that are the first two edges of the combinatorial geodesic from to . Since , both and intersect . Consequently, intersects as does not separate from . Call the intersection . The point is a centre of a pentagon and is a vertex of the same pentagon, so the distance between them does not depend on (for example by specialness of ). See Figure 2.
The closest boundary component of to is seen from at more than the right angle (remember that the hyperplanes are geodesics). But such a point is within distance of . To see this, take to be the vertical ray through in the upper half-plane model to the. Then the set of points with obtuse subtended angle is contained between rays and . Geodesic between these rays and is an arc of length
[TABLE]
Therefore (and hence ) is at a uniformly bounded distance from and the action of on is cocompact.
Corollary 3.6**.**
All finitely generated infinite index subgroups of closed, orientable, hyperbolic surface group are -separable in .
Proof.
By Lemma 3.4, finitely generated subgroups of are convex-cocompact in . By the Main Theorem 3.1 they are -separable in . By Lemma 2.2, they are -separable in . ∎
4 Proof of the Main Theorem
Definition 4.1** (Disjoint hyperplanes, bounding hyperplanes, positive half-space).**
Let be a cube complex, a convex subcomplex. Let be the set of hyperplanes disjoint from . Let be the set of hyperplanes bounding (a hyperplane bounds if it is dual to some with one endpoint in and one not in ).
If , denote by the half-space of containing .
Lemma 4.2**.**
Any hyperplane bounding a convex subcomplex in a complex is disjoint from .
Proof.
Let be an edge dual to such that and . Suppose intersects . Then there is an edge dual to . Without loss of generality belongs to the same half-space of as . By convexity of any (combinatorial) geodesic between and lies entirely in . A geodesic between two vertices in a complex is precisely a path, which crosses each hyperplane separating the two vertices once [Sag95, Page 613]. Therefore a concatenation of and a geodesic from to is a geodesic from to . The vertex lies on this geodesic and hence belongs to giving a contradiction. ∎
Recall that any intersection of half-spaces is convex and conversely any convex subcomplex is an intersection of the half-spaces containing it. Hence it is equivalent to specify a convex subcomplex or the half-spaces in which it is contained (or the set of disjoint hyperplanes if there can be no confusion about the choice of half-spaces, e.g. if only one choice gives a non-empty intersection).
Definition 4.3** (Deletion, vertebra).**
Suppose acts on a cube complex with core . Define deletion as removing a bounding hyperplane and all its -translates from . The result of deletion of is .
The cube complex is called a vertebra. See Figures 4 and 5.
A vertebra is an intersection of two combinatorially geodesically convex sets, so it also is combinatorially geodesically convex. In particular, it is connected.
Definition 4.4** (Acting without self-intersections).**
We say acts without self-intersections on a cube complex , if implies for all hyperplanes of and .
Definition 4.5** (Special action).**
An action of on a cube complex is special if it is without self-intersections and moreover if and , then .
Lemma 4.6**.**
Suppose that acts without self-intersections on a locally compact cube complex with core and . Then the result of deletion of is also a core for . Let be the stabiliser of in . If is a set of orbit representatives for the action of on the vertices of and is a set of orbit representatives for the action of on the vertices of the vertebra , then is a set of orbit representatives for the action of on the vertices of . Moreover, .
Proof.
Recall that implies special.
First note that by definition and as a bounding hyperplane still bounds unless it is a translate of .
The set of half-spaces containing is invariant under , hence is invariant. The subcomplex is an intersection of half-spaces, hence convex. Suppose . Let be a combinatorial geodesic from to of shortest length with edges and suppose . Let’s be the hyperplane dual to . Then as , we have . Since acts on without self-intersections . And , because and is convex, so
Therefore . It must intersect , so it is not entirely contained in and it intersects . Because the cube complex is special, and do not interosculate. In particular, there is a square with two consecutive sides and . Let be the edge opposite in this square. By Lemma 4.2 does not bound and . We can now construct a shorter path from to with edges . Contradiction.
So and lies in a -neighbourhood of and therefore the action is cocompact.
There is a unique edge connecting to as any path of length is a geodesic or is contained in some square. In the first case by convexity of , we have . In the second, .
By invariance of , the -translates of do not intersect . Suppose . There is a unique hyperplane in dual to an edge , which connects to , say . Then belongs to a unique translate of , namely . ∎
Corollary 4.7**.**
Let be a finite simplicial graph. If is a subgroup of a right-angled Coxeter group and it acts on the Davis-Moussong complex with core , then deletion produces another core.
Proof.
The Davis-Moussong complex is a cube complex, hence simply connected and special. The action of on it preserves labels. In this complex any two consecutive edges have distinct labels, so the action is without self-intersections. The restriction to is also without self-intersections. ∎
Lemma 4.8**.**
Suppose acts on a cube complex with core . If is constructed from using a deletion of , then each edge in is dual to a hyperplane intersecting .
Proof.
Let be an edge in and a hyperplane dual to . If , is contained entirely in . But then is disjoint from . In particular one of the endpoints of is in the opposite half-space of than .
Since is the intersection of all half-spaces containing with the exception of the -translates of , the hyperplane is for some .
The subcomplex is -invariant and bounds , hence bounds . This contradicts . ∎
Corollary 4.9**.**
Suppose acts on with core . If is constructed from using a deletion of , then each edge in has a label which commutes with the label of .
Definition 4.10** (Deletion along a path, deletion with labels, tail).**
Suppose is a subcomplex of a complex and a core for the action of on . Suppose is a path in , which starts in . The deletion of hyperplanes along the path is a subcomplex , where goes over hyperplanes disjoint from and from .
Suppose additionally that edges of are labelled in such a way that for every vertex and every label, there is precisely one edge starting at that vertex of the given label. Suppose , and is a sequence of edge labels, then the deletion with labels at is the deletion of hyperplanes along , where is a path starting at with labelled .
Suppose was built from using a series of deletion of hyperplanes . We call a tail.
Lemma 4.11**.**
Suppose is a finite simplicial graph. Suppose is connected, and acts on with a core . Then there exists a core which can be obtained from by deletion along a path with the vertebra a single vertex.
Remark 4.12*.*
The hypothesis that is connected is necessary. Consider the situation when is a square. Then and is the standard tiling of . Let be the subgroup generated by two non-commuting generators of . The invariance of the core and cocompactness of the action imply that any core for is of the form for some .
Every hyperplane intersecting such a core divides it into two infinite parts.
Proof of Lemma 4.11.
Since is a proper subcomplex, there exists be such that bounds . Let be the endpoint of , which lies in . Let be the other endpoint. Say the label of is . Let be a cube complex obtained from by deletion of .
Let be the set of generators labelling the edges of vertebra . Then by Corollary 4.9, commutes with all generators in .
If is an edge with endpoint , whose label does not commute with , we can define and similarly as before. Just as before the generators of commute with .
The hyperplanes and do not intersect, so . There is an inclusion of into given by sending a vertex of to the unique vertex of to which it is connected by an edge labelled . Extending this map to edges and cubes is a label preserving map between cube complexes and . It follows that is a (not necessarily proper) subset of .
We will now show that, by a series of such operations, we can reach a situation where . I.e. the vertebra is a single vertex.
Suppose we have already applied deletion times and is non-empty. We will use a series of deletions to get . By an abuse of notation, we’ll identify the vertices of with the labels and with the generators of the right-angled Coxeter group. (Rather than having a generator for every vertex and using these as labels.)
Since the group does not split as a product, there exists some and which do not commute. Since is connected, there exists a vertex path in from the vertex , which is the label of the hyperplane we removed last.
Successive generators in this path do not commute. Indeed assume that and commute. Take , let be edges of the path starting at with labels . This is a closed loop, since and commute. The hyperplane separates from , so it has to be dual to one of and . Parallel edges have the same labels so . Similarly . The hyperplane separates from , so and have to cross. The Davis-Moussong complex is special, so there is a square where and are successive edges. By construction of the complex, and are connected by an edge is . This contradicts adjacency of and in .
Apply deletion of hyperplanes labelled starting at some vertex of . Note that the th hyperplane we remove belongs in a subset of as and does not commute with . Moreover, . In particular, and does not belong to as . Similarly, the hyperplane dual to edge between and is dual.
Therefore is a proper subset of and we can continue this process until we get an empty . ∎
Remark 4.13*.*
We can even control the label of the hyperplane which was removed last. Indeed, if the last removed hyperplane had label , and is some other generator, pick a vertex path between and in . Then remove hyperplanes labelled by vertices on this path, starting at the unique vertex of a vertebra.
By Lemma 4.6 there is a set of orbit representatives for the action of on with .
Haglund shows the following [Hag08, Proof of Theorem A].
Lemma 4.14**.**
Suppose acts on with a core and with a set of orbit representatives . Let be generated by the reflections in the hyperplanes bounding . Let . Then is a fundamental domain for the action of on and is a set of orbit representatives for the action of on .
Let act on the right cosets of . We have that sends to . But is a reflection in the hyperplane . By definition of if bounds , and is fixed by .
Moreover, if , then is a set of right coset representatives for .
We will first prove that by a suitable sequence of deletions, we can satisfy the conditions of Jordan’s theorem. It follows that we can construct quotients that are either alternating or symmetric.
Definition 4.15**.**
If is a subset of a cube complex , then is a union of closed cubes, which have non-empty intersection with . We define inductively .
If is convex, then so is (as a neighbourhood is obtained by removing bounding hyperplanes and therefore it is an intersection of convex subcomplexes). And if acts cocompactly on , it still acts cocompactly on assuming that is locally compact.
Proposition 4.16**.**
Let be the right-angled Coxeter group associated to a finite simplicial graph, , and suppose that acts on the associated Davis-Moussong complex with a proper core . Let be the class of symmetric and alternating groups. If is connected, then is -separable.
Proof.
As acts with a proper core, there exists a generator of not contained in . Say .
Suppose .
Fix . Without loss of generality, we may assume that contains and for all (otherwise replace with for a sufficiently large ). Moreover, by Lemma 4.11 we may assume that there exists a hyperplane with and by the Remark 4.13 we may assume that the label of is .
As is connected, there exists a generator not commuting with . Let be the unique vertex of . Let be the edge starting at with a label . Obtain by deleting from the boundary of . By Lemma 4.6 . If , then there is an edge starting at with the other endpoint in . This edge is labelled and is dual to . Now since otherwise would have to intersect and would commute with . Therefore is uniquely determined as the other endpoint of .
Continue this by taking to be the edge starting at labelled for even and for odd and let be the other endpoint of . Let be with deleted from the boundary. Let with to be specified later.
Let be the group generated by the reflections in the hyperplanes bounding . Let . Then , where denotes the number of vertices of . Every successive vertebra consists of a single vertex, so by Lemma 4.6 . We can choose to make a prime. As is in a natural bijection with and , we may choose as one of the coset representatives. . Since , for every we have . Therefore does not act as an element of , i.e. .
Let be a generator distinct from and . By the remark after Lemma 4.14, we can identify the right cosets of with orbits of under the action of and we can read of the action from the geometry as follows. Pick in an orbit corresponding to , let be a vertex connected to by an edge labelled . If , then . If , then is the coset corresponding to . Since the tail contains no edge labelled , every coset corresponding to a vertex in the tail is fixed by .
So moves at most elements. By taking large enough while is still a prime, we may ensure that the conditions of Jordan’s lemma are satisfied (the primitivity follows from transitivity and a non-existence of non-trivial partition of a prime number of elements into sets of the same size). ∎
5 Changing parity
We shall now prove that we may force the action to be alternating (similarly we can force it to be symmetric). Let be a non-discrete locally compact finite graph throughout this section.
Definition 5.1**.**
Suppose is a core for an action of on a . The parity of with respect to the core is the parity of acting on the right cosets of , where is the finite index subgroup of generated by and the reflections in the hyperplanes bounding .
We will modify the construction of the tail in order to make each act as an even permutation (or we will make at least one of acts as an odd permutation).
Suppose is in the tail. If the edge between and is in the tail, then and map to distinct vertices in , hence .
If is not in the tail, then the hyperplane dual to this edge bounds and the reflection in this hyperplane belongs to . Therefore or equivalently .
More precisely, suppose acts with core and is the core resulting from deletion of , and the label of is . Moreover assume is a single edge.
Then the parity of with respect to is the sum of the parity of with respect to and the number of edges labelled in . So we can control the parity of by changing the number of edges with label in the tail. Suppose that the conditions of Jordan’s theorem are satisfied with a margin (i.e. the conditions are satisfied even if moves elements). Taking , where is the diameter of will be sufficient.
First let us show that we can deal with parity of all generators other than and .
Lemma 5.2**.**
For any , if the tail of is a path with labels of length at least starting at vertex , then there exists a core such that in the associated action the parity of changed and the parities of no changed for . Moreover, and contains a tail of the same length as and the labels of these two paths are the same with the exception of a subpath labelled of length .
Proof.
Say is a path in of the shortest length. Let be a subcomplex built using deletions of hyperplanes starting at .
Compared to , the tail of this complex contains two more edges labelled for . It also contains an extra edge labelled , so the parity of changed and the parity of other generators remains the same for . ∎
Now let’s change the parity of a generator that appears in the tail.
Lemma 5.3**.**
If the tail of contains a path with labels of length at least , then there exists a core such that in the associated action only the parity of changed. Moreover, and is built from the same complex as using a sequence of deletions, whose labels agree with that of with the exception of deletions. (We allow a deletion to be replaced by no deletion.)
Proof.
Suppose there exists distinct and which commute mutually but neither of which commutes with . Then instead of the deletion of the hyperplanes labelled , delete the hyperplanes labelled . This creates a square. Continue building the tail starting from one of the vertices of the square using the deletions of the hyperplanes with the same labels as before. The new tail contains two fewer labels, two more of and two more of and one fewer (or the same number of and two more , if etc.). Hence only the parity of changed.
To be precise, we need to take the path labelled which is a subpath of a path labelled in the tail, as otherwise deleting a hyperplane labelled could introduce more than just a side of a square. Similarly for the other cases in this proof. 2. 2.
Suppose there is some commuting with , but not . Then instead of the deletion of the hyperplanes labelled , delete the hyperplanes labelled and then delete the hyperplanes labelled at two of the vertices of the square. This creates a square with two spurs. Continue building the tail starting from the remaining vertex of the square. The new tail contains the same number of labels, two more of and one fewer . Hence only the parity of changed. 3. 3.
Lastly, if neither of the above cases holds, then consists of , isolated vertices , vertices at distance from and vertices at distance from . Moreover, there exists a vertex adjacent to as the graph is non-discrete. Every vertex adjacent to is adjacent to , so .
The induced graph on vertices of is discrete because every edge intersects . Take any . Consider a path from to in . Somewhere along this path we go from a vertex, which is connected to both and to a vertex which is connected to neither. Therefore there are and such that commutes with and and does not commute with any of and . Now instead of the deletion of the hyperplanes labelled delete the hyperplanes labelled . This creates a square with labels . Continue building the tail. We have one fewer , two fewer and two more of each and .
Let be the new subcomplex. By construction and the sequences of labels of deleted hyperplanes for the two complexes differ at no more than places. ∎
Using Lemmas 5.2 and 5.3, we can now modify segments of the tail to make the parity of all elements even. This completes the proof of the main theorem.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[DJ 00] Michael W Davis and Tadeusz Januszkiewicz. Right-angled artin groups are commensurable with right-angled coxeter groups. Journal of Pure and Applied Algebra , 153(3):229–235, 2000.
- 2[DM 96] John D Dixon and Brian Mortimer. Permutation groups , volume 163. Springer Science & Business Media, 1996.
- 3[Hag 08] Frédéric Haglund. Finite index subgroups of graph products. Geometriae Dedicata , 135(1):167, 2008.
- 4[Hal 49] Marshall Hall. Coset representations in free groups. Transactions of the American Mathematical Society , 67(2):421–432, 1949.
- 5[HW 08] Frédéric Haglund and Daniel T Wise. Special cube complexes. Geometric and Functional Analysis , 17(5):1551–1620, 2008.
- 6[Sag 95] Michah Sageev. Ends of group pairs and non-positively curved cube complexes. Proceedings of the London Mathematical Society , 3(3):585–617, 1995.
- 7[Sco 78] Peter Scott. Subgroups of surface groups are almost geometric. Journal of the London Mathematical Society , 2(3):555–565, 1978.
- 8[Sco 85] Peter Scott. Correction to ‘subgroups of surface groups are almost geometric’. Journal of the London Mathematical Society , 2(2):217–220, 1985.
