The Congruence Subgroup Problem for finitely generated Nilpotent Groups

preprint2020arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.