Commensurating HNN-extensions: non-positive curvature and biautomaticity
Ian J. Leary, Ashot Minasyan

TL;DR
This paper investigates the properties of certain groups, showing that the commensurator of quasiconvex abelian subgroups in biautomatic groups is limited, and constructs examples of CAT(0) groups that are not biautomatic, addressing key questions in geometric group theory.
Contribution
It establishes a new criterion relating commensurators to biautomaticity and provides explicit examples of CAT(0) groups lacking biautomaticity.
Findings
The commensurator of quasiconvex abelian subgroups in biautomatic groups has finite image.
Existence of CAT(0) groups that are not biautomatic.
Resolution of open questions about the relationship between CAT(0) and biautomatic groups.
Abstract
We show that the commensurator of any quasiconvex abelian subgroup in a biautomatic group is small, in the sense that it has finite image in the abstract commensurator of the subgroup. Using this criterion we exhibit groups that are CAT(0) but not biautomatic. These groups also resolve a number of other questions concerning CAT(0) groups.
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.
\subject
primaryMSC200020F67 \subjectsecondaryMSC200020F10 \subjectsecondaryMSC200020E06
Commensurating HNN-extensions: non-positive curvature
and biautomaticity
Ian J. Leary
Ashot Minasyan
CGTA, School of Mathematical Sciences, University of Southampton, Highfield, Southampton, SO17 1BJ, United Kingdom.
[email protected], [email protected]
Abstract
We show that the commensurator of any quasiconvex abelian subgroup in a biautomatic group is small, in the sense that it has finite image in the abstract commensurator of the subgroup. Using this criterion we exhibit groups that are CAT(0) but not biautomatic. These groups also resolve a number of other questions concerning CAT(0) groups.
keywords:
commensurating HNN-extension
keywords:
biautomatic group
keywords:
CAT(0) group
1 Introduction
The theory of automatic and biautomatic groups was developed in the late 1980’s, and described in the book [17] written by Epstein, Cannon, Holt, Levy, Paterson and Thurston. The question of whether there are any automatic groups that are not biautomatic appears in this book as [17, Question 2.5.6] and as Remark 6.19 at the end of the paper of Gersten and Short [20] in which biautomatic groups were introduced. By that time it had been shown that hyperbolic groups are biautomatic (implicit in [17, Theorem 3.4.5]). The definition of biautomaticity has both language-theoretic and geometric aspects, whose interaction is non-trivial. This motivated Alonso and Bridson to introduce, in the early 1990’s, the geometric class of semihyperbolic groups [1]. This class contains all biautomatic groups and all CAT(0) groups. In the mid 1990’s Niblo and Reeves proved that CAT(0) cubical groups are biautomatic [32]. The question of whether all CAT(0) groups are automatic or even biautomatic must have been a motivating question for much of the above work, but the earliest written versions that we were able to find were in the PhD thesis of Elder [16, Open Question 2], written in 2000, and in a problem list compiled by McCammond after the American Institute of Mathematics meeting ‘Problems in Geometric Group Theory’ April 23–27, 2007 [27, Question 13] (see also [19, Section 6.6]). We answer the latter question by constructing the first examples of CAT(0) groups that are not biautomatic.
The groups that we construct are higher-dimensional analogues of Baumslag-Solitar groups [7], in the sense that they are HNN-extensions of free abelian groups of rank greater than one in which the stable letter conjugates two finite-index subgroups. Consider the group given by the presentation
[TABLE]
This is an HNN-extension of in which the stable letter conjugates two subgroups of index five. If we let act on the Euclidean plane in such a way that and act as translations of length one in orthogonal directions, the elements and act as translations of length in orthogonal directions, as do the elements and . The action of on extends to an action of the whole group , in which the stable letter acts as a rotation through . The fact that this action is by isometries is what ensures that is CAT(0), while the fact that the rotation through has infinite order is what allows us to show that is not virtually biautomatic (i.e., no finite-index subgroup is biautomatic).
The action of on the Euclidean plane can be used to show that for any , the subgroup is not abelian. But also contains a finite-index subgroup of , and so it cannot be a free group (see Corollary 9.6 below). Thus the elements give the first negative answer to a question of Wise concerning a strong version of the Tits Alternative for CAT(0) groups [8, Question 2.7].
The Bass-Serre tree for is a regular tree of valency , and we show that acts geometrically on the direct product . For a free group of rank 5, the group acts geometrically on the same CAT(0) space as , and it follows that these groups are quasi-isometric to each other. Hence any property that is not shared by and the group cannot be invariant under quasi-isometry, even amongst CAT(0) groups. In particular there are CAT(0) groups that are quasi-isometric to but are not virtually biautomatic, and hence cannot be virtually cubical. In fact, by a recent result of Huang and Prytuła [22], no finite-index subgroup of admits a proper action on a finite-dimensional CAT(0) cube complex by cubical automorphisms (because no positive power of normalizes a subgroup of finite index in the abelian base group ).
Note that although is quasi-isometric to it is not commensurable to it, and so is not quasi-isometrically rigid, contrary to some claims in the existing literature. Moreover, embeds as an irreducible lattice in the group of isometries of . There has been some confusion concerning this property in the literature: in particular [13] claims that no such lattices exist (this has recently been rectified in [14]).
By varying the geometry of the free abelian subgroup, one can construct similar examples in which the indices of the subgroups conjugated by the stable letter are smaller. Consider the groups for with presentations
[TABLE]
In , the stable letter conjugates two index subgroups of , and since , this relator and the generator can be eliminated, giving a presentation of with just two generators and two relators. We show that is CAT(0) if and only if and that is biautomatic if and only if . Thus the groups for are CAT(0) but not biautomatic, and the elements give counterexamples to Wise’s question for these values of too [8, Question 2.7].
Although our main examples arise already for base groups free abelian of rank , we consider commensurating HNN-extensions of free abelian groups of arbitrary finite rank. Such a group is described by a pair of finite-index subgroups of , together with a matrix such that multiplication by defines an isomorphism . We denote this group by , because is determined by the pair . Many of the results that we obtain concerning these groups are summarized in the following theorem.
Theorem 1.1**.**
Let be a group defined above. Then
* is residually finite is linear either or or is conjugate in to an element of ;* 2. 2.
* is CAT(0) is conjugate in to an orthogonal matrix;* 3. 3.
* is biautomatic is virtually biautomatic has finite order.*
In the special case when the three parts of Theorem 1.1 are previously known results concerning Baumslag-Solitar groups. Similarly to Baumslag-Solitar groups, many of the groups can be shown to be non-Hopfian. We give a criterion for this in Proposition 10.1 which implies that the groups and , for odd, are all non-Hopfian.
The three parts of Theorem 1.1 are proved separately. The characterization of when is residually finite in claim (1) follows from earlier work in [4], and we use the affine action of on to show that each residually finite is linear over . For claim (2) we introduce an addendum to the Flat Torus Theorem concerning the commensurator of an abelian group of semi-simple isometries of a CAT(0) space, which may be of independent interest. The main result used to prove claim (3) is the next theorem that imposes strong restrictions on the commensurator of a quasiconvex abelian subgroup in a biautomatic group.
Theorem 1.2**.**
Suppose that is a group with a biautomatic structure , and is an -quasiconvex abelian subgroup. Then the commensurator , of in , has finite image in the abstract commensurator . In particular, there is a finite-index subgroup such that every finitely generated subgroup of centralizes a finite-index subgroup of in .
The key tool used in the proof of Theorem 1.2 is the boundary of an automatic structure, discussed in Section 2. Our strategy is to show that a biautomatic structure on induces a biautomatic structure on the quasiconvex subgroup , and acts on the boundary of this structure in a natural way (see Section 4). In Section 3 we show that the boundary of any (bi)automatic structure on the abelian group is finite, hence a finite-index subgroup of must fix this boundary pointwise. Finally, in Section 5 we apply the latter to prove Theorem 1.2.
The technical heart of this paper is the results concerning biautomaticity, but the other parts of the paper may be read independently of this material. Section 6 contains our addendum to the Flat Torus Theorem. Section 7 introduces the groups , and characterizes which of them are CAT(0). Section 8 characterizes which of the groups are biautomatic. Section 9 considers in more detail the case when , and discusses a class of examples which includes the groups and already mentioned above, establishing many of their properties. Section 10 concerns the non-Hopfian property, with results only in the case , and residual finiteness, with a more general result. Section 11 shows that many of our examples can be embedded as index two subgroups of free products with amalgamation in which each factor is virtually abelian. This construction gives rise to amalgamated products of virtually abelian groups with surprising properties. Section 12 concludes with a short list of open problems concerning the groups .
Acknowledgements
Firstly, the authors thank Tomasz Prytuła. He asked the authors for an example of an abelian subgroup of a CAT(0) group, whose commensurator does not normalize any finite-index subgroup, in connection with his work on classifying spaces for families of abelian subgroups [33, 35]. This question was what originally led us to consider the groups and . The authors also thank Martin Bridson, Pierre-Emmanuel Caprace, Derek Holt, Jingyin Huang, Denis Osin and Kevin Whyte for helpful comments on aspects of the work. The first named author was partially supported by a Research Fellowship from the Leverhulme Trust. Most of the work was done in Southampton. However, during the project the first named author spent some weeks at INI, Cambridge, where research was supported by EPSRC grant EP/K032208/1.
2 Background and notation
2.1 Commensurators
If is a group and is a subgroup, the commensurator of in is the subset defined by
[TABLE]
It is not difficult to see that is actually a subgroup of . We will say that commensurates if .
The elements of the abstract commensurator of a group , denoted , are equivalence classes of isomorphisms , where both and are finite-index subgroups of . Two such isomorphisms and are equivalent if there is also of finite index in so that . The abstract commensurator is a group, in which the composite of the equivalence classes of and is the class of .
For any group and a subgroup , there is a natural map from to , taking to the element of represented by conjugation by . The kernel of this homomorphism consists of the elements that centralize some finite-index subgroup of .
It is easy to see that the abstract commensurator can be naturally identified with . Equivalently, if is a finitely generated free abelian group then is identified with , the group of vector space automorphisms of . There is a coordinate-free description of the homomorphism from the abstract commensurator of to : suppose that is an isomorphism between finite-index subgroups of , and let and be the inclusions. Each of and is an isomorphism. The image of in is .
2.2 Automatic structures and the fellow traveller property
In this subsection we will briefly discuss the notions of automatic and biautomatic structures on groups. The reader is referred to [17, Section 2.3, 2.5] for more details and examples.
Let be a finite set and let be a group with a map . We will say that is generated by if the extension of to a homomorphism from the free monoid to is surjective. Elements of will be called words, and if and are such that , we will say that represents in . Given a word in , will denote its length. We will always assume that is closed under inversion, that is there is an involution , where, for each , is denoted and satisfies in . Any subset will be called a language over .
We can form the Cayley graph , of with respect to as follows: the vertices are elements of and for every and there is an edge from to , labelled by . Metrically, every edge in will be considered as an isometric copy of the interval .
We will use to denote the standard graph metric on ; its restriction to is the word metric corresponding to the generating set . For any element we will use to denote ; in other words, is the length of a shortest word in representing in . Note that since is closed under inversion.
For an edge path in , and will denote the start and end vertices of respectively, and will denote the length of . The label of is a word from obtained by collating the labels of its edges.
Any edge path in can be equipped with the following ray parametrization: , where for each , is the -th vertex of (so that , ), and for all ; for every and each , is defined so that the restriction of to is an isometry with the corresponding edge of in .
Definition 2.1**.**
Let be two edge paths in , with ray parametrizations respectively, and let be a constant. We will say that -follows if for all . The paths and are said to *-fellow travel * if for all .
If and are two words from , we can consider two edge paths , in which start at and are labelled by , respectively. We will say that -follows if the path -follows the path . Similarly, and are said to -fellow travel if and -fellow travel.
It is easy to see that two edge paths (words) -fellow travel if and only if each of them -follows the other one.
Definition 2.2**.**
Let be a group. An automatic structure on the group is a pair , where is a finite generating set of , which comes equipped with a map as above and which is closed under inversion, and is a language satisfying the following conditions:
- (i)
;
- (ii)
is a regular language, i.e., is the accepted language of a finite state automaton over ;
- (iii)
there exists such that for any two edge paths in , labelled by some words from and satisfying and , and -fellow travel.
is a biautomatic structure on , if satisfies the conditions (i), (ii) and
- (iii’)
there exists such that for any two edge paths in , labelled by some words from and satisfying and , and -fellow travel.
The group is said to be automatic (biautomatic) if it admits an automatic (respectively, biautomatic) structure.
Obviously condition (iii’) is stronger than condition (iii), so every biautomatic structure on a group is also an automatic structure. Also, condition (iii) implies that for any two paths that are labelled by some words from and satisfy and , for some , and -fellow travel in . And, if (iii’) holds, then the requirement can be relaxed to .
An automatic structure on a group is said to be finite-to-one if for every . It is known (see [17, Theorem 2.5.1]) that every automatic (biautomatic) structure can be refined to a finite-to-one automatic (respectively, biautomatic) structure, hence from now on we will assume that all the automatic and biautomatic structures are finite-to-one. Without loss of generality we will also suppose that all the automata in this paper have no dead states.
It is worth noting that the nowadays standard definition of a biautomatic structure that we give above is not the same as the definition from [17, Definition 2.5.4]: see [2]. However, for finite-to-one structures these definitions are equivalent [2, Theorem 6].
2.3 The boundary of an automatic structure
Definition 2.3**.**
Let be an automatic structure on , and let be a sequence of words from . We will say that this sequence tends to infinity if as and there exists such that for any , -follows whenever .
Suppose that and are two sequences of words from tending to infinity, and, for each , , are the edge paths in starting at and labelled by , respectively. We will say that is equivalent to if the Hausdorff distance between the corresponding sequences of paths and is at most in . In other words, there must exist such that for all , any vertex of is at most away from a vertex of , for some , and vice-versa.
Definition 2.3 immediately implies the following.
Remark 2.4*.*
If is a subsequence of a sequence of words tending to infinity, then also tends to infinity and is equivalent to .
Definition 2.5**.**
If is an automatic structure on a group , then the boundary, , of this automatic structure is the set of equivalence classes of sequences of words from tending to infinity. If is the equivalence class of a sequence , we will say that this sequence converges to the boundary point .
The first definition of a boundary of an automatic structure was given by Neumann and Shapiro in [31, pp. 459-460]. It is not difficult to see that there is a natural bijection between their boundary and ours. However, our Definition 2.5 is better suited for constructing the action of a group on the boundary of a biautomatic structure (see Section 4 below).
Given an automaton , by a path in this automaton we will mean any directed path in the corresponding graph. If is a state of , a cycle based at is a closed path starting and ending at the state . A path in is simple if it does not pass through the same state twice. A cycle based at a state in is simple if it passes through exactly twice (at its beginning and at its end) and does not pass through any other state more than once. A path or a cycle is non-trivial if it has at least one edge.
The following lemma is a straightforward consequence of the definitions.
Lemma 2.6**.**
Suppose that is an automatic structure on a group , is a finite state automaton for and is the label of a non-trivial cycle in based at some state . Let and be words from labelling some paths and connecting the initial state of with and with an accept state of respectively. Then is a sequence of words from tending to infinity. In particular, if is infinite then .
Definition 2.7**.**
In the notation of Lemma 2.6, if the paths and the cycle are all simple, the sequence of words will be called a simple sequence tending to infinity and the corresponding point will be called a simple boundary point.
3 The boundary of an automatic structure on an abelian group
Theorem 3.1**.**
Let be an abelian group with an automatic structure and let be a finite state automaton accepting the language . Then every boundary point is simple; in other words, every sequence of words from tending to infinity is equivalent to a simple such sequence.
Proof.
Let be a simple cycle in based at a state . Given a path in , an occurrence of in is a subpath of starting and ending at and traversing exactly once. We will use to denote the number of occurrences of in .
Let be a sequence of words from tending to infinity, and for each fix a path from the initial state to an accept state in , labelled by . Since as and the automaton is finite, in view of Remark 2.4 we can replace by a subsequence so that for all and share a common initial subpath , of length .
Evidently, since as , there must exist some non-trivial simple cycle , based at a state in , such that
[TABLE]
Choose so that , then there is a path from the initial state of to such that is an initial subpath of (and, hence, of for all ). We can also choose a simple path from to an accept state of , and let , and be the labels of , and respectively. We will now show that the sequence of words , which tends to infinity by Lemma 2.6, is equivalent to the original sequence .
Let and be the paths in starting at and labelled by the words and respectively, . For any , according to (1), there is such that , hence is the concatenation , where are some paths in from to itself, and is a path from to an accept state of . Let be the word in labelling , .
Note that since is abelian, the word represents the same element of as the word . Moreover, clearly is accepted by (it labels the path in ), by construction, hence and -fellow travel in , where is the constant from the definition of the automatic structure . Therefore the word -follows in , which implies that every vertex of the path lies -close to a vertex of , where .
To show the converse, let be arbitrary and set . By (1) there exists such that as before. If is the label of , , arguing as above we can conclude that the words and -fellow travel in . Since tends to infinity, we know that there is , depending only on this sequence, such that -follows , as . Hence -follows the prefix of , of length , which, in its own turn, -follows the prefix of , of the same length. Since is a prefix of of length at least , we can conclude that -follows the word in , hence it also -follows the word . Therefore each vertex of the path is -close to a vertex of the path in , where .
Thus we have shown that the sequences of paths and lie in -neighborhoods of each other in , yielding that the sequences and are equivalent, as claimed.
The proof of the theorem is not quite finished yet, as the path , labelled by in , may not be simple. So, choose some simple path , joining the initial state of with the state , at which the simple cycle is based, and let be the word labelling . By Lemma 2.6, is a simple sequence tending to infinity, and we will complete the proof by showing that this sequence is equivalent to (and, hence to , by transitivity).
Let be the path in starting at and labelled by the word , . Since is abelian, for all the word represents the same element of as the word . Therefore for all , where . Since the labels of and are both in the language , these paths -fellow travel in for each , where . Hence the Hausdorff distance between the sequences of paths and is at most , which implies that the sequences of words and are equivalent. Thus the theorem is proved. ∎
Definition 2.7 implies that any automatic structure admits only finitely many simple sequences of words tending to infinity. Therefore the following statement is a consequence of Theorem 3.1 (cf. [31, Theorem 6.7]).
Corollary 3.2**.**
If is an automatic structure on an abelian group then is finite.
4 The action of the commensurator on the boundary of a
quasiconvex subgroup
Let be a group equipped with a (finite-to-one) biautomatic structure . Recall that a subgroup is -quasiconvex if there exists such that for any path in starting at , ending at some and labelled by a word , every vertex of lies in the -neighborhood of (see [20, p. 129]). Given such a quasiconvex subgroup, let and define a finite subset of by
[TABLE]
Note that since is closed under inversion. Recalling the construction from [20, p. 138], given any word , where , the quasiconvexity of implies that for each there is such that and . Clearly we can choose and let so that in . This allows us to re-write the words from as words from , possibly in a non-unique fashion due to some freedom in the choice of . Let denote the resulting language, consisting of words from re-written as words in in such a way (with all possible ’s).
In [20, Theorem 3.1] Gersten and Short proved that is a biautomatic structure on . For our purposes it will be convenient to modify the original biautomatic structure on as follows. Let be the abstract union of the finite sets and . Then is a language in . Obviously and are still regular in , hence is also a regular language in , as a union of regular languages (see [17, Lemma 1.4.1]).
One can define a map , where and is the identity map on (as , by definition), and extend it to a monoid homomorphism . Clearly is a finite generating set of .
Consider any path in , labelled by a word . Let , then belongs to the coset . By definition, is obtained from a word by applying the re-writing process above. Let denote the path in labelled by and starting at . Then and . Moreover, the paths and -fellow travel in , by construction (see Figure 1).
Lemma 4.1**.**
* is a finite-to-one biautomatic structure on .*
Proof.
We have already observed that is a regular language in ; moreover, as and . Let us now check that the fellow travelling property holds.
Since is a biautomatic structure on , there is some such that two paths in with labels from whose endpoints are at distance at most from each other -fellow travel. Consider any two paths and in labelled by words from , with and . Define the paths and in as follows. If is labelled by a word from , then ; otherwise, if is labelled by a word from then is the path defined above, labelled by a word from . We construct the path similarly, and note that since the labels of and are in , they can be considered as paths in .
Since for any , by (2), has the same endpoints as , and has the same endpoints as , we see that and . Therefore the paths and -fellow travel in , where . Hence, these paths also -fellow travel in , as . It follows that the original paths and -fellow travel in , where . Thus is a biautomatic structure on .
By our convention, the biautomatic structure on is finite-to-one, and, by the above construction, there are only finitely many possibilities for re-writing each word as a word in , hence the biautomatic structure on is also finite-to-one. It follows that the biautomatic structure on is finite-to-one as well. ∎
The new biautomatic structure on naturally extends the biautomatic structure on , and the Cayley graph is a subgraph of the Cayley graph . This allows us to define the action of the commensurator on the boundary of as follows. Let be a sequence of words from tending to infinity and representing a boundary point , and let . Since has finite index in , there exist such that , thus, for any there is , with , such that .
Note that for all , and choose any sequence of elements , , such that and for all . Let be any word representing , . We claim that the sequence of words tends to infinity and define its equivalence class in to be the result of the action of on .
Lemma 4.2**.**
The above construction gives a well-defined action of on .
Proof.
Using the notation from the preceding paragraph, let us first check that the sequence of words in tends to infinity. Note that , as , and the biautomatic structure is finite-to-one by Lemma 4.1. We can also observe that
[TABLE]
Therefore .
For each let be the path in starting at and labelled by . Since the sequence , of words in , tends to infinity, there exists such that -follows in , for any with .
Let be the path in starting at and labelled by , . Observe that for all , and . Since and the structure is biautomatic, there exists such that the paths and -fellow travel, for all . Therefore, for , the path -follows the path in , whenever and . Let . Since each is labelled by a word from , -follows as paths in , whenever . Thus the sequence , of words in , tends to infinity.
Now, suppose that is another sequence of words in which tends to infinity and is equivalent to the sequence . For each choose an arbitrary element such that and , and let be any word from representing the element . Let us show that the sequence is equivalent to the sequence .
Let be the path in starting at and labelled by , and let be the path in starting at and labelled by , . By the assumptions, there exists such that the Hausdorff distance between the sequences and is at most . On the other hand, the argument above shows that the paths and -fellow travel, for some and all . It follows that the Hausdorff distance between the sequences and does not exceed in . Since and are labelled by words from , for each , the Hausdorff distance between the sequences of these paths is also bounded in by the constant . Thus the sequences of words and indeed give rise to the same boundary point in . This shows that the above action is well-defined.
It remains to check that the axioms of a group action are satisfied. Let and let be a sequence of words from converging to a boundary point . Obviously , so this axiom is satisfied. On the other hand, by the definition of the action, the point is obtained from a sequence of words in representing the elements , where , , and , , for all . Set , and observe that since for all , . Therefore the boundary point can be obtained from the same sequence of words in , representing the same elements , , that were used for the point . Thus , which completes the proof of the lemma. ∎
5 The case of an abelian subgroup
In this section we will assume that is a group equipped with a biautomatic structure , and is a finitely generated abelian subgroup with a biautomatic structure , where and . As explained in Section 4, we can find such biautomatic structures on and starting from any biautomatic structure on , as long as is -quasiconvex. We also define the action of the commensurator on the boundary as explained in that section. Let and denote the monoid homomorphisms sending the words to the group elements they represent.
The next theorem is the main result of this section.
Theorem 5.1**.**
Using the notation from the beginning of the section, suppose that an element acts trivially on the boundary . Then centralizes a finite-index subgroup of .
The proof of Theorem 5.1 will require two auxiliary statements.
Lemma 5.2**.**
Suppose that fixes a simple boundary point , given by a sequence of words in tending to infinity, where . Then there exists such that in , where is the element represented by the word .
Proof.
Since , we can choose elements , , so that and for all . By the definition of the action, given in Section 4, is the equivalence class of a sequence of words , where represents the element , .
For each let be the path in starting at and labelled by the word , let and be the paths in starting at and labelled by the words and , respectively (see Figure 2). Note that and, since , there are , independent of , and , such that is at most -away from some vertex of . Obviously, any vertex of is at most -away from , for some and .
Thus for every there is such that . On the other hand, recall that . Since the paths and are both labelled by words from and is a biautomatic structure on , there is such that these paths -fellow travel in for all and .
Now, the word cannot be empty by the assumptions, and since the structure is finite-to-one, must have infinite order in . It follows that , hence must also tend to infinity as . Therefore there is such that both and are greater than .
For each let be the vertex of such that the subpath of from to is labelled by . Similarly, we define to be the vertex of the path such that the subpath of from to is labelled by . By construction, for every , and the definition of implies that there must exist indices , , such that in . Set , then the quadrilateral in with vertices , , and (see Figure 2) gives rise to the equality in , where . Thus commutes with in . On the other hand, the quadrilateral with vertices , , and in gives rise to the equality in . Since is a word from and is abelian, the element commutes with in , therefore also commutes with and the lemma is proved. ∎
Lemma 5.3**.**
Let be a finite state automaton accepting the language , and let be the set of elements of represented by the labels of non-trivial simple cycles in . Then generates a finite-index subgroup of .
Proof.
Let be the number of states in the automaton . We claim that , where .
Indeed, choose any element and let be the shortest word from representing in . We will prove that by induction on the length of . If then . Otherwise, if , any path in labelled by , from the initial state to an accept state of (which exists as this automaton accepts ), must contain a non-trivial simple cycle based at some state and labelled by a word , with . Thus , where , are labels of some subpaths of ending and beginning at respectively. Clearly , as this word is accepted by , but its length is strictly smaller than the length of . Moreover, since is abelian, we have . By the induction hypothesis, , so , and the claim is proved.
Since is a finite set, by definition, and , the inclusion implies that , as required. ∎
Proof of Theorem 5.1.
Let be a finite state automaton accepting the language , and let be the list of the labels of all non-trivial simple cycles in . Let denote the (finite) set of elements of represented by the words from .
Take any , then for some . Let be the state of at which a cycle labelled by is based, and choose some simple paths and joining the initial state of with and with an accept state of respectively. Then, according to Lemma 2.6, the sequence of words converges to some point . By the assumptions, , so we can use Lemma 5.2 to conclude that in , for some . Since the latter holds for every and , we can find a single such that commutes with for all .
Now, the elements obviously generate a finite-index subgroup of the finitely generated abelian group , which itself has finite index in , by Lemma 5.3. Thus and is centralized by , as required. ∎
We can now prove Theorem 1.2 stated in the introduction.
Proof of Theorem 1.2.
Define a biautomatic structure on the subgroup as in Section 4. This gives rise to an action of on the finite set (see Lemma 4.2 and Corollary 3.2), and we denote the kernel of this action by . Then and .
By Theorem 5.1, every element of centralizes a finite-index subgroup of , hence lies in the kernel of the homomorphism from to . It follows that the image of in is finite. Any finite subset of centralizes a finite-index subgroup of , thus the same holds for any finitely generated subgroup . ∎
The main examples of -quasiconvex subgroups in biautomatic groups are centralizers of finite subsets (see [17, Corollary 8.3.5 and Theorem 8.3.1]). Therefore the following statement is an immediate corollary of Theorem 1.2.
Corollary 5.4**.**
Let be a biautomatic group and let be a finite subset such that is abelian. Then there is a finite-index subgroup such that every finitely generated subgroup of centralizes a finite-index subgroup of in .
Remark 5.5*.*
In [22, Proposition 9.1] Huang and Prytuła use an example from Wise’s thesis [40] to show that there exists a group , acting properly discontinuously, cocompactly and cellularly on a product of two trees, and an infinite cyclic subgroup such that is not finitely generated and does not normalize any finite-index subgroup of .
Since the product of two trees is a CAT(0) cube complex, the group is biautomatic by [32]. After analysing the construction it becomes clear that one can replace with a commensurable infinite cyclic subgroup to ensure that for some finite subset . Therefore, the examples of and show that it is indeed necessary to pass to finitely generated subgroups of in Theorem 1.2 and Corollary 5.4.
6 Commensuration and the Flat Torus Theorem
Let us start this section by recalling the Flat Torus Theorem [12, II.7.1]. Throughout this section we will use additive notation for the group operation on a free abelian group .
Theorem 6.1**.**
Let be a free abelian group of rank acting properly by semi-simple isometries on a CAT(0) space . Then:
The min set for is non-empty and . 2. 2.
Every leaves invariant, respects the product decomposition, and acts trivially on and by translation on . 3. 3.
For , the quotient is an -torus. 4. 4.
If an isometry of normalizes then it preserves and the direct product decomposition. 5. 5.
If a group of isometries of normalizes , then a finite-index subgroup of centralizes . If is finitely generated, then has a finite-index subgroup containing as a direct factor.
We want an analogous statement to (4) above, but for isometries that lie in the commensurator of rather than in its normalizer. For this it is easier first to describe a different statement that is equivalent to (3).
Recall that a torsor for an abelian group is a non-empty set on which it acts freely and transitively. An affine space is naturally a torsor for its vector space of translations.
Remark 6.2*.*
Let be a free abelian group of finite rank , and suppose that acts by translations on a finite-dimensional real affine space . The following are equivalent:
- •
the action of is properly discontinuous and cocompact;
- •
the unique affine extension of the action to makes a torsor for .
In fact, the affine extension to is free if and only if the action of on is properly discontinuous, and in this case is a torsor for if and only if has dimension .
Now suppose that one is given a torsor action of a vector space by translations on the Euclidean space . In this case, the Euclidean distance on enables one to define an inner product on , via \displaystyle\langle v,w\rangle\mathrel{\mathop{\mathchar 0\relax}"303A}\mkern-1.2mu=\frac{1}{2}\bigl{(}d((v+w)\,x,x)^{2}-d(v\,x,x)^{2}-d(w\,x,x)^{2}\bigr{)}, for any .
In particular, with hypotheses and notation as in Theorem 6.1, we may define an inner product on by setting
[TABLE]
for each , and extending linearly to . Here , the min set of , and Theorem 6.1(2) tells us that the definition does not depend on which we choose. The fact that this is an inner product follows easily from the cosine rule. The following observation is an immediate consequence of the definitions and Theorem 6.1.
Remark 6.3*.*
Let be a finitely generated free abelian group acting properly by isometries on a CAT(0) space , and let be any subgroup. Then the min set of is contained in the min set of , and for all we have .
We are now ready state our addendum to the Flat Torus Theorem.
Theorem 6.4**.**
Let be a free abelian group of rank acting properly by semi-simple isometries on a CAT(0) space . Then:
- (1)
The min set for is non-empty and .
- (2)
Every leaves invariant, respects the product decomposition, and acts trivially on and by translation on .
- ()
For each , is a torsor for under the affine extension of the action of .
- ()
For any isometry of that commensurates , the image of in preserves the inner product .
Proof.
Statements (1) and (2) are parts of the usual Flat Torus Theorem (Theorem 6.1), and are restated here for convenience. By Remark 6.2, () is equivalent to Theorem 6.1(3). It remains to establish ().
Since commensurates , conjugation by it in the group of the isometries of induces an isomorphism , for some finite-index subgroups and of . Let and be the min sets in for and respectively. Note that , the min set for , is contained in both and , and that restricts to an isometry from to . It follows that respects their inner products, in the sense that for each , . Since and have finite index in , there exists so that for all , . Remark 6.3 implies that , and are all equal on the finite-index subgroup of . Hence for any ,
[TABLE]
where is the image of in , as defined in Subsection 2.1. ∎
7 Commensurating HNN-extensions of free abelian groups
Let be a finitely generated free abelian group, and let be an isomorphism between finite-index subgroups of . Define a group as the HNN-extension of in which the stable letter conjugates to via :
[TABLE]
In the case when we are given a basis for and is described by a matrix, we simplify the notation slightly. For and a finite-index subgroup of , we write for the HNN-extension defined as above:
[TABLE]
If in this case, is as large as possible, i.e., , then we write instead of .
When , the groups are precisely the Baumslag-Solitar groups; if is a matrix with entry , then and if then .
Proposition 7.1**.**
Each group is free-by-abelian-by-cyclic.
Proof.
There is an affine action of on in which elements of act as translations and acts as multiplication by the matrix . Let denote the resulting homomorphism, where is the group of affine transformations of . The subgroup is in the kernel of the standard map , and hence the image is cyclic. Since , we can deduce that is abelian-by-cyclic.
Evidently the intersection is trivial, which implies that acts freely on the Bass-Serre tree for expressed as an HNN-extension of . Hence this kernel is free, so is free-by-abelian-by-cyclic. ∎
See [23] for a stronger result in the case .
Theorem 7.2**.**
The group is a CAT(0) group if and only if the matrix is conjugate in to an orthogonal matrix.
Proof.
Let and consider any . Let be the lattice , let , and let . There is a group isomorphism from to , given by for , and .
Now suppose that is an orthogonal matrix. In this case, there is a homomorphism from to the group of isometries of , in which elements of act naturally as translations and acts as multiplication by . This action is not properly discontinuous, but its restriction to each conjugate of is free and properly discontinuous. Now let be the Bass-Serre tree for expressed as an HNN-extension of . The stabilizer of each vertex of is a conjugate of and the stabilizer of each edge of is a conjugate of . Consider the diagonal action of on the product . Since edge and vertex stabilizers for the action of on act freely properly discontinuously and cocompactly on , it follows that the diagonal action of on the product is free, properly discontinuous, cocompact and isometric (for the product metric on , which is CAT(0) [12, Example II.1.15(3)]). Hence is a CAT(0) group.
For the converse, if is a CAT(0) group, then since is in , it follows that the action of preserves an inner product on by Theorem 6.4. But this action is just multiplication by . Hence preserves an inner product on and so (since all -dimensional real inner product spaces are isomorphic), is conjugate in to an orthogonal matrix. ∎
Remark 7.3*.*
There is another way to describe the CAT(0) space constructed in the above proof. Suppose that is an orthogonal matrix, is a lattice and multiplication by induces an isomorphism of finite-index sublattices . Then multiplication by induces an isometry of tori from to . Take the torus , and the direct product . Glue the subspace to via the covering map , which is a local isometry, and glue the subspace to by the composite of multiplication by (an isometry ) and the covering map . By the gluing lemma [12, II.11.13], the resulting space is locally CAT(0). The universal cover of this space with its group of deck transformations is of course the direct product with the isometric action of as described in the proof above.
Corollary 7.4**.**
If is conjugate in to an orthogonal matrix and then is quasi-isometric to , the direct product of a free abelian group and a finite rank non-abelian free group .
Proof.
Let be the free group of rank . Since the determinant of is , too. Hence the Bass-Serre tree , for the decomposition of as an HNN-extension, is a regular tree of valency , and so both and have natural isometric geometric actions on . By the Švarc-Milnor lemma [12, I.8.19] they are quasi-isometric to each other. ∎
Theorem 7.5**.**
Suppose that where has infinite order and is conjugate in to an orthogonal matrix. Then is a lattice in whose projections to the factors are not discrete.
Proof.
Since is conjugate to a matrix in , acts isometrically on , and the action on the Bass-Serre tree is always isometric. Since acts freely, properly discontinuously, cocompactly and isometrically on , it follows that is a lattice in . Since has infinite order, the element acts on as an infinite order element of the point stabilizer, which is compact (and isomorphic to ), showing that the projection of to is not discrete.
The vertex stabilizers of the action of on are conjugates of the subgroup , hence the kernel of this action is the core of , i.e., the intersection of all conjugates of in . Provided that has infinite index in , it will follow that the image of in is an infinite subgroup of the vertex stabilizer, which is a compact (profinite) group (because the tree is locally finite). But is a normal abelian subgroup of , and so, by the Flat Torus Theorem (Theorem 6.1), there is such that centralizes , and thus acts trivially on . But cannot act trivially on because has infinite order, and so must be a proper subspace of . It follows that , and so the image of (and, hence, of ) in is not discrete. ∎
In the case when , it follows that as in the above statement is an irreducible lattice in , because the matrix acts irreducibly on . This is not necessarily the case for larger . For example, if satisfies the hypotheses, then so does . As mentioned in the introduction, the existence of irreducible lattices in contradicts [13, Theorem 1.3(i), Proposition 3.6, Theorem 3.8].
8 Characterizing biautomaticity of the groups
Suppose that , for some , and is a finite-index subgroup such that is contained in . In this section we study the (virtual) biautomaticity of the groups defined in (4).
Lemma 8.1**.**
If and are both proper subgroups of then is self-centralizing in . In particular, if neither nor is an integer matrix, then is self-centralizing.
Proof.
Let be the Bass-Serre tree for expressed as an HNN-extension of . The centralizer of will act on the set of -fixed points , which is a subtree (because the unique geodesic path between two fixed points must also be fixed). The vertex corresponding to the identity coset of is fixed by , but the hypotheses imply that no edge that is incident with this vertex can be fixed by . Hence the fixed point set for the action of on is this single vertex. The first claim follows since is the full stabilizer of this vertex.
The second claim follows from the first, because the largest possible choices for and are and . ∎
Recall that a subgroup of a direct product , of two groups and , is said to be a subdirect product if the restrictions to of the natural projections and are surjective.
The following criterion for biautomaticity will be useful.
Proposition 8.2**.**
Let be a finitely generated virtually abelian group and let be a biautomatic group. Then every subdirect product is also biautomatic.
Proof.
Abusing the notation we identify any subgroup with the subgroup of . Since is subdirect, the subgroup is normal in (cf. [29, Lemma 2.1]). Now, by [30, Lemma 4.2], there exists a normal subgroup which intersects trivially and such that . Let and be the natural homomorphism whose kernel is .
By construction, has trivial intersection with in , hence . Evidently is still subdirect in . Moreover, has finite index in as , which implies that has finite index in (see [29, Lemma 2.1]).
Now, is finitely generated and virtually abelian, so it is biautomatic by [17, Corollary 4.2.4]. Therefore is biautomatic by [17, Theorem 4.1.1], and, hence its finite-index subgroup is biautomatic by [17, Theorem 4.1.4]. ∎
Theorem 8.3**.**
The group is biautomatic if and only if has finite order.
Proof.
Assume that is biautomatic. If either or , then is an ascending HNN-extension of ; in this case Groves and Hermiller [21, Main Theorem] proved that must be virtually abelian. The latter clearly implies that has finite order in .
Thus we can assume and are proper subgroups of . Then is finitely generated and self-centralizing by Lemma 8.1, and the commensurator is the whole of . Therefore, by Corollary 5.4, there is such that centralizes a finite-index subgroup of . This means that is the identity matrix, and so has order dividing .
Now suppose that has finite order , and let be the intersection of the subgroups , . Then is a finite-index subgroup of and is normal in . The quotient group is an HNN-extension of the finite group , hence it is virtually free. It follows that is word hyperbolic, and, therefore, biautomatic (this can be easily deduced from [17, Chapter 3]; see [12, III..2.20] for an explicit statement). Let denote the natural epimorphism with .
As in the proof of Proposition 7.1, we also have a homomorphism which sends to a subgroup of translations of and to the linear transformation of corresponding to . Since has finite order, it is clear that is virtually abelian; moreover, by construction.
Define the homomorphism by for all . This homomorphism is injective because the kernels of and intersect trivially. Since and , is a subdirect product in . Therefore is biautomatic by Proposition 8.2. ∎
A well-known open problem (see [17, Open Question 4.1.5]) asks whether a group which has a finite-index biautomatic subgroup must itself be biautomatic. In the remainder of this section we will show that this is indeed the case for our groups: is biautomatic if and only if it is virtually biautomatic.
Lemma 8.4**.**
Suppose that and are both proper subgroups of and let denote the second derived subgroup of . Then is a non-abelian free group and for any two non-commuting elements , the centralizer is a finite-index subgroup of , for some .
Proof.
Proposition 7.1 implies that is free, and since and are proper subgroups of , cannot be soluble (it will contain non-abelian free subgroups being an HNN-extension in which both of the associated subgroups are proper subgroups of the base group), hence is non-abelian.
Observe that the normal closure , of in , is generated by the elements , where and . Evidently any such element centralizes the finite-index subgroup , of . Since each is a product of finitely many such elements, we conclude that must also centralize a finite-index subgroup of in .
Consider any two non-commuting elements . Since is cyclic (generated by the image of ), , so and both centralize some finite-index subgroup of . Let be the Bass-Serre tree for the splitting of as an HNN-extension of . Note that the subgroup acts freely on (see the proof of Proposition 7.1), so each acts as a hyperbolic isometry of with an axis , .
If then the rank free subgroup acts on the simplicial line by isometries. This action must have a non-trivial kernel, because the group of all simplicial isometries of is isomorphic to the infinite dihedral group. This means that a non-trivial element of fixes pointwise, contradicting the freeness of the action of this subgroup on .
Hence and must be distinct. Since preserves each of these axes setwise, this centralizer must fix a vertex of : if is a finite segment, it will fix a vertex of this segment; if is an infinite ray, it will fix all of it; finally, if , it will fix all vertices of the unique geodesic segment connecting these two axes. The vertex stabilizers for the action of on are conjugates of , so there exists such that . Recall that commensurates , hence has finite index in . Since contains and , we conclude that , as claimed. ∎
Theorem 8.5**.**
If has infinite order then the group is not virtually biautomatic.
Proof.
As in the proof of Theorem 8.3, the case when either or follows from the result of Groves-Hermiller [21, Main Theorem], so we assume from now on that both and are proper subgroups of .
Let be a finite-index subgroup of , then , so is a non-abelian free subgroup by Lemma 8.4. Choose arbitrary two non-commuting elements . The same lemma states that is a finite-index subgroup of for some . Since commensurates , it also commensurates , as well as its finite-index subgroup . It follows that is an abelian subgroup commensurated by . Now, Corollary 5.4 implies that cannot be biautomatic as , for some , and no non-trivial power of this element can centralize a finite-index subgroup of (since has infinite order). ∎
9 Explicit examples
Throughout this section, it will be sufficient to specialize the groups , defined in Section 7, to the case when has rank two. We will write to denote the ring of matrices with rational entries. Before starting, we recall that the classification, up to conjugacy, of square matrices over a field is equivalent to the classification, up to isomorphism, of finitely generated torsion modules for the polynomial ring , which is a principal ideal domain [25, Ch. XI]. In particular, if is a polynomial that is square-free (i.e., not divisible by the square of any irreducible polynomial) then there is exactly one conjugacy class of square matrices over with characteristic polynomial : this is the analogue for of the familiar statement (for -modules) that there is exactly one abelian group of order provided that is square-free.
Proposition 9.1**.**
If , then is conjugate to an element of in if and only if and either or . Such a matrix has finite order if and only if .
Proof.
Matrices in have the claimed properties, and these are not changed by conjugation. Conversely, if has the claimed properties and , then the characteristic polynomial of has the form , and is irreducible over . Any two matrices with this characteristic polynomial are conjugate in .
If has finite order, the additive group of the subring of generated by is finitely generated, from which it follows that the characteristic polynomial of must lie in . For the converse, the choices of for give rise to elements of order respectively. ∎
Example 9.2*.*
As examples, the matrix
[TABLE]
for with , is conjugate to a matrix in if and only if , and has infinite order provided that .
Pythagorean triples give rise to matrices of infinite order in . For example we shall consider the matrix , defined by
[TABLE]
A combination of Theorem 7.2 with Theorem 8.3 yields the following.
Corollary 9.3**.**
If has infinite order and is conjugate to an element of in then for any , is CAT(0) and is not biautomatic.
Example 9.4*.*
For more concrete examples, consider the groups
[TABLE]
This group is CAT(0) whenever and is not biautomatic provided that . The group is of the form , where has index in . In the case when , is as large as possible, so .
The first example of a group of this type that we found was the group , where is the matrix defined in (6) . Here are presentations for the groups mentioned in the introduction (which corresponds to the case ) and .
[TABLE]
[TABLE]
In the case when is CAT(0), there is usually only one choice of CAT(0) metric on up to homothety.
Corollary 9.5**.**
Suppose that has order at least 3 and is conjugate to an element of in . In this case, the inner product on , defined by (3) when viewing as a subgroup of the CAT(0) group , is, up to multiplication by a scalar, the unique inner product that is preserved by .
Proof.
Let be any non-identity element, and suppose that the CAT(0) structure on is chosen so that acts on as translation by some distance . In this case , but also
[TABLE]
because acts on as rotation through an angle with . The uniqueness follows, because for , and form a basis of . ∎
Figure 3 below depicts the unique geometries on for the seven CAT(0) groups and the CAT(0) group .
In [8, Question 2.7] D. Wise asked whether every CAT(0) group has the following property: for any elements , there exists so that the subgroup is either abelian or free.
Corollary 9.6**.**
If has infinite order and is conjugate to an element of in then the group , for any suitable choice of , is CAT(0) but it is not virtually biautomatic and it does not have Wise’s property. In particular, this applies to the groups , and from Example 9.4, provided and .
Proof.
The group is CAT(0) by Theorem 7.2 and it is not virtually biautomatic by Theorem 8.5.
Let be a non-identity element of and let be the stable letter from the presentation (4). Set , then for every . Given any , the subgroup cannot be abelian because does not centralize any non-identity element of . On the other hand, cannot be free, because it contains the element , which together with generates a finite-index subgroup of . ∎
Remark 9.7*.*
Although the standard Tits alternative is still unknown for general CAT(0) groups, Proposition 7.1 implies that it does hold for any of the groups , defined by (4).
Remark 9.8*.*
After hearing the first named author’s talks on the results of this paper, M. Bridson suggested that the methods developed in his paper [9] give an alternative proof that the groups from Corollary 9.6 are not biautomatic. Indeed, [9, Proposition 2.2] states that any biautomatic structure on an abelian group can contain only finitely many commensurability classes of quasiconvex subgroups. If the matrix has infinite order and has no rational eigenvectors, then for any infinite cyclic quasiconvex subgroup , its conjugates , , will all be quasiconvex, pairwise non-commensurable and will virtually be subgroups of . Moreover, using the work of Bridson and Gilman [11] it may be possible to extend this method to prove the stronger statement that does not admit any bounded bicombing such that the corresponding language is context-free.
10 Residual finiteness and non-Hopficity
As mentioned in the introduction, the groups are higher dimensional generalizations of the Baumslag-Solitar groups. Originally Baumslag and Solitar introduced their groups in [7] as the first examples of non-Hopfian one-relator groups. It is not hard to see that nearly the same argument shows that many of our groups are non-Hopfian. The following result is closely related to a theorem of D. Meier [28], although neither result is a direct corollary of the other.
Proposition 10.1**.**
Let satisfy . Suppose that there exists an integer so that is an integer matrix and is coprime to . Then the group , defined in Section 7, is non-Hopfian.
Proof.
The characteristic polynomial of is , where . This implies that
[TABLE]
in particular, is an integer matrix. Since is an integer matrix, we have , hence . Similarly, . Thus
[TABLE]
Let be generators for , and let be the stable letter. Combining (8) with (7), we obtain the identity
[TABLE]
It is easy to check that the map defined by
[TABLE]
extends to an endomorphism . Since the image of contains and , in view of (9) we see that it also contains and . Recall that is coprime to by the assumptions, hence the image of contains and , so is surjective.
It remains to show that is not injective. The assumptions imply that both and have some non-integer entries, hence and must be proper subgroups of . Choose arbitrary and (since cannot be the union of the two proper subgroups and , there are elements of this form with ). Then the commutator is non-trivial in by Britton’s Lemma for HNN-extensions (cf. [24, Section IV.2]), but it is in the kernel of by (8). ∎
By a well-known theorem of Malcev (cf. [26]) the groups from Proposition 10.1 cannot be residually finite. We can actually say more about the finite images of such groups.
Corollary 10.2**.**
Suppose that is a group satisfying the assumptions of Proposition 10.1, and is the endomorphism defined in the proof of this proposition. Let . Then the quotient is abelian-by-cyclic. In particular, every finite quotient of is metabelian.
Proof.
Let be the normal closure of in , so that is infinite cyclic. Any can be written as products of elements of the form , where and . Hence, we can choose such that and are products of elements of the form , where and .
Note that, in view of (8), if then for each , in . Therefore there exists a sufficiently large such that and . Since is abelian, it follows that the commutator , so , for arbitrary . Therefore the image of in is abelian, so is abelian-by-cyclic.
For the last assertion, recall that the proof of Malcev’s theorem implies that is contained in the intersection of all finite-index subgroups of . Therefore it is annihilated by every epimorphism , with finite. It follows that is a quotient of , so it is also abelian-by-cyclic, as claimed. ∎
Corollary 10.3**.**
Suppose that or , with , and , is a group from Example 9.4. Then is a CAT(0) group which is not Hopfian and not uniformly non-amenable.
Proof.
The group is non-Hopfian by Proposition 10.1. The fact that is not uniformly non-amenable follows from Corollary 10.2 by [5, Corollary 13.2] or [34, Theorem 2.2]. ∎
The fact that the group is non-Hopfian can also be derived from Meier’s criterion [28, Lemma 1], however this criterion does not seem to apply to the groups . The first examples of non-Hopfian CAT(0) groups were constructed by Wise in [39].
Using the work of Andreadakis, Raptis and Varsos [4] we can characterize the residual finiteness of groups in general.
Proposition 10.4**.**
Suppose that , and is a finite-index subgroup of such that . Then the group , defined by (4), is residually finite if and only if one of the following conditions holds:
- (i)
* or ;*
- (ii)
* is conjugate in to a matrix from .*
Proof.
By [4, Theorem 1] the group , defined by (4), is residually finite if and only if either or (in which case is metabelian) or normalizes a finite-index subgroup of . Let us prove that the latter is equivalent to saying that is conjugate in to a matrix from .
Suppose, first, that for some finite-index subgroup . This implies that , so . Evidently for some invertible matrix with integer entries, thus , i.e., .
Conversely, assume that for some . Set and choose so that all entries of the matrix are integers divisible by . Then is invertible, so has finite index in ; moreover, by the choice of . Note that , so . It follows that , hence , as required. ∎
Using the rational canonical form for matrices [25, Chapter XI.4], condition (ii) from Proposition 10.4 can be restated more algebraically.
Remark 10.5*.*
A matrix is conjugate in to some matrix from if and only if and all coefficients of the characteristic polynomial of are integers.
Proposition 10.6**.**
Let , where , and is a finite-index subgroup of such that . Then is residually finite if and only if is linear over .
Proof.
Finitely generated linear groups are residually finite by a result of Malcev [26], hence we only need to prove that if is residually finite then it is isomorphic to a subgroup of for some .
Suppose, first, that normalizes a finite-index subgroup of . Then and is an HNN-extension of the finite group . Thus is finitely generated and virtually free, so it is linear over . Let be the natural epimorphism with .
As before, we also have a homomorphism , which comes from the actions of and on by translations and by respectively. The standard embedding of in shows that it is linear over .
Evidently , hence . Therefore the homomorphism , defined by for all , is injective. It follows that is linear over .
If does not normalize any finite-index subgroup of , then, by [4, Theorem 1], either or . In this case is an ascending HNN-extension of , which easily yields that embeds in the direct product , where the homomorphism , onto the second factor, is given by the natural projection sending to [math] and to . This again shows that is linear over . ∎
11 Free products with amalgamation
Just as a cyclic group embeds as an index two subgroup of a dihedral group, many of the groups can be embedded as index two subgroups of groups expressed as free products with amalgamation.
Theorem 11.1**.**
Let , let and let be a finite-index subgroup of . Suppose that there is a matrix with the following properties.
- (i)
;
- (ii)
;
- (iii)
, where .
Then the group , defined by (4), embeds as an index two subgroup of an amalgamated free product , where is an index overgroup of and is an index overgroup of .
If and is conjugate to an element of in then is CAT(0).
Proof.
Define the matrix . From conditions (i)–(iii) it is immediate that , and that . The group is defined as an extension with kernel and the quotient cyclic of order two, generated by , say, where conjugation by acts as multiplication by the matrix . Similarly, is defined as an extension with kernel and the quotient cyclic of order two, generated by an element that acts on as multiplication by . Let be the amalgamated product of and along their common subgroup .
Let and be some preimages of and respectively. Let us first check that the subgroup has index in . Evidently is generated by and , and , , as and in . Therefore , which implies that because . It follows that is the kernel of the epimorphism , defined by , and . Thus , as claimed.
Let be the Bass-Serre tree for the decomposition of as an amalgamated free product. The vertices of can be identified with the cosets or , , and the edges correspond to the cosets , . Let , be the vertices of corresponding to and respectively; let be the edge of corresponding to . Then joins with in , and this edge, together with the endpoints, is a fundamental domain for the action of on . As a fundamental domain for the induced action of on we can take the union , where with the vertices , and . Note that , since and . Thus the action of on has two orbits of vertices and two orbits of edges, and the quotient graph consists of two vertices and two edges joining them.
Observe that the -stabilizers of , , and are , , and respectively. We can now apply the Structure Theorem of Bass-Serre theory [36, Section I.5.4] to find that has the following presentation:
[TABLE]
It remains to observe that for each we have , hence the presentation (10), of , coincides with the presentation (4), of . Thus .
Now suppose that and . The cases are easily dealt with. Assuming that has order at least , a direct computation shows that any matrix satisfying is a reflection matrix from . Hence whenever preserves some inner product on , that inner product is also preserved by and . Once one knows this, showing that is a CAT(0) group is similar to the proof of Theorem 7.2. There are isometric actions of the group on and on , the Bass-Serre tree for the given decomposition as a free product with amalgamation. Furthermore, the diagonal action on is properly discontinuous, cocompact and by isometries. (If we metrize so that each edge has length , the space with its action of is equivariantly isometric to the space constructed in Theorem 7.2.) ∎
Remark 11.2*.*
In the case when , one has that , and so in this case condition (iii) follows from conditions (i) and (ii).
The possible isomorphism types of the group arising in Theorem 11.1 depend on the action of on . To make this precise, we need a further definition.
Let be a free abelian group of rank two, and let be an involution of that reverses the orientation of . It can be shown that there are two conjugacy classes of such involutions in , depending on whether has a basis which is permuted by or has a basis of eigenvectors for . We refer to the first as the rhombic case and to the second as the rectangular case. If one chooses an inner product on that is preserved by the action of the involution, the rhombic case corresponds to the existence of a basis for consisting of vectors of the same length swapped by , and the rectangular case corresponds to the existence of an orthogonal basis for consisting of eigenvectors for .
Proposition 11.3**.**
Let be a group expressed as an extension with kernel and quotient cyclic of order two, generated by . If the action of on is rhombic then is isomorphic to the wreath product . If the action of on is rectangular then is isomorphic either to the direct product or to the Klein bottle group .
Proof.
Group extensions with quotient cyclic of order two and kernel a given -module are classified by . In the rhombic case is a free -module and so there is only the split extension . In the rectangular case has order two. The split extension gives and the non-split extension gives the Klein bottle group . ∎
Example 11.4*.*
Next we consider how this embedding result applies to the groups , and which were defined in Example 9.4.
Let be the standard basis for . For each and , the matrix , defined in (5), is inverted by the matrix . If is the submodule of spanned by and , then and . A calculation shows that the action of on is rhombic and the action of on is rhombic in the case when is odd and is rectangular in the case when is even. Thus in each case the group embeds as an index two subgroup of a group as in the statement of Theorem 11.1, where . If is odd, then is also isomorphic to , whereas if is even, then may be taken to be either or .
Since the matrix , defined in (6), is already in , there are four possible choices for : or (rhombic case), or or (rectangular case). In the case when is as large as possible, a calculation shows that the action of on and the action of on both have the same type. Thus we obtain five potentially different amalgamated products of the form that contain as an index two subgroup, including one torsion-free group in which each of and is isomorphic to . None of the possible choices for swaps and its image under , so we cannot construct a group of this form containing as an index two subgroup.
Example 11.5*.*
Let us give an explicit presentation for the torsion-free amalgamated product , where , and (rectangular case). Then the group from Example 9.4 embeds in as a subgroup of index , and has the presentation
[TABLE]
which can be transformed to the -generator and -relator presentation
[TABLE]
Remark 11.6*.*
Suppose that the hypotheses of both Proposition 10.1 and Theorem 11.1 apply, and we are in the split case (i.e., when , and ). Then the endomorphism constructed in the proof of Proposition 10.1 extends to the amalgamated product via and . This gives examples of free products of virtually groups amalgamating abelian subgroups that are non-Hopfian, and, in particular, not residually finite.
Corollary 11.7**.**
In addition to the assumptions of Theorem 11.1, suppose that has infinite order. Then the amalgamated product is not virtually biautomatic.
Proof.
Indeed, the group is not virtually biautomatic by Theorem 8.5 and, since has index in , cannot be virtually biautomatic by [17, Theorem 4.1.4]. ∎
Baumslag, Gersten, Shapiro and Short [6] proved that a free product of two finitely generated free abelian groups amalgamating any subgroup is always automatic. However, Bridson [10, Remark 3] noted that amalgamated products of finitely generated virtually abelian groups can be much wilder; in particular they may not even be asynchronously automatic. Corollary 11.7 together with Example 11.4 produce examples of similar spirit.
12 Closing remarks and open questions
Motivated by the question whether all automatic groups are biautomatic, we tried checking automaticity of the groups and from Example 9.4. As part of this effort, we used the GAP implementation of Holt’s KBMAG software [18, 37] to search for automatic structures on the groups as defined in Example 9.4 for various choices of . In the cases it easily found an automatic structure, while for it failed to find any automatic structure.
Throughout the rest of this section we assume that , , and is a finite-index subgroup of such that . The questions below concern the groups , defined in (4).
Question 12.1**.**
Can the group be automatic when has infinite order?
As explained in the introduction, the groups are higher-dimensional analogues of Baumslag-Solitar groups , which cannot be subgroups of biautomatic groups unless [20, Proposition 6.7]. This yields the following question, suggested to the authors by K.-U. Bux:
Question 12.2**.**
Suppose that embeds as a subgroup in a biautomatic group. Does it follow that has finite order?111A positive answer to this question has recently been announced by M. Valiunas, arXiv:2104.13688.
In [19, Question 43] Farb, Hruska and Thomas asked whether every group which acts properly and cocompactly on a CAT(0) piecewise Euclidean -complex is biautomatic. This question remains open, though one can show that our groups and , , admit geometric actions on CAT(0) piecewise Euclidean -complexes.
Andreadakis, Raptis and Varsos [3] described a necessary and sufficient criterion for an HNN-extension of to be Hopfian. However, it is not obvious how to check this criterion for any given group . It would be interesting to characterize the Hopficity of only in terms of the matrix and the finite-index subgroup of (in the spirit of the residual finiteness criterion from Proposition 10.4).
Question 12.3**.**
Classify the groups up to isomorphism222This has recently been completed by M. Valiunas in arXiv:2011.08143., commensurability and quasi-isometry.
We expect that the classification up to isomorphism should be straightforward, while the classification up to commensurability will be more challenging (it has only recently been completed by Casals-Ruiz, Kazachkov and Zakharov [15] for the Baumslag-Solitar groups, which correspond to the case ). For the quasi-isometry classification of Baumslag-Solitar groups was done by Whyte [38]. Suppose that is conjugate to an orthogonal matrix in . Then, in view of Corollary 7.4, is quasi-isometric to the direct product of with a free group. So, for a fixed , there are exactly quasi-isometry classes for such : in the first class , has finite order and is virtually , and in the second class is a proper subgroup of and is quasi-isometric to , where is the free group of rank . In the latter case is commensurable with if and only if has finite order.
Finally, an observant reader may notice that, according to Theorem 1.1, if the group is both CAT(0) and residually finite then it is biautomatic. Thus our methods leave the following question open.
Question 12.4**.**
Is every residually finite CAT(0) group biautomatic?
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J.M. Alonso, M.R. Bridson, Semihyperbolic groups. Proc. London Math. Soc. (3) 70 (1995), 56–114.
- 2[2] A. Amrhein, Characterizing Biautomatic Groups. Preprint (2021). ar Xiv:2105.07509
- 3[3] S. Andreadakis, E. Raptis, D. Varsos, Hopficity of certain HNN-extensions. Comm. Algebra 20 (1992), no. 5, 1511–1533.
- 4[4] S. Andreadakis, E. Raptis, D. Varsos, Residual finiteness and Hopficity of certain HNN extensions. Arch. Math. (Basel) 47 (1986), no. 1, 1–5.
- 5[5] G.N. Arzhantseva, J. Burillo, M. Lustig, L. Reeves, H. Short, E. Ventura, Uniform non-amenability. Adv. Math. 197 (2005), no. 2, 499–522.
- 6[6] G. Baumslag, S.M. Gersten, M. Shapiro, H. Short, Automatic groups and amalgams. J. Pure Appl. Algebra 76 (1991), no. 3, 229–316.
- 7[7] G. Baumslag, D. Solitar, Some two-generator one-relator non-Hopfian groups. Bull. Amer. Math. Soc. 68 (1962), 199–201.
- 8[8] M. Bestvina, Questions in Geometric Group Theory. http://www.math.utah.edu/~bestvina/eprints/questions-updated.pdf
