R ENDICONTI
del
S EMINARIO M ATEMATICO
della
U NIVERSITÀ DI P ADOVA
J OHN C. L ENNOX
J AMES W IEGOLD
A result about cosets
Rendiconti del Seminario Matematico della Università di Padova, tome 93 (1995), p. 185-186
<http://www.numdam.org/item?id=RSMUP_1995__93__185_0>
© Rendiconti del Seminario Matematico della Università di Padova, 1995, 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/
A Result About Cosets.
JOHN C. LENNOX - JAMES WIEGOLD
(*) (*)
Marking
some final year honours exercises onright
coset represen- tations has led us to thefollowing problem:
When is it the case that every proper non-trivial
subgroup
Hof
afi-
nite group G has a coset Hx
consisting of
elementsof
one and the sameorder
a(x, H)?
We call finite groups with this
property CSO-groups.
It is not sur-prising
thatCSO-groups
are rare.However, they
are nothugely
un-common either.
THEOREM. A soluble group G is a
CSO-group
if andonly
if G is ap-group and
GB~( G )
consists of elements of the same order.Therefore,
for every soluble
CSO-group,
there exists a number «depending only
on G such that every proper non-trivial
subgroup
has a coset Hx con-sisting
of elements of order a.Solubility
is an essentialingredient
in ourproof.
Indeed we wouldmake the
following
CONJECTURE.
Every CSO-group
is soluble.Quite possibly,
one would need the classification theorem forsimple
groups to
verify
this! It is easy to see that thealternating
groups of de- gree more than 4 are notCSO-groups.
Turning
now to theproof
of thetheorem,
let G be a soluble CSO-(*) Indirizzo
degli
A.A.: School of Mathematics,University
of Wales,College
of Cardiff, Cardiff CF2 4YH, U.K.
186
group and M a maximal normal
subgroup.
Then M is ofprime
index p, say, and there is a coset Mxconsisting
of elements of the same order.Since x has order p mod
M, x
must have p-power orderp t ,
say, so that Mx consists of elements of that order.We claim that
GBM
consists of elements oforder p~.
To seethis,
con-sider any coset
Mxi
with 1 ~ i p: every element ofGBM
is in such acoset.
Let j
be apositive integer
suchthat ji = 1 mod p.
For every ele-ment
mx
ofMXi,
we have(mx i )
= m’ x for some m’ E M. But m’x hasorder p~;
since( j , p)
=1,
so doesmx i .
Thus
GBM
consists of elements of orderp t .
Asimple
count showsthat every maximal normal
subgroup
N must have the sameindex p
asM and that the elements of
GBN
have orderp t .
ThereforeG/G’
is ap-group.
We claim that G is a p-group. If
not,
we can choose a non-trivial Hallp’-subgroup Q
of G inside G’ and aSylow p-subgroup
Ppermuting
withQ,
so that G =PQ. By
theCSO-property,
P has a cosetPy consisting
ofelements of
p’-order.
ThusPy
cG ’ ; since y
EG ’ ,
we have P c G’ andG =
G’ ,
a contradiction. Thus G is a p-group afterall,
andby
the firstpart
of theproof, G)4l(G)
consists of elements of the same orderpt=a.
Conversely,
let G be a p-group such thatGBO(G)
consists of ele-ments of the same order «. Let H be a proper non-trivial
subgroup
andM a maximal
subgroup containing
H. For x EGBM
we have Hx cGBM,
so that Hx consists of elements of order «, as
required.
Thiscompletes
the
proof.
Obvious
examples
ofCSO-groups
are groups ofprime exponent.
Less obvious are the second
nilpotent products
ofcyclic
p-groups of thesame odd order. A full classification is
probably
out of the ques- tion.Manoscritto pervenuto in redazione il 28 settembre 1993.