This paper investigates the congruence subgroup problem for free metabelian groups, showing that for four or more generators, the kernel of the associated map is abelian, revealing a new structural property.
Contribution
It proves that the kernel $C(\
Findings
01
For $n \\geq 4$, $C(\\\Phi_{n})$ is abelian.
02
The dichotomy in the kernel's structure shifts at $n=4$ in the metabelian case.
03
Extends understanding of the congruence subgroup problem for free metabelian groups.
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)⊇F^ω. 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…
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.
Taxonomy
TopicsSpectral Theory in Mathematical Physics · Finite Group Theory Research · Geometric and Algebraic Topology
Full text
The Congruence Subgroup Problem
for the Free Metabelian group on n≥4 generators
David El-Chai Ben-Ezra
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)⊇F^ω. 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.
The classical congruence subgroup problem (CSP) asks for, say, G=SLn(Z)
or G=GLn(Z), whether every finite index
subgroup of G contains a principal congruence subgroup, i.e. a
subgroup of the form G(m)=ker(G→GLn(Z/mZ))
for some 0=m∈Z. Equivalently, it asks whether the
natural map G^→GLn(Z^) is injective, where
G^ and Z^ are the profinite completions of
the group G and the ring Z, respectively. More generally,
the CSP asks what is the kernel of this map. It is a classical 19th
century result that the answer is negative for n=2. Moreover (but
not so classical, cf. [Mel], [L]), the kernel in
this case is F^ω - the free profinite group on a countable
number of generators. On the other hand, it was proved in the sixties
by Mennicke [Men] and Bass-Lazard-Serre [BLS] that
for n≥3 the answer is affirmative, and the kernel is therefore
trivial.
By the observation GLn(Z)≅Aut(Zn)=Out(Zn),
the CSP can be generalized as follows: Let Γ be a group and
G≤Aut(Γ) (resp. G≤Out(Γ)).
For a finite index characteristic subgroup M≤Γ denote
[TABLE]
Such a G(M) will be called a “principal congruence
subgroup” and a finite index subgroup of G which contains G(M)
for some M will be called a “congruence subgroup”. The CSP
for the pair (G,Γ) asks whether every finite index
subgroup of G is a congruence subgroup. In some sense, the CSP
tries to understand whether every finite quotient of G comes from
a finite quotient of Γ.
One can easily see that the CSP is equivalent to the question: Is
the congruence map G^=limG/U→limG/G(M)
injective? Here, U ranges over all finite index normal subgroups
of G, and M ranges over all finite index characteristic subgroups
of Γ. When Γ is finitely generated, it has only finitely
many subgroups of given index m, and thus, the charateristic subgroups
Mm=∩{Δ≤Γ∣[Γ:Δ]=m}
are of finite index in Γ. Hence, one can write Γ^=limm∈NΓ/Mm
and have111By the celebrated theorem of Nikolov and Segal which asserts that
every finite index subgroup of a finitely generated profinite group
is open [NS], the second inequality is actually an equality.
However, we do not need it.
[TABLE]
Therefore, when Γ is finitely generated, the CSP is equivalent
to the question: Is the congruence map G^→Aut(Γ^)
(resp. G^→Out(Γ^)) injective? More generally,
the CSP asks what is the kernel C(G,Γ) of this
map. For G=Aut(Γ) we will also use the simpler
notation C(Γ)=C(G,Γ).
The classical congruence subgroup results mentioned above can therefore
be reformulated as C(Z2)=F^ω
while C(Zn)={e} for n≥3.
So the finite quotients of GLn(Z) are closely
related to the finite quotients of Zn when n≥3,
but the finite quotients of GL2(Z) are far
from being understandable by the finite quotients of Z2.
Very few results are known when Γ is non-abelian. Most of
the results are related to Γ=πg,n, the fundamental group
of Sg,n, the closed surface of genus g with n punctures.
In these cases one can take G=PMod(Sg,n), the pure
mapping class group of Sg,n, and can naturally view it as a
subgroup of Out(πg,n) (cf. [FM], chapter
8). Considering these cases, it is known that:
Theorem 1.1**.**
For g=0,1,2 and every n≥0,1,0 respectively,
we have C(PMod(Sg,n),πg,n)={1}.
Note that when g=1 and n=0, π1,0≅Z2
and PMod(S1,0)≅SL2(Z),
so C(PMod(S1,0),π1,0)=C(SL2(Z),Z2)=F^ω.
The cases for g=0 were proved in [DDH] (see also [Mc]),
the cases for g=1 were proved in [A] (see also [Bo1],
[BER]), and the cases for g=2 were proved in [Bo1]
(see also [Bo2] for the specific case where g=2 and n=0).
In particular, as PMod(S1,1) is isomorphic to the
special outer-automorphism group of F2, we have an affirmative
answer for the full outer-automorphism group of F2, and by some
standard arguments it shows that actually C(F2) is
trivial (see [BER], [BL]). Note that for every n>0,
πg,n≅F2g+n−1 = the free group on 2g+n−1 generators.
Hence, the above solved cases give an affirmative answer for various
subgroups of the outer-automorphism group of finitely generated free
groups, while the CSP for the full Aut(Fd) when d≥3
is still unsettled, and so is the situation with PMod(Sg,n)
when g≥3.
All the above settled cases have a common property which plays a crucial
role in the proof of Theorem 1.1: There is an intrinsic
description of G by iterative extension process by virtually free
groups (groups which have a finite index free subgroup). Actually,
in these cases, in some sense, we do understand the finite quotients
of G, and the CSP tells us that these quotients are closely related
to the finite quotients of Γ. This situation changes when
we pass to G=Aut(Fd) for d≥3 or PMod(Sg,n)
for g≥3. In these cases we do not have a description of G
that can help to understand the finite quotients of G. So in some
sense, all the known cases do not give us a new understanding of the
finite quotients of G. Considering the abelian case, what makes
the result of Mennicke and Bass-Lazard-Serre so special is that it
not only shows that the finite quotients of GLn(Z)
are related to the finite quotients of Zn, but also
gives us a description of the finite quotients of GLn(Z),
which we have not known without this result.
Denote now the free metabelian group on n generators by Φn=Fn/Fn′′.
Considering the metabelian case, it was shown in [BL] (see
also [Be1]) that C(Φ2)=F^ω.
In addition, it was proven there that C(Φ3)⊇F^ω.
So, the finite quotients of Aut(Φ2) and Aut(Φ3)
are far from being connected to the finite quotients of Φ2
and Φ3, respectively.
Here comes the main theorem of this paper:
Theorem 1.2**.**
For every n≥4, C(IA(Φn),Φn)
is central in IA(Φn), where
and the fact that GLn(Z)→GLn(Z^)
is injective for n≥3, we obtain that C(IA(Φn),Φn)
is mapped onto C(Φn). Therefore we deduce that:
Theorem 1.3**.**
For every n≥4, C(Φn) is
abelian.
This is dramatically different from the cases of n=2,3 described
above. Theorem 1.3 tells us that when n≥4 the situation
changes, and the finite quotients of Aut(Φn) are
closely related to the finite quotients of Φn in the following
manner:
Corollary 1.4**.**
Let n≥4. Then, for every finite index
subgroup H≤G=Aut(Φn), there exists a finite
index characteristic subgroup M≤Φn and r∈N
such that G(M)′G(M)r⊆H.
Note that by a theorem of Bachmuth and Mochizuki [BM2], Aut(Fn)→Aut(Φn)
is surjective for every n≥4, and thus G=Aut(Φn)
is finitely generated. Hence, the principal congruence subgroups of
the form G(M) are finitely generated, and thus, the
subgroups of the form G(M)′G(M)r are also
of finite index in Aut(Φn). Therefore, the quotients
of the form Aut(Φn)/G(M)′G(M)r
describe all the finite quotients of Aut(Φn).
In particular, our theorem gives us a description of the finite quotients
of Aut(Φn) when n≥4 - just like the theorem
of [Men] and [BLS] gives for GLn(Z)
when n≥3. Corollary 1.4 obviously does not
hold for n=2,3. So, the picture is that while the dichotomy in
the abelian case is between n=2 and n≥3, in the metabelian
case we have a dichotomy between n=2,3 and n≥4.
In [KN], Kassabov and Nikolov showed that ker(SLn(Z[x])→SLn(Z[x]))
is central and not finitely generated, when n≥3. In [Be2]
we use their techniques and an interesting surjective representation
[TABLE]
to show also that:
Theorem 1.5**.**
For every n≥4, C(IA(Φn),Φn)
is not finitely generated.
We remark that despite the result of the latter theorem, we do not
know whether C(Φn) is also not finitely generated.
In fact we cannot even prove at this point that it is not trivial
(for more, see ∮6).
We would like now to give a conceptual explanation for the dichotomy
between n=2,3 and n≥4. Let us recall first the strategy of
Bachmuth and Mochizuki [BM2], showing that the natural map
Aut(Fn)→Aut(Φn) is surjective
for n≥4. They start with the observation that as Aut(Fn)→GLn(Z)
is surjective, it is enough to show that every element of IA(Φn)
is induced by an element of IA(Fn)=ker(Aut(Fn)→Aut(Fn/Fn′)=GLn(Z)).
From here, the basic background for their proof are the following
facts:
•
For every n (not only for n≥4), IA(Φn)
can naturally be viewed as a subgroup of GLn(Rn)
where Rn=Z[x1±1,…,xn±1] is the
free Laurent polynomial ring on n commutative variables over Z
(see ∮2 for the details). It can be easily
shown that for every 1≤i≤n, this embedding contains a copy
of the group
[TABLE]
•
By a classical result of Magnus ([MKS], Chapter 3, Theorem
N4) the group IA(Fn) is finitely generated by a well
described generating set of its elements, say S (also here, it
is true for every n). Denote the image of S in IA(Φn)
by Sˉ.
The technique of [BM2] was to show that when n≥4 the
set Sˉ generates the whole of IA(Φn).
In Section 3, [BM2] start with presenting a variety of types
of elements that are contained in the subgroup of IA(Φn)
generated by Sˉ - here, [BM2] already needed the
assumption of n≥4. In section 5, [BM2] show that every
element g∈IA(Φn) can be written as a product
of elements
[TABLE]
where ki∈IGLn−1,i and hi are elements generated
by Sˉ (by Section 3) - so it remains to show that IGLn−1,i
is generated by Sˉ. Then, in the beginning of Section 4, by
some classical results from Algebraic K-Theory, [BM2] manage
to give a description for a generating set to IGLn−1,i. From
here, the rest of Section 4 is devoted to show that the generating
set of IGLn−1,i can be built from the elements of Sˉ.
The aforementioned results from Algebraic K-Theory are strongly leaning
on the assumption n≥4, i.e. n−1≥3. Actually, when n=3,
i.e. n−1=2, the situation is completely different, and leads to
the fact that Aut(Φ3) is not finitely generated (See [BM1]).
In some sense, what we show in this paper is that this difference
between Aut(Φ3) and Aut(Φn≥4), combined with
the dichotomy between n=2 and n≥3 in the CSP for the abelian
case, induces a dichotomy between n=2,3 and n≥4 in the CSP
for the metabelian case.
The main line of the proof of Theorem 1.2, is as follows:
For G=IA(Φn) we first take the principal congruence
subgroups G(Mn,m) where Mn,m=(Φn′Φnm)′(Φn′Φnm)m.
By [Be1], Φ^n=lim(Φn/Mn,m),
and thus we deduce that the subgroups of the form G(Mn,m)
are enough to represent the congruence subgroups of IA(Φn)
in the sense that every congruence subgroup contains one of these
principal congruence subgroups. Then, we follow the steps of the theorem
of Bachmuth and Mochizuki [BM2], showing that Aut(Fn)→Aut(Φn)
is surjective for n≥4, and we try to build G(Mn,m)
using elements of ⟨IA(Φn)m⟩.
Along this paper, mostly in ∮4 and Claim
5.12, we present a variety of types of elements that are
contained in ⟨IA(Φn)m⟩.
In ∮5 we prove a main lemma, which
can be viewed as a counterpart of Section 5 in [BM2]. A counterpart
of Section 4 in [BM2] is proven in Section 7 of [Be2]
(see Lemma 3.2 in this paper). These parts are combined
together in ∮3, and by some additional
results from algebraic K-theory we get that for every m
[TABLE]
is finite and central in IA(Φn)/⟨IA(Φn)m⟩.
Hence, ⟨IA(Φn)m⟩ is
of finite index in IA(Φn). In particular, as every
normal subgroup of index m in IA(Φn) contains
⟨IA(Φn)m⟩, we deduce
that the groups of the form ⟨IA(Φn)m⟩
are enough to represent the finite index subgroups of IA(Φn).
From here, it follows easily that C(IA(Φn),Φn)
is central in IA(Φn) (see Corollary
3.4).
We hope that the solution of the free metabelian case will help to
understand some new cases of non-abelian groups, such as the automorphism
group of a free group and the mapping class group of a surface. The
immediate next challenges are the automorphism groups of free solvable
groups.
Let us point out that, as remarked in∮5 in [BL],
one can deduce from Theorem 1.3 that for every n≥4,
Aut(Φn) is not large, i.e does not contain a finite
index subgroup which can be mapped onto a free group. This is in contrast
with Aut(Φ2) and Aut(Φ3) which
are large.
The paper is organized as follows: In ∮2
we present some notations and discuss IA(Φn) and
some of its subgroups. Then, up to a main lemma, in ∮3
we prove the main theorem of the paper, Theorem 1.2. In
∮4 we present some elements of ⟨IA(Φn)m⟩
which we use in the proof of the main lemma. In ∮5
we prove the main lemma. We end the paper with the proof of Theorem
1.3, and some remarks on the problem of computing C(Φn)
and C(IA(Φn),Φn).
Acknowledgements: I wish to offer my deepest thanks to my
great supervisor Prof. Alexander Lubotzky for his sensitive and devoted
guidance, and to the Rudin foundation trustees for their generous
support during the period of the research.
2 Some properties of IA(Φn)
and its subgroups
Let G=IA(Φn)=ker(Aut(Φn)→Aut(Φn/Φn′)=GLn(Z)).
We start with recalling some of the properties of G=IA(Φn)
and its subgroups, as presented in Section 3 in [Be2]. We
also refer the reader to [Be2] for the proofs of the statements
in this section. We start with the following notations:
•
Φn=Fn/Fn′′= the free metabelian group on n elements.
Here Fn′′ denotes the second derivative of Fn, the free
group on n elements.
•
Φn,m=Φn/Mn,m, where Mn,m=(Φn′Φnm)′(Φn′Φnm)m.
•
IGn,m=G(Mn,m)=ker(IA(Φn)→Aut(Φn,m)).
•
IAnm=⟨IA(Φn)m⟩.
•
Rn=Z[Zn]=Z[x1±1,…,xn±1]
where x1,…,xn are the generators of Zn.
•
Zm=Z/mZ.
•
σi=xi−1 for 1≤i≤n. We also denote by σ
the column vector which has σi in its i-th entry.
•
An=∑i=1nσiRn = the augmentation
ideal of Rn.
•
Hn,m=ker(Rn→Zm[Zmn])=∑i=1n(xim−1)Rn+mRn.
By the well known Magnus embedding (see [Bi], [RS],
[Ma]), one can identify Φn with the matrix group
[TABLE]
where ti is a free basis for Rn-module, under the identification
of the generators of Φn with the matrices
[TABLE]
Moreover, for every α∈IA(Φn), one can
describe α by its action on the generators of Φn,
by
[TABLE]
and this description gives an injective homomorphism (see [Ba],
[Bi])
[TABLE]
which gives an identification of IA(Φn) with the
subgroup
[TABLE]
One can find the proof of the following proposition in [Be2]
(Propositions 3.1 and 3.2):
Proposition 2.1**.**
Let In+A∈IA(Φn).
Then:
•
If one denotes the entries of A by ak,l for 1≤k,l≤n,
then for every 1≤k,l≤n, ak,l∈∑l=i=1nσiRn⊆An.
•
det(In+A)* is of the form det(In+A)=∏r=1nxrsr
for some sr∈Z.*
Consider now the map
[TABLE]
which induced by the projections Zn→Zmn,
Rn=Z[Zn]→Zm[Zmn].
Using result of Romanovskiĭ [Rom], it is shown in [Be1]
that this map is surjective and that Φn,m is canonically
isomorphic to its image. Therefore, we can identify the principal
congruence subgroup of IA(Φn), IGn,m, with
[TABLE]
Let us step forward with the following definitions:
Definition 2.2**.**
Let A∈GLn(Rn), and for 1≤i≤n, denote
by Ai,i the minor which obtained from A by erasing its i-th
row and i-th column. Now, for every 1≤i≤n, define the
subgroup IGLn−1,i≤IA(Φn), by
[TABLE]
where:
[TABLE]
The following proposition is proven in [Be2] (Proposition
3.4):
Proposition 2.3**.**
For every 1≤i≤n we have IGLn−1,i≅GLn−1(Rn,σiRn).
We recall the following definitions from Algebraic K-Theory:
Definition 2.4**.**
Let R be a commutative ring (with identity), H⊲R
an ideal, and d∈N. Then:
•
Ed(R)=⟨Id+rEi,j∣r∈R,1≤i=j≤d⟩≤SLd(R)
where Ei,j is the matrix which has 1 in the (i,j)-th
entry and [math] elsewhere.
•
SLd(R,H)=ker(SLd(R)→SLd(R/H)).
•
GLd(R,H)=ker(GLd(R)→GLd(R/H)).
•
Ed(R,H) = the normal subgroup of Ed(R),
which is generated as a normal subgroup by the elementary matrices
of the form Id+hEi,j for h∈H.
Under the above identification of IGLn−1,i with GLn−1(Rn,σiRn),
for every 1≤i≤n we define:
Definition 2.5**.**
Let H⊲Rn. Then:
[TABLE]
3 The main theorem’s proof
Using the above notations we prove in ∮5
the following main lemma:
Lemma 3.1**.**
For every n≥4 and m∈N one
has
[TABLE]
Observe that it follows that when n≥4, then for every m∈N
[TABLE]
The following Lemma is proved in [Be2], using classical results
from Algebraic K-theory (Lemma 7.1 in [Be2]):
Lemma 3.2**.**
For every n≥4, 1≤i≤n and m∈N
one has
[TABLE]
Let us now quote the following proposition (see [Be2], Corollary
2.3):
Proposition 3.3**.**
Let R be a commutative ring, H⊲R
ideal of finite index and d≥3. Assume also that Ed(R)=SLd(R).
Then:
[TABLE]
is a finite group which is central in GLd(R)/Ed(R,H).
Now, according to Proposition 3.3 and the fact that
Ed(Rn)=SLd(Rn) for every d≥3
[Su], we obtain that for every n≥4
[TABLE]
is a finite group. Thus
[TABLE]
is also a finite group. Hence, the conclusion from Lemmas 3.1
and 3.2 is that for every m∈N, one can
cover IGn,m4 with finite number of cosets of IAnm.
As IGn,m4 is obviously a finite index subgroup of IA(Φn)
we deduce that IAnm is also a finite index subgroup of IA(Φn).
Therefore, as every normal subgroup of IA(Φn)
of index m cotains IAnm we deduce that one can write explicitely
IA(Φn)=lim(IA(Φn)/IAnm).
On the other hand, it is proven in [Be1] that Φ^n=limΦn,m,
and thus:
Corollary 3.4**.**
For every n≥4
[TABLE]
Now, Proposition 3.3 gives us also that for every
m∈N and n≥4, the subgroup SK1(Rn,Hn,m;n−1)
is central in GLn−1(Rn)/En−1(Rn,Hn,m).
This fact is used in Section 5 of [Be2] to prove that if
we define
[TABLE]
then for every n≥4, m∈N and 1≤i≤n the
subgroup
[TABLE]
is central in IA(Φn)/IAn,m. Completely similar
arguments yield the following result222The only property of IAn,m used in Chapter 5 of [Be2]
is that IAnm⊆IAn,m.:
Proposition 3.5**.**
For every n≥4, m∈N and 1≤i≤n
the subgroup
[TABLE]
is central in IA(Φn)/IAnm.
Corollary 3.6**.**
For every n≥4 and m∈N the elements of the set
[TABLE]
belong to the center of IA(Φn)/IAnm.
The conclusion from the latter corollary is that for every n≥4
and m∈N, the set
[TABLE]
is an abeliangroup which contained in the center of IA(Φn)/IAnm.
In particular, IAnm⋅IGn,m4/IAnm is contained
in the center of IA(Φn)/IAnm, and thus,
by Corollary 3.4, C(IA(Φn),Φn)
is in the center of IA(Φn). This finishes,
up to the proof of Lemma 3.1, the proof of Theorem
1.2.
So it remains to prove Lemma 3.1. But before we start
to prove this lemma, we need to present some elements of IAnm.
We will do this in the following section.
4 Some elementary elements of ⟨IA(Φn)m⟩
In this section we introduce some elements of IAnm=⟨IA(Φn)m⟩
which are needed through the proof of Lemma 3.1. As
one can see below, we separate the elementary elements to two types.
In addition, we separate the treatment of the elements of type 1,
to two parts. We hope this separation will make the process clearer.
Additionally to the previous notations, on the section, and also later
on, we will use the notation
[TABLE]
4.1 Elementary elements of type 1
Proposition 4.1**.**
Let n≥3, 1≤u≤n and m∈N.
Denote by ei the i-th row standard vector. Then, the
elements of IA(Φn) of the form (the following
notation means that the matrix is similar to the identity matrix,
except the entries in the u-th row)
[TABLE]
when (au,1,…,au,u−1,0,au,u+1,…,au,n)
is a linear combination of the vectors
[TABLE]
with coefficients in Rn, belong to IAnm.
Before proving this proposition, we present some more elements of
this type. Note that for the following proposition we assume n≥4:
Proposition 4.2**.**
Let n≥4, 1≤u≤n and m∈N.
Then, the elements of IA(Φn) of the form
[TABLE]
when (au,1,…,au,u−1,0,au,u+1,…,au,n)
is a linear combination of the vectors
[TABLE]
with coefficients in Rn, belong to IAnm.
Proof.
(of Proposition 4.1) Without loss of generality,
we assume that u=1. Observe now that for every ai,bi∈Rn
for 2≤i≤n one has
[TABLE]
Hence, it is enough to prove that the elements of the following forms
belong to IAnm (when we write aei we mean that
the entry of the i-th column in the first row is a):
[TABLE]
We start with the elements of form 1. Here we have
[TABLE]
We pass to the elements of form 2. In this case we have
[TABLE]
We finish with the elements of form 3. If k=i, it is a special
case of the previous case, so we assume k=i. So we assume that
i,j,k are all different from each other and i,j,k=1 - observe
that this case is interesting only when n≥4. The computation
here is more complicated than in the previous cases, so we will demonstrate
it for the special case: n=4, i=2, j=3, k=4. It is clear
that symmetrically, with similar argument, the same holds in general
when n≥4 for every i,j,k=1 which different from each other.
So
(of Proposition 4.2) Also here, without loss of generality,
we assume that u=1. Thus, all we need to show is that also the
elements of the following forms belong to IAnm:
[TABLE]
Also here, to simplify the notations, we will demonstrate the proof
in the special case: n=4, i=2, j=3. We start with the first
form. From Proposition 4.1 we have (an element of
form 2 in Proposition 4.1)
[TABLE]
Therefore, we also have
[TABLE]
We pass to the elements of form 2. From Proposition 4.1
we have (an element of form 3 in Proposition 4.1)
[TABLE]
and therefore, we have
[TABLE]
∎
4.2 Elementary elements of type 2
Proposition 4.3**.**
Let n≥4, 1≤u<v≤n and m∈N.
Then, the elements of IA(Φn) of the form
[TABLE]
for f∈Hn,m, belong to IAnm.
Proof.
As before, to simplify the notations we will demonstrate the proof
in the case: n=4, u=1 and v=2, and it will be clear from
the computation that the same holds in the general case, provided
n≥4.
First observe that for every f,g∈Rn we have
[TABLE]
[TABLE]
so it is enough to consider the cases f∈mR4 and f∈σrμr,mR4
for 1≤r≤4, separately. Consider now the following computation.
For an arbitrary f∈Rn we have
[TABLE]
Therefore, we conclude that if
[TABLE]
then also
[TABLE]
Thus, the cases f∈mR4 and f∈σrμr,mR4
for r=4, are obtained immediately from Proposition 4.1.
Hence, it remains to deal with the case f∈σrμr,mR4
for r=4. However, it is easy to see that by switching the roles
of 3 and 4, the remained case is also obtained by similar arguments.
∎
5 A main lemma
In this section we prove Lemma 3.1 which states that
for every n≥4 and m∈N we have
[TABLE]
The proof will be presented in a few stages - each of which will be
covered in a separate subsection. In this sections n≥4 will
be constant, so we will make notations simpler and write
[TABLE]
We will also use the following notations:
[TABLE]
Notice that it follows from the definitions, that Hm=∑r=1nσrUr,m+Om
(we note that in [Be2] the notation Ur,m is used for
σrμr,mR).
Before we get deeply into the details, let us give an outline of the
proof of the above main lemma. Given 0≤u≤n, denote the
ideal
[TABLE]
The lemma is proven by induction on 1≤u≤n. Note that by
Proposition 2.1IA(Φn)⊆GLn(R,A)=GLn(R,A~0).
Now, let g∈IGn,m2∩GLn(R,A~u−1).
If one could show that by multiplying it by elements of IAm
and an element of ISLn−1,u(σuHn,m) we
can “push” g to an element of IGn,m2∩GLn(R,A~u),
then as GLn(R,A~n)={In}, it will certainly
be sufficient for proving the lemma. The issue is that the elements
of IAm take us out from IGn,m2. Hence, we extend IGn,m2∩GLn(R,A~u−1)
to a larger subgroup, denoted by J~m,u−1.
In general, these subgroups do not satisfy J~m,u⊆J~m,u−1.
However, in the delicate process described below we show that we can
“push” g∈J~m,u−1 to an element
of J~m,u by elements of IAm and
an element of ISLn−1,u(σuHn,m). We go
out from J~m,u−1 and get into J~m,u.
The process ends when we get into J~m,n={In}.
The definition of J~m,u is quite delicate,
and so is the process.
In Subsection 5.1 we describe the above definitions
and process is details. Then, in Subsection 5.2 we show
that given an element of J~m,u−1, before
“pushing” it into J~m,u, one can
fix it a bit with elements of J~m,u−1∩IAm
to a more convenient form. Then, in Subsection 5.3
we define the “pushing elements” from IAm and ISLn−1,u(σuHn,m).
We start this subsection with introducing the following objects:
Definition 5.1**.**
Let m∈N. Define
[TABLE]
Proposition 5.2**.**
For every m∈N we have
[TABLE]
Proof.
Let x∈R. Notice that ∑i=0m−1xi∈(x−1)R+mR.
In addition, by replacing x by xm we obtain ∑i=0m−1xmi∈(xm−1)R+mR.
Hence
[TABLE]
Thus, we obtain that Hm2=∑r=1n(xrm2−1)R+m2R⊆Jm+Om2.
Now, let In+A∈IGm2=IA(Φn)∩GLn(R,Hm2).
From the above observation and from Proposition 2.1,
it follows that every entry of A belongs to (Jm+Om2)∩A=Jm.
In addition, by Proposition 2.1, the determinant
of In+A is of the form ∏r=1nxrsr. On the
other hand, we know that under the projection Rn→Zm2[Zm2n]
we have In+A↦In and thus also ∏r=1nxrsr=det(In+A)↦1.
Therefore, det(In+A) is of the form ∏r=1nxrm2sr,
as required.
∎
Corollary 5.3**.**
Let n≥4 and m∈N. Then,
for proving Lemma 3.1 it suffices to prove that
[TABLE]
We continue with defining the following objects:
Definition 5.4**.**
For 0≤u≤n and 1≤v≤n, define
the following ideals of R=Rn=Z[x1±1,…,xn±1]:
[TABLE]
and for 0≤u≤n define the groups A~u=IA(Φn)∩GLn(R,A~u),
and
[TABLE]
Remark 5.5*.*
If In+A∈J~m,u, the entries of
the columns of A may belong to different ideals in R, so it
is not obvious that J~m,u is indeed
a group, i.e. closed under matrix multiplication and the inverse operation.
However, showing that J~m,u is a group
is not difficult and we leave it to the reader.
Notice now the extreme cases:
For u=0 we have (for every v and m) A~0=A,
and Jm⊆J~m,0,v. Hence, we have Jm⊆J~m,0.
For u=n we have (for every v and m) A~n=J~m,n,v=0.
Hence, we also have J~m,n={In}.
Corollary 5.6**.**
For proving Lemma 3.1, it is
enough to prove that for every 1≤u≤n
[TABLE]
Proof.
Using that IAm is normal in IA(Φn) and the
latter observations, under the above assumption, one obtains that
For 0≤u≤n and 1≤v≤n, define the following ideals
of R:
[TABLE]
and for 0≤u≤n define the group
[TABLE]
It follows from the definitions that for every 1≤u≤n we
have:
Jm,u−1,v⊆Jm,u,v, but A~u−1⊇A~u.
Thus, we have also
2. 2.
Jm,u−1⊆Jm,u, but A~u−1⊇A~u.
Here comes the connection between the latter objects to the objects
defined in Definition 5.4.
Proposition 5.8**.**
For every 0≤u≤n and 1≤v≤n
we have Jm,u,v∩A~u=J~m,u,v,
and hence Jm,u∩A~u=J~m,u.
Proof.
It is clear from the definitions that we have J~m,u,v⊆Jm,u,v∩A~u,
so we have to show an opposite inclusion. Let a∈Jm,u,v∩A~u.
As
[TABLE]
we can assume that a∈A(∑r=1uAσrUr,m+AOm+Om2)∩A~u.
Observe now that by dividing an element b∈R by σu+1,…,σn
(with residue), one can present b as a summand of an element of
A~u with an element of Ru=Z[x1±1,…,xu±1].
Hence, R=A~u+Ru and A=A~u+Au,
where Au is the augmentation ideal of Ru. Hence
[TABLE]
Hence, we can assume that a∈(Au2∑r=1uσrμr,mRu+Au2mRu+Aum2Ru)∩A~u={0},
i.e. a=0∈J~m,u,v, as required.
∎
Due to the above, we can now reduce Lemma 3.1’s proof
as follows.
Corollary 5.9**.**
For proving Lemma 3.1 it suffices
to show that given 1≤u≤n, for every α∈J~m,u−1
there exist β∈IAm∩Jm,u and γ∈ISLn−1,u(σuHm)∩Jm,u
such that γαβ∈A~u.
Proof.
As clearly Jm,u⊇Jm,u−1⊇J~m,u−1,
we obtain from Proposition 5.8 that γαβ∈A~u∩Jm,u=J~m,u.
Thus
[TABLE]
This yields that J~m,u−1⊆IAm⋅ISLn−1,u(σuHm)⋅J~m,u
which is the requirement of Corollary 5.6.
∎
5.2 A technical lemma
In this section we will prove a technical lemma, which will help us
in subsection 5.3 to prove Lemma 3.1.
In the following subsections 1≤u≤n will be constant. We
will use the following notations:
•
For a∈R we denote its image in Ru under the projection
xu+1,…,xn↦1 by aˉ. In addition, we denote
its image in Ru−1 under the projection xu,…,xn↦1
by aˉˉ.
•
For α∈GLn(R) we denote its image in GLn(Ru)
under the projection xu+1,…,xn↦1 by αˉ.
•
Similarly, we will use the following notations for every m∈N:
–
Aˉ=Au=∑i=1uσiRu,
Uˉr,m=μr,mRu for 1≤r≤u, Oˉm=mRu
and Hˉm=Hu,m=∑r=1uσrUˉr,m+Oˉm.
–
Aˉˉ=Au−1=∑i=1u−1σiRu−1,
Uˉˉr,m=μr,mRu−1 for 1≤r≤u−1 and
Oˉˉm=mRu−1.
Now, let α=In+A∈J~m,u−1,
and denote the entries of A by ai,j. Consider the u-th
row of A. Under the above assumption, for every v we have
[TABLE]
Hence we have
[TABLE]
We can state now the technical lemma:
Lemma 5.10**.**
Let α=In+A∈J~m,u−1. Then,
there exists δ∈IAm∩J~m,u−1
such that for every v=u, the (u,v)-th entry of
αδ−1 belongs to σu2Hˉm.
We will prove the lemma in two steps. Here is the first step:
Proposition 5.11**.**
Let α=In+A∈J~m,u−1.
Then, there exists δ∈IAm∩J~m,u−1
such that for every v<u, the (u,v)-th entry of αδ−1
belongs to σu2Hˉm.
Proof.
So let α=In+A∈J~m,u−1, and
observe that for every 1≤v≤u−1 one can write aˉu,v=σubˉu,v
for some bˉu,v∈∑r=1u−1AˉσrUˉr,m+σu2Uˉu,m+AˉOˉm+Oˉm2.
In addition, as it is easy to see that
[TABLE]
[TABLE]
one can write bˉu,v=σucˉu,v+bˉˉu,v
for every 1≤v≤u−1, for some
[TABLE]
Notice, that as A satisfies the condition Aσ=0
we have the equality σ1au,1+…+σnau,n=0,
which yields the following equalities as well:
[TABLE]
Observe now that for every 1≤v≤u−1 we have
[TABLE]
and thus, if we define
[TABLE]
then δ∈J~m,u−1. We claim now
that we also have δ∈IAm. We will prove this claim soon,
but assuming this claim, we can now multiply α from the right
by δ−1∈J~m,u−1∩IAm
and obtain an element in J~m,u−1 such
that the image of its (u,v)-th entry for 1≤v≤u−1,
under the projection xu+1,…,xn↦1, is
[TABLE]
as required.
∎
So it remains to prove the following claim:
Claim 5.12*.*
Let n≥4, 1≤u≤n, and bˉˉu,v∈∑r=1u−1AˉˉσrUˉˉr,m+AˉˉOˉˉm+Oˉˉm2
for 1≤v≤u−1 which satisfy the condition
[TABLE]
Then
[TABLE]
Proof.
It will be easier to prove a bit more - we will prove that if for
every 1≤v≤u−1
[TABLE]
then the vector b=(bˉˉu,1,…,bˉˉu,u−1,0,…,0)
is a linear combination of the vectors
[TABLE]
with coefficients in Ru−1. This will show that σu(bˉˉu,1,…,bˉˉu,u−1,0,…,0)
is a linear combination of the vectors in Propositions 4.1
and 4.2, so the claim will follow.
We start with expressing bˉˉu,1 explicitly by writing
[TABLE]
for some pi,r,qi,j,r∈Ru−1. Now, Equation 5.3
gives that under the projection σ2,…,σu−1↦0,
bˉˉu,1↦0. It follows that bˉˉu,1∈∑i=2u−1σiRu−1⊆Aˉˉ.
In particular, as obviously
[TABLE]
we also have mr∈Aˉˉ and hence r∈Aˉˉ.
Hence, we can write
[TABLE]
for some pi,r,qi,j,ri∈Ru−1.
Observe now that by dividing r1 by σ2,…,σu−1
(with residue) we can write r1=r1′+∑i=2u−1σiri′
where r1′ depends only on x1. Therefore, by replacing
r1 by r1′ and ri by ri+σ1ri′ for
2≤i≤n, we can assume that r1 depends only on x1.
Similarly, by dividing q1,1 by σ2,…,σu−1,
we can assume that q1,1 depends only on x1. Now, by replacing
b with
[TABLE]
we can assume that bˉˉu,1 is a polynomial which depends
only on x1. On the other hand, we already saw that Equation
5.3 yields that bˉˉu,1∈∑i=2u−1σiRu−1,
so we can actually assume that bˉˉu,1=0.
We continue in this manner by induction. In the 1≤v≤u−1
stage we assume that bˉˉu,1=…bˉˉu,v−1=0.
Then we write
[TABLE]
for some pi,r,qi,j,r∈Ru−1. The condition bˉˉu,1=…=bˉˉu,v−1=0
and Equation 5.3 give that σvbˉˉu,v+σv+1bˉˉu,v+1+…+σu−1bˉˉu,u−1=0
and thus, under the projection σv+1,…,σu−1↦0,
bˉˉu,v↦0, so bˉˉu,v∈∑i=v+1u−1σiRu−1⊆Aˉˉ.
In particular, r∈Aˉˉ, so we can write
[TABLE]
for some pi,r,qi,j,ri∈Ru−1.
Now, as we explained previously, by dividing pi,r,qi,j,ri
for 1≤i,j,r≤v by σv+1,…,σu−1, we
can assume that these polynomials depend only on x1,…,xv.
Thus, by replacing b with
[TABLE]
we can assume that bˉˉu,v is a polynomial which depends
only on x1,…,xv, without changing the assumption that
bˉˉu,w=0 for w<v. But we saw that in this situation
Equation 5.3 yields that bˉˉu,v∈∑i=v+1u−1σiRu−1,
so we can actually assume that bˉˉu,v=0, as required.
∎
This finishes the proof of Proposition 5.11. Here is
the second step of the technical lemma’s proof:
Proposition 5.13**.**
Let α=In+A∈J~m,u−1 such that
for every v<u, aˉu,v∈σu2Hˉm. Then,
there exists δ∈IAm∩J~m,u−1
such that for every v=u, the (u,v)-th entry of
αδ−1 belongs to σu2Hˉm.
Proof.
So let α=In+A∈J~m,u−1 such
that for every v<u, , aˉu,v∈σu2Hˉm.
We remined that by Equation 5.2, for every v>u we
have aˉu,v∈σu(∑r=1u−1AˉσrUˉr,m+σu2Uˉu,m+AˉOˉm+Oˉm2).
Hence, we can write explicitly
[TABLE]
for some pr,i,q,ri,s∈Ru. Clearly, as AˉOˉm⊇AˉOˉm2,
by dividing s by σi for 1≤i≤u (with residue),
we can assume that s∈Z. Consider now the following element:
[TABLE]
By the computation in the proof of Proposition 5.2,
we obtain that
[TABLE]
and thus (we remind that v>u)
[TABLE]
In addition, the determinant of δ′ is xvm2. Therefore,
δ′∈J~m,u−1. Observe now that
as v>u, under the projection σu+1,…,σn↦0,
xv↦1, and δ is therefore maped to
[TABLE]
Thus, if we multiply α from the right by δ′s we
obtain that the value of the entries in the u-th row under the
projection σu+1,…,σn↦0 does not change,
besides the value of the entry in the v-th colmun, which changes
to (see Equation 5.2 for the ideal which contains aˉu,u)
[TABLE]
Hence, we can assume that aˉu,v∈σu∑i=1u−1σifi+σu2(∑r=1uσrUˉr,m+Oˉm)=σu∑i=1u−1σifi+σu2Hˉm,
for some fi∈∑r=1u−1σrUˉr,m+Oˉm.
Define now (the coefficient of ev is the value of the
(u,v)-th entry)
[TABLE]
By proposition 4.1, we obviously have δv∈IAm.
In addition, as v>u, under the projection σu+1,…,σn↦0
we have
[TABLE]
Thus, by multiplying α from the right by δˉv−1
we obtain that the value of the entries in the u-th row under the
projection σu+1,…,σn↦0 does not change,
besides the value of the entry in the v-th colmun, which changes
to
[TABLE]
Thus, defininig δ=∏v=u+1nδv finishes the
proof of the proposition, and hence, also the proof of the technical
lemma.
∎
We remind that we fixed a constant 1≤u≤n. We remind also
that by Corollary 5.9, it suffices to show that given
α∈J~m,u−1 there exist β∈IAm∩Jm,u
and γ∈ISLn−1,u(σuHm)∩Jm,u
such that γαβ∈A~u.
So let α=In+A∈J~m,u−1. By
the above technical lemma, there exists δ∈IAm∩J~m,u−1⊆IAm∩Jm,u
such that for every v=u, the (u,v)-th entry of
αδ−1 belongs to σu2Hˉm.
Thus, by replacing α with αδ−1, with out loss
of generality, we can assume that we have aˉu,v∈σu2Hˉm
for every v=u. I.e. for every v=u one can write aˉu,v=σu2bˉu,v
for some bˉu,v∈Hˉm.
Now, for every v=u define the matrix
[TABLE]
which is equals, by direct computation, to the product of the matrices
[TABLE]
for k=u,v and the matrix (the following is an example for v>u)
[TABLE]
i.e. δv=ηv⋅∏u,v=k=1nεv,k
(observe that the matrices εv,k commute, so the product
is well defined). One can see that by Propositions 4.1
and 4.2, εv,k∈IAm for every
k=u,v. Moreover, by Proposition 4.3, ηv∈IAm.
Hence, δv∈IAm∩Jm,u. Now, as for every
1≤i≤n we have ∑j=1nai,jσj=0 (by
the condition Aσ=0), α⋅∏u=v=1nδv
is equals to
[TABLE]
[TABLE]
It is easy to see now that if we denote α⋅∏u=v=1nδv=In+C,
then for every v=u, cˉu,v=0, when ci,j is
the (i,j)-th entry of C. Hence, we also have
[TABLE]
Thus, we can write α⋅∏u=v=1nδv=In+Cˉ
when the matrix Cˉ has the following properties:
•
The entries of the u-th row of Cˉ are all [math].
•
As ai,v∈J~m,u−1,v for every i,v, by the computation
for Equation 5.2 we have aˉi,v∈σu(∑r=1u−1AˉσrUˉr,m+σu2Uˉu,m+AˉOˉm+Oˉm2)
for every i,v=u. Hence, for every i,v=u we have
[TABLE]
Now, as det(δv)=1 for every v=u, det(α⋅∏u=v=1nδv)=det(α)=∏i=1uxisim2.
However, as the entries of Cˉ have the above properties, this
determinant is mapped to 1 under the projection σu↦0.
Thus, det(α⋅∏u=v=1nδv)
is of the form xusum2. Now, set i0=u, and
denote
[TABLE]
By the computation in the proof of Proposition 5.2,
we obtain that
[TABLE]
and thus
[TABLE]
so ζ∈IAm∩Jm,u. In addition det(ζ)=xum2.
Therefore, α⋅∏v=uδvζ−su,
writen as In+Cˉ, has the following properties:
•
The entries of the u-th row of Cˉ are all [math].
•
For every i,v=u we have cˉi,v∈σu(AˉHˉm+Oˉm2),
so we can write cˉi,v=σudi,v for some di,v∈AˉHˉm+Oˉm2.
•
For every 1≤i≤n we have ∑k=1uσkcˉi,k=0,
so cˉi,u=−∑k=1u−1σkdi,k .
•
det(In+Cˉ)=1.
In other words
[TABLE]
for some di,j∈AˉHˉm+Oˉm2,
and det(In+Cˉ)=1.
Define now β=∏v=uδvζ−su, so β∈IAm∩Jm,u.
In addition, define γ to be the inverse of γ−1=In+C~
where
[TABLE]
is the (i,j)-th entry of C~. Notice that γ−1∈IA(Φn),
and that γ−1=In+Cˉ=αβ.
In addition
[TABLE]
Moreover, as di,j∈AˉHˉm+Oˉm2⊆Hm,
γ∈ISLn−1,u(σuHm). Additionally,
γ∈Jm,u. Hence, we obtained β∈IAm∩Jm,u
and γ∈ISLn−1,u(σuHm)∩Jm,u
such that γαβ=In, i.e. γαβ∈A~u,
as required.
6 Remarks and problems for further research
We will prove now Theorem 1.3, which asserts that C(Φn)
is abelian for every n≥4. But before, let us state the following
proposition, which is slightly more general than Lemma 2.1. in [BER],
but proven by similar arguments:
Proposition 6.1**.**
Let 1→G1→αG2→βG3→1
be a short exact sequence of groups. Assume also that G1 is
finitely generated. Then:
1. The sequence G^1→α^G^2→β^G^3→1
is also exact.
2. The kernel ker(G^1→α^G^2)
is central in G^1.
Proof.
(of Theorem 1.3) By Proposition 6.1, the
commutative exact diagram
[TABLE]
gives rise to the commutative exact diagram
[TABLE]
Now, as n≥4, by the CSP for GLn(Z),
the map GLn(Z)→GLn(Z^)
is injective, so one obtains by diagram chasing, that C(IA(Φn),Φn)=ker(IA(Φn)→Aut(Φ^n))
is mapped onto C(Φn)=ker(Aut(Φn)→Aut(Φ^n))
through the map IA(Φn)→Aut(Φn).
In particular, as by Theorem 1.2C(IA(Φn),Φn)
is central in IA(Φn) for every n≥4,
it is also abelian, and thus C(Φn) is an image
of an abelian group, and therfore abelian, as required.
∎
Problem 6.2**.**
Is C(Φn) not finitely generated?
trivial?
We proved in [Be2] that C(IA(Φn),Φn)
is not finitely generated for every n≥4. This may suggest that
also C(Φn) is not finitely generated, or at least,
not trivial. Moreover, if C(IA(Φn),Φn)
were not central in IA(Φn), we could
use the fact that IA(Φn) is finitely generated
for every n≥4 [BM2], and by the second part of Proposition
6.1 we could derive that the image of C(IA(Φn),Φn)
in Aut(Φn) is not trivial. However,
we showed that C(IA(Φn),Φn) is
central in IA(Φn), so it is possible
that C(IA(Φn),Φn)⊆ker(IA(Φn)→Aut(Φn))
and thus C(Φn) is trivial.
We saw in [Be2] that for every i there is a natural surjective
map
[TABLE]
These maps enabled us to show in [Be2] that for every n≥4,
C(IA(Φn),Φn) can be written as
[TABLE]
where
[TABLE]
are central in IA(Φn). Here we showed
that also C(IA(Φn),Φn)∩i=1nkerρ^i
lie in the center of IA(Φn) but we still
do not know to determine whether:
Problem 6.3**.**
Is C(IA(Φn),Φn)=∏i=1nCi
or does it contain more elements?
It seems that having the answer to Problem 6.3 will help
to solve Problem 6.2.
ISLn−1,i(H)=IGLn−1,i∩SLn−1(Rn,H),
under the identification of IGLn−1,i with GLn−1(Rn,σiRn),
Section 2.
•
IEn−1,i(H)=IGLn−1,i∩En−1(Rn,H),
under the identification of the group IGLn−1,i with GLn−1(Rn,σiRn),
Section 2.
Bibliography25
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[A] M. Asada, The faithfulness of the monodromy representations associated with certain families of algebraic curves, J. Pure Appl. Algebra 159 (2001), 123–147.
2[Ba] S. Bachmuth, Automorphisms of free metabelian groups, Trans. Amer. Math. Soc. 118 (1965) 93-104.
3[Be 1] D. E-C. Ben-Ezra, The congruence subgroup problem for the free metabelian group on two generators. Groups Geom. Dyn. 10 (2016), 583–599.
4[Be 2] D. E-C. Ben-Ezra, The IA-congruence kernel of high rank free Metabelian groups, ar Xiv:1707.09854.
5[Bi] J. S. Birman, Braids, links, and mapping class groups, Princeton University Press, Princeton, NJ, University of Tokyo Press, Toyko, 1975.
6[Bo 1] M. Boggi, The congruence subgroup property for the hyperelliptic modular group: the open surface case, Hiroshima Math. J. 39 (2009), 351–362.
7[Bo 2] M. Boggi, A generalized congruence subgroup property for the hyperelliptic modular group, ar Xiv:0803.3841 v 5.
8[BER] K-U. Bux, M. V. Ershov, A. S. Rapinchuk, The congruence subgroup property for A u t ( F 2 ) 𝐴 𝑢 𝑡 subscript 𝐹 2 Aut\left(F_{2}\right) : a group-theoretic proof of Asada’s theorem, Groups Geom. Dyn. 5 (2011), 327–353.