The IA-congruence kernel of high rank free Metabelian groups
David El-Chai Ben-Ezra

TL;DR
This paper studies the kernel of the IA-congruence subgroup for high-rank free metabelian groups, revealing it is abelian, non-trivial, and infinitely generated, contrasting with lower-rank or nilpotent cases.
Contribution
It demonstrates that for free metabelian groups with at least four generators, the IA-congruence kernel is abelian, non-trivial, and infinitely generated, a novel finding in this area.
Findings
Kernel is abelian for n≥4
Kernel is non-trivial and not finitely generated
Behavior differs from lower-rank or nilpotent groups
Abstract
The congruence subgroup problem for a finitely generated group and asks whether the map is injective, or more generally, what is its kernel ? Here denotes the profinite completion of . In this paper we investigate , where is a free metabelian group on generators, and . We show that in this case is abelian, but not trivial, and not even finitely generated. This behavior is very different from what happens for free metabelian group on generators, or for finitely generated nilpotent groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
