English

The Congruence Subgroup Problem for finitely generated Nilpotent Groups

Group Theory 2020-05-08 v1

Abstract

The congruence subgroup problem for a finitely generated group Γ\Gamma and GAut(Γ)G\leq Aut(\Gamma) asks whether the map G^Aut(Γ^)\hat{G}\to Aut(\hat{\Gamma}) is injective, or more generally, what is its kernel C(G,Γ)C\left(G,\Gamma\right)? Here X^\hat{X} denotes the profinite completion of XX. In the case G=Aut(Γ)G=Aut(\Gamma) we denote C(Γ)=C(Aut(Γ),Γ)C\left(\Gamma\right)=C\left(Aut(\Gamma),\Gamma\right). Let Γ\Gamma be a finitely generated group, Γˉ=Γ/[Γ,Γ]\bar{\Gamma}=\Gamma/[\Gamma,\Gamma], and Γ=Γˉ/tor(Γˉ)Z(d)\Gamma^{*}=\bar{\Gamma}/tor(\bar{\Gamma})\cong\mathbb{Z}^{(d)}. Denote Aut(Γ)=Im(Aut(Γ)Aut(Γ))GLd(Z)Aut^{*}(\Gamma)=\textrm{Im}(Aut(\Gamma)\to Aut(\Gamma^{*}))\leq GL_{d}(\mathbb{Z}). In this paper we show that when Γ\Gamma is nilpotent, there is a canonical isomorphism C(Γ)C(Aut(Γ),Γ)C\left(\Gamma\right)\simeq C(Aut^{*}(\Gamma),\Gamma^{*}). In other words, C(Γ)C\left(\Gamma\right) is completely determined by the solution to the classical congruence subgroup problem for the arithmetic group Aut(Γ)Aut^{*}(\Gamma). In particular, in the case where Γ=Ψn,c\Gamma=\Psi_{n,c} is a finitely generated free nilpotent group of class cc on nn elements, we get that C(Ψn,c)=C(Z(n))={e}C(\Psi_{n,c})=C(\mathbb{Z}^{(n)})=\{e\} whenever n3n\geq3, and C(Ψ2,c)=C(Z(2))=F^ωC(\Psi_{2,c})=C(\mathbb{Z}^{(2)})=\hat{F}_{\omega} = the free profinite group on countable number of generators.

Keywords

Cite

@article{arxiv.2005.03263,
  title  = {The Congruence Subgroup Problem for finitely generated Nilpotent Groups},
  author = {David El-Chai Ben-Ezra and Alexander Lubotzky},
  journal= {arXiv preprint arXiv:2005.03263},
  year   = {2020}
}

Comments

18 pages

R2 v1 2026-06-23T15:22:25.447Z