Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 42 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 217 tok/s Pro
GPT OSS 120B 474 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

The Congruence Subgroup Problem for the Free Metabelian group on $n\geq4$ generators (1701.02459v5)

Published 10 Jan 2017 in math.GR

Abstract: The congruence subgroup problem for a finitely generated group $\Gamma$ asks whether the map $\hat{Aut\left(\Gamma\right)}\to Aut(\hat{\Gamma})$ is injective, or more generally, what is its kernel $C\left(\Gamma\right)$? Here $\hat{X}$ denotes the profinite completion of $X$. It is well known that for finitely generated free abelian groups $C\left(\mathbb{Z}{n}\right)=\left{ 1\right}$ for every $n\geq3$, but $C\left(\mathbb{Z}{2}\right)=\hat{F}_{\omega}$, where $\hat{F}{\omega}$ is the free profinite group on countably many generators. Considering $\Phi{n}$, the free metabelian group on $n$ generators, it was also proven that $C\left(\Phi_{2}\right)=\hat{F}{\omega}$ and $C\left(\Phi{3}\right)\supseteq\hat{F}{\omega}$. In this paper we prove that $C\left(\Phi{n}\right)$ for $n\geq4$ is abelian. So, while the dichotomy in the abelian case is between $n=2$ and $n\geq3$, in the metabelian case it is between $n=2,3$ and $n\geq4$.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.