On the residual and profinite closures of commensurated subgroups
Pierre-Emmanuel Caprace, Peter H. Kropholler, Colin D. Reid, Phillip, Wesolek

TL;DR
This paper proves that in finitely generated groups, commensurated subgroups have virtually normal residual closures, leading to broad implications for separable subgroups and various classes of groups.
Contribution
It establishes that the residual closure of a commensurated subgroup in certain groups is virtually normal, a significant generalization in subgroup theory.
Findings
Residual closure of commensurated subgroups is virtually normal in finitely generated groups.
Separable commensurated subgroups are virtually normal.
Applications include results on separable subgroups, polycyclic groups, and groups acting on trees.
Abstract
The residual closure of a subgroup of a group is the intersection of all virtually normal subgroups of containing . We show that if is generated by finitely many cosets of and if is commensurated, then the residual closure of in is virtually normal. This implies that separable commensurated subgroups of finitely generated groups are virtually normal. A stream of applications to separable subgroups, polycyclic groups, residually finite groups, groups acting on trees, lattices in products of trees and just-infinite groups then flows from this main result.
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.
\receivedline
Received 10 July 2017; revised 4 June 2019
On the residual and profinite closures
of commensurated subgroups
PIERRE-EMMANUEL CAPRACE
Université Catholique de Louvain
IRMP
\addressbreakChemin du Cyclotron 2
bte L7.01.02
1348 Louvain-la-Neuve
Belgique \addressbreake-mail: [email protected]
\nextauthorPETER H. KROPHOLLER
Mathematical Sciences F.R.S.-FNRS senior research associate, supported in part by EPSRC grant no EP/K032208/1.
University of Southampton
UK \addressbreake-mail: [email protected]
\nextauthorCOLIN D. REID
University of Newcastle supported by EPSRC grants no EP/K032208/1 and EP/ N007328/1.
\addressbreakSchool of Mathematical and Physical Sciences
\addressbreakCallaghan
NSW 2308
Australia \addressbreake-mail: [email protected]
\nextauthorPHILLIP WESOLEK
Binghamton University ARC DECRA fellow, supported in part by ARC Discovery Project DP120100996.
\addressbreakDepartment of Mathematical Sciences
PO Box 6000
\addressbreakBinghamton
New York 13902-6000
USA \addressbreake-mail: [email protected]
(????)
Abstract
The residual closure of a subgroup of a group is the intersection of all virtually normal subgroups of containing . We show that if is generated by finitely many cosets of and if is commensurated, then the residual closure of in is virtually normal. This implies that separable commensurated subgroups of finitely generated groups are virtually normal. A stream of applications to separable subgroups, polycyclic groups, residually finite groups, groups acting on trees, lattices in products of trees and just-infinite groups then flows from this main result.
††volume: ???
Contents
- 1 The Main Theorem.
- 2 Applications to subgroup separability
- 3 Applications to polycyclic groups
- 4 Applications to residually finite groups
- 5 Applications to generalized Baumslag–Solitar groups
- 6 Applications to groups acting on graphs and metric spaces
- 7 Applications to lattices in products of groups
- 8 Applications to just-infinite groups
This paper consists of a Main Theorem concerning commensurated subgroups and topologies related to profinite topologies. It then has a string of Corollaries. Some of the Corollaries are original, some known, some are well known. For example the applications to residually finite groups in Section 4 and some of the Corollaries in Section 8 are to the best of our knowledge new. But the point is to show that all our results flow in a natural way from a single source. Some of the Corollaries deserve to be called, or are called, Theorems in their own right. Before coming to the formal and complete statement of the Main Theorem we examine a special case belonging to very familiar territory. Let be a finitely generated group and let be a subgroup that satisfies the following two conditions:
is separable in , meaning that it is an intersection of subgroups of finite index or equivalently closed in the profinite topology. 2.
is commensurate with all of its conjugates, meaning that is finite for all .
Then we prove that there is a subgroup of such that is normal in and of finite index in .
This very simple general observation is not difficult to prove. Our original proofs used moderately sophisticated tools from the theory of totally disconnected locally compact groups, but here we present a proof that could be delivered in any beginning graduate course in abstract group theory. Startlingly this leads to simplifications and streamlinings of many results scattered through the literature, as we shall show.
We say that a subgroup of a group is commensurated when it is commensurate with all its conjugates. The commensurator of is the unique largest subgroup of in which is a commensurated subgroup.
For a first example of an application, if is a polycyclic group then all its subgroups satisfy So any one that satisfies is commensurate to a normal subgroup. More generally, our main theorem shows that every subgroup of a polycyclic group is commensurate with a subgroup that is normal in its commensurator, see the implication Theorem 10 (i)(iv) below: a significant streamlining of a fundamental lemma of Kropholler [14]. But the larger picture which involves a theorem of Jeanes and Wilson can also be given a smooth treatment using our Main Theorem.
Further applications can be made to group actions on graphs, metric spaces, and trees, to Baumslag–Solitar groups, the Grigorchuk group and at least one member of the family of Gupta–Sidki groups and more.
Moreover it is rather quickly clear that generalizations are possible: for example if condition is not satisfied then one can still apply the result to the profinite closure of the subgroup. Upon arriving at preliminary forms our Main Theorem it became apparent that profinite closure and separability, while very familar concepts, should be treated alongside the slightly more subtle and less well known concepts of residual closure and weak separability. This generality created no additional mathematical difficulty. So without further ado, let us proceed to the general form of
1 The Main Theorem.
Let be a group. A subgroup is called virtually normal if there is a subgroup that is normal in and of finite index in . A subgroup is called weakly separable if it is an intersection of virtually normal subgroups. Any intersection of weakly separable subgroups is weakly separable. Any subgroup is thus contained in a unique smallest weakly separable subgroup, denoted by and called the residual closure of in .
Weakly separable subgroups are a generalization of separable subgroups. A separable subgroup of is an intersection of subgroups that have finite index in . The profinite closure of a subgroup in , denoted by , is the unique smallest separable subgroup containing . The inclusion holds in general, but it can be strict. For instance, if is infinite and simple and is any finite subgroup, then , but .
{thm*}
Let be a group and be a commensurated subgroup. Assume that is generated by finitely many cosets of . Then
[TABLE]
is of finite index in the residual closure of . Additionally, is a normal subgroup of such that , and .
Basically, in words and in the case when the ambient group is finitely generated, it says that the residual closure of a commensurated subgroup is virtually normal.
For the proof, we need a couple of lemmas to show that the operation of taking the residual closure is well behaved. Define to be the set of normal subgroups of that contain a finite index subgroup of . In particular is the set of normal subgroups of finite index in . The following basic fact will be used repeatedly.
Lemma 1
Let be a group and be a subgroup. Then
[TABLE]
Proof 1.1**.**
For any , the group is a virtually normal subgroup of containing . Thus . Conversely, let be any virtually normal subgroup of containing . Let be a finite index subgroup of which is normal in . We then have and . Hence .
The proof for the profinite closure is similar.
Two subgroups are called commensurate if their intersection is of finite index in both and .
Lemma 1**.**
Let be a group and let such that . Then
[TABLE]
In particular, if and are commensurate, then and are commensurate and and are commensurate. If is commensurated in , then is commensurated and is commensurated.
Proof 1.2**.**
For any subgroup , if and only if . We infer that .
For the remaining claims, the cases of the residual closure and the profinite closure are similar. We therefore only consider the residual closure. Clearly,
[TABLE]
so . In order to prove that , we may thus assume that .
Write as a disjoint union of right cosets of . For each , there is some such that via Lemma 1, since and . The set is closed under finite intersections, so there is some such that all of the cosets are distinct. Fixing such an , Lemma 1 ensures that we can write as
[TABLE]
where is the set of such that .
Take . We have , so for exactly one . For each , it is also the case that , so . Therefore,
[TABLE]
and the latter set is exactly the coset by Lemma 1. We conclude that . Thus, , and as , the proof is complete.
Lemma 2**.**
Let be a group and let .
- (i)
For any , we have and . 2. (ii)
For any , we have .
Proof 1.3**.**
We prove (i). Claim (ii) is similar.
Take . By Lemma 1, we can write as
[TABLE]
where is the set of elements of contained in . Then
[TABLE]
where the last equality follows Lemmas 1 and 1. Applying Lemma 1 again, has finite index in , so . We conclude that . The reverse inclusion is clear.
Proof 1.4** (Proof of the Main Theorem).**
Set . Suppose for the moment that has finite index in . We infer that , so . Since , we indeed have that . Lemma 2 implies additionally that . To prove the theorem, it thus suffices to show that has finite index in . By Lemma 1, is a commensurated subgroup of , so we may assume that .
For a subset of , we define
[TABLE]
If and is finite, then has finite index in . The group is weakly separable, since is weakly separable. Letting list right coset representatives of in , there is some such that does not contain for any , since by Lemma 1. It now follows that , hence . We thus deduce that with ; that is given by Lemma 1. We now obtain the following.
- (A)
For all finite with , there is such that for all with and , we have
[TABLE]
Fix . Let denote the collection of all finite subsets of containing such that
[TABLE]
Suppose that and are subsets of and is an element of . We shall prove the following claim.
- (B)
If , and all belong to then belongs to .
We have
[TABLE]
[TABLE]
[TABLE]
Conjugating (2) by yields
[TABLE]
Intersecting with (1), we obtain
[TABLE]
Using (3) to substitute for on the left hand side of (5), we obtain
[TABLE]
A fortiori, noting that and , we have
[TABLE]
and therefore,
[TABLE]
Combining this with (6), we obtain claim (B).
Let be a finite subset of such that and . Since is commensurated, every right -coset is contained in a finite union of left -cosets. There is thus a finite subset of such that and that . In particular, we have . It follows that for all . Hence, .
Using (A) we can choose in such that contains as well as for all . By iterated application of (B), we see that belongs to for all . We deduce that
[TABLE]
Since , the group is normal in , and its index in is bounded above by . The result follows.
We immediately recover a result of Caprace and Monod, which was in fact the original inspiration for the Main Theorem. A locally compact group is called residually discrete if the intersection of all its open normal subgroups is trivial.
Corollary 3** (Caprace–Monod, [6, Corollary 4.1]).**
*A compactly generated and totally disconnected locally compact group is residually discrete if and only if it has a basis of identity neighborhoods consisting of compact open normal subgroups. *
Proof 1.5**.**
Let be a compactly generated totally disconnected locally compact group, be an identity neighborhood in , and be the set of open normal subgroups of . By Van Dantzig’s theorem, contains a compact open subgroup . That is compact ensures that for all , and via a standard compactness argument,
[TABLE]
Additionally, since is compactly generated, is generated by finitely many cosets of .
If is residually discrete, i.e. , then is weakly separable. Being compact and open, is commensurated, so by the Main Theorem, contains a normal subgroup of that is of finite index in . The closure of is a compact open normal subgroup of contained in . Conversely, if is not residually discrete, then certainly cannot have a basis of identity neighborhoods consisting of compact open normal subgroups.
Remark 3
Unlike the profinite closure, the residual closure is not a closure with respect to a fixed group topology on . However, the residual closure of a commensurated subgroup can be recovered as a closure with respect to some group topology on . Indeed, for commensurated, there is a canonical locally compact group and homomorphism such that has dense image and every finite index subgroup of is the preimage of a compact open subgroup of . The group is called the Belyaev completion of ; see [3, §7]. Let be the intersection of all open normal subgroups of and let be the quotient map. The subgroup is then the closure of in the topology induced by on . In other words, we take the closure in the coarsest group topology on such that is continuous.**
An alternative proof of the Main Theorem can be derived by following this line of reasoning and applying the aforementioned result of Caprace and Monod to the compactly generated totally disconnected group .**
2 Applications to subgroup separability
We here use the Main Theorem to study separable subgroups. Let us first observe a restatement of the Main Theorem for the profinite closure.
Corollary 4**.**
Let be a group and be a commensurated subgroup. Assume that is generated by finitely many cosets of . Then
[TABLE]
is of finite index in the profinite closure of . Additionally, is a normal subgroup of such that , and .
Proof 2.1**.**
By Lemma 1, is a commensurated subgroup. Since finite index subgroups are virtually normal, , so is weakly separable. Applying the Main Theorem, has finite index in . In particular, .
Since has finite index in it follows that some finite intersection of conjugates of already coincides with . That is, there are such that and therefore that . In view of Lemma 1, we may find such that . Hence, , and Lemma 2 implies that that .
For the final claim, Lemma 1 ensures that . By the previous paragraph, we deduce that , completing the proof.
In view of the Main theorem and Corollary 4, we deduce the following.
Corollary 5**.**
Let be a group and be a commensurated subgroup such that is generated by finitely many cosets of .
- (i)
If is weakly separable, then there is a subgroup of that is normal in and has finite index in . 2. (ii)
If is separable, then there is a subgroup that is both normal and separable in and of finite index in .
Corollary 6**.**
Let be a group and be a commensurated subgroup such that is generated by finitely many cosets of . If is weakly separable and , then is finite.
Given , we denote by the set of those such that and are commensurate.
Corollary 7**.**
Let be a group. Let be subgroups such that is finitely generated and that . If is weakly separable in , there exists a subgroup that is normal in and of finite index in .
Proof 2.2**.**
Since is weakly separable as a subgroup of , it is also weakly separable as a subgroup of . The conclusion follows by applying Corollary 5 to the group .
3 Applications to polycyclic groups
The class of virtually polycyclic groups, often referred to as polycyclic-by-finite groups coincides with the class all groups that have a series of finite length with cyclic or finite factor groups. Similarly the class of virtually soluble groups coincides with the class of all groups that have a finite series with abelian or finite factor groups. The main goal of this section is to prove the following characterizations of virtually polycyclic groups within the class of finitely generated virtually soluble groups. In particular, we will recover the known fact, due to S. Jeanes and J. Wilson [12], that a finitely generated virtually soluble group in which every subgroup that is subnormal of defect at most is separable, is virtually polycyclic. This application grew out of discussions between the second author and B. Nucinkis.
Theorem 3.0** (Jeanes–Wilson, [12]).**
The following assertions are equivalent for any finitely generated virtually soluble group .
- (i)
* is virtually polycyclic.* 2. (ii)
Every subgroup of is separable. 3. (iii)
Every subgroup of that is subnormal of defect at most is separable. 4. (iv)
To every there is a subgroup that has finite index in such that . 5. (v)
For all subgroups of that are subnormal of defect at most and all finitely generated , there exists a subgroup that has finite index in and is normal in .
The fact that (i) implies (iv) is [14, (3.1)]; however, instead of appealing to [14], we remark that this implication can be obtained immediately from Corollary 5 and a classical theorem of Mal*′*cev, thus giving a cleaner proof than the original argument of the second author (see the proof of Corollary 7 at the end of this section below).
To explain the proof we first require some background on soluble groups of finite rank. The Prüfer rank of a group is the supremum of the minimum number of generators required for each of its finitely generated subgroups. The abelian section rank is the supremum of the minimum number of generators of the elementary abelian sections, and it is a theorem of Robinson that finitely generated soluble groups with finite abelian section rank are minimax; see [20, Theorem 1.1]. Since the Prüfer rank is bounded below by the abelian section rank, finitely generated virtually soluble groups of finite Prüfer rank are minimax. For these reasons the class of minimax groups inevitably plays a central role in any study of soluble groups and associated finiteness conditions. Recall that a group is virtually soluble and minimax provided it has a series
[TABLE]
in which the factors are cyclic, quasicyclic, or finite. By a quasicyclic group, we mean a group , where is a prime number, isomorphic to the group of -power roots of unity in the field of complex numbers. For a useful alternative point of view, the exponential map identifies the additive group with . The terminology Prüfer -group is often used to mean the quasicyclic group .
For brevity, we write for the class of virtually soluble minimax groups. The following important generalization of Robinson’s work on soluble groups of finite rank is crucial to our arguments below.
Theorem 3.0** (P. H. Kropholler, [13]).**
Every finitely generated soluble group not belonging to has a section isomorphic, for some prime , to a lamplighter group .
The Hirsch length of an -group is defined to be the number of infinite cyclic factors in a cyclic–finite–quasicyclic series witnessing the definition above. The -groups of Hirsch length [math] satisfy the minimal condition on subgroups as can be seen by a straightforward induction on the length of a quasicyclic–finite series. In fact these Hirsch length [math] -groups are precisely the Černikov groups, each being virtually a direct product of finitely many quasicyclic groups by Černikov’s theorem [15, 1.4.1].
It should be noted that the Hirsch length can be defined for any soluble group by the formula , and more generally for virtually soluble groups by taking the constant value this formula gives on any subgroup of finite index. For this reason the Hirsch length is sometimes known as the torsion-free rank.
The Fitting subgroup of an -group is always nilpotent, and all -groups are virtually nilpotent-by-abelian. Details of these facts are explained in [15, §5.2.2]. We refer the reader to [15, Chapter 5] for further background information.
By lifting generators of the cyclic sections in a cyclic–finite–quasicyclic series for an -group, we see that every -group contains a finitely generated subgroup with the same Hirsch length.
Lemma 8**.**
Let be an -group and let be a subgroup with . Then is separable if and only if .
Proof 3.1**.**
The ‘only if’ direction is all that requires proof.
Note first that if is any normal subgroup of then
[TABLE]
and
[TABLE]
Since and we see that equality between and also forces both the equalities and .
To prove the Lemma we use induction on the length of a chain that is witness to . If the length is zero, then is trivial, and the result is trivially true. Suppose the length is greater than zero and let be the penultimate term. The equality forces and so by induction has finite index in . Therefore has finite index in , and is separable. There are three cases. If is finite, then has finite index in , and we are done. If is infinite cyclic, then must also be infinite cyclic, because has the same Hirsch length as . Therefore is finite, and again we are done. If is quasicyclic, then , being separable in , must be equal to (because quasi-cyclic groups do not have any proper finite index subgroups), so .
Lemma 9**.**
Let be a group in which the finitely generated subgroups are separable. Then every -subgroup of is virtually polycyclic.
Proof 3.2**.**
Let be an -subgroup of and let be a subgroup of that is finitely generated with . By Lemma 8, has finite index in , and hence is finitely generated. This shows that all -subgroups of are finitely generated. Since every subgroup of an -group is also a -group it follows that in this situation the -subgroups satisfy the maximal condition on subgroups. Virtually soluble groups with the maximal condition are all virtually polycyclic and the result follows.
The next lemma follows from [8, Theorem 3.1] once one interprets the notion of ‘solvable FAR group’ and is there attributed to D. J. S. Robinson. We include a proof for the reader’s convenience that is suited to our nomenclature.
Lemma 10** (D. J. S. Robinson).**
Let be an -group and let and be finitely generated subgroups of Hirsch length equal to . Then and are commensurate.
Proof 3.3**.**
The group has the same Hirsch length as , so replacing and by this group, we may assume that and that is finitely generated.
Let denote the number of infinite factors in a cyclic–quasicyclic–finite series. We use induction on to prove that has finite index in . If , then is finite, and there is nothing to prove. Let us then assume that is infinite. Every infinite -group has an infinite abelian normal subgroup. Let be an infinite abelian normal subgroup of . Then
[TABLE]
and . Therefore has finite index in by induction. We may replace by and so assume that . The intersection is normal in , and we have
[TABLE]
from which it follows that . We deduce that is torsion. However, is finitely generated, is abelian and torsion of finite rank, and is the semidirect product of by . In a finitely generated semi-direct product, the normal subgroup is always finitely generated as a normal subgroup. Therefore, it follows that is finite, so has finite index in .
Lemma 11**.**
Let be a finitely generated virtually soluble group. Assume that for all subnormal subgroups of and all finitely generated , there exists a subgroup that is normalized by and has finite index in . Then is virtually polycyclic.
Proof 3.4**.**
Suppose first that is an -group. Let be a finitely generated subgroup of the Fitting subgroup of such that . The subgroup is subnormal, since is nilpotent, and , by Lemma 10. Let denote the join of with the commutator subgroup of . Then also satisfies but is now subnormal of defect at most .
By hypothesis, there is a normal subgroup of which has finite index in . The quotient is then an -group of Hirsch length and so is a Černikov group. Therefore by Černikov’s theorem [15, 1.4.1] there is a characteristic abelian subgroup of finite index in . The group is finitely generated, is normal in , and is finitely presented. We thus deduce that is finitely generated as a normal subgroup of . It follows that and we deduce that is finite which implies that is finitely generated. Hence is polycyclic, and is virtually polycyclic as required.
Let us now suppose toward a contradiction that is not an -group. By Proposition 7 (the main theorem of [13]), it follows that has subgroups such that
- •
* is a normal subgroup of , and*
- •
* isomorphic to the lamplighter group for some prime .*
The section is a wreath product which can be identified with the matrix group
[TABLE]
Under this identification, the base of the wreath product — the group of lamps — corresponds to
[TABLE]
It is clear from the arguments used in [13] that and can be chosen such that is sandwiched between two terms of the derived series of a soluble subgroup of finite index in . In other words, we may assume that there is a soluble subgroup that is normal and of finite index in and an such that . In particular, both and are subnormal in of defect at most .
Let be the subgroup of the base of consisting of half the lamps, namely the subgroup corresponding to
[TABLE]
Note that is also subnormal of defect at most . Clearly contains while the intersection of the conjugates of is contained in . Let be a finitely generated subgroup of such that . Applying the hypothesis to and , we deduce that normalizes some subgroup of finite index in , and therefore normalizes some subgroup of finite index in . This is a contradiction and so excludes the possibility of large wreath product sections in .
We can now combine the results of this section to prove the main application.
Proof 3.5** (Proof of Corollary 7).**
The implication (i) (ii) is a result of Mal′cev [16]; moreover, every subgroup of a virtually polycyclic group is finitely generated. Thus we obtain (i) (iv) as a special case of Corollary 5, by considering as a subgroup of . Clearly (ii) implies (iii) and (iv) implies (v). The implication (iii) (v) is valid in any group by Corollary 7. Thus (i) implies all the other assertions, and (v) is implied by each of the other assertions. Lemma 11 ensures that (v) implies (i), and hence that all five assertions are equivalent.
4 Applications to residually finite groups
Given , we say that is relatively residually finite in if the subgroups of have trivial intersection. In other words, every non-trivial element of is separated from the identity by a quotient of in which has finite image. If itself is residually finite, then every subgroup is relatively residually finite, so the results of this section will apply to commensurated subgroups of residually finite groups.
Lemma 12**.**
Let be a group and be a subgroup. Then
[TABLE]
In particular, if is a relatively residually finite subgroup, then , and if is residually finite, then .
Proof 4.1**.**
Let and . Then for all we have , and hence . The required conclusion follows, observing in addition that the inclusion is obvious.
The proof of the corresponding fact about the profinite closure is the same.
The FC-centralizer of a subgroup of a group , denoted by , is the collection of those elements which centralize a finite index subgroup of . The FC-centralizer is a normal subgroup of the commensurator . Notice moreover that the FC-centralizer coincides with the FC-center of , i.e. the set of elements of whose -conjugacy class is finite. A group is called an FC-group if or, equivalently, if all elements of have a finite conjugacy class. We underline the difference between an FC-subgroup of , which is a subgroup such that , and an FC-central subgroup of , which is a subgroup of .
Corollary 13**.**
Let be a group, let be a normal subgroup and be a commensurated subgroup of such that . Assume that every normal FC-subgroup of is finite. If is generated by finitely many cosets of and if is relatively residually finite in , then has a finite index subgroup that commutes with .
Proof 4.2**.**
For , there is a finite index subgroup such that . The commutator is contained in the intersection , so . We deduce from Lemma 12 that since is relatively residually finite. Moreover, by Lemma 1, the index of in is finite. This shows that . Let be the normal subgroup of obtained by applying the Main Theorem to , so that is a finite index subgroup of . Thus we have . In particular is contained in , which is a normal FC-subgroup of . By hypothesis, it is finite, so that is finite. By Lemma 2, we have . Since is relatively residually finite, it follows that , and hence also , are relatively residually finite. Therefore, since is finite, there exists such that . Since and are both normal, they commute. Thus has finite index in and commutes with .
Corollary 14**.**
Let be a finitely generated residually finite group all of whose amenable normal subgroups are finite. For any normal subgroup and any commensurated subgroup , if , then some subgroup of finite index in commutes with .
Proof 4.3**.**
Every FC-group is {locally finite}-by-abelian, see [18, Theorem 5.1 and Corollary 5.13]. In particular FC-groups are amenable. Thus the required conclusion follows directly from Corollary 13.
In [2], U. Bader, A. Furman and R. Sauer have undertaken a systematic study of lattice envelopes of an abstract group , that is, a description of the structure of all locally compact groups that contain an isomorphic copy of as a lattice. Their theory requires the abstract group to satisfy three conditions. One of those conditions is that for any normal subgroup N and any commensurated subgroup H in , if , then H has a finite index subgroup that commutes with . Thus Corollary 14 shows that this one of the Bader–Furman–Sauer conditions is automatically satisfied by every finitely generated residually finite group whose amenable radical is finite.
Corollary 15**.**
Let be a finitely generated group in which every infinite normal subgroup has trivial centralizer. Then every infinite commensurated relatively residually finite subgroup has trivial FC-centralizer.
Proof 4.4**.**
Let be an infinite commensurated subgroup and let . There is a finite index subgroup such that . Let then be the normal subgroup of obtained by applying the Main Theorem to and note that is relatively residually finite as a consequence of Lemma 2. Since , we deduce from Lemma 12 that . The group is infinite, so is trivial by hypothesis. Hence, is trivial.
The hypothesis that be relatively residually finite cannot be removed in Corollary 15. As we shall see in the next section, this is illustrated by the Baumslag–Solitar groups.
Lemma 16**.**
Let be an infinite group in which every infinite normal subgroup has trivial centralizer. Then every non-trivial normal subgroup is infinite.
Proof 4.5**.**
Let be a finite normal subgroup of . Its centralizer is a normal subgroup of finite index, hence it is infinite. On the other hand, , which contains , is trivial by hypothesis.
Corollary 17**.**
Let be a finitely generated group in which every infinite normal subgroup has trivial centralizer. Then every infinite commensurated relatively residually finite subgroup has an infinite intersection with every non-trivial normal subgroup.
Proof 4.6**.**
We assume that is infinite. Let be an infinite commensurated subgroup and be a non-trivial normal subgroup. By Lemma 16, is infinite.
Assume toward a contradiction that is finite. Since is infinite and relatively residually finite, there is an infinite such that . For , there is a finite index subgroup such that . The commutator is contained in the intersection , so . We conclude that , so since by Corollary 15. In particular, , which is absurd.
The conclusion of Corollary 17 cannot be extended to a conclusion that any two infinite commensurated relatively residually finite subgroups have infinite intersection. For instance, let be an irreducible residually finite lattice in a product of two totally disconnected locally compact groups and choose to be compact open subgroups of respectively such that . We then obtain two infinite commensurated subgroups of with trivial intersection, namely and .
To conclude this section, we note a property of residually finite dense subgroups of totally disconnected locally compact groups.
Corollary 18**.**
Let be a non-discrete totally disconnected locally compact group such that every infinite normal subgroup of has trivial centralizer. If is a dense subgroup of that is finitely generated and residually finite, then the only discrete normal subgroup of contained in is the trivial subgroup.
Proof 4.7**.**
Given an infinite normal subgroup of , we see that the closure of is an infinite normal subgroup of and thus has trivial centralizer. Since the centralizer is unaffected by taking the closure, it follows that . W conclude that satisfies the hypotheses of Corollary 17.
Let be a non-trivial normal subgroup of , let be a compact open subgroup of and set . The subgroup is commensurated in , so by Corollary 17, the intersection is infinite. It now follows that is not discrete.
5 Applications to generalized Baumslag–Solitar groups
In the setting of Hausdorff topological groups, the collection of elements which satisfy a fixed law is often closed. Alternatively, if a set satisfies a law, then so does its closure. The simplest example of this phenomenon is that centralizers are always closed in a Hausdorff topological group.
While the residual closure does not necessarily come from a group topology, it does appear to behave well with respect to laws; cf. Corollary 12. We here explore the extent to which laws pass to the the residual closure of a subgroup.
Lemma 19**.**
Let be a variety of groups. If is a group and is a relatively residually finite -subgroup of , then the residual closure of also belongs to . If is residually finite, then .
Proof 5.1**.**
We see from the hypotheses that there is an injective map from to a profinite group , where is the inverse limit of the finite groups for , such that the image of in is dense. Since is a -group, it follows that is a -group and hence is a -group. If is residually finite, the argument that is similar.
Corollary 20**.**
Let be a variety of groups and let be a finitely generated group. Suppose that is a commensurated relatively residually finite -subgroup of . Then there is a normal -subgroup of such that .
We next consider the Baumslag–Solitar groups . The group is the one-relator group given by the presentation
[TABLE]
where and are integers with . A Baumslag–Solitar group is an HNN-extension of and so acts on the associated Bass–Serre tree.
We can now provide a swift strategy for recovering the known result on residual finiteness of Baumslag–Solitar groups, predicted in the original work of Baumslag and Solitar and subsequently established by Meskin.
Theorem 5.1** (Meskin, [17]).**
The Baumslag–Solitar group is residually finite if and only if the set has at most elements.
Proof 5.2**.**
We focus on one direction; namely, if is residually finite, then
[TABLE]
This is the implication where our Main Theorem provides a significant insight. The converse is rather more routine and we are not here adding anything to the argument that can be found in [17].
We prove the contrapositive. Suppose that and set . The cyclic subgroup fixes a vertex of the Bass–Serre tree and the action is vertex transitive. Since , the subgroup is trivial, and thereby, the representation is faithful. The vertex stabilizers of also do not fix any of the incident edges, so in particular, the action of on does not fix an end.
In any group acting minimally without a fixed end on a tree with more than two ends, every normal subgroup either acts trivially or acts minimally without a fixed end, by [22, Lemme 4.4]. Since a subgroup of acting minimally has trivial centralizer in (because the displacement function of any element in the centralizer is constant), it follows that every non-trivial normal subgroup of has trivial centralizer. On the other hand, is an infinite commensurated abelian subgroup of , which is thus contained in its own FC-centralizer.
We conclude from Corollary 15 that is not residually finite in this case, and indeed that is not even relatively residually finite in .
As a further illustration of these ideas we offer an application to certain fundamental groups of graphs of virtually soluble groups that generalizes some of the aspects of Meskin’s result (Corollary 20). In particular, the class we consider includes all generalized Baumslag–Solitar groups, that is, fundamental groups of graphs of cyclic groups. We shall need two lemmas in preparation.
Lemma 21**.**
Let be a group, let and let .
If is virtually soluble then is virtually soluble. 2. 2.
The Prüfer rank of is at most the Prüfer rank of . 3. 3.
If belongs to , then belongs to , with .
Proof 5.3**.**
We have a sequence of homomorphisms arising from the direct system, such that and . More generally, given such that , write for the ascending union .
Let be a soluble normal subgroup of finite index in and let be the maximal derived length of a soluble subgroup of . We now show by induction that for each ,
[TABLE]
is a soluble subgroup of of derived length at most . This is true when by the choice of . Suppose now that and, inductively, that is a soluble subgroup of . Then , so . Moreover, is normal and soluble, is soluble by induction, and so is a soluble subgroup of length at most . We thus have an ascending chain of soluble subgroups each of length at most and having finite index in . Let denote the union ; of course, for all sufficiently large .
By construction, , so we may form the ascending union . The group belongs to the variety of and hence is soluble of length at most . Let denote the (finite) index of in . For each , we see that
[TABLE]
and so we deduce that . Thus, is virtually soluble. 2. 2.
It is clear that has at most the Prüfer rank of for each , and the Prüfer rank of is the supremum of the Prüfer ranks of . 3. 3.
Consider first the case when is torsion-free abelian. In this case, induces a -linear map . Since has finite Hirsch length, is finite-dimensional over . By replacing with for sufficiently large , we may assume and hence ensure that has full rank, in other words is an automorphism. Upon choosing a basis of , we obtain a matrix corresponding to whose entries, being finite in number, belong to a subring for a choice of common denominator . Let be the product of the finitely many primes for which has Prüfer -group as a section. It is now clear that induces an automorphism of and that is a free -module of rank and belongs to . This shows that and also that .
Suppose that is an abelian -group with torsion subgroup . Then is torsion, so . Torsion -groups satisfy the minimal condition on subgroups, so restricts to a surjective map on for some . Then
[TABLE]
so we see that is by the direct limit of iterating an endomorphism of . From the torsion-free case, we conclude that .
For the case when is a soluble -group, we proceed by induction on the derived length. Since the commutator subgroup is verbal, we see that . Our inductive hypothesis implies that is an -group, and on the other hand, is the direct limit of iterating the endomorphism of induced by . We deduce that is an -group by the abelian case, and hence . A similar induction argument on the derived length shows that .
Finally, consider the general virtually soluble case. The argument used to prove (1) shows that there is a soluble subgroup of finite index in such that . We know that and by the soluble case, and the result follows since has finite index in .
Lemma 22**.**
Let be a finitely generated group acting on a tree in such a way that there is no global fixed point and there is a unique fixed end. Then there is a vertex and a hyperbolic element such that and is the ascending HNN-extension .
Proof 5.4**.**
We can define a partial ordering on the set of vertices of by declaring that when the geodesic ray starting from and traveling towards the fixed end passes through . This makes the vertex set into a directed set because the rays from any two vertices that head towards the fixed end eventually coalesce and so reach a vertex to which they both point. Note also that if then . The set of elliptic elements of is thus the directed union of the vertex stabilizers. If , then is finitely generated and so is contained in a vertex stabilizer, and this contradicts the assumption that has no global fixed point. Therefore and contains a hyperbolic element . Let be the axis of and fix a vertex on . Replacing by if necessary we may assume that . If is any element of , then fixes a vertex , and there is a such that . This shows that , and the result is clear.
Proposition 23**.**
Let be a finitely generated residually finite group that is the fundamental group of a graph of virtually soluble groups of finite Prüfer rank and of Hirsch length . Then has a soluble normal subgroup such that one of the following holds.
* fixes points on the corresponding Bass–Serre tree of and has Hirsch length , and is the fundamental group of a graph of locally finite groups. If in addition all the vertex and edge groups of the graph of groups belong to , then is virtually free.* 2. 2.
* has no fixed points on the corresponding Bass–Serre tree of , fixes a unique end and is a virtually soluble -group of Hirsch length , and is infinite and virtually cyclic. Note that in this case all vertex and edge stabilizers automatically belong to and that is virtually free of rank .*
Proof 5.5**.**
Let denote the Bass–Serre tree afforded by the hypothesized graph of groups. For each vertex or edge , let be a finitely generated subgroup of the stabilizer of Hirsch length . Note first that if and are edges that are incident with the same vertex , then is a finitely generated subgroup of , and therefore by Lemma 10, is commensurate with . Lemma 10 also shows that and have finite index in and so we deduce that , and are all commensurate. Suppose and are any two vertices in . By considering the edges and vertices on the geodesic from to , we deduce that and are commensurate.
Fix any vertex and let be a soluble subgroup of finite index in . The profinite closure of in is soluble, with the same derived length as , by Lemma 19. Additionally, has a finite index subgroup which is a separable normal subgroup of by Corollary 5. The group is a soluble normal subgroup of , and for every vertex or edge of the tree, the intersection has Hirsch length and the quotient is locally finite, residually finite, and of finite Prüfer rank.
A soluble group acting without inversion on a tree fixes a point or a unique end or stabilizes a unique pair of ends; see for example [21, Corollary 2]. Suppose toward a contradiction that there is a unique pair of ends fixed by but that does not fix any vertex or edge. In this case, stabilizes the line joining the two ends and so does . There is then a homomorphism from to an infinite cyclic or dihedral group induced by the action of on the line. On the other hand, acts on the line as a group of order at most , since fixes a vertex. By replacing with a subgroup of finite index as necessary, we can ensure that . The quotient is residually finite, so the profinite closure of and hence also act trivially on the line. This contradicts the assumption that has no fixed points.
Suppose that has a fixed point in . In this case acts on the subtree of -fixed points and is the fundamental group of a graph of locally finite groups as claimed. For any vertex of , we additionally have . Thus, , so has Hirsch length . Moreover, the quotient is a residually finite and locally finite -group, so Černikov’s theorem [15, 1.4.1] ensures that is finite. The quotient is then a graph of finite groups and thus is a virtually free group since is finitely generated. We thus obtain case (1).
Suppose that fixes a unique end of but does not fix any vertices. In this case has the same property, and Lemma 22 shows that is an ascending HNN-extension over one of its vertex stabilizers . The group is thus of the form where is a virtually soluble group of finite Prüfer rank and Hirsch length by Lemma 21. Thus, has Hirsch length and is virtually soluble. Since is also assumed to be finitely generated, it belongs to , by Proposition 7. Finally, the quotient is an -group as well as residually finite and locally finite. Any residually finite and torsion -group is finite by Černikov’s theorem [15, 1.4.1], so is finite. Since is normal, is a subgroup of where is the generator of that translates toward the fixed end. Just as in the proof of Lemma 21, we deduce that is finite, and thus, is finite-by-cyclic. It follows that is virtually cyclic, so we obtain case (2).
6 Applications to groups acting on graphs and metric spaces
Commensurated subgroups arise naturally from actions on locally finite graphs. We thus obtain several consequences for such group actions.
Corollary 24**.**
Let be a connected locally finite graph (without multiple edges) and be a finitely generated vertex-transitive group. If the stabilizer of a vertex is weakly separable, then it is finite.
Proof 6.1**.**
Since acts vertex-transitively, we have . On the other hand, the stabilizer is a commensurated subgroup of since is connected and locally finite. The conclusion now follows from Corollary 6.
Corollary 25**.**
Let be a proper uniquely geodesic metric space (e.g. a locally finite tree) and let be a finitely generated group. Suppose that there is no proper -invariant convex subspace. If the orbit of a point is discrete and its stabilizer is weakly separable, then is finite.
Proof 6.2**.**
The hypothesis of absence of proper -invariant convex subspace implies that for any vertex , the intersection is trivial, because it fixes pointwise a -invariant subspace, namely the convex hull of the -orbit of . The hypothesis that is proper and that is discrete ensures that has finite orbits on , so is commensurated. The conclusion now follows from Corollary 6.
The terminology in the following application is borrowed from [4].
Corollary 26**.**
Let be a locally finite tree all of whose vertices have degree and let be a non-discrete finitely generated subgroup whose action on is locally quasi-primitive. For a vertex, the residual closure of the vertex stabilizer in is of finite index in .
Proof 6.3**.**
Since is locally finite, the vertex stabilizer is commensurated. The group is also infinite since is non-discrete. Let be the normal subgroup afforded by the Main Theorem. Since contains a finite index subgroup of , its action on is not free. Therefore, [4, Lemma 1.4.2] implies that the -action on has finitely many orbits of vertices. In particular, is of finite index in .
7 Applications to lattices in products of groups
Lattices in products of totally disconnected locally compact groups often have interesting commensurated subgroups. We here apply our work to shed light on these subgroups.
The equivalence between (i) and (iv) in the following result is due to M. Burger and S. Mozes [5, Proposition 1.2]. Our inspiration for the equivalence between (ii) and (iv) came from contemplating D. Wise’s iconic example constructed in [26, Example 4.1]; see also [24]. The equivalence between (iii) and (iv) is closely related to, but not a formal consequence of, another result of Wise [25, Lemmas 5.7 and 16.2].
Corollary 27**.**
Let be leafless trees and let be a discrete subgroup acting cocompactly on . Then the following assertions are equivalent.
- (i)
There exists such that the projection is discrete. 2. (ii)
There exists and a vertex such that the stabilizer is a weakly separable subgroup of . 3. (iii)
For all and all , the stabilizer is a separable subgroup of . 4. (iv)
The groups and act cocompactly on and respectively, and the product is of finite index in .
Proof 7.1**.**
For the equivalence of (i) and (iv), see [5, Proposition 1.2]. If (iv) holds, then is virtually the product of two groups and acting properly and cocompactly on and respectively. Such groups are virtually free, hence residually finite, so , and are all residually finite. In particular, and are separable in . For every , the group is separable, since is finite. Assertion (iv) thus implies (iii).
That (iii) implies (ii) is clear. That (ii) implies (i) follows from Corollary 25, using the fact that a cocompact action on a leafless tree does not preserve any proper subtree.
We obtain the following abstract generalization of a statement originally proved by Burger and Mozes for lattices in products of trees with locally quasi-primitive actions (see [5, Proposition 2.1]), and later extended to lattices in products of CAT([math]) spaces (see [7, Proposition 2.4]).
Corollary 28**.**
Let be a lattice in the product of two locally compact groups. Assume that is totally disconnected and non-discrete and that every infinite closed normal subgroup of has trivial centralizer in . Suppose further that is finitely generated and that the canonical projection has a dense image. If is residually finite, then the projection is injective.
Proof 7.2**.**
Let and be the projection maps, let and let . We must show that is trivial. We shall proceed by contradiction and assume that is non-trivial. The group is a non-trivial discrete subgroup of and is normalized by the dense subgroup of . As is also closed, it is normal in , and hence is infinite by Lemma 16.
The groups and are two normal subgroups of with trivial intersection, hence they commute. Since is residually finite, the profinite closures and also commute, in light of Corollary 12. We have in particular that
[TABLE]
so . Thus, is profinitely closed in . Hence, is residually finite. We thus contradict Corollary 18, since is an infinite discrete normal subgroup of .
8 Applications to just-infinite groups
We finally consider just-infinite groups. An infinite group is just-infinite if every proper quotient is finite. These groups have restricted normal subgroups. We here explore restrictions on their commensurated subgroups.
Corollary 29**.**
Let be a finitely generated just-infinite group and be an infinite commensurated subgroup. Then the residual closure of in is of finite index.
Proof 8.1**.**
Let be the normal subgroup afforded by the Main Theorem. Since is infinite and contains a finite index subgroup of , we see that is infinite. The group is thus of finite index in the just-infinite group . Hence, is also of finite index.
In [23], P. Wesolek shows that every commensurated subgroup of a finitely generated just-infinite branch group is either finite or of finite index. As an application of the Main Theorem, we obtain the following related result. A maximal subgroup of a group is a subgroup that is maximal among all proper subgroups.
Corollary 30**.**
Let be a finitely generated just-infinite group. Assume that whenever are subgroups of such that is maximal in and has finite index in , then has finite index in . Then every commensurated subgroup of is either finite or has finite index in .
Proof 8.2**.**
Let be an infinite commensurated subgroup. By Corollary 29, the residual closure is of finite index in . Suppose toward a contradiction that . Let be a maximal subgroup containing , which exists since is finitely generated. By hypothesis, the group is of finite index in . In particular, is of finite index in and thus weakly separable. On the other hand, is the smallest weakly separable subgroup of containing . We infer that , which is absurd. Hence, and so has finite index in .
Examples of groups satisfying the hypotheses of Corollary 30 include the Grigorchuk group (see [11, Lemma 4]) and many related finitely generated torsion branch groups (see [1] and [19]), so we recover the corresponding special cases of Wesolek’s result [23].
Another striking family of just-finite groups is that consisting of the ‘residually finite Tarski monsters’ constructed by M. Ershov and A. Jaikin in [9]. In addition to their residual finiteness, these groups enjoy the property that each of their finitely generated subgroups is finite or of finite index. In particular, these groups are LERF: every finitely generated subgroup is separable.
The monster groups from [9] indeed enjoy a stronger property. For a prime, we say that a subgroup is -separable if it is the intersection of subgroups of power index. We say that a group is -LERF if every finitely generated subgroup is -separable. The examples from [9] are virtually -LERF.
The following application, which applies to the just-infinite groups constructed in [9], was pointed out to us by A. Jaikin.
Corollary 31**.**
Let be a finitely generated just-infinite group which is virtually -LERF for some prime . Then every commensurated subgroup of is either finite or of finite index.
Since the Grigorchuk group (which is a -group) is LERF by Theorem 2 of [11] and the Gupta–Sidki -group is LERF by Theorem 2 of [10], and upon noting that a -group that is LERF is automatically -LERF, we thus also recover two more special cases of Wesolek’s result in [23].
To prove Corollary 31 we use the following subsidiary fact.
Lemma 32**.**
Let be a finitely generated group which is -LERF for some prime . If a subgroup is of infinite index in , then its profinite closure is also of infinite index.
Proof 8.3**.**
If is of finite index in , then the closure of the image of in the pro- completion is of finite index. The closure in is then topologically finitely generated, hence contains a finitely generated subgroup whose image in has the same closure as the image of . Since is of infinite index, so is , but the closure of the image of in is of finite index. This contradicts that is -LERF.
Proof 8.4** (Proof of Corollary 31).**
Let be an infinite commensurated subgroup and let be a subgroup of finite index in which is -LERF. By Corollary 29, the residual closure is of finite index, so the profinite closure is also of finite index. The profinite closure of in is thus of finite index in . By Lemma 32, this implies that the index of in is finite. The index of in is thus finite.
{acknowledgement}
We would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge for support and hospitality during the programme Non-positive curvature group actions and cohomology where part of the work on this paper was accomplished.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Theofanis Alexoudas, Benjamin Klopsch, and Anitha Thillaisundaram. Maximal subgroups of multi-edge spinal groups. Preprint ar Xiv:1312.5615.
- 2[2] Uri Bader, Alex Furman, and Roman Sauer. On the structure and arithmeticity of lattice envelopes. C. R. Math. Acad. Sci. Paris , 353(5):409–413, 2015.
- 3[3] V. V. Belyaev. Locally finite groups containing a finite inseparable subgroup. Siberian Math. J. , 34(2):218–232, 1993.
- 4[4] Marc Burger and Shahar Mozes. Groups acting on trees: from local to global structure. Inst. Hautes Études Sci. Publ. Math. , (92):113–150 (2001), 2000.
- 5[5] Marc Burger and Shahar Mozes. Lattices in product of trees. Inst. Hautes Études Sci. Publ. Math. , (92):151–194 (2001), 2000.
- 6[6] Pierre-Emmanuel Caprace and Nicolas Monod. Decomposing locally compact groups into simple pieces. Math. Proc. Cambridge Philos. Soc. , 150(1):97–128, 2011.
- 7[7] Pierre-Emmanuel Caprace and Nicolas Monod. A lattice in more than two Kac-Moody groups is arithmetic. Israel J. Math. , 190:413–444, 2012.
- 8[8] A. S. Detinko, D. L. Flannery, and E. A. O’Brien. Algorithms for linear groups of finite rank. J. Algebra , 393:187–196, 2013.
