R ENDICONTI
del
S EMINARIO M ATEMATICO
della
U NIVERSITÀ DI P ADOVA
J OHN C. L ENNOX
On soluble groups in which centralizers are finitely generated
Rendiconti del Seminario Matematico della Università di Padova, tome 96 (1996), p. 131-135
<http://www.numdam.org/item?id=RSMUP_1996__96__131_0>
© Rendiconti del Seminario Matematico della Università di Padova, 1996, tous droits réservés.
L’accès aux archives de la revue « Rendiconti del Seminario Matematico della Università di Padova » (http://rendiconti.math.unipd.it/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions).
Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit conte- nir la présente mention de copyright.
Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques
http://www.numdam.org/
in which Centralizers Are Finitely Generated.
JOHN C.
LENNOX (*)
The aim of this paper is to consider some evidence for an affirmative
answer to the
following question
of the author(see [3]):
is a soluble grouppolycyclic
if all centralizers of itsfinitely generated subgroups
are
finitely generated?
Of course all
subgroups
ofpolycyclic
groups arefinitely generated
and so the converse
question
has apositive
answer.We note that the
hypothesis implies
that the group inquestion
isfinitely generated.
In what follows we shall abbreviate
finitely generated
tof.g.
and ifG is a group we shall abbreviate the usual centralizer notation CG
(X)
toc(X)
where there is noambiguity
as to theidentity
of the group G withrespect
to which centralizers arebeing
taken.THEOREM A. A soluble group
of finite
rank ispolycyclic if
allcentralizers
of f.g. subgroups
aref.g.
Now soluble groups of finite rank are
nilpotent by
abelianby
finiteand so Theorem A is an immediate consequence of the somewhat
stronger
THEOREM B. that G is a
nilpotent by polycyclic
group in which the centralizerof
eachpolycyclic subgroup
isf.g.
Then G ispolycyclic.
(*) Indirizzo dell’A.: School of Mathematics,
University
of Wales, Cardiff, Wales, U.K.The author wishes to thank the Alexander von Humboldt
Stiftung
for aFellowship
and Professor Hermann Heineken of theUniversity
ofWurzburg
forhospitality during
thecompletion
of this work.132
As a further
corollary
of Theorem B we have that a soluble linear group ispolycyclic
if the centralizer of each of itspolycyclic subgroups
is
f.g.
We remark that the
hypothesis
of Theorem Bonly requires
the cen-tralizers of
polycyclic subgroups
to bef.g.
If we further weaken thishy- pothesis
torequire only
that centralizers ofcyclic suybgroups
aref.g.,
we have
THEOREM C.
Suppose
that G is an abelianby nilpotent
group in which the centralizerof
eachcyclic subgroup
isf.g.
Then G ispoly- cyclic.
This result is deduced in turn from
THEOREM D.
Suppose
that a group G has an abelian normal sub- group A such thatG/A is nilpotent
and CG(a)
isf.g. for
all a in A. ThenG is
polycyclic.
We do not know whether Theorems C and D hold if
«nilpotent»
isreplaced by «polycyclic».
Proof.
PROOF OF THEOREM B. We first of all need.
LEMMA 1.
Suppose
that G is a soluble group and thatc(X)
isf.g.
for
everypolycyclic subgroup
Xof
G. Then thisproperty
passes toG/P,
where P is a
polycyclic
normalsubgroup of
G.PROOF.
Suppose
thatL/P
=cG/p(H/P),
whereH/P
ispolycyclic.
Then L normalizes H.
Now nG (H)/cG (H)
is a soluble group of automor-phisms
of apolycyclic
group and is thereforepolycyclic by
Mal’cev’sTheorem. Since CG
(H)
isf.g.
and contained inL,
it now follows that L isf.g.,
asrequired.
We now
proceed
with theproof
of Theorem B and we suppose that G is af.g. nilpotent by polycyclic
group in whichcG (H)
isf.g.
for everypolycyclic subgroup H
of G. Let N be anilpotent
normalsubgroup
of Gsuch that
G/N
ispolycyclic.
Since G isf.g.
it is countable and so N iscountable.
Suppose
thatN = ~ a1, a2 , ... , an , ... ~.
SetUn
=(aI’ an).
Then
Un
isf.g. nilpotent
and sopolycyclic
and henceCn
=c( Un )
isf.g.
by hypothesis.
(*) Furthermore, CI N a C2 N :
... ~ ... sothat,
sinceG/N
ispolycyclic,
we must have that there exists apositive integer
kwith
I
finite for all r ; 1.We set K =
Ck
and consider V = coreg(KN).
SinceG/N
ispolycyclic,
it follows
by
a result of Rhemtulla[4],
that V is the intersection offinitely
manyconjugates
of KN.Suppose
that 01, ... , gs will do as theconjugating
elements andput x
= Thenai , ... , ak belong
to N andso there exists a
positive integer t
such thatUk
is contained inUt .
Itthen follows that
Ct ‘
Kx . HenceCt N ~
andusing (*)
we have that the lattersubgroup
contains Ka for somepositive integer
a. Since sis finite we deduce that
Kb
V for somepositive integer
b.Since K is
f.g.
soluble we have that isfinite,
so thatKN/V
is fi-nite
(note
that N ~V).
Now suppose that a is any element of N. Thencertainly c(a) N
for some c > 0. We also have forall g
in G that= V ~ Thus for any h in G
since
c(a) N.
SoK cb
centralizesaG N’ /N’ .
But
G/N’
is af.g.
abelianby polycyclic
group so,by
a theorem of P.Hall
[2], N/N’
isf.g.
as a G-module. It follows at once from the above that = M centralizesN/N’
for some w > 0.Moreover,
N isnilpotent
and we may
apply
a result of Robinson[5]
to deduce that[N,qM]
=1,
for some q > 0.
We now set W =
MZ,
where Z is the centre of N. Then W isf.g.
since it is of finite index in K and K is
f.g.
But[N, qM]
= 1 and so W is af.g. hypercentral by polycyclic
group. HenceW/Zq (W)
ispolycyclic.
Hence W is
polycyclic
and so Z is af.g.
abelian group.By
Lemma 1 thehypotheses
pass toG/Z
and induction on thenilpo- tency
class of Ncompletes
theproof.
PROOF OF THEOREM D. Here we shall need
LEMMA 2.
Suppose
that G is a group and A an abelian normalsubgroups of
G such thatG/A is polycyclic
and CG(a)
isfg. for
all a inA. Then
if B is
a normalsubgroup of
G contained inA,
we have thatfg. for
all a in A.PROOF. Set =
H/B,
so that A ~cG ( a ) ~
H.Moreover,
H/A
ispolycyclic
and CG(a)
isf.g. by hypothesis,
so that H isf.g.
andthe result follows.
We now
proceed
with theproof
of Theorem D and suppose that G is134
a
non-polycyclic
group with an abelian normalsubgroup
A such thatG/A
isnilpotent
andcG (a)
isf.g.
for all a in A. Thus G =cG ( 1 )
isf.g.
and so
by
Hall’s theorem A satisfies Max-G. This facttogether
withLemma 2 allows to assume that if B is a non-trivial normal
subgroup
ofG contained in A then
G/B
ispolycyclic.
From this it is not difficult to deduce that we may assume that G isjust non-polycyclic (j.n.p.):
foreither G is
j.n.p.
or there is a non-trivial normalsubgroup
N of G withG/N
notpolycyclic.
It follows that N n A = 1 and so N ispolycyclic.
InG/N
we have[ gN, aN]
= 1 if andonly
if[ g, a]
E N n A = 1. ThusG/N
inherits the
hypothesis
in an obvious way. Since G satisfies Max-n wemay factor out the maximal such N and so assume G is
j.n.p.
asstated.
By
results of Groves[1] (or
Robinson and Wilson[6])
there are twocases that arise:
Case 1. A is torsion free of finite rank.
Case 2. A has finite
exponent
aprime
p.In Case 1
(see [6])
G is a finite extension of af.g.
metabelian group.It not hard to see that we can come down to a
subgroup
of finite indexand assume that G is metabelian.
(If
the new group is notj.n.p.
we canrepeat
theargument
and assume that itis).
But then CG(a)
is normal in G for all a in A. Hencea G
is contained in the centre of thef.g.
metabelian group
cG (a)
and so,again by
Hall’stheorem, aG
isf.g.
as anabelian group. But G is
j.n.p.
and soG/aG
ispolycyclic.
Hence G ispoly- cyclic,
a contradiction.So we may assume that we case in Case 2. Put C =
cG (A).
ThenG/C
is
nilpotent.
LetZ/C
the centre ofG/C. By
Hall’s theorem A is the nor-mal closure in G of
finitely
many elements al , ... , an , say. Denote CG( ai ) by Ci .
TheCi
contains C and is normalizedby Z,
since[Z, G]
C.Hence
Ci]
= 1. ButCi
isf.g.
abelianby nilpotent
and soby
theusual
argument
its centre and hence is af.g.
abelian group and therefore is finite since it is a p-group. It follows that the normal clo-sure B of
(ai , ... , an)
under Z is finite.Furthermore,
C ;Z,
sothat D = is normal in G.
However,
1 =[B, D]
=[B, D]G
=[A, D]
so that D = C.Thus
Z/C
=Z/D
embeds inAut B,
which is a finite group. There- foreZ/C
is finite. ButG/C
is af.g. nilpotent
group and hence is finite.Thus C is
f.g.
and abelianby nilpotent. By
a finalapplication
of Hall’sresult,
the centre of C isf.g.
Hence A isf.g.
and so G ispolycyclic,
acontradiction.
REFERENCES
[1] J. GROVES, Soluble groups with every proper
quotient polycyclic,
Illinois J.Math., 22 (1978), pp. 90-95.
[2] P. HALL, Finiteness conditions
for
soluble groups, Proc. London Math. Soc., (3) 4 (1954), pp. 419-436.[3] J. C. LENNOX,
Centrality
in soluble groups,Proceedings
«InfiniteGroups
1994», deGruyter,
Berlin, 1996.[4] A. H. RHEMTULLA, A
minimality
propertyof polycyclic
groups, J. London Math. Soc., 42 (1967), pp. 456-462.[5] D. J. S. ROBINSON, A property
of the
lower central seriesof a
group, Math. Z.,107 (1968), pp. 225-231.
[6] D. J. S. ROBINSON - J. S. WILSON, Ssoluble groups with many
polycyclic
quo-tients, Proc. London Math. Soc., (3) 48 (1984), pp. 193-229.
Manoscritto pervenuto in redazione il 23 febbraio 1995.