The pro-$p$ group of upper unitriangular matrices
Nadia Mazza

TL;DR
This paper investigates the structure of the pro-$p$ group of upper unitriangular matrices, revealing subgroup embeddings, normalising properties, and the Hausdorff spectrum, linking it to $p$-adic groups and analytic structures.
Contribution
It extends the subgroup analysis of the pro-$p$ group, embeds the Nottingham group, and characterizes the Hausdorff spectrum, providing new insights into its structure and connections.
Findings
Embedding of the Nottingham group as a selfnormalising subgroup.
Closure of Holubowski's free product is selfnormalising of infinite index.
Hausdorff spectrum of the group is the entire interval [0,1].
Abstract
We study the pro- group whose finite quotients give the prototypical Sylow -subgroup of the general linear groups over a finite field of prime characteristic . In this article, we extend the known results on the subgroup structure of . In particular, we give an explicit embedding of the Nottingham group as a subgroup and show that it is selfnormalising. Holubowski (\cite{holub1,holub0,holub2}) studies a free product as a (discrete) subgroup of and we prove that its closure is selfnormalising of infinite index in the subgroup of -periodic elements of . We also discuss change of rings: field extensions and a variant for the -adic integers, this latter linking with some well known -adic analytic groups. Finally, we calculate the Hausdorff dimensions of some closed subgroups of and show that the Hausdorff spectrum of is the whole…
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 · Coding theory and cryptography · Advanced Algebra and Geometry
The pro- group of upper unitriangular matrices
Nadia Mazza
Department of Mathematics and Statsitics
University of Lancaster
Lancaster
LA1 4YF, UK
Abstract.
We study the pro- group whose finite quotients give the prototypical Sylow -subgroup of the general linear groups over a finite field of prime characteristic . In this article, we extend the known results on the subgroup structure of . In particular, we give an explicit embedding of the Nottingham group as a subgroup and show that it is selfnormalising. Holubowski ([13, 14, 15]) studies a free product as a (discrete) subgroup of and we prove that its closure is selfnormalising of infinite index in the subgroup of -periodic elements of . We also discuss change of rings: field extensions and a variant for the -adic integers, this latter linking with some well known -adic analytic groups. Finally, we calculate the Hausdorff dimensions of some closed subgroups of and show that the Hausdorff spectrum of is the whole interval which is obtained by considering partition subgroups only.
MSC: *Primary 20E18; Secondary 20H25 *
Keywords: pro- group; infinite unitriangular matrix group; Nottingham group; Hausdorff dimension
1. Introduction
In this paper we investigate the pro- group whose finite quotients give the prototypical Sylow -subgroup of the general linear groups over a finite field of prime characteristic . For convenience, we will consider an odd prime throughout the paper.
Sylow -subgroups of finite general linear groups for a power of have been minutely analysed by Weir in the 50s ([23]). His findings have subsequently been exploited by many; in particular Bier ([4, 5]) who extended some of Weir’s results to the pro- group of upper unitriangular matrices with coefficients in the field with elements. By upper unitriangular matrix, we mean an upper triangular matrix with all diagonal coefficients equal to . In the first part of this article, we will elaborate on Weir, Bier’s and Holubowski’s results ([13, 14, 15]), and we will focus on the subgroup structure of , revisiting the notion of partition subgroups considered by Weir. We will also discuss the embeddings of a free product of the form as a discrete subgroup of and of the Nottingham group ([6, 7, 8]) as a closed pro- subgroup of . Then we will discuss how we can relate and for a field extension . In Section 7 we present a -adic version of the group and briefly relate this group to some well-known -adic analytic groups ([9]). In the last section of the paper we calculate the Hausdorff dimensions ([1, 2, 3, 10]) of the closed subgroups presented in the preceding sections. A short appendix includes background about the automorphism groups of the Sylow -subgroups of the general linear groups and about the Hausdorff dimension for profinite groups.
Definition 1.1**.**
Let be a power of an odd prime number , with . For each , let be the Sylow -subgroup of formed by the upper triangular matrices with diagonal coefficients all equal to . Let be the set of column vectors of size with coefficients in .
Note that for each , we have
[TABLE]
where acts on by left multiplication in the obvious way. Thus, the natural projections
[TABLE]
form an inverse system.
Definition 1.2**.**
Let be the inverse limit of (1). The group is a pro- group, which we will call the pro- group of upper unitriangular matrices over . If the prime power is clear from the context, we write simply and instead of and respectively.
For each , let be the universal map, i.e. such that
[TABLE]
Let also . Thus is the normal subgroup of formed by all the matrices whose upper left diagonal block is the identity matrix.
From [24, Section 1.2], a filter base for the topology on is the set of open normal subgroups
[TABLE]
while the set forms a fundamental system of open neighbourhoods of the identity in ([12, p. 26-27]). In particular, is countably based (cf. [24, Proposition 4.1.3]).
For any let denote the infinite elementary square matrix whose unique nonzero coefficient is and is equal to , i.e. for all . So, if generate as -vector space, then , where we write for the identity element of and for the multiplicative group of nonzero elements of . The set
[TABLE]
generates topologically and converges to . Indeed, it generates a dense subgroup of , because for all ; moreover, any open subgroup of contains all but a finite number of such elements ([21, Section 2.4]).
The metric on is defined as follows. Let and fix a number , for instance . Then
[TABLE]
Then is an ultrametric, i.e. subject to the axioms
- •
with equality if and only if ;
- •
;
- •
for all (the ultrametric axiom).
For and , the open ball of centre and radius is the set of all the elements of such that for some integer . It differs from its closure only if is an integer, in which case , for any . In particular,
[TABLE]
2. Partition subgroups of
Let denote the -th term in the lower central series of , starting with and , the derived subgroup of . The notation for subsets of a group denotes the subgroup spanned by the commutators with and , where we write
[TABLE]
At the basis of each computation, lays the ubiquitous commutator relation
[TABLE]
Extending work of Weir, Bier investigated a sub-family of the subgroups that Weir called partition subgroups of . The results she proves are only for these partition subgroups, but it is easy to see that they extend to all partition subgroups. For convenience, we introduce the following definition.
Definition 2.1**.**
A partition diagram is a subset
[TABLE]
such that
[TABLE]
That is, a partition diagram is a collection of pairs of distinct positive integers, which should be regarded as the coordinates of the nondiagonal squares (or coefficients) in the matrices of :
[TABLE]
The corresponding partition subgroup of is the subgroup
[TABLE]
So, the constraint (4) on the elements of reflects the multiplication of the corresponding matrices (what Weir called “completing the rectangle”) in , namely
[TABLE]
If is such that for each , if , then all the pairs for all , then we call a partition and write it as
[TABLE]
Then
[TABLE]
is formed by all the elements of whose th column has zeroes above the diagonal. A partition of the form defines the partition subgroup , for any (and if , then ). An exponent “” in a partition means repeated times.
Given a partition diagram , we denote its shape, i.e. the set of all squares on an infinite chessboard which consist of the possible nonzero squares in .
A square covers if and if and . We say that avoids if covers a square outside of .
Remark 2.2**.**
In [4, 5], Bier only considers partitions. Moreover, she takes the “complementary” definition of a partition than the one we take here. That is, the parts in a partition denote the number of zeroes above the diagonal. Instead, we have chosen to use the same convention as Weir in [23], in order to include the more general partition subgroups defined by partition diagrams.
If is a partition diagram, we call a subpartition (diagram) of a subset of which is a partition (diagram) on its own. So a partition diagram is a lattice. That is ([11, Section 8.2]), given any two subpartitions diagrams and of , their union and intersection are also subpartition diagrams of . The union of two partition diagrams is the smallest partition diagram which contains them (i.e. obtained by “completing the rectangles” in Weir’s terminology), whilst their intersection is their set intersection. In particular, if and are subpartitions of , then
[TABLE]
It follows that each partition diagram has a unique maximal subpartition
[TABLE]
We say that a partition diagram converges to a partition if there exists such that for any with , then for all . That is, becomes a partition for large enough. The trivial partition is the partition , where is the cardinality of .
[23, Theorem 2] describes the partition diagrams which define normal subgroups : namely is a partition and the boundary of should move monotonically downward to the right. The point is that if and , then conjugation by any and implies that and must also be in for all and all , i.e. contains all the squares covered by . So must be a partition, and its “boundary”, determined by all the squares with , must give an increasing sequence .
A rectangular partition subgroup is a normal subgroup of for of the form , where for some (we could extend to by admitting the trivial subgroup of as a rectangular partition subgroup). The shape of such explains the terminology. If , then the maximal abelian (and characteristic) subgroups of have this form, with ([23, Theorem 6]). That is,
[TABLE]
where the coefficients in the block \big{(}*\big{)} can take any value in .
Extending Pavlov ([20]) and Weir’s ([23]) results, Bier proves that the automorphism group of is generated by three types of continuous automorphisms: inner, diagonal (i.e. conjugation by an infinite diagonal matrix), and those induced by field automorphisms. Furthermore, shifts are surjective group homomorphism, where for , the th shift of is the matrix obtained by deleting the first rows and columns of .
Definition 2.3**.**
We call a matrix periodic (of period ) if there exists such that . A subgroup is periodic (of period ) if every element of is periodic (of period ).
Here is a summary of Bier and Weir’s results as they apply to .
Proposition 2.4**.**
- (1)
Partition subgroups are closed. 2. (2)
A partition subgroup is open if and only if the partition diagram is such that there exists for which for all and for all . 3. (3)
Let be a closed subgroup of . The following are equivalent.
- (a)
* is a normal subgroup of .* 2. (b)
* is a normal partition subgroup of .* 3. (c)
* is a characteristic subgroup of .* 4. (d)
* is a partition subgroup defined by an increasing partition , i.e. such that .*
If satisfies these equivalent conditions, we call a normal partition subgroup. 4. (4)
Given a partition diagram , the normal core of is the partition subgroup
[TABLE]
for all . In particular, if the maximal subpartition of converges to the trivial partition, then . 5. (5)
The normal closure of a partition subgroup of is the partition subgroup , where is the partition with .
It is clear that partition subgroups are closed, since any sequence of elements in a partition subgroup which converges in must converge in . The other statements are routine.
Weir obtained specific results for normal partition subgroups of the finite quotients , for all , and these also apply to .
Proposition 2.5**.**
[23, Theorem 3]** Given a normal partition subgroup , then
- (1)
, where are all the squares covered by . 2. (2)
Let be the preimage of in , then is the normal partition subgroup where are all the squares which do not avoid .
Thus to get the commutator subgroup we “delete” the squares at the corners of , i.e. if and are both outside but is in , then we delete in . On the other hand, if and are both in but is not in , then we add to to get .
As an example for Proposition 2.5, we get the subgroups in the lower central series of by deleting successive super diagonals, where the th super diagonal is the set of all squares . Thus
[TABLE]
Similar considerations allow us to calculate the derived subgroups of , starting with
[TABLE]
Thus elementary commutators calculations (Equation (3)), with , give
[TABLE]
Hence, as partition subgroup,
[TABLE]
In particular, is not soluble, because its derived series does not converge.
Partition subgroups can also be used to show that is not hereditarily just infinite. A profinite group is hereditarily just infinite if every every open subgroup is just infinite ([17, Definition I.3]). That is, every nontrivial closed normal subgroup of any open subgroup of has finite index. By the above discussion, the open subgroups of have infinitely many closed normal subgroups of infinite index (e.g. the subgroups in the lower central series).
From the basic commutator formula (3), we obtain the structure of the centralisers of partition subgroups of .
Definition 2.6**.**
Let be a partition diagram. The orthogonal partition diagram of is the partition diagram
[TABLE]
The centre of is the subpartition diagram
[TABLE]
For instance, if , then
[TABLE]
[TABLE]
By definition and each is a partition subgroup of . Now for each and if and only if
[TABLE]
So and for each . In other words,
[TABLE]
Which leads to the following conclusion.
Proposition 2.7**.**
Let be a partition diagram. Then
[TABLE]
In particular, for any open partition subgroup.
3. Examples of torsion subgroups
The direct limit of the ’s is a discrete torsion group, and so not a subgroup of . Here is the group formed by all the square matrices such that there exists for which . Now, each element of can be regarded as a torsion element in in the obvious way, by taking each to \displaystyle\big{(}xN_{n}/N_{n})_{n\in\mathbb{N}}\in G. This mapping, let’s call it , is an injective homomorphism of abstract groups, which takes into and with the property that its image is dense in , i.e. . Note that contains “many” torsion elements which are not in (take for instance ).
In [14], Holubowski studies string subgroups, which form a large class of torsion discrete subgroups of . In particular string subgroups cannot contain any open subgroup of .
Definition 3.1**.**
A matrix is a string if is in the image of some injective group homomorphism
[TABLE]
Thus has finite order and is a string with the same block structure as . A string subgroup of is a subgroup of formed by strings.
So a string subgroup of is isomorphic to a subgroup of a partition subgroup of of the form for some non-negative integers , for .
The equality
[TABLE]
shows that, regarded as abstract groups (as in [14]), string subgroups are the complements of normal partition subgroups. That is,
[TABLE]
4. Free subgroups of
In this section, we let , and .
We discuss a particular discrete subgroup of investigated by Holubowski (cf. [14]), and we also look at its closure in . This subgroup of is the product of two string subgroups, but is not a string subgroup itself.
Definition 4.1**.**
Let
[TABLE]
and regard and as elements of .
Let be the free product of two groups of order .
Holubowski ([14, Theorem 1]) defines a function , by
[TABLE]
and proves that is an injective group homomorphism. [14, Theorem 1] shows that the image is contained in the intersection of the subgroup of so-called banded matrices with the subgroup of periodic matrices of . A banded matrix is a matrix for which there exists such that whenever . In particular, is not a closed subgroup of because . We let be the closure of in .
A word is mapped to
[TABLE]
where the coefficients are monomials in of degrees at most and respectively. For instance, for any ,
[TABLE]
Recall from Definition 2.3 that is the matrix obtained from by deleting the first rows and columns. From Equation (7) and elaborating by induction on it, we record the following.
Proposition 4.2**.**
For any , we have
[TABLE]
Moreover, the length of can be read from the last nonzero squares in the first two rows of . Namely,
- (i)
if , i.e. for all , then the last nonzero squares in the first two rows of are and respectively;
- (ii)
if , (i.e. is the only zero exponent) then the last nonzero squares in the first two rows of are and ;
- (iii)
if and no other exponent is zero, then the last nonzero squares in the first two rows of are and .
In particular, we obtain -periodic elements of whose last nonzero squares in any two successive rows are such that . Therefore
[TABLE]
is a closed subgroup of infinite index in the subgroup of -periodic elements of . Furthermore,
[TABLE]
A counting exercise gives the indices and , where is the subgroup of -periodic elements of and , this latter obtained inductively on .
Remark 4.3**.**
- (1)
It is important to emphasise that Holubowski regards (as most of the subgroups he investigates in [13, 14, 15]) as a discrete group, and this can be seen from the fact that is not closed in . Recall that is a pro- group for the topology defined by taking the set of all the subgroups of of finite -power index (cf. [12, Example (iii), p. 29]). Letting run through all the normal subgroups of of finite -power index, we obtain all the -generated finite -groups as the quotients . For instance and . 2. (2)
Let us also mention the description of from [22, p. 28], i.e. that of the fundamental group of a tree with fundamental domain a segment
\textstyle{\langle x\rangle\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\langle y\rangle} .
5. Nottingham group
As pointed out in the concluding remark of [13], the Nottingham group can be seen as a subgroup of . We make this embedding of topological groups explicit in this section. There are equivalent definitions of the Nottingham group. We follow [7].
Definition 5.1**.**
The Nottingham group is the group of algebra automorphisms of of the form
[TABLE]
R. Camina investigated the subgroups of and proved that contains every countably based pro- group as a closed subgroup.
Now the tantalising fact that is countably based as pro- group, implies by Camina’s result that embeds into as a closed subgroup. On the other hand, by linear algebra, the elements of can be expressed as infinite unitriangular matrices, i.e. elements of , and therefore is a subset of ; but it certainly cannot be the whole of , because only consists of algebra automorphisms.
The convention is that acts on the right of . So, we can identify the nonconstant elements of as infinite row vectors
[TABLE]
Matrix multiplication induces a linear transformation of ,
[TABLE]
for all . which translates as function on as follows:
[TABLE]
Given that , where generate as -vector space, and
[TABLE]
[TABLE]
This suggests the following mapping , defined on the generators of by
[TABLE]
where the sums run over all the positive integers , resp. , such that
[TABLE]
and all the other coefficients are zero. Note that in the first sum for all .
In particular, for , if we write and , then the th row of contains the th row of Pascal’s triangle starting from the diagonal , and spaced by zeroes between each coefficient in a row. Note that for all .
For example,
[TABLE]
[TABLE]
Matrix multiplication yields
[TABLE]
which corresponds to
[TABLE]
and so gives in particular , i.e. . Accordingly, for any “canonical” vector the corresponding “canonical” row vector has a unique nonzero coefficient equal to in the th coordinate, so that is the th row of ,
[TABLE]
which corresponds to the element
[TABLE]
Routine computations give
[TABLE]
for and otherwise. That is, a “row-palindrome” matrix
[TABLE]
Since each row of has finitely many nonzero entries, a recursive algorithm (or a more elaborate procedure) gives us the inverse; for instance
[TABLE]
In particular, each row of has infinitely many nonzero terms, and for all .
The key point is that the elements in are entirely determined by their first row, where is defined by Equation (8). That is, if is given by , then the equation defines the coefficients in the th row of .
It is routine to check that the matrices correspond to the image under of the algebra automorphisms , and that they are subject to the same relations.
Proposition 5.2**.**
* is a closed subgroup of of infinite index in . In particular, does not contain any open subset of .*
Proof.
We have seen above that is a homomorphism of abstract groups, and it is clearly injective. For any and for any , the open ball is not contained in , since it contains infinitely many linear transformations of which are not algebra automorphisms. Therefore, does not contain any open subset of and has infinite index. To prove that is continuous, and so that is a closed subgroup of , we show that the preimage by of any neighbourhood is a neighbourhood of for any and . Note that is an open normal subgroup of ([7]). So we have
[TABLE]
which is an open set of , as required. ∎
Next, we turn to the normaliser of in . Klopsch proved in [18] that every automorphism of is standard, provided . That is, , where is the group of all the algebra automorphisms of .
Proposition 5.3**.**
Suppose . Then , i.e. is selfnormalising in .
Proof.
Consider the inclusion given by mapping to conjugation by in . From the elementary commutator relation (3), we observe that , where and . Moreover, is a pro- group and so , where is a Sylow -subgroup of . Now, is the cyclic group spanned by the Frobenius homomorphism , which has order ([19, VII.5 Theorem 12]). In particular, for , we have , implying that this mapping cannot be given by conjugation by an element of . It follows that is isomorphic to a -subgroup of . Since is the unique Sylow -subgroup of , the result follows. ∎
6. Field extensions
Given for and an odd prime, let us regard as an -dimensional -vector space. Left multiplication in induces an injective ring homomorphism between endomorphism rings of vector spaces
[TABLE]
Choosing such induces an injective group homomorphism (cf. Definition 1.2)
[TABLE]
Note that if and only if , in which case . Also, if and only if is in the subfield of .
Lemma 6.1**.**
The map is continuous. So is isomorphic to a closed subgroup of .
Proof.
Write , and and for the normal open subgroups of and respectively. Let and . Then
[TABLE]
where is defined by the inequalities and follows from taking only those which have nonempty preimage by . Therefore, the preimage under of an open neighbourhood of is an open neighbourhood of for all , which proves that is continuous ([16, Ch. 3, Theorem 1]). ∎
In particular, for any , we have .
Conversely, the ring inclusion induces a continuous injective group homomorphism
[TABLE]
[TABLE]
For short, fix and let , and . Let and . Clearly neither nor are open subgroups because they have infinite index in and respectively. To find the index of in , we regard the elements of in block form, where each block is of the form
[TABLE]
In each of these blocks with , the image of is isomorphic to a copy of , so that in each block, the index is equal to . There are countably infinitely many such blocks, giving .
Similarly, to calculate the index of in we see that for each coefficient with , we have an index , so that .
From Proposition 2.4, we gather that and that since they are not partition subgroups.
In order to determine the normalisers and , we use a result of Weir on the automorphisms of the finite groups . For convenience, we have put Weir’s theorem and some technical considerations of conjugation in Appendix A.
Proposition 6.2**.**
Suppose the above notation. The following hold.
- (i)
, where .
- (ii)
, where .
Proof.
We prove the second part: . Let and for any . We first show that in the finite quotients we have
[TABLE]
where is the subgroup of all elements of whose only nonzero nondiagonal squares are in the upper right corner, by Lemma A.2 below.
Using Theorem A.1, it remains to show that no other automorphism of of -power order can be expressed as a conjugation by an element of . Thus we need to consider and possibly in case divides . Now, a field automorphism of becomes an automorphism of which fixes all the elements and therefore cannot be given by a conjugation by a matrix in because the elements which centralise also centralise . So Lemma A.2 proves that a field automorphism on cannot be given by an inner automorphism of .
Finally, neither central, nor extremal automorphisms of can be given by inner automorphisms of by a similar argument to that used in the proof of [23, Theorem 8]. Indeed, in Equation (13) in the proof of Lemma A.2 below, if a morphism , for and , were given by an inner automorphism of , say conjugation by , then Equation (13) has no solution; that is, on the one hand we would need for all , and on the other, conjugating by such element is not of the form .
It follows that as asserted. Now, to obtain the normaliser , we let , and the claim follows.
The proof that can be handled in a similar way and follows easily from the above. We leave this to the reader. ∎
7. -adic variation
In this section, we consider a variant on the pro- groups of Definition 1.2. Namely, let be an odd prime and for any , write
[TABLE]
where is a poset for the order relation if and only if and . Thus is a directed system.
For any in , there are obvious surjections:
- •
analogous to the surjective group homomorphisms from Section 1, using that , where is the natural module for , and
- •
induced by the reduction of the coefficients.
Hence we get an inverse system in which all the maps are surjective
[TABLE]
The inverse limit of this system is the group
[TABLE]
where denotes the ring of -adic integers. By definition, is a pro--group ([21, Proposition 2.2.1] or [24, Theorem 1.2.5 (b)]), because the class of pro- groups is closed under taking closed subgroups and arbitrary direct products. It follows from the product and subgroup topologies that the open sets of must be the cosets of the factor groups where
[TABLE]
for all . So and .
For later use, we want to extract from this set a filtration, i.e. a totally ordered set of open normal subgroups of . For each , let
[TABLE]
so that , with and for all .
To prove that this is a base of open neighbourhood of in , it suffices to show that each is a union of cosets of the ’s. By inspection, we obtain
[TABLE]
the coefficients of are the coefficients of in running through a set of representatives of . That is,
[TABLE]
\displaystyle U_{n}(k)=\bigcup_{g\in G_{k}(p^{n}\mathbb{Z}_{p}/p^{k}\mathbb{Z}_{p})}\left(\begin{array}[]{r|r}g&\hbox{\Large 0}\\ \hline\cr\hbox{\Large 0}&\hbox{\Large I}_{\infty}\end{array}\right)V_{k} if .
Although is defined over the -adic integers, it is clear from the definition of a -adic analytic group ([9, Section 9]) that is not -adic analytic because one cannot find homeomorphisms between the open subsets of and -modules of finite rank. However, for each , the group is the prototype of a compact -adic analytic group (cf. [9, § 5.1]). From the fact that , we observe that the inverse limit of compact -adic analytic groups need not be -adic analytic.
Obviously, there are some similarities between subgroup structures of and for any . In particular, we have partition subgroups and free products (of the form ). Using the ideals in we note that has in fact a plethora of closed subgroups. We flag some “ideal” partition subgroups.
Proposition 7.1**.**
Let be an ideal of and a partition diagram. Let
[TABLE]
The following hold.
- (i)
* is closed.* 2. (ii)
* is open if and only if and converges to a partition such that there exists with of all and all .* 3. (iii)
* is normal in if and only if is characteristic in if and only if the partition subgroup is normal in .*
The proof is straightforward using Proposition 2.4.
8. Hausdorff dimension of closed subgroups of
In this section, we apply [1, Proposition 2.6] to some closed subgroups of and calculate their Hausdorff dimension. Note that in [1], the author refers to the Billingsley dimension instead of Hausdorff, which is defined over the set of real numbers. We adopt the terminology used in later papers ([2, 3]), which use Abercrombie’s results too. We refer the reader to [10] for an in-depth background on fractal dimensions and measure theory. We limit ourselves to the essential facts as they apply to from Definition 1.2, and include an appendix with some additional theory which may be useful to the reader. For convenience, we take as definition of Hausdorff dimension that given in Abercrombie’s result.
Definition 8.1**.**
[1, Proposition 2.6] Let , be a closed subgroup of , where , and where is a filtration of by open normal subgroups. The Hausdorff dimension of is the real number
[TABLE]
The Hausdorff spectrum of is the subset
[TABLE]
of the Hausdorff dimensions of all the closed subgroups of . Thus .
Recall from the elementary law of logarithms
[TABLE]
so that we can take any base for the logarithm defining . We will take unless otherwise specified.
From the definition, if , then , and consequently, any subset of finite index has . Therefore, the “interesting” dimensions may only be obtained by taking closed subsets of of infinite index.
8.1. Hausdorff dimension of partition
subgroups of
The partitions subgroups of (of infinite index) are of the form for a partition diagram , subject to ; or a partition , where for all as defined in Section 2. Hence , which gives
[TABLE]
where denotes the cardinality of the subset of the squares of up to, and including, the th column:
[TABLE]
With this notation, we can state and prove the main result in this section.
Theorem 8.2**.**
Let . Then there exists a partition subgroup for which . In particular .
Moreover, for all ,
[TABLE]
for the subgroups of in the lower central and derived series of .
Proof.
The existence of a partition subgroup for is clear. Suppose and let be the sequence of rational numbers defined as follows:
[TABLE]
where denotes the integer part of any .
We claim that converges to . The inequalities imply that
[TABLE]
Let . We want to show that there exists such that for all . Define as being the least positive integer such that . Then for any , we have
[TABLE]
For , consider
[TABLE]
where , so that the difference is nonnegative for all . More precisely, from the inclusion b_{n}-b_{n-1}\in\big{(}\alpha(n-1)-1\;,\;\alpha(n-1)+1\big{)}, which contains a unique integer, we see that whenever the difference is positive, then is of the order of .
Now, define the partition as follows: and then for all . Because the differences are nonnegative integers less than , the sequence defines a partition subgroup . That is, is the subgroup of whose nonzero squares in column are the top ones (possibly none). For , we have
[TABLE]
It follows that
[TABLE]
proving the first part of the theorem.
To prove the second part of the statement, recall that
[TABLE]
So
[TABLE]
It follows that
[TABLE]
and similarly
[TABLE]
∎
Remark 8.3**.**
From the proof of the theorem, we see that one could try to modify the definition of in order to obtain a normal partition subgroup with prescribed Hausdorff dimension. This “tweaking” consists in shifting each “bulging” square arising whenever by a finite number of columns to the right until it reaches the next “landing”. The next examples may shed some light on this.
Example 8.4**.**
- (1)
Let . The sequence obtained by the method of the proof of Theorem 8.2 gives the integers and , with . We calculate
[TABLE]
That is, the subgroup
[TABLE]
So the proportion of squares in (relative to the total number of squares in ) up to the fourth column is , while up to the twentieth column we have (an error of to decimal places).
Expanding on Remark 8.3, we can tweak the partition to get a normal partition , such that and .
One can check that the same values for for are obtained with instead of . 2. (2)
Let . The corresponding partition is
[TABLE]
So the proportion of squares in up to the twentieth column is (an error of to d.p.). Here finding a normal partition subgroup with Hausdorff dimension seems more difficult.
Theorem 8.2 gives one amongst “many” partition diagrams which give partition subgroups of prescribed Hausdorff dimension. Closed subgroups of with a rational Hausdorff dimension can easily be described as partition subgroups using (maybe more natural) partition diagrams.
Example 8.5**.**
To get a partition subgroup with Hausdorff dimension , let
[TABLE]
Note that is not normal in , and that is formed by a half of the super diagonals of . Therefore
[TABLE]
8.2. Hausdorff dimension of finitely determined closed
subgroups
Let , where be determined by a finite total number of rows, columns and super diagonals. That is, there exists a finite number of rows and of super diagonals such that for any any coefficient of is given as a function of certain coefficients in the rows and diagonals above. We call such a subgroup finitely determined. For instance, any -periodic subgroup is finitely determined by its first rows: if , then is subject to the constraints , where and . Similarly, a string subgroup which embeds into a direct product of subgroups isormorphic to , for some upper bound on the size of the diagonal blocks, is determined by its first super diagonals.
In the examples seen above, we observed that the subgroup isomorphic to the Nottingham group is determined by its first row (cf. paragraph preceeding Proposition 5.2), while the free product , as a subgroup of , is determined by its first rows, by Proposition 4.2. Recall from Section 4 that
[TABLE]
More generally, for a -periodic subgroup , the subgroup of is the subgroup whose coefficients in the first rows can be chosen freely, and these uniquely determine the remaining ones in the bottom rows.
[TABLE]
where denote the coefficients that are determined by the freely chosen chosen .
Although not finitely generated, nor finitely presented in general, finitely determined subgroups of are “small” in , in the following sense.
Lemma 8.6**.**
Suppose that is finitely determined. Then .
Note that a closed subgroup of which is determined by a finite number of columns is also determined by a finite number of rows, so that the lemma applies to this class of subgroups too.
Proof.
We prove the claim for determined by a finite number of rows . Let and the subgroup of formed by all the -periodic elements. So is determined by its first -rows. For we calculate
[TABLE]
It follows that
[TABLE]
Similarly, if is determined by super diagonals, then for , we have (counting the coefficients in the successive super diagonals up to the th one)
[TABLE]
and we conclude as above. The lemma follows. ∎
Here are immediate consequences of this observation.
Corollary 8.7**.**
The following hold.
- (1)
The subgroup of isomorphic to the Nottingham group has Hausdorff dimension [math]. 2. (2)
If , the subgroup of has Hausdorff dimension [math]. 3. (3)
If is a -periodic subgroup of for some positive integer , then . 4. (4)
If is a string subgroup of of the form for some integer , then has Hausdorff dimension [math].
8.3. Hausdorff dimension and field
extensions
We use the same notation as in Section 6. Let and for some . Given write with and . Write . We calculate
[TABLE]
Left- and right hand side terms both converge to as , i.e. as . Therefore \displaystyle\dim\big{(}\alpha_{f}(G(q))\big{)}=\frac{1}{f}.
Let and . By definition of , for each , the index of in is equal to , so that
[TABLE]
8.4. Hausdorff spectrum of
To calculate the Haudorff dimension of closed subgroups of , we consider the filtration given in Equation (10):
[TABLE]
with factor groups for all .
Theorem 8.2 proves that the dimension spectrum of is the whole interval , which can be attained using solely partition subgroups of .
Corollary 8.8**.**
Let . Then there exists a partition subgroup for which . In particular .
For all proper ideals and any ideal partition subgroup as in Proposition 7.1, we have .
Moreover, for all ,
[TABLE]
for the subgroups of in the lower central and derived series of .
Appendix A Automorphisms of the finite groups
Let where for some . So is generated by all the matrices of the form , where form a basis of as -vector space and . A minimal set of generators is formed by all such elements of the form . In [23], A. Weir determines the group of automorphisms of and describes the maps by their action on the elements in a minimal set of generators.
Theorem A.1**.**
[23, Theorem 8]** The group of automorphisms of is generated by the subgroups and , where
[TABLE]
In particular, has order , is cyclic of order , has order , has order , is elementary abelian of order .
The elements of are called central automorphisms, because they induce the identity on , and those of are called extremal automorphisms. The maps are inner automorphisms, and so need not be added in . The function corresponds to the symmetry of the Dynkin diagram of type , flipping the squares about the antidiagonal.
We now prove the technical lemma which we used in the proof of Proposition 6.2. We use the same notation as in the proposition. In particular, , induced by regarding as an -dimensional -vector space, has image , and , induced by the inclusion of the coefficients , has image .
Lemma A.2**.**
Let and for any . Then , is the subgroup formed by all the matrices whose only nonzero nondiagonal squares lie in the upper right corner.
Proof.
Let . Clearly the elements of commute with any element of because the first and last diagonal blocks of any element in is the identity matrix.
To show that these are exactly the elements which centralise , it is enough to see that no other element centralises an element of . Let for and suppose that . Put . We calculate
[TABLE]
and solve the equation . Note that all the indices appearing in are distinct. Therefore for all , all and all . By definition of these coefficients, we must then also have for all . Now, take and suppose that centralises . We calculate , which gives . Similarly, for we obtain that is the zero matrix. Inductively on each of the successive blocks of the matrix must be zero, except the last one in which the squares can take any value. This proves the lemma. ∎
Appendix B Fractional dimension for profinite groups
We review the concept of fractional dimension for profinite groups, as introduced in [1], and refer to [10] for the concepts used.
First some background on measure theory. Let be a set and write for the power set of . A non-empty subset is a -field if is closed under taking complements and countable unions. The Borel sets of are the sets belonging to the -field generated by the closed subsets of . Given a -field, one can show that
[TABLE]
The former set is formed by all elements which are in all but a finite number of , while the latter set is formed by all elements which belong to infinitely many .
A measure defined on a -field is a function such that and for any countable collection of disjoint sets . We call an outer measure if , and we call it a probability measure if .
Suppose that is a profinite group with projection maps onto the finite quotients and maps such that for all (with ). We consider the standard basis
[TABLE]
for the topology on . For short, let for all . It is well-known in measure theory that the so-called Haar measure is the unique probability measure on which is -invariant. This measure satisfies
[TABLE]
This second property means that is non-atomic.
Now define as follows. For all with define for ,
[TABLE]
where is a cover of by balls such that . Hence let
[TABLE]
One can show that there exists a unique real number satisfying
[TABLE]
Thus is the Hausdorff dimension of , or Billingsley dimension of ([1]).
Abercrombie proves the following.
Proposition B.1**.**
* is a positive increasing set function and for each , the function is an outer measure on . Furthermore,*
- (i)
For all , then \Delta_{\mu}(\cup_{n}M_{n})={\underset{{n}}{\operatorname{sup}}}\big{(}\Delta_{\mu}(M_{n})\big{)}.
- (ii)
If such that , then .
- (iii)
Let be a closed subset of , i.e. . Then
[TABLE]
whenever the limit exists.
Acknowledgements. We wish to thank the referee for a careful proofreading, correcting a few errors, and for helpful suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J.L. Abercrombie, Subgroups and subrings of profinite rings , Math. Proc. Cambr. Phil. Soc. 116 (1994), 209–222.
- 2[2] Y. Barnea, B. Klopsch, Index-subgroups of the Nottingham group , Adv. Math. 180 (2003), no. 1, 187–221.
- 3[3] Y. Barnea, A. Shalev, Hausdorff dimension, pro-p groups, and Kac-Moody algebras , Trans. Amer. Math. Soc. 349 (1997), no. 12, 5073–5091.
- 4[4] A. Bier, Commutators and powers of infinite unitriangular matrices , Linear Algebra Appl. 457 (2014), 162–178.
- 5[5] A. Bier, On lattices of closed subgroups in the group of infinite triangular matrices over a field , Linear Algebra Appl. 485 (2015), 132–152.
- 6[6] R. Camina, Some natural subgroups of the Nottingham group , J. Algebra, 196 (1997), 101–-113.
- 7[7] R. Camina, Subgroups of the Nottingham group , J. Algebra 196 (1997), no. 1, 101–-113.
- 8[8] R. Camina, The Nottingham group , New horizons in pro- p 𝑝 p groups, 205-–221, Progr. Math., 184 , Birkhäuser, 2000.
