The Congruence Subgroup Problem for the Free Metabelian group on n≥4 generators

Abstract

The congruence subgroup problem for a finitely generated group asks whether the map Aut() Aut() is injective, or more generally, what is its kernel C()? Here X denotes the profinite completion of X. It is well known that for finitely generated free abelian groups C(Zn)=\ 1\ for every n≥3, but C(Z2)=Fω, where Fω is the free profinite group on countably many generators. Considering n, the free metabelian group on n generators, it was also proven that C(2)=Fω and C(3)⊃eqFω. In this paper we prove that C(n) for n≥4 is abelian. So, while the dichotomy in the abelian case is between n=2 and n≥3, in the metabelian case it is between n=2,3 and n≥4.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…