Topological finite generation of compact open subgroups of universal groups
Marc Burger, Shahar Mozes

TL;DR
This paper characterizes when compact open subgroups of universal groups associated with certain permutation groups are topologically finitely generated, revealing they are also positively finitely generated in these cases.
Contribution
It provides a characterization of permutation groups F for which all compact open subgroups of the associated universal group are topologically finitely generated.
Findings
Identifies conditions on permutation groups F for topological finite generation
Shows these groups are positively finitely generated
Provides a classification related to universal groups and automorphisms of trees
Abstract
In this paper we characterize the finite permutation groups on letters such that every compact open subgroup of the associated universal group is topologically finitely generated. Actually we show that in this case the groups are positively finitely generated.
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.
Taxonomy
TopicsFinite Group Theory Research · Advanced Topology and Set Theory · Coding theory and cryptography
Topological finite generation of compact open subgroups of universal groups
Marc Burger
ETH Zürich
Shahar Mozes 111M.B. thanks the hospitality of the IMS of the National University of Singapore, S.M. acknowledges the support of ISF grants 1003/11 and 2095/15. We both thank the hospitality of the University of Newcastle and the ANSI program ”Winter of disconnectedness”. We thank the Isaac Newton Institute for Mathematical Sciences for support and hospitality during the program on ”Non-positive curvature group action and cohomology”. This work was supported by EPSRC Grant Number EP/K032208/1.
AMS Subject classification 2010: 20E18, 20E08, 22D05
The Hebrew University of Jerusalem
This paper is part of our ongoing study of the structure of co-compact irreducible lattices in the product of two regular trees, see [BuMo1], [BuMo2], [BuMoZ], [Ra1], [BuMo3]. The specific result obtained here, see Corollary 0.2, is motivated by the following question: Let be the -regular tree, a permutation group on letters and the universal group attached to it; see [BuMo1], for definitions and properties. When is the closure of the projection of a co-compact lattice , where is locally compact, compactly generated? Work of D. Rattaggi (using [BuMo2]) implies that this is so when is the alternating group with , or is the -Matthieu group, or ) is the special affine group on ; in addition there are co-compact lattices in with dense projections for , .
Our starting observation is that if is a co-compact lattice with as above, then any compact open subgroup of is topologically finitely generated. Our main result gives a characterization of the permutation groups for which this property holds. In fact, this result will follow from a similar result concerning the finite generation of iterated wreath products. More precisely, let be a finite set and a permutation group. Let be the ’th iterated wreath product of acting on , and the projective limit. Note that has a natural action on the rooted tree whose vertices are labeled by words over (the root is the empty word).
Theorem 0.1**.**
The profinite group is topologically finitely generated if and only if the two following conditions are satisfied:
- a)
* is perfect.*
- b)
Every -orbit in has at least two elements.
If these conditions are satisfied, then is positively finitely generated.
This result was announced in [Mo98]. A version of the proof was written up in the thesis of O. Amann [Am] following a manuscript by the authors. The proof presented here substantially simplifies the original one.
Applied to our situation, let , and . Then for every , the pointwise stabilizer in of the ball or radius centered at any vertex is a finite direct product of to which our theorem applies and gives
Corollary 0.2**.**
The profinite group obtained by considering the stabilizer in of a vertex is topologically finitely generated if and only if the following two conditions are satisfied:
- a)
* is perfect.*
- b)
Any orbit in has at least two elements.
Moreover, when those conditions are satisfied, any compact open subgroup of is positively finitely generated.
Recall that a compact group is positively finitely generated if for some , the Haar measure of the subset of -tuples in generating a dense subgroup of is positive. For background information concerning this property, we refer to [Mann1]. The question of finite generation of various infinite iterated wreath products was considered by several authors. See [Bhatt], [Quick1], [Quick2], [Bondarenko], [Vann]. All these works consider wreath products of transitive group actions.
Now we shortly discuss the necessity of the conditions in Theorem 0.1 and to that end we start by fixing some notations used throughout this article. The permutation groups acting on are defined inductively by and where an element in is a pair , : a map, and the product structure reads , and . The action of on is given by .
Now we show the necessity of the two conditions.
- a)
If : is an abelian quotient of , then
[TABLE]
is a surjective homomorphism; by induction this implies that is a quotient of and hence admits as quotient. Thus, if is not perfect, is not topologically finitely generated.
- b)
If is -fixed, then is -fixed and is a normal subgroup of with quotient . By recurrence this implies that is a quotient of and hence of . But if , the is not topologically finitely generated and hence not as well.
The plan of the paper is the following: the proof of the converse of Theorem 0.1 follows a strategy devised by Bhattacharjee in [Bhatt]. Namely, if denotes the probability for a -tuple to generate the finite group , we show that under the hypothesis of Theorem 0.1, for some . For this we use a result of Bhattacharjee (see [Bhatt]), which we recall below, relating to modulo a multiplication factor which is defined in terms of the conjugacy classes of maximal subgroups of surjecting onto . The main work consists then in classifying these conjugacy classes.
1 A result of M. Bhattacharjee
We recall for the convenience of the reader the following:
Proposition 1.1**.**
([Bhatt]) Let : be a surjective homomorphism of finite groups and . Then
[TABLE]
where the sum is over the set of -conjugacy classes of proper maximal subgroups of surjecting onto .
Proof.
We have , where is the probability for a -tuple to generate given that its image in generates . Then
[TABLE]
where is the probability of the opposite event. Observing that a non-generating -tuple is always contained in a proper maximal subgroup , we obtain:
[TABLE]
∎
Denoting by , we conclude:
Corollary 1.2**.**
Assume that for some , . Let be such that and let be such that is generated by elements. Then is positively -generated for .
Proof.
For every we have (Proposition 1.1)
[TABLE]
Now observe that
[TABLE]
and conclude by choosing . ∎
2 Maximal subgroups in wreath products
Let be a finite group, transitive (non-empty) -sets, and non-trivial perfect groups; these will be our standing assumptions throughout this section. Let be the semi-direct product, where the action of is by permuting factors, and : the projection map.
Definition 2.1**.**
A standard normal subgroup of is a subgroup of the form
[TABLE]
where
Observe that every subgroup contains a unique maximal standard normal subgroup of .
Definition 2.2**.**
A subgroup is clean if it contains no non-trivial standard normal subgroup.
The following proposition summarizes the ingredients needed in the proof of Theorem 0.1; this proposition is a corollary of more precise statements proven in this section.
Proposition 2.3**.**
Let be a clean, proper, maximal subgroup such that .
Then one of the following holds:
, are non-abelian simple and
- (a)
* is the graph of an isomorphism .*
- (b)
.
In particular, there are at most conjugacy classes of such subgroups, and .
- 2)
, and for all . There is a normal subgroup which is a product where is non-abelian simple. Moreover,
- (a)
* is a product of subdiagonals of corresponding to an -invariant block decomposition of .*
- (b)
.
- (c)
For any given -invariant block decomposition of there are at most conjugacy classes of such subgroups.
- (d)
There are most such block decompositions of where is the number of -invariant block decompositions of .
- (e)
.
- 3)
, and is a proper subgroup of . Up to conjugation for all ,
[TABLE]
and .
- 4)
, .
Now we state and prove several lemmas which together will imply the above proposition. We recall that we will work under the above standing assumptions on the objects , .
Lemma 2.4**.**
Assume is proper, maximal, clean. Then for all .
Proof.
Assume that for some , . Since is clean and maximal, and since this implies . Since is perfect we obtain:
[TABLE]
which contradicts the assumption that is clean. ∎
Given a subgroup we let denote the kernel of the -action on . Also, given , , let denote the subgroup whose only non-identity component is at and equals .
Remark 2.5**.**
If is clean, and , then for all . Indeed, otherwise since , would contain the normal subgroup which is standard.
Lemma 2.6**.**
Assume is proper, clean, maximal and . Then
[TABLE]
Proof.
If , then let and be such that
[TABLE]
Then and
[TABLE]
Since by Lemma 2.4, we must have and hence . But this contradicts the cleanness assumption by Remark 2.5. ∎
Lemma 2.7**.**
Let be clean, proper, maximal with . If are non-trivial normal subgroups of contained in such that
[TABLE]
Then both act transitively and regularly on . In particular or .
Proof.
The -action on is primitive and (Lemma 2.6) the subgroup is faithful. The action of each of the normal subgroups is transitive and faithful. Since they commute each of them must act freely and hence regularly. This implies that there cannot be three normal subgroups of contained in such that every two of them intersect only at the identity. Thus . ∎
Lemma 2.8**.**
Assume that is proper, clean, maximal with and assume . Then are non-abelian simple, is the graph of an isomorphism and
[TABLE]
In addition, .
Proof.
It follows from Lemma 2.7 that both and act transitively and regularly on . Hence, if , then being non-trivial, normal in , acts transitively on , hence and which shows that is simple.
Next, , hence and thus . Similarly, we have . Since we also have , we deduce that is the graph of an isomorphism . Finally, we have
[TABLE]
and if equality does not hold then is normal in and hence equal to , contradicting Lemma 2.6. The lower bound on is clear. ∎
Next, we need to estimate the number of -conjugacy classes of maximal subgroups as in Lemma 2.8.
Lemma 2.9**.**
The number of conjugacy classes of maximal subgroups as in Lemma 2.8 is bounded by
[TABLE]
where is some chosen element.
Proof.
According to Lemma 2.8 the subgroup is determined by an isomorphism : . Since are non-abelian simple such an isomorphism is given by the following data:
- (1)
a bijection :
- (2)
for every an isomorphism : .
Where
[TABLE]
Then and the condition that surjects onto together with gives that for every there is a unique with . From this we deduce
[TABLE]
Next, using that normalizes the graph of , we get for all , ,
[TABLE]
Evaluating this at and for maps whose support is a singleton, we get
[TABLE]
Now fix a point and observe that for all . Together with (2.1) this implies that : given by where is any element with , is a well defined map.
Rewriting the equation (2.1) in terms of , we get
[TABLE]
Using this one computes that the group corresponds to an isomorphism given by
the same equivariant bijection : ;
- 2)
a family of isomorphism : which all coincide.
From this, one readily deduces the upper bound stated in Lemma 2.9. ∎
Now we turn to the situation where , that is , where we have set , . This splits into four different cases which we will analyze now. Our standing assumption on is that it is a proper, clean, maximal subgroup which surjects onto .
Lemma 2.10**.**
Assume that , , and that for every minimal normal subgroup , . Then is the product of two isomorphic non-abelian simple groups. Furthermore:
[TABLE]
Proof.
We claim that every non-trivial minimal normal subgroup is a direct factor. For let : . From we deduce and hence . Observe that and thus . Finally, , which shows that is a direct factor of . This implies using Lemma 2.7 that is either non-abelian simple or the product of two such groups. The assumption that for any minimal normal subgroup implies that is not simple.
If the last assertion of the lemma were not to hold, then and hence , contradicting Lemma 2.6. ∎
Lemma 2.11**.**
Assume that , and there is minimal normal with . Then is a product of (isomorphic) non-abelian simple groups.
- (a)
* for all .*
- (b)
.
Proof.
Since acts transitively, faithfully and not regularly on , it (and hence also ) cannot be abelian. Since is a minimal normal subgroup of it is therefore a product of isomorphic non-abelian simple groups.
Next, we observe that is normal in , and being non-trivial, we deduce for all . Again, if , then contradicting Lemma 2.6. ∎
It follows from Lemma 2.10 and Lemma 2.11 that when , and for all , there is a normal subgroup which is a product where is non-abelian simple and for all . Since is non-abelian simple, this implies already the assertion 2) (a) in Proposition 2.3. Concerning 2) (b), we observe that, as usual, if , then which contradicts Lemma 2.6.
Next, we turn to assertions (c), (d) and (e) which will follow from the following discussion. The subgroup projects onto for each , where we recall that denotes the disjoint union of copies of with corresponding -action. Since , the subgroup is a product of subdiagonals of corresponding to a -invariant block decomposition of . Given a partition of such a subgroup is obtained in the following way: for each there is an automorphism of and is the direct product over of the diagonal subgroup of given by
[TABLE]
The index of in is then where . Observe that for every . Indeed otherwise for some , would contain a -factor of ; but which implies in the case of Lemma 2.11 where is a minimal normal subgroup of , that and hence since the projection of is it follows that contradicting the assumption that is clean. In the case of Lemma 2.10 where , it follows that would contain a factor of . Hence since the projection of is it follows that which since is a standard normal subgroup, contradicting the assumption that is clean. This implies and establishes assertion (e) of Proposition 2.3. Concerning assertion (c), just observe that we can conjugate by inner automorphisms of so that for a given partition we have at most conjugacy classes of such subgroups.
What remains is to estimate the number of -invariant partitions of . To this end, let be transitive -sets and set .
If is an -invariant partition with such that some intersects and , then induces partitions into pieces of and . Denoting by the number of -invariant partitions with pieces of and by the total number of -invariant partitions of , we have that the number of -invariant partitions of is estimated by:
[TABLE]
where and the estimate in the first line uses the observation that to obtain a partition into k pieces of whose pieces meet both ’s one needs to partition each into pieces and pair them. The pairing of these pieces is determined (by the transitivity of the action on each ) by choosing for one piece of a piece of . Applying this inequality with and we get and by recurrence,
[TABLE]
Lemma 2.12**.**
Assume that and for all . Then up to conjugating , there is a subgroup such that . We have .
Proof.
Let , . Then, since surjects onto , all the subgroups are conjugated within . In addition, normalizes : indeed, it is the unique smallest subgroup of containing and having direct product structure. Thus, modulo conjugating , we may assume , hence . If they were not equal, we would have that , hence from we would deduce , but since this would imply which is a contradiction. ∎
The last case left is when , that is, is a section of in . Concerning this, we cannot say anything in this degree of generality, and we will have to estimate by recurrence the number of sections of in groups of the form , where is an -orbit.
3 Estimating
In order to prove Theorem 0.1, we will use Corollary 1.2 and show that for some ,
[TABLE]
Thus we have to estimate
[TABLE]
where the sum is over the conjugacy classes of proper, maximal subgroups surjecting onto . To this end, let denote the maximal standard normal subgroup of contained in (see Definition 2.1). Let be the set of orbits in . Then
[TABLE]
where are quotients of and is a clean proper maximal subgroup which surjects onto . Let us observe first that we cannot have for all since otherwise which together with the hypothesis that surjects onto would imply that contradicting properness. Proposition 2.3 implies then that there is either exactly one pair of orbits for which and , or there is exactly one orbit for which . We are going to estimate the contribution to according to the four different cases of Proposition 2.3.
To this end we make some preliminary observations. Let
[TABLE]
be a partition into -orbits. Then by hypothesis b) of Theorem 0.1 we have
[TABLE]
The set of -orbits in is given by
[TABLE]
Then there are orbits of in and for each such orbit we have
[TABLE]
Case 1: Every pair of orbits in leads possibly to a contribution to which is bounded by
[TABLE]
where is the number of simple quotients of and an upper bound on the cardinality of their outer automorphism groups; this takes into account the estimate (3.5).
Summing over all distinct pairs of orbits, the total contribution of Case 1 is bounded by
[TABLE]
Case 2: According to Proposition 2.3 2 d) we need to estimate the number of -block decompositions of an orbit . Observe that a -block decomposition of is obtained by taking the products of -block decompositions in each . Therefore, if is an upper bound on the number of -block decompositions of , , then the number of -block decompositions in any orbit is bounded by .
Now fix such that . Then every normal subgroup which is of the form for some non-abelian simple contributes at most
[TABLE]
to and this can be rewritten as:
[TABLE]
Now choose large enough so that , then one sees easily that the sum over all and converges, taking into account that .
Case 3: The total contribution of this case is easily seen to be bounded by
[TABLE]
where bounds the number of subgroups of quotients of .
Thus the sum over of the contributions to in the Cases 1, 2 and 3 converge already for large enough depending on .
Case 4: We will treat this case by estimating the number of sections of in . To this end let , we define , so that . Let be the number of sections of in .
Let be an upper bound on the number of non-abelian subgroups of and an upper bound on for any quotient of and any .
Lemma 3.1**.**
.
Proof.
Let and represent a given section : by a map of the form
[TABLE]
We analyze separately and .
We have where is a map from to . Expressing that is a homomorphism, we see at once that for every , the map
[TABLE]
is a section of in . The number of possible restrictions to of a section as above is therefore bounded by .
Next, we analyze
[TABLE]
Observe that is isomorphic to and thus is determined by
[TABLE]
Now we observe that we have an isomorphism:
[TABLE]
where , . Thus is determined by a collection of homomorphisms
[TABLE]
parametrized by . But is the restriction of a homomorphism defined on and the -action on is transitive, we conclude that is determined once is fixed for some . Thus we are left with estimating the number of homomorphisms
[TABLE]
Given such a homomorphism , for every the image of the corresponding -factor is either trivial or non-abelian (since is perfect). Since the images via of different factors commute, they cannot be sent to the same non-abelian subgroup of .
Thus we conclude that the number of such homomorphisms is bounded by
[TABLE]
This concludes the proof of the lemma. ∎
Lemma 3.2**.**
, where .
Proof.
Set , the -tuple being given. In Lemma 3.1 estimate
[TABLE]
Iterating the inequality thus obtained:
[TABLE]
we get
[TABLE]
where
[TABLE]
Then
[TABLE]
∎
Every orbit in contributes to at most
[TABLE]
where is an upper bound on the number of quotient groups of . Now choose such that
[TABLE]
Then the sum over all orbits in of the contribution in Case 4 is bounded by
[TABLE]
and with this choice of , the sum over converges.
This concludes the proof the theorem.
References
