×

Most finitely generated subgroups of infinite unitriangular matrices are free. (English) Zbl 1021.20037

Let \(G\) be the group of infinite dimensional upper unitriangular matrices over a finite field. Then \(G\) is a profinite group and under a metric induced by the profinite topology is a complete metric space. In this paper the author considers ‘how many’ \(k\)-generator subgroups of \(G\) are free. Many authors have considered this question for other infinite groups.
The author proves that almost all \(k\)-generator subgroups are free by proving that the set of \(k\)-tuples \(\{x_1,\dots,x_k\}\) in \(G^k\) which do not generate a free group of rank \(k\) is a meagre set. The author does this by defining a countable subgroup \(H\) which is ‘full’ of \(k\)-generator subgroups, i.e. the intersection of \(H^k\) with any open ball in \(G^k\) contains a free subgroup of rank \(k\).
The author notes that \(G\) has many interesting non-free subgroups, for example the Nottingham group.

MSC:

20H20 Other matrix groups over fields
20E07 Subgroup theorems; subgroup growth
20E18 Limits, profinite groups
Full Text: DOI

References:

[1] DOI: 10.1016/0021-8693(71)90107-4 · Zbl 0222.22012 · doi:10.1016/0021-8693(71)90107-4
[2] DOI: 10.1112/blms/22.3.222 · Zbl 0675.20003 · doi:10.1112/blms/22.3.222
[3] DOI: 10.1006/jabr.1997.7082 · Zbl 0883.20015 · doi:10.1006/jabr.1997.7082
[4] DOI: 10.1006/jabr.1995.1053 · Zbl 0920.20025 · doi:10.1006/jabr.1995.1053
[5] DOI: 10.1007/BF02676668 · doi:10.1007/BF02676668
[6] Magnus, Combinatorial group theory (1966)
[7] Ribes, Profinite groups (2000) · doi:10.1007/978-3-662-04097-3
[8] Kelley, General topology (1955)
[9] Wilson, Profinite groups 19 (1998) · Zbl 0909.20001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.