The IA-congruence kernel of high rank free Metabelian groups
Abstract
The congruence subgroup problem for a finitely generated group and G≤ Aut() asks whether the map G Aut() is injective, or more generally, what is its kernel C(G,)? Here X denotes the profinite completion of X. In this paper we investigate C(IA(n),n), where n is a free metabelian group on n≥4 generators, and IA(n)=(Aut(n) GLn(Z)). We show that in this case C(IA(n),n) is abelian, but not trivial, and not even finitely generated. This behavior is very different from what happens for free metabelian group on n=2,3 generators, or for finitely generated nilpotent groups.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.