No Arabic abstract
The congruence subgroup problem for a finitely generated group $Gamma$ asks whether the map $hat{Autleft(Gammaright)}to Aut(hat{Gamma})$ is injective, or more generally, what is its kernel $Cleft(Gammaright)$? Here $hat{X}$ denotes the profinite completion of $X$. It is well known that for finitely generated free abelian groups $Cleft(mathbb{Z}^{n}right)=left{ 1right}$ for every $ngeq3$, but $Cleft(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 $Cleft(Phi_{2}right)=hat{F}_{omega}$ and $Cleft(Phi_{3}right)supseteqhat{F}_{omega}$. In this paper we prove that $Cleft(Phi_{n}right)$ for $ngeq4$ is abelian. So, while the dichotomy in the abelian case is between $n=2$ and $ngeq3$, in the metabelian case it is between $n=2,3$ and $ngeq4$.
In this paper we describe the profinite completion of the free solvable group on m generators of solvability length r>1. Then, we show that for m=r=2, the free metabelian group on two generators does not have the Congruence Subgroup Property.
The congruence subgroup problem for a finitely generated group $Gamma$ asks whether $widehat{Autleft(Gammaright)}to Aut(hat{Gamma})$ is injective, or more generally, what is its kernel $Cleft(Gammaright)$? Here $hat{X}$ denotes the profinite completion of $X$. In this paper we first give two new short proofs of two known results (for $Gamma=F_{2}$ and $Phi_{2}$) and a new result for $Gamma=Phi_{3}$: 1. $Cleft(F_{2}right)=left{ eright}$ when $F_{2}$ is the free group on two generators. 2. $Cleft(Phi_{2}right)=hat{F}_{omega}$ when $Phi_{n}$ is the free metabelian group on $n$ generators, and $hat{F}_{omega}$ is the free profinite group on $aleph_{0}$ generators. 3. $Cleft(Phi_{3}right)$ contains $hat{F}_{omega}$. Results 2. and 3. should be contrasted with an upcoming result of the first author showing that $Cleft(Phi_{n}right)$ is abelian for $ngeq4$.
The congruence subgroup problem for a finitely generated group $Gamma$ and $Gleq Aut(Gamma)$ asks whether the map $hat{G}to Aut(hat{Gamma})$ is injective, or more generally, what is its kernel $Cleft(G,Gammaright)$? Here $hat{X}$ denotes the profinite completion of $X$. In the case $G=Aut(Gamma)$ we denote $Cleft(Gammaright)=Cleft(Aut(Gamma),Gammaright)$. Let $Gamma$ be a finitely generated group, $bar{Gamma}=Gamma/[Gamma,Gamma]$, and $Gamma^{*}=bar{Gamma}/tor(bar{Gamma})congmathbb{Z}^{(d)}$. Denote $Aut^{*}(Gamma)=textrm{Im}(Aut(Gamma)to Aut(Gamma^{*}))leq GL_{d}(mathbb{Z})$. In this paper we show that when $Gamma$ is nilpotent, there is a canonical isomorphism $Cleft(Gammaright)simeq C(Aut^{*}(Gamma),Gamma^{*})$. In other words, $Cleft(Gammaright)$ is completely determined by the solution to the classical congruence subgroup problem for the arithmetic group $Aut^{*}(Gamma)$. In particular, in the case where $Gamma=Psi_{n,c}$ is a finitely generated free nilpotent group of class $c$ on $n$ elements, we get that $C(Psi_{n,c})=C(mathbb{Z}^{(n)})={e}$ whenever $ngeq3$, and $C(Psi_{2,c})=C(mathbb{Z}^{(2)})=hat{F}_{omega}$ = the free profinite group on countable number of generators.
The goal of this paper is to give a group-theoretic proof of the congruence subgroup property for $Aut(F_2)$, the group of automorphisms of a free group on two generators. This result was first proved by Asada using techniques from anabelian geometry, and our proof is, to a large extent, a translation of Asadas proof into group-theoretic language. This translation enables us to simplify many parts of Asadas original argument and prove a quantitative version of the congruence subgroup property for $Aut(F_2)$.
We show the connection between the relative Dehn function of a finitely generated metabelian group and the distortion function of a corresponding subgroup in the wreath product of two free abelian groups of finite rank. Further, we show that if a finitely generated metabelian group $G$ is an extension of an abelian group by $mathbb Z$ the relative Dehn function of $G$ is polynomially bounded. Therefore, if $G$ is finitely presented, the Dehn function is bounded above by the exponential function up to equivalence.