SearcharxivSearch

arXiv · 2603.09640

On the Maximal Size of Irredundant Generating Sets in Lie Groups and Algebraic Groups

Abstract

We show the following dichotomy for a connected Lie group $G$: If $G$ is amenable, then any topologically generating set $X\subset G$ of size larger than a fixed polynomial in the dimension of $G$ must be redundant (i.e., a proper subset of $X$ still generates $G$). If $G$ is non-amenable, then it admits arbitrarily large topologically generating sets that are irredundant, and remain irredundant even after applying Nielsen transformations. The polynomial bound for amenable groups is obtained by reduction to finite simple groups of Lie type via strong approximation. This partially answers two conjectures by Gelander on generation in compact Lie groups and simple algebraic groups, and moreover shows that these conjectures are implied by the Wiegold conjecture. The construction of large Nielsen irredundant generating sets in non-amenable groups is done by extending Minsky's work to higher rank Lie groups, exhibiting dense representations in the domain of discontinuity of the $\mathrm{Out}(F_{n})$-action on the character variety.

Explore related subjects

Keep this discovery

BibTeXRIS

Tal Cohen, Itamar Vigdorovich. 2026-03-10. On the Maximal Size of Irredundant Generating Sets in Lie Groups and Algebraic Groups. https://arxiv.org/abs/2603.09640

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR