Classes Of Finite Groups Mathematics And Its

Applications 1st Edition Adolfo

Ballesterbolinches download

https://ebookbell.com/product/classes-of-finite-groups-
mathematics-and-its-applications-1st-edition-adolfo-
ballesterbolinches-2143840

Explore and download more ebooks at ebookbell.com

Here are some recommended products that we believe you will be
interested in. You can click the link to download.

Classes Of Finite Groups 1st Edition Adolfo Ballesterbolinches

https://ebookbell.com/product/classes-of-finite-groups-1st-edition-
adolfo-ballesterbolinches-985864

Structure Theory For Canonical Classes Of Finite Groups 1st Wenbin Guo

https://ebookbell.com/product/structure-theory-for-canonical-classes-
of-finite-groups-1st-wenbin-guo-5087296

Characteristic Classes And Cohomology Of Finite Groups 1st Edition C B

Thomas

https://ebookbell.com/product/characteristic-classes-and-cohomology-
of-finite-groups-1st-edition-c-b-thomas-882674

A Study Of Nonfinite Clauses In English A Systemic Functional Approach

https://ebookbell.com/product/a-study-of-nonfinite-clauses-in-english-
a-systemic-functional-approach-50544086
Nonfinite Complementation A Usagebased Study Of Infinitive And Ing
Clauses In English Thomas Egan

https://ebookbell.com/product/nonfinite-complementation-a-usagebased-
study-of-infinitive-and-ing-clauses-in-english-thomas-egan-1389422

Classes Of Good Noetherian Rings Cristodor Ionescu

https://ebookbell.com/product/classes-of-good-noetherian-rings-
cristodor-ionescu-49457282

Classes Of Directed Graphs 1st Ed 2018 Jrgen Bangjensen Gregory Gutin

https://ebookbell.com/product/classes-of-directed-graphs-1st-
ed-2018-jrgen-bangjensen-gregory-gutin-51157758

Classes Of Ladies Of Cloistered Spaces Writing Feminist History

Through Biography In Findesiecle Egypt Marilyn Booth

https://ebookbell.com/product/classes-of-ladies-of-cloistered-spaces-
writing-feminist-history-through-biography-in-findesiecle-egypt-
marilyn-booth-51973182

Classes Of Directed Graphs Bangjensen Jrgen Gutin Gregory

https://ebookbell.com/product/classes-of-directed-graphs-bangjensen-
jrgen-gutin-gregory-7112342
Classes of Finite Groups
Mathematics and Its Applications

Managing Editor:

M. HAZEWINKEL
Centre for Mathematics and Computer Science, Amsterdam, The Netherlands

Volume 584
Classes of Finite Groups

by

Adolfo Ballester-Bolinches
Universitat de València,
València, Spain

and

Luis M. Ezquerro
Universidad Pública de Navarra,
Pamplona, Spain
A C.I.P. Catalogue record for this book is available from the Library of Congress.

ISBN-10 1-4020-4718-5 (HB)

ISBN-13 978-1-4020-4718-3 (HB)
ISBN-10 1-4020-4719-3 (e-book)
ISBN-13 978-1-4020-4719-0 (e-book)

Published by Springer,
P.O. Box 17, 3300 AA Dordrecht, The Netherlands.

www.springer.com

Printed on acid-free paper

All Rights Reserved

© 2006 Springer
No part of this work may be reproduced, stored in a retrieval system, or transmitted
in any form or by any means, electronic, mechanical, photocopying, microfilming, recording
or otherwise, without written permission from the Publisher, with the exception
of any material supplied specifically for the purpose of being entered
and executed on a computer system, for exclusive use by the purchaser of the work.

Printed in the Netherlands.

For the ones we love:
Fran, Isabel, Eneko
Contents

Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix

1 Maximal subgroups and chief factors . . . . . . . . . . . . . . . . . . . . . . 1

1.1 Primitive groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 A generalisation of the Jordan-Hölder theorem . . . . . . . . . . . . . . 40
1.3 Crowns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
1.4 Systems of maximal subgroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73

2 Classes of groups and their properties . . . . . . . . . . . . . . . . . . . . . 87

2.1 Classes of groups and closure operators . . . . . . . . . . . . . . . . . . . . . 87
2.2 Formations: Basic properties and results . . . . . . . . . . . . . . . . . . . . 91
2.3 Schunck classes and projectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
2.4 Fitting classes, Fitting sets, and injectors . . . . . . . . . . . . . . . . . . . 109
2.5 Fitting formations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118

3 X-local formations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125

3.1 X-local formations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
3.2 A generalisation of Gaschütz-Lubeseder-Schmid-Baer theorem . . 144
3.3 Products of X-local formations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
3.4 ω-local formations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163

4 Normalisers and prefrattini subgroups . . . . . . . . . . . . . . . . . . . . . 169

4.1 H-normalisers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171
4.2 Normalisers of groups with soluble residual . . . . . . . . . . . . . . . . . 179
4.3 Subgroups of prefrattini type . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 190

5 Subgroups of soluble type . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205

5.1 Subgroup functors and subgroups of soluble type: elementary
properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 206
5.2 Existence criteria . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
5.3 Projectors of soluble type . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 224

vii
viii Contents

6 F-subnormality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235
6.1 Basic properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235
6.2 F-subnormal closure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239
6.3 Lattice formations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
6.4 F-subnormal subgroups and F-critical groups . . . . . . . . . . . . . . . . 265
6.5 Wielandt operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285

7 Fitting classes and injectors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 309

7.1 A non-injective Fitting class . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 309
7.2 Injective Fitting classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 315
7.3 Supersoluble Fitting classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 329
7.4 Fitting sets, Fitting sets pairs, and outer Fitting sets pairs . . . . 339

References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 355

List of symbols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 367

Index of authors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 371

Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375
Preface

. . . [El caballero andante] ha de saber las matemáticas,

porque a cada paso se le ofrecerá tener necesidad dellas; . . .

Miguel de Cervantes Saavedra

Segunda parte del ingenioso caballero
don Quijote de la Mancha, chapter 18

In the sixties and seventies of the last century, in parallel to the tremend-
ous effort to classify the simple groups, a large number a papers created a
beautiful and comprehensive view of finite soluble groups. In 1980, when the
classification was almost completed, Helmut Wielandt proposed giving pri-
ority after the classification to the extension of these brilliant results of the
theory of finite soluble groups to the more ambitious universe of all finite
groups.
Almost at the same time Klaus Doerk and Trevor Hawkes started to write a
volume gathering, ordering, and systematising the rich stuff of soluble groups.
This encyclopedic work took more than ten years to accomplish. The public-
ation of Finite soluble groups (De Gruyter, 1992) is a crucial milestone in the
history of the development of the theory of classes of finite soluble groups. In
fact lots of separate pieces of the manuscript, generously distributed by the
authors to all interested specialists, had a strong influence on the research of
the area even before the publication of the volume.
In the last decade, the Doerk-Hawkes’ book has been one of the most
powerful tools for undertaking Wielandt’s task. The consequence is an im-
pressive flourishing of ideas, methods and results illuminating the structure of
finite groups. Furthermore, this process has produced a new arithmetic-free
approach to understand some aspects of the soluble case.
We believe that there is already a lot of work published in this area and
consequently there is a need for a detailed account of the theory of classes of

ix
x Preface

groups in the general finite universe. The present book represents an attempt
to meet this need.
Our main objective in this book is to present the latest achievements
and investigations continuing the Doerk-Hawkes book to enlarge and adapt
the methods of the soluble case to classes of finite non-necessarily soluble,
according to Wielandt’s proposal.
The contents of the book are organised in seven chapters. Chapter 1 begins
with primitive groups and crowns. These concepts are central to our approach.
It continues with the study of solid sets and systems of maximal subgroups.
They are, together with the generalised Jordan-Hölder theorem, the ingredi-
ents combined to introduce the prefrattini subgroups in Chapter 4. Chapter 2
contains definitions, and elementary and basic results on classes of groups.
Chapter 3 deals with partially saturated formations. A unified extension of the
theorems of Gaschütz-Lubeseder-Schmid and Baer on the local character of
the saturated and solubly saturated formations is presented there. Normalisers
associated with Schunck classes H of the form EΦ F for some formation F and
prefrattini subgroups associated to arbitrary Schunck classes are studied in
Chapter 4, whereas Chapter 5 is devoted to presenting an alternative approach
to a theory of projectors and covering subgroups in arbitrary finite groups re-
sembling the corresponding theory in finite soluble groups. It is based on
Salomon’s Dissertation Strukturerhaltende Untergruppen, Schunckklassen und
extreme Klassen endlicher Gruppen, Johannes Gutenberg-Universität, Mainz,
1987. Subnormal subgroups associated to formations are the main theme of
Chapter 6. This concept was introduced by Hawkes in 1969 in the soluble
universe and it turns out to be very useful in the study of the structure of
finite groups. The last chapter contains some of the recent developments of
the theory of Fitting classes, focusing our attention on injective Fitting classes
and supersoluble Fitting classes. In particular, a detailed account of Salomon’s
unpublished example of a non-injective Fitting class is included.
To end this preface, we would like to pay a tribute to the figure of Pro-
fessor Klaus Doerk, recently deceased. Without Doerk and his research team’s
collaboration, this book would have never ever come to be.

Acknowledgements

We would like to conclude by expressing our deepest gratitude to Ramón

Esteban-Romero for his patient work with our manuscripts. His knowledge on
this book’s issues as well as his master skills on the use of TEX made him the
best helper for the meticulous task of editing this book.
We would also like to thank Homer Bechtell, John Cossey, Arny Feld-
man, Marı́a Jesús Iranzo, Paz Jiménez-Seral, Carmen Lacasa-Esteban,
Julio Lafuente, Inmaculada Lizasoain, Marı́a del Carmen Pedraza-Aguilera,
Tatiana Pedraza and Francisco Pérez-Monasor for their valious collaborations,
as well as to the Ministerio de Educación y Ciencia (Spanish Government)
 Preface xi

and FEDER (European Union) for their financial support via the grants
MTM2004-08219-C02-01 and MTM2004-08219-C02-02.
To conclude, we must thank Springer for converting this project into a
reality and for their continuous patience and help while writing this book.

Torres-Torres, A. Ballester-Bolinches
Pamplona, Luis M. Ezquerro
January, 2006
1
Maximal subgroups and chief factors

1.1 Primitive groups

This book, devoted to classes of finite groups, begins with the study of a class,
the class of primitive groups, with no hereditary properties, the usual require-
ment for a class of groups, but whose importance is overwhelming to under-
stand the remainder. We shall present the classification of primitive groups
made by R. Baer and the refinement of this classification known as the O’Nan-
Scott Theorem. The book of H. Kurzweil and B. Stellmacher [KS04], recently
appeared, presents an elegant proof of this theorem. Our approach includes
the results of F. Gross and L. G. Kovács on induced extensions ([GK84])
which are essential in some parts of this book.
We will assume our reader to be familiar with the basic concepts of per-
mutation representations: G-sets, orbits, faithful representation, stabilisers,
transitivity, the Orbit-Stabiliser Theorem, . . . (see [DH92, A, 5]). In partic-
ular we recall that the stabilisers of the elements of a transitive G-set are
conjugate subgroups of G and any transitive G-set Ω is isomorphic to the
G-set of right cosets of the stabiliser of an element of Ω in G.

Definition 1.1.1. Let G be a group and Ω a transitive G-set. A subset Φ ⊆ Ω

is said to be a block if, for every g ∈ G, we have that Φg = Φ or Φg ∩ Φ = ∅.

Given a G-set Ω, trivial examples of blocks are ∅, Ω and any subset with
a single element {ω}, for any ω ∈ Ω. In fact, these are called trivial blocks.

Proposition 1.1.2. Let G be a group which acts transitively on a set Ω and

ω ∈ Ω. There exists a bijection

{block Φ of Ω : ω ∈ Φ} −→ {H ≤ G : Gω ≤ H}

which preserves the containments.

1
2 1 Maximal subgroups and chief factors

Proof. Given a block Φ in Ω such that ω ∈ Φ, then GΦ = {g ∈ G : Φg = Φ} is

a subgroup of G and the stabiliser Gω is a subgroup of GΦ . Conversely, if H
is a subgroup of G containing Gω , then the set Φ = {ω h : h ∈ H} is a block
and ω ∈ Φ. These are the mutually inverse bijections required. 

The following result is well-known and its proof appears, for instance, in
Huppert’s book [Hup67, II, 1.2].
Theorem 1.1.3. Let G be a group which acts transitively on a set Ω and
assume that Φ is a non-trivial block of the action of G on Ω. Set H = {g ∈
G : Φg = Φ}. Then H is a subgroup of G.
Let T be a right transversal of H in G. Then
1. {Φt : t ∈ T } is a partition of Ω.
2. We have that |Ω| = |T ||Φ|. In particular |Φ| divides |Ω|.
3. The subgroup H acts transitively on Φ.
Notation 1.1.4. If H is a subgroup of a group G, the core of H in G is the
subgroup

CoreG (H) = Hg.
g∈G

Along this chapter, in order to make the notation more compact, the core of
a subgroup H in a group G will often be denoted by HG instead of CoreG (H).
Theorem 1.1.5. Let G be a group. The following conditions are equivalent:
1. G possesses a faithful transitive permutation representation with no non-
trivial blocks;
2. there exists a core-free maximal subgroup of G.
Proof. 1 implies 2. Suppose that there exists a transitive G-set Ω with no
non-trivial blocks and consider any ω ∈ Ω. The action of G on Ω is equivalent
to the action of G on the set of right cosets of Gω in G. The kernel of this
action is CoreG (Gω ) and, by hypothesis, is trivial. By Proposition 1.1.2, if H
is a subgroup containing Gω , there exists a block Φ = {ω h : h ∈ H} of Ω such
that ω ∈ Φ and H = GΦ = {g ∈ G : Φg = Φ}. Since G has no non-trivial
blocks, either Φ = {ω} or Φ = Ω. If Φ = {ω}, then Gω = H and if Φ = Ω,
then H = GΩ = G. Hence the stabiliser Gω is a core-free maximal subgroup
of G.
2 implies 1. If U is a core-free maximal subgroup of G, then the action of G
on the set of right cosets of U in G is faithful and transitive. By maximality
of U , this action has no non-trivial blocks by Proposition 1.1.2. 

Definitions 1.1.6. A a faithful transitive permutation representation of a
group is said to be primitive if it does not have non-trivial blocks.
A primitive group is a group which possesses a primitive permutation rep-
resentation. Equivalently, a group is primitive if it possesses a core-free
maximal subgroup.
 1.1 Primitive groups 3

A primitive pair is a pair (G, U ), where G is a primitive group and U a

core-free maximal subgroup of G,
Each conjugacy class of core-free maximal subgroups affords a faithful
transitive and primitive permutation representation of the group. Thus, in
general, it is more precise to speak of primitive pairs. Consider, for instance,
the alternating group of degree 5, G = Alt(5). There exist three conjugacy
classes of maximal subgroups, namely the normalisers of each type of Sylow
subgroup. Obviously all of them are core-free. This gives three non-equivalent
primitive representations of degrees 5 (for the normalisers of the Sylow 2-
subgroups), 10 (for the normalisers of the Sylow 3-subgroups) and 6 (for the
normalisers of the Sylow 5-subgroups).
The remarkable result that follows, due to R. Baer, classifies all primitive
groups (a property defined in terms of maximal subgroups) according to the
structure of the socle, i.e. the product of all minimal normal subgroups.
Theorem 1.1.7 ([Bae57]).
1. A group G is primitive if and only if there exists a subgroup M of G such
that G = M N for all minimal normal subgroups N of G.
2. Let G be a primitive group. Assume that U is a core-free maximal subgroup
of G and that N is a non-trivial normal subgroup of G. Write C = CG (N ).
Then C ∩ U = 1. Moreover, either C = 1 or C is a minimal normal
subgroup of G.
3. If G is a primitive group and U is a core-free maximal subgroup of G,
then exactly one of the following statements holds:
a) Soc(G) = S is a self-centralising abelian minimal normal subgroup
of G which is complemented by U : G = U S and U ∩ S = 1.
b) Soc(G) = S is a non-abelian minimal normal subgroup of G which is
supplemented by U : G = U S. In this case CG (S) = 1.
c) Soc(G) = A × B, where A and B are the two unique minimal normal
subgroups of G and both are complemented by U : G = AU = BU and
A ∩ U = B ∩ U = A ∩ B = 1. In this case A = CG (B), B = CG (A),
and A, B and AB ∩ U are non-abelian isomorphic groups.
Proof. 1. If G is a primitive group, and U is a core-free maximal subgroup
of G, then it is clear that G = U N for every minimal normal subgroup N
of G. Conversely, if there exists a subgroup M of G, such that G = M N for
every minimal normal subgroup N of G and U is a maximal subgroup of G
such that M ≤ U , then U cannot contain any minimal normal subgroup of G,
and therefore U is a core-free maximal subgroup of G.
2. Since U is core-free in G, we have that G = U N . Since N is normal,
then C is normal in G and then C ∩ U is normal in U . Since C ∩ U centralises
N , then C ∩ U is in fact normal in G. Therefore C ∩ U = 1.
If C = 1, consider a minimal normal subgroup X of G such that X ≤ C.
Since X is not contained in U, then G = XU. Then C = C∩XU = X(C∩U) = X.
4 1 Maximal subgroups and chief factors

3. Let us assume that N1 , N2 , and N3 are three pairwise distinct minimal

normal subgroups. Since N1 ∩ N2 = N1 ∩ N3 = N2 ∩ N3 = 1, we have that
N2 ×N3 ≤ CG (N1 ). But then CG (N1 ) is not a minimal normal subgroup of G,
and this contradicts 2. Hence, in a primitive group there exist at most two
distinct minimal normal subgroups.
Suppose that N is a non-trivial abelian normal subgroup of G. Then N ≤
CG (N ). Since by 2, CG (N ) is a minimal normal subgroup of G, we have that
N is self-centralising. Thus, in a primitive group G there exists at most one
abelian minimal normal subgroup N of G. Moreover, G = N U and N is
self-centralising. Then N ∩ U = CG (N ) ∩ U = 1.
If there exists a unique minimal non-abelian normal subgroup N , then
G = N U and CG (N ) = 1.
If there exist two minimal normal subgroups A and B, then A ∩ B = 1
and then B ≤ CG (A) and A ≤ CG (B). Since CG (A) and CG (B) are minimal
normal subgroups, we have that B = CG (A) and A = CG (B). Now A ∩ U =
CG (B) ∩ U = 1 and B ∩ U = CG (A) ∩ U = 1. Hence G = AU = BU .
Since A = CG (B), it follows that B is non-abelian. Analogously we have
that A is non-abelian.
By the Dedekind law [DH92, I, 1.3], we have A(AB ∩ U ) = AB = B(AB ∩
U ). Hence A ∼ = A/(A ∩ B) ∼
= AB/B ∼ = B(AB ∩ U )/B = AB ∩ U . Analogously
∼
B = AB ∩ U . 


Baer’s theorem enables us to classify the primitive groups as three different

types.

Definition 1.1.8. A primitive group G is said to be

1. a primitive group of type 1 if G has an abelian minimal normal subgroup,
2. a primitive group of type 2 if G has a unique non-abelian minimal normal
subgroup,
3. a primitive group of type 3 if G has two distinct non-abelian minimal
normal subgroups.
We say that G is a monolithic primitive group if G is a primitive group of
type 1 or 2.

Definition 1.1.9. Let U be a maximal subgroup of a group G. Then U/UG is

a core-free maximal subgroup of the quotient group G/UG . Then U is said to
be
1. a maximal subgroup of type 1 if G/UG is a primitive group of type 1,
2. a maximal subgroup of type 2 if G/UG is a primitive group of type 2,
3. a maximal subgroup of type 3 if G/UG is a primitive group of type 3.
We say that U is a monolithic maximal subgroup if G/UG is a monolithic
primitive group.
 1.1 Primitive groups 5

Obviously all primitive soluble groups are of type 1. For these groups, there
exists a well-known description called Galois’ theorem. The proof appears in
Huppert’s book [Hup67, II, 3.2 and 3.3].

Theorem 1.1.10. 1. (Galois) If G is a soluble primitive group, then all core-

free maximal subgroups are conjugate.
2. If N is a self-centralising minimal normal subgroup of a soluble group G,
then G is primitive, N is complemented in G, and all complements are
conjugate.

Remarks 1.1.11. 1. The statement of Theorem 1.1.10 (1) is also valid if G

is p-soluble for all primes dividing the order of Soc(G).
2. If G is a primitive group of type 1, then its minimal normal subgroup
N is an elementary abelian p-subgroup for some prime p. Hence, N is a vector
space over the field GF(p). Put dim N = n, i.e. |N | = pn . If M is a core-free
subgroup of G, then M is isomorphic to a subgroup of Aut(N ) = GL(n, p).
Therefore G can be embedded in the affine group AGL(n, p) = [Cpn ] GL(n, p)
in such a way that N is the translation group and G∩GL(n, p) acts irreducibly
on N . Thus, clearly, primitive groups of type 1 are not always soluble.
3. In his book B. Huppert shows that the affine group AGL(3, 2) = [C2 ×
C2 × C2 ] GL(3, 2) is an example of a primitive group of type 1 with non-
conjugate core-free maximal subgroups (see [Hup67, page 161]).
4. Let G be a primitive group of type 2. If N is the minimal normal
subgroup of G, then N is a direct product of copies of some non-abelian simple
group and, in particular, the order of N has more than two prime divisors. If p
is a prime dividing the order of N and P ∈ Sylp (N ), then G = NG (P )N by the
Frattini argument. Since P is a proper subgroup of N , then NG (P ) is a proper
subgroup of G. If U is a maximal subgroup of G such that NG (P ) ≤ U , then
necessarily U is core-free. Observe that if P0 ∈ Sylp (G) such that P ≤ P0 ,
then P = P0 ∩ N is normal in P0 and so P0 ≤ U . In other words, U has
p -index in G. This argument can be done for each prime dividing |N |. Hence,
the set of all core-free maximal subgroups of a primitive group of type 2 is
not a conjugacy class.
5. In non-soluble groups, part 2 of Theorem 1.1.10 does not hold in general.
Let G be a non-abelian simple group, p a prime dividing |G| and P ∈ Sylp (G).
Suppose that P is cyclic. Let GΦ,p be the maximal Frattini extension of G with
p-elementary abelian kernel A = Ap (G) (see [DH 92; Appendix β] for details
of this construction). Write J = J(KG) for the Jacobson radical of the group
algebra KG of G, over the field K = GF(p). Then the section N = A/AJ
is irreducible and CG (N ) = Op
,p (G) = 1. Consequently GΦ,p /AJ is a group
with a unique minimal normal subgroup, isomorphic to N , self-centralising
and non-supplemented.

In primitive groups of type 1 or 3, the core-free maximal subgroups com-

plement each minimal subgroup. This characterises these types of primitive
groups. In case of primitive groups of type 2 we will see later that the minimal
6 1 Maximal subgroups and chief factors

normal subgroup could be complemented by some core-free maximal subgroup

in some cases; but even then, there are always core-free maximal subgroups
supplementing and not complementing the socle.

Proposition 1.1.12 ([Laf84a]). For a group G, the following are pairwise

equivalent:
1. G is a primitive group of type 1 or 3;
2. there exists a minimal normal subgroup N of G complemented by a sub-
group M which also complements CG (N );
3. there exists a minimal normal subgroup
 N of G such that G is isomorphic
to the semidirect product X = [N ] G/ CG (N ) .

Proof. Clearly 1 implies 2. For 2 implies 1 observe that, since N ∩ MG = 1,

then MG ≤ CG (N ). But, since also MG ∩ CG (N ) = 1, we have that MG =
1. Suppose that S is a proper subgroup of G such that M ≤ S. Then the
subgroup S ∩ N is normal in S and is centralised by CG (N ). Hence S ∩ N is
normal in S CG (N ) = G. By minimality of N , we have that S ∩ N = 1 and
then S = M . Then M is a core-free maximal subgroup of G and the group G
is primitive. Observe that the minimal normal subgroup of a primitive group
of type 2 has trivial centraliser.
2 implies 3. Observe that G = NM , with N ∩M = 1, and ∼
 M = G/ C  G (N ).
The map α : G −→ [N ] G/ CG (N ) given by (nm) = n, m CG (N ) is the
α

desired isomorphism.
3 implies 2. Write C = CG (N ). Assume that there exists an isomorphism

α : [N ](G/C) −→ G
 α
and consider the following subgroups N ∗ = {(n, C) : n ∈ N } , M ∗ =
 α  α
{(1, gC) : g ∈ G} , and C ∗ = {(n, gC) : ng ∈ C} . For each n ∈ N ,
the element (n , nC) is a non-trivial element of C . Hence C ∗ = 1. It is
−1 α ∗

an easy calculation to show that N ∗ is a minimal normal subgroup of G,

C ∗ = CG (N ∗ ) and M ∗ complements N ∗ and C ∗ . 


Corollary 1.1.13. The following conditions for a group G are equivalent:

1. G is a primitive group of type 3.
2. The group G possesses two distinct minimal normal subgroups N1, N2,
such that
a) N1 and N2 have a common complement in G;
b) the quotient groups G/Ni , for i = 1, 2, are primitive groups of type 2.

Proof. 1 implies 2. By Theorem 1, if G is a primitive group of type 3, then G

possesses two distinct minimal normal subgroups N1 , N2 which have a com-
mon complement M in G. Observe that M ∼ = G/N1 and N2 N1 /N1 is a minimal
normal subgroup of G/N1 . If gN1 ∈ CG/N1 (N2 N1 /N1 ), then [n, g] ∈ N1 , for all
n ∈ N2 . But then [n, g] ∈ N1 ∩N2 = 1, and therefore g ∈ CG (N2 ) = N1 . Hence
 1.1 Primitive groups 7

CG/N1 (N2 N1 /N1 ) = 1. Consequently G/N1 is a primitive group of type 2 and

therefore so are M and G/N2 .
2 implies 1. Let M be a common complement of N1 and N2 . Then
G/Ni ∼= M is a primitive group of type 2 such that Soc(G/Ni ) = N1 N2 /Ni
and CG (N1 N2 /Ni ) = Ni . Therefore CG (N2 ) = N1 and CG (N1 ) = N2 . By
Proposition 1.1.12, this means that G is a primitive group of type 3. 


Proposition 1.1.14 ([Laf84a]). For a group G, the following statements are

pairwise equivalent.
1. G is a primitive group of type 2.
2. G possesses a minimal normal subgroup N such that CG (N ) = 1.
3. There exists a primitive group X of type 3 such that G ∼
= X/A for a
minimal normal subgroup A of X.

Proof. 3 implies 2 is Corollary 1.1.13 and 2 implies 1 is the characterisation

of primitive groups of type 2 in Theorem 1. Thus it only remains to prove
that 1 implies 3. If G is a primitive group of type 2 and N is the unique
minimal normal subgroup of G, then N is non-abelian and CG (N ) = 1. By
Proposition 1.1.12, the semidirect product X = [N ]G is a primitive group of
type 3. Clearly if A = {(n, 1) : n ∈ N }, then X/A ∼
= G. 


Consequently, if M is a core-free maximal subgroup of a primitive group

G of type 3, then M is a primitive group of type 2 and Soc(M ) is isomorphic
to a minimal normal subgroup of G.
According to Baer’s Theorem, the socle of a primitive group of type 2 is
a non-abelian minimal normal subgroup and therefore is a direct product of
copies of a non-abelian simple group (see [Hup67, I, 9.12]). Obviously, the
simplest examples of primitive groups of type 2 are the non-abelian simple
groups. Observe that if S is a non-abelian simple group, then Z(S) = 1 and
we can identify S and the group of inner automorphisms Inn(S) and write
S ≤ Aut(S). Since CAut(S) (S) = 1, any group G such that S ≤ G ≤ Aut(S)
is a primitive group of type 2 such that Soc(G) is a non-abelian simple group.
Conversely, if G is a primitive group of type 2 and S = Soc(G) is a simple
group, then, since CG (S) = 1, we can embed G in Aut(S).

Definition 1.1.15. An almost simple group G is a subgroup of Aut(S) for

some simple group S, such that S ≤ G.

If G is an almost simple group and S ≤ G ≤ Aut(S), for a non-abelian

simple group S, then CG (S) = 1. Hence G possesses a unique minimal normal
subgroup S and every maximal subgroup U of G such that S ≤ U is core-free
in G.

Proposition 1.1.16. Suppose that S is a non-abelian simple group and let

G be an almost simple group such that S ≤ G ≤ Aut(S). If U is a core-free
maximal subgroup of G, then U ∩ S = 1.
8 1 Maximal subgroups and chief factors

Proof. Recall Schreier’s conjecture ([KS04, page 151]) which states that the
group of outer automorphisms Out(S) = Aut(S)/ Inn(S) of a non-abelian
simple group S is always soluble. The classification of simple groups has
allowed us to check that this conjecture is true.
Suppose that U ∩ S = 1. We know that U ∼ = U S/S ≤ Aut(S)/ Inn(S) and,
by Schreier’s conjecture ([KS04, page 151]) we deduce that U is soluble. Let Q
be a minimal normal subgroup of U . Then Q is an elementary abelian q-group
for some prime q. Observe that CG (Q) is normalised by U . Therefore CS (Q)
is normalised by U and then U CS (Q) is a subgroup of G. Since U is maximal
in G and CG (S) = 1, then CS (Q) = 1. The q-group Q acts fixed-point-freely
on S and then S is a q  -group. By the Odd Order Theorem ([FT63]), we have
that q = 2. Now Q acts by conjugation on the elements of the set Syl2 (S) and
by the Orbit-Stabiliser Theorem ([DH92, A, 5.2]) we deduce that Q normalises
−1
some P ∈ Syl2 (S). If P and P x , for x ∈ S, are two Sylow 2-subgroups of
S which are normalised by Q, then Q, Qx ∈ Sylq NQS (P ) and there exists
an element g ∈ NQS (P ), such that Qg = Qx . Write g = yz, with y ∈ Q
and z ∈ S. Then Qx = Qz with z ∈ NS (P ). Hence [Q, xz −1 ] ≤ Q ∩ S = 1
and xz −1 ∈ CS (Q) = 1. Therefore x = z ∈ NS (P ) and we conclude that Q
normalises exactly one Sylow 2-subgroup P of S. Hence NG (Q) ≤ NG (P ).
But U = NG (Q), by maximality of U . The subgroup U P is a proper subgroup
of G which contains properly the maximal subgroup U . This is a contradiction.
Hence U ∩ S = 1. 


For our purposes, it will be necessary to embed the primitive group G in

a larger group. Suppose that Soc(G) = S1 × · · · × Sn , where the Si are copies
of a non-abelian simple ∼ n
 group  S, i.e. Soc(G) = S , the direct product ofn n
copies of S. Since CG Soc(G) = 1, the group G can be embedded in Aut(S ).
The automorphism group of a direct product of copies of a non-abelian simple
group has a well-known structure: it is a wreath product.
Thus, the study of some relevant types of subgroups of groups which are
wreath products and the analysis of some special types of subgroups of a
direct product of isomorphic non-abelian simple groups will be essential.

Definition 1.1.17. Let X and H be two groups and suppose that H has a
permutation representation ϕ on a finite set I = {1, . . . , n} of n elements.
The wreath product X ϕ H (or simply X H if the action is well-known) is
the semidirect product [X  ]H, where X  is the direct product of n copies of
X: X  = X1 × · · · × Xn , with Xi = X for all i ∈ I, and the action is

(x1 , . . . , xn )h = (x1(h−1 )ϕ , . . . , xn(h−1 )ϕ ) (1.1)

for h ∈ H and xi ∈ X, for all i ∈ I.

The subgroup X  is called the base group of X H.

Remarks 1.1.18. Consider a wreath product G = X ϕ H.

1. If ϕ is faithful, then CG (X  ) ≤ X  .
 1.1 Primitive groups 9

2. For any g ∈ G, then g = xh, with x ∈ X  and h ∈ H. For each

i = 1, . . . , n, we have that Xig = Xih = Xihϕ .
3. Thus, the group G acts on I by the following rule: if i ∈ I, for any
ϕ ϕ
g = xh ∈ G, with x ∈ X  and h ∈ H, then ig = ih . In particular ih = ih , if
h ∈ H.
4. If S ⊆ I, then write

πS : X  −→ Xj
j∈S

for the projection of X  onto j∈S Xj . Then for any y ∈ X  and any g ∈ G,
we have that
(y g )πS g = (y πS )g .
Proposition 1.1.19. Let S be a non-abelian simple group and write S n =
S1 × · · · × Sn for the direct product of n copies S1 , . . . , Sn of S, for some
positive integer n. Then the minimal normal subgroups of S n are exactly the
Si , for any i = 1, . . . , n,
Proof. Let N be a minimal normal subgroup of S n . Suppose that N ∩ Si = 1
for all i = 1, . . . , n. Then N centralises all Si and hence N ≤ Z(S n ) = 1. This
is a contradiction. Therefore N ∩ Si = N for some index i. Then N = Si .  
Proposition 1.1.20. Let S be a non-abelian simple group and write S n =
S1 × · · · × Sn for the direct product of n copies S1 , . . . , Sn of S, for some
positive integer n. Then Aut(S n ) ∼= Aut(S) Sym(n), where Sym(n) is the
symmetric group of degree n.
Proof. If σ is a permutation in Sym(n), the map ασ defined by
(x1 , . . . , xn )ασ = (x1σ−1 , . . . , xnσ−1 )
is an element of Aut (S n ) associated with σ. Now H = {ασ ∈ Aut (S n ):
σ ∈ Sym(n)} is a subgroup of Aut(S n ) and σ −→ ασ defines an isomorphism
between Sym(n) and H. By Proposition 1.1.19, the minimal normal subgroups
of the direct product S1 × · · · × Sn are exactly the S1 , . . . , Sn . Therefore, if
γ ∈ Aut(S n ), then there exists a σ ∈ Sym(n) such that Siγ = Siσ = Siασ , for
all i = 1, . . . , n.
Let D be the subgroup of all elements β in Aut(S n ) such that Siβ = Si
for all i. The maps β1 , . . . , βn defined by (x1 , . . . , xn )β = (xβ1 1 , . . . , xβnn ) are
automorphisms of S and the map β → (β1 , . . . , βn ) defines an isomorphism
between D and Aut(S)n . Moreover, by Proposition 1.1.19 again, if β ∈ D and
γ ∈ Aut(S n ), then (Siγ )β = Siγ . This means that D is a normal subgroup of
Aut(S n ).
Observe that ασ ∈ D if and only if σ = 1, or, in other words, D ∩ H = 1.
Moreover for all γ ∈ Aut(S n ), we have that γασ−1 ∈ D. Therefore Aut(S n ) =
[D]H. This allows us to define a bijective map between Aut(S n ) and Aut(S)
Sym(n) which is an isomorphism. 

10 1 Maximal subgroups and chief factors

F. Gross and L. G. Kovács published in [GK84] a construction of groups,

the so-called induced extensions, which is crucial to understand the structure
of a, non-necessarily finite, group that possesses a normal subgroup which is a
direct product of copies of a group. It is clear that primitive groups of type 2
are examples of this situation. We present in the sequel an adaptation of this
construction to finite groups.
Proposition 1.1.21. Consider the following diagram of groups and group
homomorphisms:
Z (1.2)
g

X
f
/Y
where g is a monomorphism. Let G be the following subset of X:

G = {x ∈ X : xf = z g for some z ∈ Z},

and the following mapping

−1
h : G −→ Z xh = xf g for every x ∈ G.

Then G is a subgroup of X and h is a well-defined group homomorphism such

that the following diagram of groups and group homomorphisms is commut-
ative:
h /
G Z
ι g
 
X
f
/Y
(where ι is the canonical inclusion of G in X). Moreover Ker(hι ) = Ker(f ).
Further, if (G0 , ι0 , h0 ) is a triple, with G0 a group, ι0 : G0 −→ X a mono-
morphism and h0 : G0 −→ Z is a group homomorphism, such that the diagram

G0
h0
/Z
ι0 g
 
X
f
/Y

is commutative, then there exists a monomorphism Φ : G0 −→ G, such that

 Φ  ι
Φh = h0 , Φι = ι0 and Ker(h0 ) ≤ Ker(h) = Ker(f ).
Proof. It is an easy exercise to prove that G is a subgroup of X and, since g
is a monomorphism, the mapping h is a well-defined group homomorphism.
It is not difficult to see that Ker(h)ι = Ker(f ).
For the second statement, let x ∈ G0 and observe that xh0 is an element
of Z such that (xh0 )g = (xι0 )f , and then xι0 ∈ G and (xι0 )h = xh0 . Write
Φ : G0 −→ G such that xΦ = xι0 . 

 1.1 Primitive groups 11

Definition 1.1.22. The triple (G, ι, h) introduced in Proposition 1.1.21 is

said to be the pull-back of the diagram (1.2).

Proposition 1.1.23. Consider the following extension of groups:

1 /K /X f
/Y /1

and a monomorphism g : Z −→ Y . Consider the triple (G, ι, h), the pull-back

of the diagram (1.2).
1. There exists an extension

Eg : 1 /K /G h /Z /1

such that the following diagram of groups and group homomorphisms is

commutative:

Eg : 1 /K /G h /Z /1

id ι g
  
E: 1 /K /X f
/Y /1

2. Moreover, if
E0 : 1 /K / G0 h0
/Z /1

is another extension such that the diagram

E0 : 1 /K / G0 h0
/Z /1

id ι0 g
  
E: 1 /K /X f
/Y /1

is commutative, there exists a group isomorphism Φ : G0 −→ G such that

Φh = h0 , Φι = ι0 and Φ|K = idK .

Proof. The proof of 1 is a direct exercise. To see 2, first notice that, by

the Short Five Lemma ([Hun80, IV, 1.17]), the homomorphism ι0 is a
monomorphism. By Proposition 1.1.21, there exists a group monomorphism
Φ : G0 −→ G such that Φh = h0 , Φι = ι0 and Φ|K = idK . Furthermore, since
|G| = |Z|/|K| = |G0 |, we have that Φ is an isomorphism. 


Definition 1.1.24. The extension Eg is said to be the pull-back extension of

the extension E and the monomorphism g.

Hypotheses 1.1.25. Let B be a group. Assume that C a subgroup of a group

B such that |B : C| = n and let T = {t1 = 1, . . . , tn } be a right transversal
12 1 Maximal subgroups and chief factors

of C in B. Then B, acting by right multiplication on the set of right cosets

of C in B, induces a transitive action ρ : B −→ Sym(n) on the set of indices
I = {1, . . . , n} in the following way. For each i ∈ I and each h ∈ B, the
element ti h belongs to some coset Ctj , i.e. ti h = ci,h tj , for some ci,h ∈ C.
ρ
Then ih = j. Write P = B ρ ≤ Sym(n).
Let α : A −→ B be a group homomorphism and write C = Aα and S =
Ker(α). Write W = A ρ P . Thereexists an induced epimorphism ᾱ : A ρ P −→
ᾱ
C ρ P defined by (a1 , . . . , an )x = (aα 1 , . . . , an )x, for a1 , . . . , an ∈ A and
α

x ∈ P . Write M = Ker(ᾱ). Observe that (a1 , . . . , an )x ∈ M if and only

j = 1, for all j ∈ I and x = 1. This is to say that M = Ker(ᾱ) =
if aα
Ker(α) × . . . × Ker(α) = S1 × . . . × Sn . We have the exact sequence:

E: 1 /M /A ρ P
ᾱ /C ρ P /1

Lemma 1.1.26. Assume the hypotheses and notation of Hypotheses 1.1.25.

1. The mapping λ = λT : B −→ C ρ P such that hλ = (c1,h , . . . , cn,h )hρ , for
any h ∈ B, is a group monomorphism.
2. Consider the pull-back exact sequence Eλ:

Eλ : 1 /M /G σ /B /1

id λ
  
E: 1 /M /A ρ P
ᾱ /C ρ P /1

Then, the isomorphism class of the group G is independent from the choice
of transversal of C in B.
Proof. 1. Let h, h ∈ B. Observe that
ci,hh
ti(hh
)ρ = ti hh = ci,h tihρ h = ci,h cihρ ,h
ti(hh
)ρ .
Hence, by (1.1) in Definition 1.1.17, we have that
hλ hλ = (c1,h , . . . , cn,h )hρ (c1,h
, . . . , cn,h
)h
ρ

ρ −1
= (c1,h , . . . , cn,h )(c1,h
, . . . , cn,h
)(h ) (hh )ρ
= (c1,h , . . . , cn,h )(c1hρ ,h
, . . . , cnhρ ,h
)(hh )ρ
= (c1,hh
, . . . , cn,hh
)(hh )ρ = (hh )λ

and λ is a group homomorphism.

Suppose that hλ = hλ . Then (c1,h , . . . , cn,h )hρ = (c1,h
, . . . , cn,h
)h and
ρ
n
therefore, since C ρ Pn = [C ]Pn is a semidirect product, we have that
cj,h = cj,h
= cj , j ∈ I; hρ = hρ = τ.
Therefore, for any index j ∈ I, we have that tj h = cj tj τ = tj h and then
h = t−1 
j cj tj τ = h . Hence λ is a group monomorphism.
 1.1 Primitive groups 13

2. Let T  = {t1 , . . . , tn } be some other right transversal of C in B such

that Cti = Cti , for each i ∈ I: there exist elements b1 , . . . , bn ∈ C such that
ti = bi ti , for i = 1, . . . , n. For each i ∈ I and each h ∈ B, the element ti h
belongs to the coset Ctj = Ctj , for ih = j, and ti h = ci,h tj , for some ci,h ∈ C.
ρ

Then

ti h = bi ti h = bi ci,h tj = ci,h tj = ci,h bj tj and ci,h = b−1 

i ci,h bj

and it appears the element (b1 , . . . , bn ) ∈ C  associated with T  . Then, for

λ = λT
, we have that
 
hλ = (c1,h , . . . , cn,h )hρ = (b1 , . . . , bn )−1 (c1,h , . . . , cn,h )(b1hρ , . . . , bnhρ ) hρ
 −1 ρ 
= (b1 , . . . , bn )−1 (c1,h , . . . , cn,h )(b1 , . . . , bn )(h ) hρ
= (b1 , . . . , bn )−1 (c1,h , . . . , cn,h )hρ (b1 , . . . , bn )
 (b1 ,...,bn )

= (c1,h , . . . , cn,h )hρ = (hλ )(b1 ,...,bn ) ,
 (b1 ,...,bn )
for any h ∈ B, and then Im(λ ) = Im(λ). For each i ∈ I, let ai be an
element of A such that aiα = bi . This is to say that (a1 , . . . , an )ᾱ = (b1 , . . . , bn ).
If x ∈ G, then


(x(a1 ,...,an ) )ᾱ = (xᾱ )(b1 ,...,bn ) = (hλ )(b1 ,...,bn ) = hλ


and then x(a1 ,...,an ) ∈ G∗ = {w ∈ W : wᾱ = hλ for some h ∈ B}, which is
the pull-back defined with the monomorphism λ :

/M / G∗ σ
/B /1
Eλ : 1
id λ

  
E: 1 /M /A ρ P
ᾱ /C ρ P /1

Thus, G∗ = Ga for some a ∈ A associated with the transversals T and


T , i.e. the pull-back groups constructed from two different transversals are
conjugate in W . In other words, the isomorphism class of the group G is
independent from the choice of transversal. 

Definition 1.1.27 ([GK84]). In the above situation and with that notation,
we will say that Eλ is the induced extension defined by α : A −→ B.
Recall that G is a subgroup of W = A ρ P defined by:

G = {x ∈ W : xᾱ = hλ , for some h ∈ B}

and σ is defined by σ = ᾱ|G λ−1 .

14 1 Maximal subgroups and chief factors

Proposition 1.1.28. With the notation introduced above, we have the follow-
ing.
1. NG (A1 ) = NG (S1 ) = NG (S2 × · · · × Sn ) = N = {x ∈ W : xᾱ = hλ , for
some h ∈ C}.
2. N/(S2 × · · · × Sn ) ∼ = A. Moreover, the image of M/(S2 × · · · × Sn ) under
this isomorphism is S = Ker(α).
3. In particular N σ = C and |G : N | = |B : C| = n. Thus, if ρ : G −→
Sym(n) is the action of G on the right cosets of N in G by multiplication,
then ρ = σρ.
4. The set {S1 , . . . , Sn } is the conjugacy class of the subgroup S1 in G.
Proof. 1. We can consider the subgroup
N = {w ∈ W : wᾱ = hλ , for some h ∈ C}.
Observe that if (a1 , . . . , an )x ∈ N , for ai ∈ A and x ∈ P , then there exists
h ∈ C, such that
hλ = (c1,h , . . . , cn,h )hρ = (aα α
1 , . . . , an )x.

Since h ∈ C, it is clear that c1,h = h and hρ belongs to the stabiliser P1 of 1.

In other words
N ≤ A1 × (A2 × · · · × An )P1 = NW (A1 ) = NW (S1 ) = NW (S2 × · · · × Sn )
and hence N ≤ NG (A1 ). Conversely, if (a1 , . . . , an )x ∈ NG (A1 ), then x ∈ P1
hρ
and there exists h ∈ B such that aα i = ci,h and x = h ∈ P1 , i.e. 1
ρ
= 1.
Hence h = t1 h = c1,h t1 = c1,h = aα1 ∈ C. Then NG (A1 ) ≤ N . Hence N =
NG (A1 ) = NG (S1 ).
2. Consider the projection e1 : A1 × (A2 × · · · × An )P1 = NW (A1 ) −→ A
on the first component. Obviously, Ker(e1 ) = (A2 × · · · × An )P1 .
Let e be the restriction to N of the projection e1 :
e = e1 |N : N −→ A.
Observe that if x ∈ N , then xᾱ = cλ for some c ∈ C. We can characterise
this c = xσ in the following way. Assume that x = (a1 , . . . , an )y. Then xᾱ =
(aα α λ ρ
1 , . . . , an )y = c = (c, c2,c , . . . , cn,c )c . Hence c = a1 = x .
α eα

We have that Ker(e) = Ker(e1 ) ∩ N . If x ∈ Ker(e), then xᾱ = (xeα )λ = 1.

Thus x ∈ Ker(ᾱ) = M and then Ker(e) ≤ M . Therefore Ker(e) = Ker(e1 ) ∩
M = (A2 × · · · × An )P1 ∩ M = S2 × · · · × Sn .
For any a ∈ A, consider the element c = aα ∈ C. Then cρ ∈ P1 and
ci,c = ti ct−1
ρ
j ∈ C, where j = ic , for i = 2, . . . , n. Since C = Aα , there exist
elements a2 , . . . , an in A such that aα j = cj,c , for j = 2, . . . , n. The element x =
(a, a2 , . . . , an )cρ ∈ N , since xᾱ = (aα , aα α ρ ρ
2 , . . . , an )c = (c, c2,c , . . . , cn,c )c =
λ e
c . Now x = a, and then e is an epimorphism.
Hence
N/ Ker(e) = N/(S2 × · · · × Sn ) ∼ = A.
Finally observe that M e ∼ = M/ Ker(e|M ) = M/(S2 × · · · × Sn ) ∼ = S. Since
M e ≤ S = Ker(α) and these two subgroups have the same order, equality
holds.
 1.1 Primitive groups 15

3. Choose a right transversal of N in G, {g1 = 1, . . . , gn } such that giσ = ti .

Then for each g ∈ G, we have that gi g = xi,g gigρ
, for some xi,g ∈ N . Then

ci,gσ tigσρ = ti g σ = giσ g σ = xσi,g g σgρ
= xσi,g tigρ

i

σρ ρ


and then ig = ig , for every i ∈ I. Therefore g σρ = g ρ for each g ∈ G, and
then σρ = ρ .
4. Observe that for each i ∈ I, the permutation tρi moves 1 to i. Therefore,
having in mind (1.1) of Definition 1.1.17, we see that S1gi = Si , and then
{S1 , . . . , Sn } is the conjugacy class of the subgroup S1 in G. 


We prove next that in fact the structure of the group G analysed in Pro-
position 1.1.28 characterises the induced extensions.

Theorem 1.1.29. Let G be a group. Suppose that we have in G the following

situation: there exist a normal subgroup M of G and a normal subgroup S of
M such that {S1 , . . . , Sn } is the set of all conjugate subgroups of S in G and
M = S1 × · · · × Sn . Write N = NG (S1 ) and K = S2 × · · · × Sn .
Let α : N/K −→ G/M be defined by (Kx)α = M x. Then G is the induced
extension defined by α.

Proof. Let σ : G −→ G/M and e : N −→ N/K be the natural epimorphisms.

If T = {t1 = 1, . . . , tn } is a right transversal of N in G, then T σ is a right
transversal of N/M in G/M . Consider ρ : G/M −→ Sym(n) the permutation
representation of G/M on the right cosets of N/M in G/M . Then ρ̄ = σρ
is the permutation representation of G on the right cosets of N in G. Write
P = Gρ̄ = (G/M )ρ . Let

λ̄ = λT : G −→ N ρ̄ P

be the embedding of G into N ρ̄ P defined in Lemma 1.1.26 and

λ = λT σ : G/M −→ (N/M ) ρ P

be the embedding of G/M into (N/M ) ρ P . As usual, for each x ∈ G, write

ρ
ti x = ci,x tj , for some ci,x ∈ N , and ix = j. Observe that ci,g σ
σ = (ci,g ) .

Write Si = S . For each i ∈ I = {1, . . . , n}, write also Ki = j∈I\{i} Sj .

ti

Then K = K1 and Ki = K ti .
If we write σ̄ : N ρ̄ P −→ (N/M ) ρ P for the epimorphism induced by σ,
then σλ = λ̄σ̄. Consider

ē : N P −→ (N/K) P, induced by e

and
ᾱ : (N/K) P −→ (N/M ) P, induced by α.
Since eα = σ|N , we find that ēᾱ = σ̄. Therefore λ̄ēᾱ = λ̄σ̄ = σλ and the
following diagram is commutative:
16 1 Maximal subgroups and chief factors

G
σ / G/M

λ̄ē λ
 
(N/K) P
ᾱ / (N/M ) P

The commutativity of the diagram shows that M λ̄ēᾱ = M σλ = 1 and then

M λ̄ē ≤ Ker(ᾱ).
Consider an element x ∈ G such that xλ̄ = (c1,x , . . . , cn,x )xρ̄ ∈ Gλ̄ ∩Ker(ē).
Then we have 1 = (Kc1,x , . . . , Kcn,x )xρ . This means that xρ = id and
ci,x ∈ K, for i ∈ I. Therefore, ci,x = ti xt−1
n
i , for i ∈ I. Hence, x ∈
ti
n i=1 K =
i=1 Ki = 1. Therefore G ∩ Ker(ē) = 1 and then λ̄ē is a monomorph-
λ̄

ism. Observe that Ker(ᾱ) = (M/K) = (M/K)1 × · · · × (M/K)n and then

|Ker(ᾱ)| = |M |. Thus, the restriction λ̄ē|M : M −→ Ker(ᾱ) is an isomorphism.
Therefore, the following diagram is commutative:

1 /M /G σ / G/M /1

λ̄ē λ
  
1 / Ker(ᾱ) / (N/K) P ᾱ / (N/M ) P /1

Therefore G is the induced extension defined by α. 



Remark 1.1.30. We are interested in the action of the group G on the normal
subgroup M = S1 × · · · × Sn , when G is an induced extension. We keep
the notation of Theorem 1.1.29. The action of the group N on S, ψ : N −→
Aut(S), is defined by conjugation: if x ∈ N , then xψ is the automorphism of
S given by the conjugation in N by the element x: for every s ∈ S, we have
ψ
sx = sx .
The induced extension G can be considered as a subgroup of the wreath
product W = N ρ P , via the embedding

λ̄ = λT : G −→ N ρ̄ P given by xλ̄ = (c1,x , . . . , cn,x )g ρ̄ , for all x ∈ G.

If (x1 , . . . , xn ) ∈ M = S1 × · · · × Sn and x ∈ G, then, by Definition 1.1.17,

 cψ cψ
xρ̄
x
(x1 , . . . , xn ) = x11,x , . . . , xnn,x = (y1 , . . . , yn ),

cψ
where xi i,x = yixρ̄ , for i ∈ {1, . . . , n}.

Proposition 1.1.31. In the hypotheses 1.1.25, assume that S is a group and

C acts on S by a group homomorphism ψ : C −→ Aut(S). Then the group B
acts on the direct product S n = S1 × · · · × Sn by a group homomorphism

ψ B : B −→ C ψ ρ P ≤ Aut(S n )
 1.1 Primitive groups 17

such that for (x1 , . . . , xn ) ∈ S n and h ∈ B, then

ψB cψ
(x1 , . . . , xn )h = (y1 , . . . , yn ), where xi i,h = yihρ̄ , for i ∈ {1, . . . , n}.
  (1.3)
Moreover, Ker(ψ B ) = CoreB Ker(ψ) .

Proof. If ψ̄ : C ρ P −→ C ψ ρ P is induced by ψ and λ is the monomorphism

of Lemma 1.1.26, then ψ B = λψ̄. Clearly ψ B is a group homomorphism.
Observe that h ∈ Ker(ψ B ) if and only if hρ is the identity permutation and
ci,h ∈ Ker(ψ), for all i ∈ I. This means that ti ht−1
i  ∈ Ker(ψ),
= ci,h  for all
i ∈ I. And this is equivalent
 to saying that h ∈ CoreB Ker(ψ) . In other
words, Ker(ψ B ) = CoreB Ker(ψ) . 


These observations motivate the following definition.

Definition 1.1.32. With the notation of Proposition 1.1.31, the action ψ B is

called the induced B-action from ψ, and the B-group (S n , ψ B ) is the induced
B-group.
The semidirect product [S n ]ψB B = [S1 × · · · × Sn ]B is called the twisted
wreath product of S by B; it is denoted by S (C,ψ) B.

Thus, if G is the induced extension defined by the map α : N/K −→ G/M

as in Theorem 1.1.29, then the conjugacy action of G on the normal subgroup
M = S1 × · · · × Sn is the induced G-action from the conjugacy action of
N = NG (S1 ) on S1 .

Remarks 1.1.33. 1. The structure of induced B-group does not depend,

up to equivalence of B-groups, on the chosen transversal of C in B.
2. The construction of induced actions is motivated by the classical con-
struction of induced modules. If S is a C-module, the induced B-action gives
to S n the well-known structure of induced B-module: S n ∼
= S B . This explains
the name and the notation.

Proposition 1.1.34. Let S and B be groups and C a subgroup of B. Suppose

that (S, ψ) is a C-group and consider the twisted wreath product G = S (C,ψ) B.
Then
1. NB (S1 ) = C and CB (S1 ) = Ker(ψ).
2. CB (S  ) = CoreB Ker(ψ) . Moreover if CoreB (C) = 1, then CG (S  ) =
Z(S  ).
ρ
Proof. 1. If h ∈ NB (S1 ), then, by (1.3), 1h = 1 and h = c1,h ∈ C.
ρ ρ
Conversely, if c ∈ C, then c = c1,c and 1c = 1; moreover (x, 1, . . . , 1)c =
ψ
(xc , 1, . . . , 1). Hence C ≤ NB (S1 ).
Observe that the elements of CB (S1 ) are elements c ∈ C such that cψ =
idS1 . Hence CB (S1 ) = Ker(ψ).
18 1 Maximal subgroups and chief factors
n
n 2. Observe that S1ti = Si , forall i ∈ I. Therefore
  CB (S  ) = i=1 CB (Si ) =
ti
i=1 CB (S1 ) = CoreB CB (S1 ) = Core B Ker(ψ) .
n
If (x1 , . . . , xn )h ∈ CG (S  ), then h ∈ i=1 NB (Si ) = CoreB (C) = 1. There-
fore (x1 , . . . , xn ) ∈ Z(S ).


If 1 −→ M −→ G −→ B −→ 1 is the induced extension defined by a
group homomorphism α : A −→ B, then G splits over M if and only if G is
isomorphic to the twisted wreath product S (C,ψ) B. F. Gross and L. G. Kovács
characterise when the induced extension splits. This characterisation, which
will be crucial in Chapter 7, is just a consequence of a deep analysis of the
supplements of M in G.
Theorem 1.1.35 (([GK84])). Let G be a group in which there exists a nor-
mal subgroup M of G such that M = S1 ×· · ·×Sn , where {S1 , . . . , Sn } is the set
of all conjugate subgroups of a normal subgroup S1 of M . Write N = NG (S1 )
and K = S2 × · · · × Sn .
1. Let L/K be a supplement of M/K in N/K. Then, there exists a supple-
ment H of M in G satisfying the following:
a) L = (H ∩ N )K and H ∩ M = (H ∩ S1 ) × · · · × (H ∩ Sn ). Further,
{H ∩ S1 , . . . , H ∩ Sn } is a conjugacy class in H, and H ∩ S1 = L ∩ S1 .
b) Suppose that H0 is a supplement of M in G such that H0 ∩ N ≤ L.
Then there is an element k ∈ K such that H0k ≤ H. Moreover, H0k =
H if and only if L = (H0 ∩ N )K and H0 ∩ M = (H0 ∩ S1 ) × · · · ×
(H0 ∩ Sn ).
c) In particular, H is unique up to conjugacy under K.
2. Suppose that H is a supplement M in G such that H ∩ M = (H ∩ S1 ) ×
· · · ×(H ∩Sn ). Write L = (H ∩N )K. Assume further that R is a subgroup
of G such that G = RM . Then the following are true:
a) R is conjugate in G to a subgroup of H if and only if R ∩ N is conjugate
in N to a subgroup of L.
b) R is conjugate to H in G if and only if (R ∩ N )K is conjugate to L
in N and also R ∩ M = (R ∩ S1 ) × · · · × (R ∩ Sn ).
3. There is a bijection between, on the one hand, the conjugacy classes in G
of supplements H of M in G such that H ∩ M = (H ∩ S1 ) × · · · × (H ∩ Sn ),
and, on the other hand, the conjugacy classes in N/K of supplements L/K
of M/K in N/K, Moreover, under this bijection, we have the following:
a) the conjugacy classes in G of supplements U of M which are maximal
subgroups of G such that U ∩ M = (U ∩ S1 ) × · · · × (U ∩ Sn ) are
in one-to-one correspondence with the conjugacy classes in N/K of
supplements of M/K which are maximal subgroups of N/K.
b) the conjugacy classes in G of complements of M , if any, are in one-
to-one correspondence with the conjugacy classes in N/K of complements
of M/K.
Proof. By Theorem 1.1.29, the group G is the induced extension defined by
α : N/K −→ G/M given by (Kx)α = M x, for all x ∈ G. Let T = {t1 =
 1.1 Primitive groups 19

1, . . . , tn } be a right transversal of N in G and write ρ : G −→ Sym(n) the

permutation representation of G on the right cosets of N in G. As usual, for
ρ
each x ∈ G, write ti x = ci,x tj , for some ci,x ∈ 
N , and ix = j. Write Si = S ti .
For each i ∈ I = {1, . . . , n}, write also Ki = j∈I\{i} Sj . Then K = K1 and
Ki = K ti . For P = Gρ , let λ be the embedding of G into (N/K) ρ P defined
by λ : G −→ (N/K) ρ P such that xλ = (Kc1,x , . . . , Kcn,x )xρ , for any x ∈ G.
1a. Define
 λ−1
H = (L/K) ρ P = {x ∈ G : ci,x ∈ L, for all i ∈ II}.

This subgroup H satisfies the required properties.

Fix an element g ∈ G. Then, for each i ∈ I, we have that ci,g ∈ N = M L
and there exists mi,g ∈ M such that m−1
i,g ci,g ∈ L.
−1
Observe that, if m ∈ M , then ci,m = mti . Then
−1 −1 −1 −1
mλ = (Kmt1 , . . . , Kmtn ) = (Km, Kmt2 , . . . , Kmtn ).

Write m = (s1 , . . . , sn ). Then, for any i ∈ I, using (1.1) in Definition 1.1.17,

−1 ρ
(mti )π1 = si , since 1ti = i. Therefore (s1 , . . . , sn )λ = (Ks1 , . . . , Ksn ).
Since the restriction of λ to M is an isomorphism onto (M/K) , i.e. M λ =
(M/K) , there exists a unique mg ∈ M such that mλg = (Km1,g , . . . , Kmn,g ).
Hence

(m−1 λ
g g) = (mg ) g = (Km−1
λ −1 λ −1 ρ
1,g , . . . , Kmn,g )(Kc1,g , . . . , Kcn,g )g =

= (Km−1 −1
1,g c1,g , . . . , Kmn,g cn,g )g ∈ (L/K)
ρ
ρ P,

and then m−1

g g ∈ H. Hence, G = HM .
t−1
Observe that Kmi,g = Kci,mg = Kmgi . If g ∈ L, then we can choose
m1,g = 1, and then mg ∈ K. Thus m−1 g g ∈ H ∩ N . Then L ≤ K(H ∩ N ). On
the other hand, if h ∈ H ∩ N , then h = c1,h ∈ L. Hence L = K(H ∩ N ).
If m = (s1 , . . . , sn ) ∈ M ∩ H, then Ksi ∈ L/K, for all i ∈ I. Observe
that, for any i ∈ I, we have that (1, . . . , si , . . . , 1)λ = (K, . . . , Ksi , . . . , K) ∈
 
(L∩M )/K and then (1, . . . , si , . . . , 1) ∈ H ∩Si . Hence, H ∩M = (H ∩ S1 )×
· · · × (H ∩ Sn ).
Since G = HM , we can choose the transversal T ⊆ H. Hence, for all i ∈ I,
we have that H ∩Si = (H ∩S1 )ti . Therefore
 {H ∩S1 , . . . , H ∩Sn } is a conjugacy
class in H. Moreover (L ∩ M )/K = (H ∩ N )K ∩ M /K = (H ∩ M )K/K =
(H ∩ S1 )K/K ∼ = H ∩ S1 and also (L ∩ M )/K = (L ∩ S1 )K/K ∼ = L ∩ S1 . Hence
|H ∩ S1 | = |L ∩ S1 |. Since H ∩ S1 = H ∩ N ∩ S1 ≤ L ∩ S1 , we have the equality
H ∩ S1 = L ∩ S 1 .
1b. Assume now that H0 is a subgroup of G such that G = M H0 and
H0 ∩ N ≤ L. For each i ∈ I, there must be an element mi ∈ M such that
ti ∈ m−1 i H0 , i.e. mi ti ∈ H0 . We may choose m1 = 1. Now, there exists a
unique k ∈ M such that
20 1 Maximal subgroups and chief factors
−1 −1
(K, Km2 , . . . , Kmn ) = k λ = (Kk t1 , . . . , Kk tn ).

This implies that k ∈ K and ti kt−1

i mi
−1
∈ K, for all i ∈ I. We show that
k−1
H0 ≤ H.
−1
Let x ∈ H0 and consider y = xk . Observe that, for all i ∈ I, M ti x =
−1 ρ ρ
M ti xk = M ti y and then ix = iy . Now

ci,y = ti yt−1
iy
−1
ρ = ti yt xρ = ti kxk
i
−1 −1
tixρ =
= ti k(t−1 −1 −1 −1
i mi mi ti )x(tixρ mixρ mix tix )k
ρ ρ
−1 −1
tixρ =
= (ti kt−1 −1 −1 −1
i mi )(mi ti xtixρ mixρ )(mix tix k
ρ ρ
−1 −1
tixρ ).

Now observe that mi ti and t−1

ix
−1
i
−1 −1
ρ m xρ are in H0 and then, mi ti xt xρ m xρ ∈ H0 .
i i
−1 −1 −1
On the other hand, ti xtixρ = ci,x ∈ N , and then mi ti xtixρ mixρ ∈ N . Since
ti kt−1 −1
i mi ∈ K and also mixρ tixρ k −1 t−1
ix
ρ ∈ K, we have that

ci,y = (ti kt−1 −1 −1 −1

i mi )(mi ti xtixρ mixρ )(mix tix k
ρ ρ
−1 −1
tixρ ) ∈ K(H0 ∩ N )K ≤ L

for all i ∈ I. This means that y ∈ H.

Assume that H0k ≤ H, for k ∈ K. Clearly, if H0k = H, then L = (H0 ∩N )K
and H0 ∩ M = (H0 ∩ S1 ) × · · · × (H0 ∩ Sn ). Conversely, suppose that L =
(H0 ∩ N )K and H0 ∩ M = (H0 ∩ S1 ) × · · · × (H0 ∩ Sn ). Observe that H0k
satisfies the same properties. Thus, we can assume that H0 ≤ H.
As in 1a, since G = H0 M , we have that {H0 ∩ S1 , . . . , H0 ∩ Sn } is a
conjugacy class in H0 , and H0 ∩ S1 = L ∩ S1 . Hence, |H ∩ S1 | = |H0 ∩ S1 |, and
then H ∩ S1 = H0 ∩ S1 . Therefore, H ∩ M = H0 ∩ M . Then, from G = H0 M =
HM , we deduce that |G : H0 | = |M : M ∩ H0 | = |M : M ∩ H| = |G : H|.
Hence, |H| = |H0 | and then, H = H0 .
Part 1c is a direct consequence of 1b.
2a. Clearly L/K is a supplement of M/K in N/K. By 1c, the subgroup
H is determined, up to conjugacy in K, by L.
Suppose that G = RM and R ∩ N is conjugate to a subgroup of L in
N . Since N = RM ∩ N = (R ∩ N )M , there is an element m ∈ M such
that (R ∩ N )m ≤ L. Write H0 = Rm . Then G = H0 M and H0 ∩ N ≤ L.
It follows, from 1b, that H0 is conjugate to a subgroup of H. Hence R is
conjugate to a subgroup of H. Conversely, if R is conjugate to a subgroup
of H, then, since G = RM , we have that Rm ≤ H, for some m ∈ M . Then
(R ∩ N )m = Rm ∩ N ≤ H ∩ N ≤ L.
2b. If G = RM and L is  conjugateto (R ∩ N )K in N , there is an element
m
m ∈ M such that L = (R ∩ N )K = (R ∩ N )m K = (Rm ∩ N )K. If
R ∩ M = (R ∩ S1 ) × · · · × (R ∩ Sn ), by 1b, we deduce that H0 = Rm is
conjugate to H. The rest of 2b follows easily.
3. The bijection follows easily from 1 and 2.
3a. Let L be a maximal subgroup of N such that K ≤ L and N = LM and
consider one of the supplements U of M in G determined by the conjugacy
 1.1 Primitive groups 21

class of L in N under the bijection. Suppose that U ≤ H < G. Then N =

(H ∩N )M . Set L0 = (H ∩N )K. Then L0 /K is a supplement of M/K in N/K.
Clearly L = (U ∩ N )K ≤ L0 . By maximality of L, we have that L = L0 . But
then H ∩ N ≤ L and, by 1b, H k ≤ U , for some k ∈ K. Clearly, this implies
that U = H. Hence U is maximal in G.
Conversely, let U be a maximal subgroup of G which supplements M in G
such that U ∩ M = (U ∩ S1 ) × · · · × (U ∩ Sn ). Write L = (U ∩ N )K. Suppose
that L ≤ L0 < N . Consider a supplement R of M in G determined by L0
under the bijection. Then L0 = (R ∩ N )K. Since U ∩ N ≤ L0 , then U k ≤ R,
for some k ∈ K. By maximality of U , we have that R = U k . This implies that
L and L0 are conjugate in N and, since L ≤ L0 , equality holds.
3b. Observe that if L/K is a complement of M/K in N/K, then L∩S1 = 1.
Hence H ∩ S1 = 1 and therefore H ∩ M = 1. This is to say that H is a
complement of M in G. Conversely, if H is a complement of M in G, then
(H ∩ N )K ∩ M = (H ∩ N ∩ M )K = K. 


The following result, due also to F. Gross and L. G. Kovács, is an applic-

ation of the induced extension procedure to the construction of groups which
are not semidirect products. We will use it in Chapter 5.

Theorem 1.1.36 ([GK84]). Let B be any finite simple group. Then there
exists a finite group G with a minimal normal subgroup M such that M is
a direct product of copies of Alt(6), the alternating group of degree 6, the
quotient group G/M is isomorphic to B and G does not split over M .
 
Proof. Consider the group A = Aut Alt(6) . Let D denote the normal sub-
group of inner automorphisms, D ∼ = Alt(6), of A. It is well-known that the
quotient group A/D is isomorphic to an elementary abelian 2-group of or-
der 4 and A does not split over D, i.e. there is no complement of D in A (see
[Suz82]).
By the Odd Order Theorem ([FT63]), the Sylow 2-subgroups of B are non-
trivial. By the Burnside Transfer Theorem (see [Suz86, 5.2.10, Corollary 2]),
a Sylow 2-subgroup of B cannot by cyclic. By a theorem of R. Brauer and
M. Suzuki (see [Suz86, page 306]), the Sylow 2-subgroups of G cannot by
isomorphic to a quaternion group. Hence a Sylow 2-subgroup of B has two
transpositions generating a dihedral 2-group (see [KS04, 5.3.7 and 1.6.9]).
Therefore B must contain a subgroup G which is elementary abelian of order 2.
Then there is a homomorphism α of A into B such that Aα = C and Ker
(α)
. =D
Now let G be the induced extension defined by α : A −→ B. Since A does
not split over D, the group G has the required properties. 


Let G be a group which is an induced extension of a normal subgroup

M = S1 × · · · × Sn . We have presented above a complete description of those
supplements of M in G whose intersection with M is a direct product of the
projections in each component H ∩M = (H ∩S1 )×· · ·×(H ∩Sn ). But nothing
22 1 Maximal subgroups and chief factors

is said about those supplements H whose projections πi : H ∩ M −→ Si

are surjective. Subgroups D of a direct product M such that all projections
πi : D −→ Si are surjective are fully described by M. Aschbacher and L. Scott
in [AS85]. In the sequel we present here an adaptation of their results suitable
for our purposes.
n
Definition 1.1.37. Let G = i=1 Si be a direct product of groups. A subgroup
H of G is said to be diagonal if each projection πi : H −→ Si , i = 1, . . . , n,
is injective.
If each projection πi : H −→ Si is an isomorphism, then the subgroup H
is said to be a full diagonal subgroup.
n
Obviously if H is a full diagonal subgroup of G = i=1 Si , then all the
Si are isomorphic. Observe that if x = (x1 , . . . , xn ) ∈ H, then xi = xπi , for
π −1 π π −1 π
all i = 1, . . . , n, and then x = (x1 , x1 1 2 , . . . , x1 1 n ). All ϕi = π1−1 πi are
isomorphisms of S1 and then ϕ = (ϕ1 = 1, ϕ2 , . . . , ϕn ) ∈ Aut(S1 )n . Con-
versely, given a group S and ϕ = (ϕ1 , ϕ2 , . . . , ϕn ) ∈ Aut(S)n , it is clear that
{xϕ = (xϕ1 , xϕ2 , . . . , xϕn ) : x ∈ S} is a full diagonal subgroup n
n of S .
More generally, given a direct product of groups G = i=1 Si such that
all Si are isomorphic copies of a group S, to each pair (∆, ϕ), where ∆ =
{I1 , . . . , Il } is a partition of the set I = {1, . . . , n} and ϕ = (ϕ1 , . . . , ϕn ) ∈
Aut(S)n , we associate a direct product D(∆,ϕ) = D1 × · · · × Dl , where each
Dj is a full diagonal subgroup of the direct product i∈Ij Si defined by the
automorphisms {ϕi : i ∈ Ij }. It is easy to see that if Γ is a partition of I
refining ∆, then D(∆,ϕ) ≤ D(Γ,ϕ) . In particular, the trivial partition Ω =
{1}, . . . {n} of I gives D(Ω,ϕ) = G, for any ϕ ∈ Aut(S)n .
For groups S with trivial centre, the group G can be embedded in the
wreath product W = Aut(S) Sym(n). In particular, if S is a non-abelian
simple group, then G ≤ Aut(S n ). In the group W the conjugacy by the
ϕ
element ϕ ∈ W makes sense and D(∆,ϕ) = D(∆,id) , where id denotes the
n-tuple composed by all identity isomorphisms.
Lemma
n 1.1.38. Let H be a full diagonal subgroup of the direct product G =
i=1 S i , where the Si are copies of a non-abelian simple group S. Then H is
self-normalising in G.
Proof. Since H is a full diagonal subgroup of G, all πi are isomorphisms of
π −1 πj
H onto Si . Observe that (x1 , . . . , xn ) ∈ H if and only if xj = x1 1 , for
j = 2, . . . , n and for all x1 ∈ S. Write ϕj = π1−1 πj , for j = 2, . . . , n.
If g = (g1 , . . . , gn ) ∈ NG (H), then for all x ∈ S we have that
 
(x, xϕ2 , . . . , xϕn )g = xg1 , (xϕ2 )g2 , . . . , (xϕn )gn ∈ H.
ϕj
Hence, for j = 2, . . . , n, (xϕj )gj = (xg1 )ϕj = (xϕj )g1 and the automorphism
g1 j gj−1 is the trivial automorphism of Sj . Hence g1 j = gj and g ∈ H. This is
ϕ ϕ

to say that H is self-normalising in G. 


 1.1 Primitive groups 23

Proposition
n 1.1.39. Suppose that H is a subgroup of the direct product G =
S
i=1 i , where the Si are non-abelian simple groups for all i ∈ I = {1, . . . , n}.
Assume that all projections πi : H −→ Si , i ∈ I, are surjective.
1. There exists a partition ∆ of I such that the subgroup H is the direct
product 
H= H πD ,
D∈∆
where 
a) each H πD is a full diagonal subgroup of i∈D Si ,
b) 
the partition ∆is uniquely determined by H in the sense that if H =
D∈∆ H
πD
= G∈Γ H πG , for ∆ and Γ partitions of I, then ∆ = Γ ,
and 
c) if H ≤ K ≤ G, then K = G∈Γ H πG , where Γ is a partition of I
which refines ∆.
2. Suppose that the Si are isomorphic copies of a non-abelian simple group
S, for all i ∈ I, i.e. G ∼= S n . Let U be a subgroup of Aut(G).
 Then
 U,
acting by conjugation on the simple components Si of Soc Aut(G) , is a
permutation group on the set {S1 , . . . , Sn } (and therefore on I).
Observe that the action of U on I induces an action on the set of all
partitions of I. We can say that a partition ∆ of I is U -invariant if
∆x = ∆ for all x ∈ U .
If H is U -invariant, i.e. U ≤ NAut(G) (H), then the partition ∆ is a
U-invariant set of blocks of the action of U on I.
3. In the situation of 2, if Γ is a U -invariant partition of I which refines ∆
and every member of Γ is again a block for the action of U on I, then the
subgroup K = G∈Γ H πG is also U -invariant.

1a. Let D be a subset of I minimal such that the subgroup D =

Proof.
H∩ i∈D Si is non-trivial. It is clear that D is a normal subgroup of H
and then every projection of D is a normal subgroup of the corresponding
projection of H. Since, by minimality of D, Dπj is non-trivial, for each j ∈ D,
we have that Dπj = Sj . Moreover, for each j ∈ D, we have that Ker(πj )∩D =
 
H∩ =j Si = 1, by minimality of D. Therefore D is a full diagonal
i∈D,i
subgroup of i∈D Si . Let E = H πD be the image of the projection of H in

i∈D Si .Then D = DπD is normal in E. By Lemma 1.1.38, D = E. Write
F = H ∩ i∈D / Si . Clearly D×F ≤ H. For  each x ∈ H, we can write x = x1 x2 ,
wherex1 is the projection of x onto i∈D Si and x2 is the projection of x
onto i∈D/ Si . Observe that x1 ∈ D ≤ H and then x2 ∈ F . This is to say that
H = D × F . Now the result follows by  induction onthe cardinality of I.
To prove 1b suppose that H = D∈∆ H πD = G∈Γ H πG , for ∆ and Γ
partitions ofI. Observe that for each D ∈ ∆, since H πD is a full diagonal
subgroup of i∈D Si , we have that the following statements are equivalent for
a non-trivial element h ∈ H:
24 1 Maximal subgroups and chief factors

1. h ∈ H πD ;
2. hπi = 1 if and only if i ∈ D;
3. there exists an i ∈ D such that hπi = 1 and for each D ∈ ∆, with D = D,
there exists a j ∈ D such that hπj = 1.
Suppose that h ∈ H πD . Then hπi = 1, for all i ∈ D, and hπj = 1, for all
j∈/ D. If i ∈ D, there exists G ∈ Γ such that i ∈ G. Thus h ∈ H πG and in fact
D = G. Hence ∆ = Γ .
1c. Suppose finally that K is a subgroup of G containing H. Obviously, the
projections πi :  K −→ Si are surjective. Then, by the above arguments, we
have that K = G∈Γ K πG , where Γis a partition of I, and, for each G ∈ Γ ,
K πG is a full diagonal subgroup of j∈G Sj . In particular, for all i ∈ G, πthe
D
Si are isomorphic  to a non-abelian simple group S G . Since H = D∈∆ H ,
πD∩G ∼
πG
we have H = D∩G,D∈∆ H πD∩G
. If G ∩ D = ∅, then H = SG . Observe
that H πG is a direct product contained in K πG ∼ = SG . This implies that the
direct product has a unique component which is equal to K πG . Hence, for each
G ∈ Γ , H πG = K πG , and G ⊆ D, for some D ∈ ∆, i.e. Γ is a partition of
I which refines ∆.
2. By Proposition 1.1.20, we can consider that U is a subgroup of the
wreath product A Sym(n), for A = Aut(S) and S a non-abelian simple group
such that S ∼ = Si , for all i ∈ I. We see in Remark 1.1.18 (2) of that U acts by
conjugation on the set {A1 , . . . , An } of factors of the base group. Since S is
the unique minimal normal subgroup of A, the group U acts by conjugation
on {S1 , . . . , Sn }.
Suppose that H is U -invariant. Then, for any x ∈ U , by Remark 1.1.18 (4),
we have
 x
 π x

H = Hx = (H πD ) = (H x ) D = H πD x
D∈∆ D∈∆ D x ∈∆x

and then ∆ = ∆x , by 1b. Hence ∆ is U -invariant. Moreover Dx is an element

of the partition ∆. Therefore either D = Dx or D∩Dx = ∅. Hence the elements
of ∆ are blocks for the action of U on I.
3. This follows immediately from Remark 1.1.18 (4): for any x ∈ U , we
have   
x π x
Kx = (H πG ) = (H x ) G = H πG = K,
G∈Γ G∈Γ G∈Γ

and therefore K is U -invariant. 



The purpose of the following is to present a proof of the Theorem of O’Nan

and Scott classifying all primitive groups of type 2. The first version of this
theorem, stated by Michael O’Nan and Leonard Scott at the symposium on
Finite Simple Groups at Santa Cruz in 1979, appeared in the proceedings in
[Sco80] but one of the cases, the primitive groups whose socle is complemen-
ted by a maximal subgroup, is omitted. In [Cam81], P. J. Cameron presented
an outline of the proof of the O’Nan-Scott Theorem again with the same
omission. Finally, in [AS85] a corrected and expanded version of the theorem
 1.1 Primitive groups 25

appears. Independently, L. G. Kovács presented in [Kov86] a completely dif-

ferent approach to the same result.
We are indebted to P. Jiménez-Seral for her kind contributions in [JS96].
These personal notes, written for a doctoral course at the Universidad de
Zaragoza and adapted for her students, are motivated mainly by the self-
contained version of the O’Nan-Scott Theorem which appears in [LPS88].
To study the structure of a primitive group G of type 2 whose socle Soc(G)
is non-simple, we will follow the following strategy. We observe that in general,
for any supplement M of Soc(G) in G, we have that M is a maximal subgroup
of G if and only if M ∩ Soc(G) is a maximal M -invariant subgroup of Soc(G).
We will focus our attention in the structure of the intersection U ∩ Soc(G) of
a core-free maximal subgroup U of G with the socle.

General remarks and notation 1.1.40. We fix here the main notation which is
used in our study of primitive groups of type 2 in the sequel. We also review
some previously known facts and make some remarks. All these observations
give rise to the first steps of the classification theorem of O’Nan and Scott.
Let G be a primitive group of type 2.
1. Write Soc(G) = S1 × · · · × Sn where the Si are copies  of a non-abelian
simple group S, for i ∈ I = {1, . . . , n}. Write also Kj = i∈I,i=j Si , for each
j ∈ I.
2. Write N = NG (S1 ) and C = CG (S1 ). Let ψ : N −→ Aut(S1 ) denote
the conjugacy action of N = NG (S1 ) on S1 . Sometimes we will make the
identification S1ψ = Inn(S1 ) = S1 .
3. The quotient group X = N/C is an almost simple group with Soc(X) =
S1 C/C.
4. Suppose that U is a core-free maximal subgroup of G.
5. The subgroup U ∩ Soc(G) is maximal with respect to being a proper
U -invariant subgroup of Soc(G).
6. By Proposition 1.1.19, the group G, acting by conjugation on the ele-
ments of the set {S1 , . . . , Sn }, induces the structure of a G-set on I. Write
ρ : G −→ Sym(n) for this action. The kernel of this action is Ker(ρ) =
 n ρ
i=1 NG (Si ) = Y . Therefore G/Y is isomorphic to a subgroup G = Pn
of Sym(n). For any g ∈ G, we write g for the image of g in Pn .
ρ

Moreover, since Soc(G) is a minimal normal subgroup, the conjugacy ac-

tion of G on {S1 , . . . , Sn }, and on I, is transitive. Observe that Sixρ = Six
and Kixρ = Kix , for x ∈ G and i ∈ I.
It is worth remarking here that the action of Soc(G) on I is trivial. There-
fore if H is a supplement of Soc(G) in G and ∆ is a partition of I, then ∆ is
H-invariant if and only if ∆ is G-invariant. Also, a subset D ⊆ I is block for
the action of H if and only if D is a block for the action of G.
Since the set {S1 , . . . , Sn } is a conjugacy class of subgroups of G, we have
that Y = CoreG (N ). In particular Soc(G) ≤ Y .
Now U is core-free and maximal in G and therefore G = U Y . This means
that if τ is a permutation of I in Pn , there exists an element x ∈ U such that
26 1 Maximal subgroups and chief factors

the conjugation by x permutes the Si in the same way τ does: Siτ = Six , for
all i ∈ I. In other words, xρ = τ . This is to say that the projection of U onto
Pn is surjective.
7. The stabiliser of the element 1 for the action of G on I is N = NG (S1 ).
Therefore |G : N | = n. Observe that N = NG (S1 ) = NG (K1 ). Let T = {1 =
t1 , t2 , . . . , tn } be a right transversal of N in G such that S1ti = Si , for i ∈ I.
8. Observe that Soc(G) ≤ N and then G = U N . For this reason the
transversal T can be chosen such that T ⊆ U .
9. Write V = U ∩ N = NU (S1 ). Then T is a right transversal of V in U .
Observe that N = N ∩ U Soc(G) = (N ∩ U ) Soc(G) = V Soc(G) = V CS1 .
10. The conjugation in S1 by the elements of V induces a group homo-
morphism ϕ : V −→ Aut(S1 ). It is clear that Ker(ϕ) = CU (S1 ).
11. For any i ∈ I, we have
ρ
ti g = ai,g tj , with ai,g ∈ N and ig = j.

Moreover, since T ⊆ U , if g ∈ U , then ai,g ∈ V .

12. Denote with a star (∗) the projection of N in X: if a ∈ N , then
a∗ = aC ∈ X.
13. The group G is the induced extension defined by α : N/K1 −→
G/ Soc(G). Hence, the action of G on Soc(G) is the induced G-action from ψ:

ψ G : G −→ X ρ Pn ≤ Aut(S n ),

given by g ψ = (a∗1,g , . . . , a∗n,g )g ρ , for any g ∈ G. Observe that Ker(ψ G ) =

G

   
CoreG Ker(ψ) = CoreG CG (S1 ) = 1. Hence ψ G is injective. In other words,
ψ G is an embedding of G into the wreath product X ρ Pn , and then into
G
Aut(S n ). We identify G and Gψ .
With this identification, NG (S1 ) = G ∩ (X1 × [X2 × · · · × Xn ]Pn−1 ), where
Pn−1 is the stabiliser of 1. If g ∈ NG (S1 ), then g ρ fixes 1, i.e. g ρ ∈ Pn−1 .
Moreover a1,g = g. Hence g ψ = (g ∗ , a∗2,g , . . . , an,g∗
G
)g ρ ∈ (X1 × [X2 × · · · ×
Xn ]Pn−1 ). Hence the projection of NG (S1 ) on X1 is surjective.
14. Observe that, for each i ∈ I, any element xi of Si can be written as
t−1
xi = ei , for certain ei ∈ S1 . For any j = i, we have that xi ∈ Sk , for
ti j

t−1
some k = 1 and therefore xij ∈ CG (S1 ). This implies that a∗j,xi = 1 for any
j = i. Moreover ai,xi = ei . Also it is clear that xi normalises all the Sj , for
G
j = 1, . . . , n and then xi ρ = 1. Hence xψ
i = e∗i . This is to say that, with the
G G
ψ
identification of 2, Si = Si , for all i ∈ I, and then Soc(G)ψ = S  .
15. For each i ∈ I, the quotientgroup Y CG (Si )/ CG (Si ) is isomorphic to a
subgroup of Aut(Si ) and then Y / i=1 CY (Si ) ∼
n
= Y is embedded in Aut(S1 ) ×
· · · × Aut(Sn ). Observe that the kernel of the homomorphism which assigns
to each n-tuple of Aut(S1 ) × · · · × Aut(Sn ) the n-tuple of the corresponding
projections of Out(S1 ) × · · · × Out(Sn ) is Soc(G). Hence the quotient group
Y / Soc(G) is isomorphic to a subgroup of Out(S1 ) × · · · × Out(Sn ). Hence,
 1.1 Primitive groups 27

by the Schreier’s
 conjecture ([KS04, page 151]), the group Y / Soc(G) = Y ∩
U Soc(G) / Soc(G) = (Y ∩ U ) Soc(G)/ Soc(G) ∼ = (U ∩ Y )/ U ∩ Soc(G) is
soluble.
16. As in Remarks 1.1.18, if S ⊆ I, then we write

πS : Soc(G) −→ Sj
j∈S

for the projection of Soc(G) onto j∈S Sj . If S = {j}, then the projection
onto Sj is denoted simply
 πj . 
πj
17. Write Rj = U ∩ Soc(G) . Since the action of G on I is transitive
and G = U Soc(G), then all projections Rj , j = 1, . . . , n are conjugate by
elements of U . Hence U ∩ Soc(G) ≤ R1 × · · · × Rn = R1 × R1t2 × · · · × R1tn .
18. By Remark 1.1.18 (4), if y ∈ U ∩ Soc(G) and g ∈ V , then (y g )π1 =
π1 g
(y ) . This is to say that R1 is a V -invariant subgroup of S1 .
Therefore R1 × · · · × Rn = R1 × R1t2 × · · · × R1tn is a V -invariant subgroup
of Soc(G).
19. By 5 and 18, we have two possibilities for each Ri :
a) either Ri is a proper subgroup of Si ; in this case,

U ∩ Soc(G) = R1 × · · · × Rn = (U ∩ S1 ) × · · · × (U ∩ Sn ),

b) or Ri = Si , i.e. the projections of U ∩ Soc(G) on each Si are surjective.

20. Let us deal first with the Case 19a: suppose that R1 is a proper sub-
group of S1 . Suppose that R1 ≤ T1 < S1 and T1 is a V -invariant subgroup of
S1 . Then T1 × T1t2 · · · × T1tn is U -invariant in Soc(G) and, by 5, we have that
T1 × T1t2 · · · × T1tn = U ∩ Soc(G) = R1 × · · · × Rn . Hence R1 = T1 .
This means that if R1 is a proper subgroup of S1 , then R1 is maximal with
respect to being a proper V -invariant subgroup of S1 .
21. If the projection π1 of U ∩ Soc(G) on S1 is not surjective, then two
possibilities arise:
a) either R1 = 1, i.e. U ∩ Soc(G) = 1: the core-free maximal subgroup U
complements Soc(G);
b) or 1 = R1 < S1 .
22. Suppose that 1 = R1 < S1 . Then, by 19a, R1 = U ∩ S1 and then
R1 ≤ V . Hence R1 = V ∩ S1 .
Moreover, if we suppose that there exists a proper subgroup M of N such
that V C ≤ M < N , then M ∩ S1 is a V -invariant subgroup of S1 and R1 ≤
M ∩ S1 . Observe that if S1 ≤ M , then N = V CS1 ≤ M and N = M , against
our assumption. Hence, R1 ≤ M ∩ S1 = S1 . By maximality of R1 , we have
that R1 = M ∩ S1 and then M = M ∩ CV S1 = CV (M ∩ S1 ) = CV R1 = CV .
Therefore V C is a maximal subgroup of N .
23. Now we consider the Case 19b. Assume that H is a supplement of
Soc(G) in G and we suppose that the projection of H ∩ Soc(G) on each
component Si of Soc(G) is surjective. Then, by Proposition 1.1.39, there exists
an H-invariant partition ∆ of I into blocks for the action of H on I such that
28 1 Maximal subgroups and chief factors
  πD
H ∩ Soc(G) = H ∩ Soc(G) ,
D∈∆
 πD
and, for each D ∈ ∆, the
 projection H ∩Soc(G) is a full diagonal subgroup
of the direct product i∈D Si .
Now we prove that H is maximal in G if and only if ∆ is a minimal
non-trivial G-invariant partition of I in blocks for the action of G on I.
Suppose 1 < Γ < ∆, where all are H-invariant partitions of I into blocks
for the action of H on I. Then by Proposition 1.1.39 (3), the product of
projections of H ∩ Soc(G) obtained from Γ is an H-invariant subgroup J of
Soc(G). By Proposition 1.1.39 (1b), H ∩ Soc(G) < J < Soc(G). But if H is
maximal in G, then H ∩ Soc(G) is maximal as an H-invariant subgroup of
Soc(G) as in 5. Hence H is not maximal in G.
Now suppose H < L < G. Then H Soc(G) = L Soc(G) = G implies
H ∩ Soc(G) < L ∩ Soc(G) < Soc(G). Then, by Proposition 1.1.39 (1c), L ∩
Soc(G) is the product of projections of H ∩ Soc(G) (which are the same as
the projections of L ∩ Soc(G)) obtained from a non-trivial proper refinement
Γ of ∆. Then by Proposition 1.1.39 (2), Γ is L-invariant so, like ∆, it is an
H-invariant set of blocks for the action of H on I. Thus if ∆ is a minimal
such partition of I, then H is maximal in G.
Finally, any H-invariant block is G-invariant, by 6.
24. If the projection of U ∩ Soc(G) on each component Si of Soc(G) is
surjective, then U ∩ Soc(G) = D1 ×  · · · × Dl , with
 1 ≤ l < n, and each Di is
isomorphic to S. Hence Soc(G) = U ∩ Soc(G) K1 and then G = U K1 .
25. In this study we have observed three different types of core-free max-
imal subgroups U of a primitive group G of type 2 according to the image of
the projection π1: U ∩ Soc(G) −→ S1 .
π1
a) U ∩ Soc(G) = S1 , i.e. the projection π1 of U ∩ Soc(G) on S1 is sur-
jective.   π1
b) 1 = R1 = U ∩ Soc(G) < S1 , i.e. the image of the projection π1 of
U ∩ Soc(G) on S1 is a non-trivial proper subgroup of S1 . In this case

1 = U ∩ Soc(G) = R1 × · · · × Rn = (U ∩ S1 ) × · · · × (U ∩ Sn ).
 π1
c) U ∩ Soc(G) = 1, i.e. U is a complement of Soc(G) in G.
26. With all the above remarks, we have a first approach to the O’Nan-
Scott classification of primitive groups of type 2. We have the following five
situations:
a) Soc(G) is a simple group, i.e. n = 1: the group G is almost simple;
b) n > 1 and U ∩ Soc(G) = D is a full diagonal subgroup of Soc(G);
c) n > 1 and U ∩ Soc(G) = D1 × · · · × Dl , a direct product of l subgroups,
with 1 < l < n, such that, for each j =  1, . . . , l, the subgroup Dj is a
full diagonal subgroup of a direct product i∈Ij Si , and {I1 , . . . , Il } is a
minimal non-trivial G-invariant partition of I in blocks for the action of
U on I;
 1.1 Primitive groups 29
  π1
d) n > 1 and the projection R1 = U ∩ Soc(G) is a non-trivial proper
subgroup of S1 ; here, R1 = V C ∩ S1 and V C/C is a maximal subgroup
of X.
e) U ∩ Soc(G) = 1.

This enables us to describe all configurations of primitive groups of type 2.

Proposition 1.1.41. Let S be a non-abelian simple group and consider an

almost simple group X such that S ≤ X ≤ Aut(S). Let Pn be a primitive
group of permutations of degree n. Construct the wreath product W = X Pn
and consider the subgroups DX = {(x, . . . , x) : x ∈ X} ≤ X  and DS =
{(s, . . . , s) : s ∈ S} ≤ S  . Clearly Pn ≤ CW (DX ). Suppose that U is a
subgroup of W such that DS ≤ U ≤ DX × Pn , and the projection of U on Pn
is surjective.
Then the group G = S  U is a primitive group of type 2 and U is a core-free
maximal subgroup of G.

Proof. It is clear that S  is a minimal normal subgroup of G and CG (S  ) = 1.

Hence G is a primitive group of type 2 and Soc(G) = S  .
Observe that DS = Soc(G) ∩ DX = Soc(G) ∩ U . Since Pn is a primitive
group, the action of U on the elements of the set {S1 , . . . , Sn } is primitive
and there are no non-trivial blocks. By 1.1.40 (23), U is a maximal subgroup
of G. 


Definition 1.1.42. A primitive pair (G, U ) constructed as in Proposition

1.1.41 is called a primitive pair with simple diagonal action.

A detailed and complete study of these primitive groups of simple diagonal

type appears in [Kov88].

Remarks 1.1.43. In a primitive pair (G, U ) with simple diagonal action, we

have the following.
1. U ∩ Soc(G) = DS = 1: this is the case 26b in 1.1.40
2. DS ∩ (S2 × · · · × Sn ) = 1 and Soc(G) = DS (S2 × · · · × Sn ). Hence
NG (S1 ) = NU (S1 ) Soc(G) = NU (S1 )(S2 × · · · × Sn ), and analogously for the
centraliser. Hence

NG (S1 )/ CG (S1 ) ∼
= NU (S1 )/ CU (S1 ).

Proposition 1.1.44. Let (Z, H) be a primitive pair such that either Z is an

almost simple group or (Z, H) is a primitive pair with simple diagonal action.
Write T = Soc(Z). Given a positive integer k > 1, let Pk be a transitive group
of degree k and construct the wreath product W = Z Pk . Write Pk−1 for the
stabiliser of 1.
Consider a subgroup G ≤ W such that
1. Soc(W ) = T  = T1 × · · · × Tk ≤ G,
2. the projection of G onto Pk is surjective,
30 1 Maximal subgroups and chief factors

3. the projection of NG (T1 ) = NW (T1 ) ∩ G = (Z1 × [Z2 × · · · × Zk ]Pk−1 ) ∩ G

onto Z1 is surjective.
Put U = G ∩ (H Pk ). Then G is a primitive group of type 2 and U is a
core-free maximal subgroup of G.

Proof. Set M = H ∩ T ; clearly NZ (M ) = H. With the obvious notation,

write M  = M1 × · · · × Mk . Then clearly H Pk ≤ NW (M  ). Moreover if
(z1 , . . . , zk )x ∈ NW (M  ), then zi ∈ NZi (Mi ) = Hi for any i = 1, . . . , k. Hence
H Pk = NW (M  ) and therefore U = NG (M  ).
Notice that T1 × · · · × Tk is a minimal normal subgroup of G and CG (T1 ×
· · ·×Tk ) = 1. Hence G is a primitive group of type 2 and Soc(G) = T1 ×· · ·×Tk .
Clearly G = U Soc(G). Since W is a semidirect product, every element of
W can be written uniquely as a product of an element of Z  and an element
of Pk . Hence, if (h1 , . . . , hk )x ∈ T  , for x ∈ Pk and hi ∈ Hi , i = 1, . . . , k, then
x = 1 and hi ∈ Ti ∩ Hi = Mi . Hence U ∩ Soc(G) = M  . In particular, U is
core-free in G. Let us see that U is a maximal subgroup of G.
Observe that NG (T1 ) = NW (T1 ) ∩ U Soc(G) = NU (T1 ) Soc(G). Let V1
be the projection of NU (T1 ) on Z1 . It is clear that V1 is contained in the
projection of U on Z1 , i.e. V1 ≤ H1 . Since the projection of NG (T1 ) onto Z1
is surjective and the projection of Soc(G) on Z1 is T1 , then Z1 = V1 T1 . Since
clearly M1 ≤ NG (T1 ), then M1 ≤ V1 ≤ H1 , so V1 ∩ T1 = M1 and by easy
order calculations, V1 = H1 .
Let L be an intermediate subgroup U ≤ L < G. By the above arguments,
the projection of NL (T1 ) on Z1 is an intermediate subgroup between H1 and
Z1 . By maximality of H in Z, we have that this projection is either H1 or Z1 .
Write Qi for the projection of L ∩ Soc(G) on Ti , for i = 1, . . . , k. Since L
acts transitively by conjugation on the elements of the set {T1 , . . . , Tk }, we
have that all Qi are isomorphic to a subgroup Q such that M ≤ Q ≤ T and
L ∩ Soc(G) ≤ Q1 × · · · × Qk . The subgroup L ∩ Soc(G) is normal in L and
then in NL (T1 ). Hence Q1 is normal in the projection of NL (T1 ) on Z1 . If this
projection is H1 , then Q is normal in H and then M ≤ Q  ≤ H ∩ T = M , i.e.
Q = M . In this case L = L ∩ U Soc(G) = U L ∩ Soc(G) = U .
Suppose that the projection of NL (T1 ) on Z1 is the whole of Z1 . Then Q is
a normal subgroup of Z and therefore Q = T . If for each i = 1, . . . , k we write
Ti = Si1 × · · · × Sir , where all the Sij are isomorphic copies of a non-abelian
simple group S, then we can put

Soc(G) = (S11 × · · · × S1r ) × · · · × (Sk1 × · · · × Skr ).

The projection of L ∩ Soc(G) oneachsimple component

π D is surjective. By Re-
mark 1.1.40 (23), L∩Soc(G) = D∈∆ L∩Soc(G) is a direct product of full
diagonal subgroups and the partition ∆ of the set {11, . . . , 1r, . . . , k1, . . . , kr}
associated with L ∩ Soc(G) is a set of blocks for the action of L. Observe that
M1 × 1 × · · · × 1 ≤ L ∩ Soc(G). If Z is an almost simple group, then r = 1
and D = {1} is a block of ∆. Hence, in this case, ∆ is the trivial partition of
 1.1 Primitive groups 31

{1, . . . , k}. If (Z, H) is a primitive pair of simple diagonal action, then M is a

full diagonal subgroup of T . Hence the set {11, . . . , 1r} is the union set of some
members D1 , . . . , Dl of the partition ∆. Since the projection of L ∩ Soc(G) on
l  π D
T1 is surjective, then T1 = i=1 L ∩ Soc(G) i ∼ = S1 × · · · × Sl (here the Si ’s
are simply the names of the projections). Hence l = r. Since L is transitive on
the Ti ’s, so that because the blocks corresponding to T1 have one element, all
the blocks do. In other words, L ∩ Soc(G) = T1 × · · · × Tk . Hence L = G.  
Definition 1.1.45. A primitive pair (G, U ) constructed as in Proposition
1.1.44 is called a primitive pair with product action.
A detailed and complete study of these primitive groups in product action
appears in [Kov89].
Remarks 1.1.46. 1. If (Z, H) is a primitive pair, then Z is a permutation
group on the set of right cosets of H in Z and the cardinality of Ω is |Z : H|
(the degree of the permutation group Z). Now, if (G, U ) is a primitive pair with
product action, as in Proposition 1.1.44, then the degree of the permutation
group G is

|G : U | = |G : G ∩ (H Pk )| = |W : H Pk | = |Z : H|k .

2. Observe that we have two different types of primitive pairs with product
action:
a) If Z is an almost simple group, T = Soc(Z), π1 and R = H ∩ T , then
1 = R < T and the projection R1 = U ∩ Soc(G) is a non-trivial proper
subgroup of T1 , by Proposition 1.1.16; this is Case 26d in 1.1.40.
b) If (Z, H) is a primitive pair with simple diagonal action, then U ∩
Soc(G) = D1 × · · · × Dk a direct product of k full diagonal subgroups, with
1 < k < n; here we are in Case 26c of 1.1.40.
Examples 1.1.47. 1. Let S be a non-abelian simple group and H a maximal
subgroup of S. If C is a cyclic group of order 2, construct the wreath product
G = S C with respect to the regular action. The group G is a primitive group
of type 2 and Soc(G) = S  = S1 × S2 .
Consider the diagonal subgroup D = {(x, x) : x ∈ S}. Then U = D×C is a
core-free maximal subgroup of G and (G, U ) is a primitive pair with diagonal
action.
Consider now the subgroup U ∗ = H C = [H1 × H2 ]C. Then U ∗ is also a
core-free maximal subgroup of G and the pair (G, U ∗ ) is a primitive pair with
product action.
2. Let G be the primitive group of Example 1 and construct the wreath
product W = G Z with respect to the regular action of the cyclic group Z of
order 2. Then, the socle of W is isomorphic to the direct product of four copies
of S: Soc(W ) = S1 × S2 × S3 × S4 . Moreover Soc(W ) is complemented by a
2-subgroup P isomorphic to the wreath product C2 C2 , that is, isomorphic
to the dihedral group of order 8. The group W is a primitive group of type 2.
32 1 Maximal subgroups and chief factors

If we consider the maximal subgroup U of G and construct M = U Z,

we obtain a core-free maximal subgroup of index |W : M | = |S|2 such that
M ∩ Soc(W ) = D1 × D2 . Taking now the maximal subgroup U ∗ of G, then
the subgroup M ∗ = U ∗ Z is another core-free maximal subgroup of W of
index |S : H|4 such that M ∗ ∩ Soc(G) = H1 × H2 × H3 × H4 .
Therefore the pairs (W, M ) and (W, M ∗ ) are non-equivalent primitive pairs
of type 2 with product action.
Write DS = {(s, s, s, s) : s ∈ S}, the full diagonal subgroup of Soc(W ).
Observe that M contains properly the subgroup M0 = DS × P and therefore
M0 is non-maximal in W .

According to Remark 1.1.40 (26), there still remains another structure of

primitive group of type 2 to describe: those primitive groups of type 2 with
the special property that the core-free maximal subgroup is a complement of
the socle. This new configuration is in fact a twisted wreath product.

Theorem 1.1.48. 1. If (G, U ) is a primitive pair of type 2 and U ∩Soc(G) =

1, then, with the notation of Definition 1.1.32, G ∼ = S (V,ϕ) U .
2. Conversely, let S be a non-abelian simple group and a group U with a sub-
group V such that there exists a group homomorphism ϕ : V −→ Aut(S).
Construct the twisted wreath product G = S (V,ϕ) U . If CoreU (V ) = 1 then
G is a primitive group of type 2. Moreover, if U is maximal in G, then
(G, U ) is a primitive pair of type 2. By construction, U ∩ Soc(G) = 1.

Proof. 1. Recall that G is the induced extension defined by α : N/K1 −→

G/ Soc(G). Hence Soc(G) is the induced U -group from the action ϕ of V on
S (see Remark 1.1.40 (10)). Since G splits on Soc(G), then G is isomorphic
to the twisted wreath product G ∼ = S (V,ϕ) U .
2. To prove the converse, it is enough to recall that in the twisted wreath
product G = S (V,ϕ) U , we have that CG (Z  ) = Z(S  ) = 1, by Proposi-
tion 1.1.34, and the conclusion follows. 


Definition 1.1.49. A primitive pair (G, U ) constructed as in Theorem 1.1.48

is called a primitive pair with twisted wreath product action.

Maximal subgroups of a primitive group G of type 2 complementing

Soc(G) are called by some authors small maximal subgroups.
Obviously one can wonder about the existence of primitive groups of type 2
with small maximal subgroups. P. Förster, in [För84a], gives sufficient con-
ditions for U , V , and S to obtain a primitive group with small maximal
subgroups.

Theorem 1.1.50 ([För84a]). Let U be a group with a non-abelian simple

non-normal subgroup S such that whenever A is a non-trivial subgroup of U
such that S ≤ NU (A), then S ≤ A. Write V = NU (S) and ϕ : V −→ Aut(S)
for the obvious group homomorphism induced by the conjugation. Construct
the twisted wreath product G = S (V,ϕ) U .
 1.1 Primitive groups 33

Then G is a primitive group of type 2 such that Soc(G) = S  , the base

group, is complemented by a maximal subgroup of G isomorphic to U .
Proof. First we see that if CU (S) = 1, then, by hypothesis, we have that
S ≤ CU (S) and this contradicts the fact that S is a non-abelian simple group.
Hence CU (S) = 1 and ϕ is in fact a monomorphism of V into Aut(S) and V
is an almost simple group such that Soc(V ) = S.
Write n = |U : V | and S  = S1 × · · · × Sn . Since U acts a transitive
permutation group by right multiplication on the set of right cosets of V in
U , and then on the set I = {1, . . . , n}, S  is a minimal non-abelian subgroup
of G. Moreover, if C = CoreU (V ) = 1, then S ≤ NU (C) = U . Now C is
an almost simple group with Soc(C) = S. Hence S is normal in U , giving a
contradiction. Hence C = CoreU (V ) = 1. Therefore, to prove that (G, U ) is a
primitive pair of type 2 with twisted wreath product action by Theorem 1.1.48,
it only remains to prove U is a maximal subgroup of G. To do this, let M be
a maximal subgroup  of G such that
 U ≤ M . Observe that  M = M ∩ G =
πj
M ∩ U Soc(G) = U M ∩ Soc(G) . All projections Rj = M ∩ Soc(G) , for
j ∈ I, are conjugate by elements of M , that is, all Ri are isomorphic to the
subgroup R1 and S1 ∩ U ≤ R1 ≤ S1 and M ∩ Soc(G) ≤ R1 × · · · × Rk . Observe
that V ≤ NG (S1 ) by (1.3) in Proposition 1.1.31, since v = v1,v , for all v ∈ V ,
and 1v = 1. By 1.1.18 (4), (y v )π1 = (y π1 )v , for all y ∈ M ∩ Soc(G).
 Since the
π1
subgroup S normalises M ∩ Soc(G), then S normalises R1 = M ∩ Soc(G) .
The automorphisms induced in S1 by S are the inner automorphisms. Hence
R1 is a normal subgroup of S1 , and, since S1 is a simple group, we have that
R1 = 1 or R1 = S1 . In the first case, we have that M ∩ Soc(G) = 1 and then
M = U . Thus, assume that the projections πj are surjective, for all j ∈ I.
By 1.1.40 (23), there exists a minimal non-trivial M -invariant partition ∆
of I in blocks for the action of M on I such that
  πD
M ∩ Soc(G) = M ∩ Soc(G) ,
D∈∆
  πD
and, for each D ∈ ∆, the
 projection M ∩Soc(G) is a full diagonal subgroup
of the direct product i∈D Si .
For each y ∈ M ∩ Soc(G) ad x ∈ M , we have that (y x )πDx = (y πD )x for
any D ∈ ∆. Suppose that ∆0 is an orbit of the action of M on ∆. Then the
subgroup   π D
T = M ∩ Soc(G)
D∈∆0

is normal in M . If ∆0 is a proper subset of ∆, then there exists some j which

is not in a member of ∆0 . Then Sj centralises T and then T is normal in
M, Sj . Since T is a proper subgroup of Soc(G), we have that Sj ≤ M , by
maximality of M . But this implies that Soc(G) ≤ M , and this  is not true.

Hence, M acts transitively on ∆. And so does U , since M = U M ∩ Soc(G) .
Assume that each member D of ∆ has m elements of I and |∆| = l, i.e.
n = lm. Since ∆ is a non-trivial partition, then m > 1.
34 1 Maximal subgroups and chief factors

Suppose that l = 1. This means that M ∩Soc(G) is a full diagonal subgroup

of Soc(G). Hence M = [M ∩ Soc(G)]U and M ∩ Soc(G) is a normal subgroup
of M which is isomorphic to S (π1 is an isomorphism between M ∩ Soc(G)
and S1 ). This gives a homomorphism ψ : U −→ Aut(S) whose restriction to
V is the monomorphism ϕ. Notice that Ker(ψ) is a normal subgroup of U
and, by hypothesis, if Ker(ψ) = 1, then S ≤ Ker(ψ). This contradicts the fact
that ϕ is a monomorphism. Therefore Ker(ψ) = 1 and ψ is a monomorphism.
Since S ψ = Inn(S) is normal in U ψ ≤ Aut(S), then S is normal in U . But
this contradicts the fact that CoreU (S) = 1. Hence l > 1.
The partition ∆ has l members which are blocks for the action of M (or
U ) on I. Write ∆ = {D1 , . . . , Dl }. The subgroup U acts transitively on ∆.
We can assume without loss of generality that 1 ∈ D1 . Let U1 denote the
stabiliser of D1 by the action of U on ∆. Clearly |U : U1 | = l.
For any x ∈ V , since V ≤ NG (S1 ), then 1x = 1 and 1 ∈ D1 ∩ Dπ1 D. 1Hence
x

D1 = D1 and x ∈ U1 . Therefore V ≤ U1 . Since D1 = M ∩ Soc(G)

x ∼
= S,
∼
there exists a group homomorphism ψ : U1 −→ Aut(D1 ) = Aut(S) whose
restriction to V is the monomorphism ϕ. Repeating the arguments of the above
paragraph, we obtain that S ψ is normal in U1ψ and then U1 ≤ NU (S) = V .
Therefore V = U1 .
But now we have that l = |U : U1 | = |U : V | = n, and then m = 1.
This is the final contradiction. Thus we deduce that U is a maximal subgroup
of G. 

Remarks 1.1.51. 1. Examples of pairs U , S satisfying the conditions of the
hypothesis of Theorem 1.1.48 are S = Alt(n) and U = Alt(n + 1), for n ≥ 5.
In this case S is maximal in U . Also S = PSL(2, pn ) and U = PSL(2, p2n ), for
pn ≥ 3 satisfies the hypothesis. Here NU (S) ∼ = PGL(2, pn ) is maximal in U .
2. In [Laf84b], J. Lafuente proved that if G is a primitive group of type 2
and U is a small maximal subgroup of G, then U is also a primitive group of
type 2 and each simple component of Soc(U ) is isomorphic to a section of the
simple component of Soc(G).
The O’Nan-Scott Theorem proves that these are all possible configurations
of primitive groups of type 2.
Theorem 1.1.52 (M. O’Nan and L. Scott). Let G be a primitive group
of type 2 and U a core-free maximal subgroup of G. Then one of the following
holds:
1. G is an almost simple group;
2. (G, U ) is equivalent to a primitive pair with simple diagonal action; in this
case U ∩ Soc(G) is a full diagonal subgroup of Soc(G);
3. (G, U ) is equivalent to a primitive pair with product action such that U ∩
Soc(G) = D1 × · · · × Dl , a direct product of l > 1 subgroups such that, for
each j =1, . . . , l, the subgroup Dj is a full diagonal subgroup of a direct
product i∈Ij Si , and {I1 , . . . , Il } is a minimal non-trivial G-invariant
partition of I in blocks for the action of U on I.
 1.1 Primitive groups 35

4. (G, U ) is equivalent
 to a primitive
π1 pair with product action such that the
projection R1 = U ∩ Soc(G) is a non-trivial proper subgroup of S1 ; in
this case R1 = V C ∩ S1 and V C/C is a maximal subgroup of X;
5. (G, U ) is equivalent to a primitive pair with twisted wreath product action;
in this case U ∩ Soc(G) = 1.

Proof. Recall that by 1.1.40 we can distinguish five different cases.

Case 1. If n = 1, then G is an almost simple group. Thus we suppose that
n > 1.
Case 2. Assume that n > 1 and U ∩Soc(G) = D is a full diagonal subgroup
Then there exist automorphisms ϕi ∈ Aut(S), i ∈ I, such that D =
U ∩ Soc(G) = {(xϕ1 , xϕ2 , . . . , xϕn ) : x ∈ S}. Since D is normal in U and U is
maximal in G, we have that U = NG (D). Let Pn be the permutation group
induced by the conjugacy action of G on the simple components of Soc(G):
Pn = G/Y (see 1.1.40 (13)). By 1.1.40 (23), the group Pn is transitive and
primitive. We embed G in X Pn as in 1.1.40 (13) and then in Aut(S) Pn .
Consider ϕ = (ϕ−1 −1
1 , . . . , ϕn ) ∈ Aut(S) ≤ Aut(S) Pn . By conjugation by
n

ϕ in Aut(S) Pn , we have that D = DS = {(x, . . . , x) : x ∈ S} and U ϕ =

ϕ

NGϕ (DS ) = Gϕ ∩ (DX × Pn ), where DX = {(x, . . . , x) : x ∈ X}. Then

Gϕ = U ϕ S  and, since Siϕ = Si , for all i ∈ I, the action of U ϕ and of U
on I are the same. Hence, the projection of U ϕ onto Pn is surjective. By
Proposition 1.1.41, we have that (Gϕ , U ϕ ) is a primitive pair with simple
diagonal action and is equivalent to (G, U ).
Case 3. Assume that n > 1 and U ∩ Soc(G) = D1 × · · · × Dl , a direct
product of l > 1 subgroups such that, for each j= 1, . . . , l, the subgroup Dj
is a full diagonal subgroup of a direct product i∈Ij Si , and {I1 , . . . , Il } is
a minimal non-trivial U -invariant partition of I in blocks for the action of U
on I.
Suppose that the Si are ordered in such a way that I1 = {1, . . . , m}. Write
K = S1 × · · · × Sm , N ∗ = NG (K), C ∗ = CG (K). Observe that I1 is a minimal
block for the action of G on I. Then N ∗ acts transitively and primitively
on I1 . Hence, X ∗ = N ∗ /C ∗ is a primitive group whose socle is Soc(X ∗ ) =
KC ∗ /C ∗ . Put V ∗ = U ∩N ∗ . Since Soc(G) ≤ N ∗ , then N ∗ = N ∗ ∩U Soc(G) =
V ∗ Soc(G) = V ∗ C ∗ K. Moreover K ∩ V ∗ = K ∩ N ∗ ∩ U = K ∩ U = D1 . Let
{g1 = 1, . . . , gl } be a right transversal of V ∗ in U (and of N ∗ in G). We can
assume that this transversal is ordered in such a way that D1gi = Di , for
i = 1, . . . , l, and put Ki = K gi , for i = 1, . . . , l. Then G acts transitively, by
conjugation of the Ki ’s, on the set {K1 , . . . , Kl }.
Clearly D1 is a V ∗ -invariant subgroup of K. Suppose that D1 ≤ T1 < K1
and T1 is a V ∗ -invariant subgroup of K1 . Then T1 ×T1g2 · · ·×T1gl is U -invariant
in Soc(G) and, by maximality of U , we have that T1 × T1g2 · · · × T1gl = U ∩
Soc(G) = D1 ×· · ·×Dl . Hence D1 = T1 . In other words, D1 is maximal as V ∗ -
invariant subgroup of K and then a maximal V ∗ C ∗ -invariant subgroup of K.
Suppose that s ∈ S1 ∩V ∗ C ∗ . There exist v ∈ V ∗ and c ∈ C ∗ , such that s = vc.
Now v = sc−1 ∈ CG (Si ), for i = 2, . . . , m and v ∈ S1 CG (S1 ) ≤ NG (S1 ).
36 1 Maximal subgroups and chief factors

Consider the element (t, tϕ2 . . . , tϕm ) ∈ D1 associated with some t ∈ S1 ;

then (t, tϕ2 . . . , tϕm )v = (tv , tϕ2 . . . , tϕm ) ∈ D1 , since D1 is normal in V ∗ .
Hence tv = t. This happens for any t ∈ S1 and therefore v ∈ CG (S1 ). Hence
s ∈ CS1 (S1 ) = 1. Therefore S1 ∩ V ∗ C ∗ = 1 and then K = K ∩ V ∗ C ∗ . Since
D1 ≤ V ∗ C ∗ ∩ K ≤ K and D1 is maximal as V ∗ C ∗ -subgroup of K, we have
that D1 = V ∗ C ∗ ∩ K. And, finally, if M is a maximal subgroup of N ∗ such
that V ∗ C ∗ ≤ M , then M ∩ K is a V ∗ C ∗ -invariant subgroup of K containing
D1 . Hence D1 = V ∗ C ∗ ∩ K = M ∩ K. Now M = M ∩ N ∗ = M ∩ V ∗ C ∗ K =
V ∗ C ∗ (M ∩ K) = V ∗ C ∗ . Therefore V ∗ C ∗ /C ∗ is a core-free maximal subgroup
of X ∗ .
Observe that (V ∗ C ∗ /C ∗ ) ∩ Soc(X ∗ ) = D1 C ∗ /C ∗ is a full diagonal sub-
group of Soc(X ∗ ). Thus X ∗ is a group of Case 2. Hence (X ∗ , V ∗ C ∗ /C ∗ ) is a
primitive pair with simple diagonal action.
l
Write Pl = G/ i=1 NG (Ki ) for the permutation group induced by the
action of G by conjugation of the Ki ’s. For any g ∈ G, we write g ρ for the
projection of g in Pl . On the other hand, for each g ∈ G and each i ∈ {1, . . . , l},
let ai,g be the element of N ∗ such that gi g = ai,g gj , for some j. For any a ∈ N ∗ ,
write ā = aC ∗ for the projection of a on X ∗ . Consider the conjugacy action
ψ : N ∗ −→ Aut(K) and the induced G-action on (X ∗ ) :

ψ G : G −→ X ∗ Pl
G
given by g ψ = (ā1,g , . . . , āl,g )g ρ , for any g ∈ G.

Arguing as in 1.1.40 (13–14), we have that

1. the map ψ G is a group homomorphism and is injective; the projection of
G
Gψ on Pl is surjective;
2. NG (K1 )ψ = Gψ ∩(X1∗ ×[X2∗ ×· · ·×Xl∗ ]Pl−1 ), where Pl−1 is the stabiliser
G G

of 1. The image of NG (K1 ) by the projection on the first component of

(X ∗ ) is the whole of X1∗ ;
3. the elements of Soc(G) can be written as (e1 , eg22 , . . . , egl l ), for certain
e1 , . . . , el ∈ K1 . The image by ψ G of the elements of the socle is
G
(e1 , eg22 , . . . , egl l )ψ = (ē1 , ē2 , . . . , ēl ),

and then (KC ∗ /C ∗ ) = Soc(X ∗ Pl ) ≤ Gψ .

G

Now, for any g ∈ U , since the gi ∈ U , we have that ai,g ∈ N ∗ ∩ U = V ∗ .

 
Hence U ψ ≤ Gψ ∩ (V ∗ C ∗ /C ∗ ) Pl . Since V ∗ C ∗ /C ∗ is maximal in X ∗ and
G G

 
U ψ is maximal in Gψ , we have that U ψ = Gψ ∩ (V ∗ C ∗ /C ∗ P1 . By
G G G G

G G
Proposition 1.1.44, this means that (G, U ) is equivalent to (Gψ , U ψ ) which
is a primitive pair with product action.  π1
Case 4. Suppose now n > 1 and the projection R1 = U ∩ Soc(G) is a
non-trivial proper subgroup of S1 .
Moreover, R1 = V C ∩ S1 and V C is a maximal subgroup of N .
Consider the embedding ψ G : G −→ X Pn of 1.1.40 (13). Then X is
G
almost simple and G is isomorphic to a subgroup Gψ of X Pn satisfying
 1.1 Primitive groups 37
G G  
all conditions of Proposition 1.1.44. Hence U ψ ≤ Gψ ∩ (V C/C) Pn .
G G
Since V C/C is maximal in X and U ψ is maximal in Gψ , we have that
U ψ = Gψ ∩ (V C/C) Pn . Therefore (G, U ) is equivalent to a primitive pair
with product action.
Case 5. Assume finally that U ∩ Soc(G) = 1. Then, by Theorem 1.1.48,
G ∼= S (V,ϕ) U and the pair (G, U ) is equivalent to a primitive pair with
twisted wreath product action. 


If U is a core-free maximal subgroup of a primitive group G of type 2,

then there are exactly three different possibilities as we saw in 1.1.40 (25):
 π1
1. U ∩ Soc(G) = S1 , i.e. the projection π1 of U ∩ Soc(G) on S1 is sur-
jective.   π1
2. 1 = R1 = U ∩ Soc(G) < S1 , i.e. the image of the projection π1 of
U ∩ Soc(G) on S1 is a non-trivial proper subgroup of S1 .

1 = U ∩ Soc(G) = R1 × · · · × Rn = (U ∩ S1 ) × · · · × (U ∩ Sn ).
 π1
3. U ∩ Soc(G) = 1, i.e. U is a complement of Soc(G) in G.
As we saw in 1.1.35, in a primitive group G of type 2, there exists a
bijection between
1. the set of all conjugacy
 classes
π1 of maximal subgroups U of G such that
the projection U ∩ Soc(G) is a proper subgroup of S1 ,
2. the set of all conjugacy classes of maximal subgroups of N/(S2 × · · · × Sn )
supplementing Soc(G)/(S2 × · · · × Sn ).
Under this bijection, the complements, if any, of Soc(G) in G are in corres-
pondence with the complements of Soc(G)/K1 in N/K1 . Thus, this bijection
works in Cases 2 and 3. Since core-free maximal subgroups of Case 2 occur in
every primitive group of type 2, these are called frequent maximal subgroups
by some authors. We complete this study in the following way.

Proposition 1.1.53. Let G be a primitive group of type 2. There exist bijec-

tions between the following sets:
1. the set of all
 conjugacy classes of maximal subgroups U of G such that the
π1
projection U ∩ Soc(G) is a non-trivial proper subgroup of S1 ,
2. the set of all conjugacy classes of maximal subgroups of N/(S2 × · · · × Sn )
supplementing but not complementing Soc(G)/(S2 × · · · × Sn ), and
3. the set of all conjugacy classes of core-free maximal subgroups of X.

Proof. We only have to see the bijection between the sets in 2 and 3. Write
K = S2 × · · · × Sn and observe that if L/C is core-free maximal subgroup of
X, then obviously L/K is a maximal subgroup of N/K and N = L Soc(G).
If L/K complements Soc(G)/K in N/K, then K = L ∩ Soc(G); in particular
L ∩ S1 = 1. But L ∩ S1 C = C(L ∩ S1 ) = C and this contradicts the fact
38 1 Maximal subgroups and chief factors

that (L/C) ∩ (S1 C/C) is non-trivial by Proposition 1.1.16. Thus L does not
complement Soc(G)/K in N .
Conversely, let L/K be a maximal subgroup of N/K such that N =
L Soc(G) and K < Soc(G) ∩ L. Let us see that C ≤ L. Consider L0 /K =
CoreN/K (L/K). Since Soc(G)/K is a minimal normal subgroup of N/K,
then L0 /K ≤ CN/K Soc(G)/K = C/K and L0 ≤ C. If L0 = C, then
C ≤ L and we are done. Suppose that C/L0 is nontrivial. Since L/L0 is
a core-free maximal subgroup of N/L0 , it is clear that N/L0 is a prim-
itive group. Observe
 that Soc(G)L
 0 /L0 is a minimal normal subgroup of
N/L0 and CN/L0 Soc(G)L0 /L0 = C/L0 . Since we are assuming that C/L0
is nontrivial, the primitive group N/L0 is of type 3. Hence L/L0 comple-
ments Soc(G)L0 /L0 . This is to say that L ∩ Soc(G) ≤ L0 , i.e. L ∩ Soc(G) =
L0 ∩ Soc(G). Therefore L ∩ Soc(G) is a normal subgroup of N between K and
Soc(G). Since Soc(G)/K ∼ = S, a non-abelian simple group, and L supplements
Soc(G) in N , we have that K = Soc(G) ∩ L. This is not possible. 


As we saw in 1.1.35, the existence of complements of the socle in a prim-

itive group G of type 2 is characterised by the existence of complements of
Soc(G)/(S2 × · · · × Sn ) in NG (S1 )/(S2 × · · · × Sn ). We wonder whether it
is possible to obtain a characterisation of the existence of complements of
Soc(G) in G in terms of complements of Soc(X) in X as we saw in 1.1.53 for
supplements. The answer is partially affirmative.

Corollary 1.1.54. With the notation of 1.1.40, let G be a primitive group of

type 2 such that Soc(X) is complemented in X. Then Soc(G) is complemented
in G.
The converse does not hold in general.

Proof. Suppose that there exists a subgroup Y ≤ N such that C ≤ Y and

N = Y S1 and Y ∩ S1 C = C. Then it is clear that

S2 × · · · × Sn ≤ Y ∩ Soc(G) ≤ Y ∩ S1 C ∩ Soc(G) = C ∩ Soc(G) = S2 × · · · × Sn

and therefore Y is a complement of Soc(G)/(S2 ×· · ·×Sn ) in N/(S2 ×· · ·×Sn ).

The conclusion follows by Theorem 1.1.35.
It is well-known that if S = Alt(6), the alternating group of degree 6,
the automorphism group A = Aut(S) is an almost simple group whose socle
is non-complemented. With the cyclic group C ∼ = C2 we consider the reg-
ular wreath product H = A C. In H we consider the diagonal subgroups
DS = {(x, x) : x ∈ S)} and DA = {(x, x) : x ∈ A}. Then NH (DS ) = DA C.
Since DS ∼ = S, the conjugacy action of NH (DS ) on DS gives a group homo-
morphism ϕ : NH (DS ) −→ Aut(S). We construct the twisted wreath product
G = S (NH (DS ),ϕ) H. Then Soc(G) = S1 × · · · × Sn is a minimal normal
subgroup of G and it is the direct product of n =  |H : NH (D)| copies of
S. Moreover since CoreH NH (DS ) = 1, then CG Soc(G) = 1 by Propos-
ition 1.1.34 (2). Hence G is a primitive group of type 2. Clearly Soc(G) is
 1.1 Primitive groups 39

complemented in G. NH (S1 ) = NH (DS ) = DA C and CH (S1 ) = Ker(ϕ) =

CH (DS ) = C. Hence, X ∼
= DA ∼= A and Soc(X) is not complemented in X.



Primitive pairs (G, U ) of diagonal type, i.e. core-free maximal subgroups

U of primitive groups G of type 2 such that the projection π1 of U ∩ Soc(G)
on S1 is surjective, appear in Cases (2) and (3) of the O’Nan-Scott Theorem.
In this case U ∩ Soc(G) is a direct product of l full diagonal subgroups, with
1 ≤ l < n, and U = NG (D).

Proposition 1.1.55. Let G be a primitive group of type 2. Given a minimal

non-trivial partition ∆ = {I1 , . . . , Il } of I in blocks for the action of G on I
 a subgroup D = D1 × · · · × Dl , where Dj is a full diagonal subgroup of
and
i∈Ij Si , for each j = 1, . . . , l, associated with ∆. The following statements
are pairwise equivalent:
1. there exists a maximal subgroup U of G such that U ∩ Soc(G) = D;
2. NG (D) is a maximal subgroup of G;
3. G = NG (D) Soc(G).

Proof. 1 implies 2. Suppose that there exists a maximal subgroup U of G such

that U ∩ Soc(G) = D. Then U ≤ NG (D) and, by maximality of U in G, we
have that U = NG (D).
2 implies 3. Observe that NG (D) ∩ Soc(G) = NSoc(G) (D) = D, by
Lemma 1.1.38, and then Soc(G) ≤ NG (D). Therefore G = NG (D) Soc(G).
3 implies 1. Let H be a maximal subgroup of G such that NG (D) ≤ H.
Then D = NSoc(G) (D) = Soc(G) ∩ NG (D) ≤ Soc(G) ∩ H. Then H ∩ Soc(G)
is a direct product of full diagonal subgroups associated with a partition of I
which refines {I1 , . . . , Il }, by Proposition 1.1.39. By minimality of the blocks,
we have that H ∩ Soc(G) = D and therefore H = NG (D). 


Example 1.1.56. We construct a primitive group G of type 2 with no maximal

subgroup of diagonal type. Consider the symmetric group of degree 5, H ∼ =
Sym(5) and denote with S the alternating group of degree 5. If C is a cyclic
group of order 2, let G be the regular wreath product G = H C. Then
Soc(G) = S1 × S2 ∼ = Alt(5) × Alt(5). Any full diagonal subgroup of Soc(G)
is isomorphic to Alt(5) and its normaliser N is isomorphic to Sym(5) × C2 .
Observe that |G/ Soc(G)| = 8 > 4 = |N Soc(G)/ Soc(G)|. Hence N does not
satisfy 3. Clearly N Soc(G) is a normal maximal subgroup of G containing N .

Proposition 1.1.57. Let G be a primitive group of type 2. Two maximal

subgroups U , U ∗ of G, such that U ∩Soc(G) and U ∗ ∩Soc(G) are direct products
of full diagonal subgroups, are conjugate in G if and only if U ∩ Soc(G) and
U ∗ ∩ Soc(G) are conjugate in Soc(G).
∗
 Suppose that U = U for some ∗g ∈ G. Then x ∈
g
Proof.  g = xh, with
g
NG U ∩Soc(G) and h ∈ Soc(G). Hence U ∩Soc(G) = U ∩Soc(G) = U ∩
40 1 Maximal subgroups and chief factors
h  h
Soc(G) . Conversely, if U ∗ ∩ Soc(G)
 = U ∩ Soc(G) for some h ∈ Soc(G),
   h  h
then U ∗ = NG U ∗ ∩ Soc(G) = NG U ∩ Soc(G) = NG U ∩ Soc(G) =
U h. 


1.2 A generalisation of the Jordan-Hölder theorem

In the first book dedicated to Group Theory, the celebrated Traité des sub-
stitutions et des équations algébriques ([Jor70]), published in Paris in 1870,
the author, C. Jordan, presents the first version of a theorem known as the
Jordan-Hölder Theorem: The length of all composition series of a finite group
is an invariant of the group and the orders of the composition factors are
uniquely determined by the group. Nineteen years later, in 1889, O. Hölder
([Höl89]) completed his contribution to the theorem proving that not only
the orders but even the composition factors are uniquely determined by the
group.
In recent years a number of generalisations of the classic Jordan-Hölder
Theorem have been done. For example it has been proved that given two chief
series of a finite group G, there is a one-to-one correspondence between the
chief factors of the series, corresponding factors being G-isomorphic, such that
the Frattini chief factors of one series correspond to the Frattini chief factors
of the other (see [DH92, A, 9.13]). This result was first published by R. W.
Carter, B. Fischer, and T. O. Hawkes (see [CFH68]) for soluble groups, and
for finite groups in general by J. Lafuente (see [Laf78]). A further contribution
is given by D. W. Barnes (see [Bar72]), for soluble groups, and again by
J. Lafuente [Laf 89] for finite groups in general, describing the bijection in terms
of common supplements.
But if we restrict our arguments to a proper subset of the set of all maximal
subgroups, we find that this is no longer true. For instance, in the elementary
abelian group G of order 4, there are three maximal subgroups, say A, B, and
C. If we consider the set X = {A, B}, the maximal subgroup B is a common
complement in X for the chief factors A and C. Also G/A is complemented
by A ∈ X. However G/C has no complement in X.
In general, the key of the proof of these Jordan-Hölder-type theorems is to
prove the result in the particular case of two pieces of chief series of a group
G of the form

1 < N1 < N1 × N 2 1 < N 2 < N 1 × N2

where N1 and N2 are minimal normal subgroups of G. It is not difficult to

prove that if N1 N2 /N1 is supplemented by a maximal subgroup M , then M
also supplements N2 (see Lemma 1.2.16), but the converse is not true. The
particular case in which N1 and N2 are supplemented and either N1 N2 /N1 or
N1 N2 /N2 is a Frattini chief factor is the hardest one (see [DH92, A, 9.12]) and,
Other documents randomly have
different content
 TABLE GÉNÉRALE

DES MATIÈRES
DU TABLEAU DE PARIS.

Les tomes sont indiqués par les chiffres romains: I, II, III, IV;
a, marque la première partie; b, la seconde. Les chiffres arabes
indiquent la pagination.

A.
Abailard, III, a, 553.
Abattoir de Villejuif, III, a, 661.
Abattoirs de Paris, leur nombre, IV, b, 536.
—Description, 537.
Abbaye Notre-Dame-aux-Bois, IV, a, 292.
Abbés de Saint-Vincent de Senlis (hôtel des), III, a, 615.
Abbés de Saint-Denis, leur hôtel, III, b, 709.
Abbon, auteur d'un poëme latin sur le siége de Paris par les
Normands, I, a, 29.
Académies, I, b, 802.
—— françoise, son origine, I, b, 802.
—Son état au 17e siècle, ib.
—Ce qu'elle fut au 18e, 803.
—Son triomphe à la révolution, ib.
—Rampe sous le tyran, ib.
—Ce qu'elle est aujourd'hui, ib.
—— royale des Inscriptions et Belles-Lettres, I, b, 804.
—Ses services, ib.
—— des Sciences, reçut une forme régulière en 1699, I, b, 805.
—Son but, ib.
—— de Peinture et Sculpture, I, b, 806.
—Ses succès, 807.
—— d'Architecture, I, b, 808.
Adam, clerc du Roi, lègue deux maisons dans Paris à l'Hôtel-
Dieu, I, a, 372.
Affaires étrangères (nouvel hôtel des), IV, b, 531.
Agathe (les filles de Sainte-), origine, III, b, 485.
Agio, ce que c'étoit, IV, b, 49.
Agnès (chapelle Sainte-) ou Saint-Eustache, II, a, 298.
Agnès (communauté de Sainte-), II, a, 313.
—Zèle et charité de ces religieuses, 314.
Agnès de Russie, femme de Henri Ier, I, b, 543.
Agobard rejette les épreuves de l'eau, du feu, etc., I, a, 352.
Agriculture (société royale d'), II, b, 1137.
Aides (cour des), son origine, I, a, 185.
—Costume des membres de cette cour, 188.
—Ses attributions, ib.
—Lieu de ses séances, 189.
—Son rang dans les cérémonies, ib.
Aignan (la chapelle Saint-), I, a, 280.
—Son origine et son emplacement, ib.
—— (hôtel Saint-), II, b, 1004.
Aiguillon (le duc d') excite en Bretagne une opposition
séditieuse, IV, b, 361.
Alais (Jean), tradition sur ce personnage, II, a, 298.
Albiac (hôtel d') détruit, III, a, 615.
Albigeois, I, b, 691.
Albret (hôtel d'), II, b, 1319; III, b, 569.
Alençon (hôtel d'), I, b, 594 et 827.
Alexandre VIII succède à Innocent XI, IV, a, 130.
Alexia, défaite des Gaulois auprès de cette ville, I, 10.
Aligre (hôtel d'), I, b, 832.
—— (ancien hôtel d') détruit, II, a, 329.
Allemands (collége des), III, a, 598.
Amalarion, diacre, rédige une règle pour les chanoines, I, a, 358.
Ambigu-Comique, II, b, 1133.
Amboise (le cardinal d'), sa réponse aux députés de l'Université,
II, b, 906.
—— (hôtel d'), détruit, III, a, 614.
Ambroise, (séminaire Saint-), II, b, 1370.
Amelot, anecdote sur ce Janséniste, IV, a, 181, note.
Amet (le père), confesseur de Marguerite de Valois, II, a, 217.
Amiot (Jacques), maître de la librairie, II, a, 187.
Amortissement, I, a, 223.
Anastase (Sainte-), II, b, 1163.
Anceline, avocat, III, a, 374.
Andelot (d'), chef des réformés, III, a, 4.
—Sa mort, 150.
André-des-Arcs (quartier Saint-), sa position et son origine, III,
b, 599.
—Église de ce nom, 617.
—Description, 621.
—Curiosités, 622.
—Circonscription, 625.
—Hospice de ce nom, 627.
Angevilliers (hôtel d'), I, b, 832.
Angleterre, son gouvernement, IV, b, 80.
—Son commerce maritime, 82.
—Crédit public, 83.
—Pourquoi elle exclut les catholiques des affaires, 84.
—Payoit une pension à Dubois, 85.
Anglois (rois), vassaux des rois de France, II, a, 13.
Anglois (les), envahissent la France à la faveur des troubles
civils, II, a, 151.
—Pourquoi ne sont pas demeurés maîtres de la France sous
Charles VII, 371.
—Songent à s'emparer du Canada, IV, b, 272.
Angloises (religieuses), origine, II, b, 1269.
—Église, 1270, III, a, 464.
—Curiosités de leur église, 455.
—Les filles angloises, 536.
Angoulême (hôtel des comtes d'), détruit, II, b, 1316.
Anjou (le duc d'), frère du roi Charles V, II, a, 77.
—Sa régence, 79.
—Appelé au trône de Naples, 83.
—Ses exactions avant de quitter la France, 83-89.
—Part pour la conquête de Naples, 89.
—Sa mort, III, a, 257.
—— (hôtel d'), détruit, II, b, 851.
Anne (communauté Sainte-), I, b, 969.
Anne (chapelle Sainte-), II, a, 555.
Anne-la-Royale (communauté de Sainte-), III, b, 446.
Anne d'Autriche, régente, III, b, 110.
—Accusée de trop de familiarité avec Mazarin, 117.
—Reçoit le parlement au Palais-Royal à la journée des
Barricades, 150.
—Emmène le roi à Ruel, 156.
—Ramène le roi à Paris, 160.
—Quitte une seconde fois Paris, 165.
—Désire la paix, 186.
—Revient à Paris avec le Roi, 197.
Annonciades célestes, institution de cet ordre, II, b, 1184.
—Leur établissement à Paris, 1185.
—Genre de vie, ib.
—Curiosités de l'église, 1186.
—— du Saint-Esprit, origine, II, b, 1273.
—Supprimées, 1277.
Annonciation (Filles de l'), IV, a, 256.
Antoine (le Petit-Saint-), origine, II, b, 1167.
—Établissement de ces religieux à Paris, 1167.
—Changement dans l'administration, 1171.
—Maison rebâtie, 1172.
—Église, ib.
Antoine (abbaye Saint-), II, b, 1298.
—Curiosités, 1300.
Antoine (M.), architecte, auteur du dépôt des archives au Palais-
de-Justice, I, a, 164.
—Restaure ce palais après un incendie, ib.
Appels d'abus et appelants, IV, b, 200 et suiv.
Aqueducs de Belleville, I, b, 833.
—Réparés sous Henri IV, 834.
Arc de triomphe de la barrière du Trône, II, b, 1309.
—Pourquoi appelée du Trône, 1310.
—Description, 1311.
Arcades de la Chambre des Comptes, I, a, 169.
—Mérite de ce monument, 405.
Archevêché, I, a, 327.
—Érigé en 1622, 354.
Arcis (Saint-Pierre-des-), étymologie de ce nom, I, a, 256.
—Détails sur cette église, curiosités, tableaux, ib.
—Paroisse au commencement du 12e siècle, 258.
—Ses droits curiaux, ib.
Arcueil (aqueduc d'), I, b, 834.
—Alimente 14 fontaines, 835.
Ardents (mal des), I, a, 289.
Argenson (hôtel d'), II, b, 1319.
Armagnac (le comte d'), fait connétable, II, a, 144.
—Son retour à Paris, 147.
—Difficultés que lui suscite la reine, 149.
—Arrêté, 154.
—Sa mort, 156.
Armagnac (la faction des), II, a, 117.
—Poursuivis dans Paris par les bouchers, 120.
—Aux portes de Paris, 124.
—Défection parmi eux, 125.
—Le dauphin les favorise, 127.
—Doivent exciter moins d'indignation que les Bourguignons,
134.
 —Réflexions en leur faveur, 136.
—Leur conduite à Paris, 140.
Arnauld, retiré à Port-Royal-des-Champs, IV, a, 179, note.
Arnaud (Jacqueline-Marie-Angélique), réforme l'abbaye de Port-
Royal, IV, a, 338.
Arnolfini, moine espagnol député aux frondeurs, III, b, 182.
—Introduit dans le parlement, 184.
—Sa harangue, 185.
Arquebuse (hôtel de l'), II, b, 1333.
Arques (la journée d'), III, a, 336.
Arras (collége d'), III, a, 598.
Arsenal (l'), ancienneté des établissements de ce genre, II, b,
953.
—Arsenal particulier de Paris, ib.
—Devient la propriété des rois, 954.
—Henri IV l'augmente, ib.
—Grand et petit, 955.
—Inscription, 956.
—Changements et réparations, 975.
Artois (hôtel du comte d') détruit, II, a, 459.
Asfelt (marquis d'), IV, b, 105.
Assomption (les religieuses de l'), leur couvent, I, b, 999.
—Appelées d'abord Haudriettes, ib.
—Au faubourg Saint-Honoré, 1001.
—Attaquées juridiquement par les héritiers de Jean Haudri,
1003.
—Fondation de l'église actuelle, 1004.
—Curiosités, 1005.
Aubin (bataille de Saint-), II, b, 894.
Aubriot (Hugues), prévôt de Paris, I, b, 539, II, a, 70.
—Pose la première pierre de la Bastille, 72.
Audran (Gérard), sa sépulture, III, b, 361.
Audrouet du Cerceau, commença le Pont-Neuf, I, a, 91.
Augustin (saint), restaurateur de la vie commune en Occident, I,
a, 356.
Augustins (les grands), III, b, 600.
—Époque de leur établissement à Paris, 602.
—Accroissement, 603.
—S'établissent dans la rue qui porte leur nom, 607.
—Église et curiosités, 608.
—Bibliothèque, 612.
—Leurs querelles, 614.
—Quai, 750.
Augustins réformés (ou petits), IV, b, 391.
—Curiosités de l'église, 394.
—Bibliothèque, 395.
Aumont (hôtel d'), II, b, 965.
Aure (les filles de sainte), III, b, 438.
Auroux, capitaine de quartier, III, a, 374.
Austerlitz (pont d'), III, a, 660.
Autriche (maison d'), sa politique, III, b, 76.
—Se met à la tête du parti catholique, ib.
—Justifiée d'avoir aspiré à la monarchie universelle, 79.
Autun (collége d'), III, b, 685.
Auvergne (le comte d'), III, b, 27.
Avançon (Guillaume d'), archevêque d'Embrun, II, a, 216.
Ave Maria (les religieuses de l'), II, b, 917.
—Origine, 918.
—Austérités, 923.
—Curiosités du couvent, 924.
—Sépultures, ib.
Avenues des Invalides et de l'École-Militaire, IV, b, 455.
Avoués des églises. Ce que c'étoit, I, a, 207.
Avoie (les religieuses de sainte). Origine, II, b, 989.
—Statuts, 991.
—Adoptent la règle des Ursulines, ib.
—Église, 993.
Avoie (fontaine Sainte-), II, b, 1012.
Azincourt (bataille d'), II, a, 143.
B.
Baillet (Jean), trésorier général, assassiné, I, b, 552, II, a, 42.
Bailliage du palais, I, a, 190.
—Du Temple, II, b, 1187.
Banque de France, II, a, 367.
—— de Law, IV, b, 29.
—Sa chute, 52.
—On essaie en vain de la relever, 53.
Bar (hôtel des comtes de), III, a, 615.
Barbe (collége et communauté de Sainte-), III, b, 482.
—Discipline, 535.
—Saint Ignace de Loyola y avoit étudié, 536.
Barbeaux (hôtel des), II, b, 963.
Barbette (hôtel), II, b, 1313.
Barnabites. Leur couvent, I, a, 224.
—Origine et emplacement, 227.
Barre (Jean de la), gardien de la bibliothèque, II, a, 186.
Barre (hôtel de), II, b, 962.
Barricades (journée des), III, a, 298; III, b, 150.
Barrière (Jean de la), abbé commandataire des Feuillants, I, b,
983.
—Merveilles de sa vie, 984.
—Vient à Paris, ib.
—Henri III envoie des seigneurs au devant de lui, ib.
Barrière avoit comploté la mort de Henri IV, III, a, 434.
Barrières de Paris, I, b, 1074; II, a, 260-562; II, b, 765-1344;
III, a, 631, b, 573; IV, a, 368, b, 497.
Barry (la du), IV, b, 362.
Barthélemi (Saint-), église royale et paroissiale, I, a, 250.
—Origine et emplacement, 251.
—Par qui desservie, 252.
—Confiée aux religieux de St-Benoît, 253.
—Curiosités, 254.
Barthélemi (massacre de la Saint-). Ne doit pas retomber sur la
religion, III. a, 153.
—La reine y détermine le roi, 177.
—Préparatifs, 181.
 —Signal du massacre, 185.
—Scènes en divers lieux, 186.
—N'a eu lieu qu'à Paris, 196.
—N'eut lieu que par représailles, 204.
Basoche, I, a, 166.
Basochiens (les) jouent des pièces de théâtre, IV, a, 312.
Baschi (Mathieu de) réforme les frères de saint François, I, b,
992.
Bassompierre (le maréchal de) à la Bastille, III, b, 74.
Baudoyer (place), étymologie, II, b, 834.
Baudrier; le clergé en obtient les honneurs, I, a, 205.
Bavière (hôtel de), III, a, 615.
Bayeux (collége de), III, b, 697.
Beaufort (le duc de), son rôle, III, b, 172.
—Accusé, 206.
—Nommé gouverneur de Paris, 305.
—Suit Gaston dans son exil, 317.
Beaugé (bataille de), II, a, 161.
Beaujeu (madame de), II, b, 880.
—Déconcerte les projets du duc d'Orléans, 883.
—Veut le faire enlever, 889.
—Sa conduite impolitique, 893.
Beaujon, conseiller d'état et receveur des finances, I, b, 1035.
Beaujon (chapelle), dédiée à saint Nicolas.
—Sa description, I, b, 1035.
—Intérieur, 1036.
—Architecture de cette église, 1037.
Beaujon (hospice), son emplacement et ses fondateurs, I, b,
1038.
Beaumont (M. de), archevêque de Paris, nouvel Athanase, IV, b,
240.
—Prend le parti des jésuites, 339.
Beautreillis (hôtel), II, b, 960.
Beautru (hôtel de), II, a, 249.
Beauvais (hôtel de), II, b, 965;
II, b, 1331;
 IV, b.
Bedfort (le duc de) fait prêter serment au roi d'Angleterre par le
parlement, II, a, 373.
—Assiége Meulan, ib.
—Son retour en France après la bataille de Montargis, 383.
—Fait les derniers efforts contre le roi de France, 384.
—Ouvre la campagne, 385.
—Assiége Orléans et est repoussé par la Pucelle, 389.
—Abandonne Paris, 392.
—Y rentre, 396.
—Se retire, 406.
—Meurt, 407.
Béguines, II, b, 917.
Belle-Isle (le comte et maréchal de), IV, b, 118.
—Sa retraite, 124.
—Fait la guerre en Provence, 147.
—Combat à Exiles, ib.
Bénédictines de la Ville-l'Évêque, I, b, 1026.
—Deviennent plus austères, 1027.
—Ce monastère, d'abord prieuré dépendant de Montmartre,
1027.
—Leurs différends avec ce couvent, 1028.
—Curiosités de leur église, ib.
—Église détruite, ib.
—— de Notre-Dame de Liesse, IV, a, 260.
—Fondation, 261.
Bénédictins anglais, III, b, 453.
—Église, 456.
Bénéfices, leur origine, I, a, 77.
Bénéfices royaux, I, a, 203, 208.
Benoît (Saint-), quartier, III, b, 337.
—Église collégiale et paroissiale, 355.
—Particularités sur le chevet de cette église, 359.
—Curiosités, 360.
—Circonscription, 362.
Bertichram, Bertchram ou Bertrand, évêque du Mans, I, b, 741.
Bernard (Saint) engage inutilement les jeunes gens de Paris à
embrasser la vie monastique, I, a, 281.
Bernard (porte Saint-), origine, III, a, 438.
—Renouvelée, 439.
—Description, 440.
Bernardins (les), origine, III, a, 450.
—Église, 454.
—Curiosités, 455.
Bernin (le chevalier), architecte et statuaire, I, b, 787.
—Détails sur ce personnage, 788.
—Son plan du Louvre critiqué, 790.
Bernis (l'abbé de), son caractère, IV, b, 278.
—Se charge du traité entre la France et l'Autriche, 279.
Berulle (le cardinal de), fondateur de l'Oratoire, I, b, 810.
—Achète l'hôtel du Bouchage, 812.
—Bâtit une nouvelle maison, 813.
Berry (duc de), frère du roi Charles V, I, a, 77.
—Perd la confiance des Parisiens, 119.
—Assiégé dans Bourges, 126.
—Reçoit des ambassadeurs anglais, 141.
—Sa mort, 145.
—— (ancien hôtel de), II, a, 341.
Bertholot (François), fonde une maison.
Berwik fait la guerre en Alsace, IV, b, 104.
—Assiége Philisbourg et y meurt, 105.
Besançon (hôtel de), III, b, 715.
Beze (Théodore de), III, a, 74.
Bibliothèque royale, son origine et ses progrès, II, a, 182.
—Fondée par Charles V, 184.
—Presqu'entièrement détruite sous Charles VI, 185.
—Son état sous Louis XI, François Ier, 186.
—Ordonnance de Henri II en sa faveur, ib.
—Sous les rois suivants, 187.
—Bâtiments, 190.
—Dépôt des livres imprimés, 191.
 —Curiosités, 192.
—Manuscrits, 194.
—Médailles, 197.
—Estampes, 201.
—de la ville, II, b, 1262.
—Description, 1263.
—Devient un magasin d'armes, 1266.
Bièvre, petite rivière, III, a, 627.
Biscornet, serrurier de la façade Notre-Dame, I, a, 310.
Blaise (chapelle Saint-) et Saint-Louis, III, b, 344.
Blanche (la reine), son administration pendant la minorité de son
fils, I, b, 694.
—Soin qu'elle mit à le bien élever, 695.
—Échappe à une embuscade près d'Étampes, 696.
—Délivrée à Montlhéri, 697.
—Traite rigoureusement l'Université, ib.
—Sa régence, 704.
—Favorise les affranchissements, 707.
—Sa mort, 708.
Blancs-Manteaux (monastère des), II, b, 998.
—Concession de Philippe de Valois, 1001.
—Église, 1002.
—Curiosités, bibliothèque, 1003.
—Marché, 1370.
Blanc-Menil, président du parlement, III, b, 2.
Blois (Charles de), ses démêlés avec Jean de Montfort, II, a, 21.
Blondel, auteur d'un Traité sur l'architecture, I, b, 934.
Boileau, son tombeau dans la Sainte-Chapelle, I, a, 116.
Bois-Bourdon, ses intrigues avec la reine, II, a, 150.
Bois-Dauphin, maréchal de France, III, b, 20.
Boissy (collége de), III, b, 686.
Bonald (de), montre les avantages de la féodalité, I, a, Avert.,
73.
—Cité, 217.
Bonami, académicien, a répandu des lumières sur les antiquités
de Paris, I, a, avert. XIII, note.
Boncourt (collége de), III, a, 609.
Bonfons, retouche le livre de Corrozet sur Paris, I, a, Avert. iij.
Bonneau (Marie), fondatrice des Miramionnes, III, a, 444.
Bons-Enfants (collége des), II, a, 320.
—Boursiers nommés par l'évêque, 321.
—L'enseignement y cesse, 332.
—Annexé au chapitre, ib.
—— (le séminaire des), Voy. Firmin (Saint-).
Bont (chapelle Saint-), II, b, 821.
Boucherie (grande), I, b, 537.
—Origine et emplacement, 539.
—Bouchers de Paris pendant les troubles du règne de Charles
VI, 540.
—Grande boucherie rasée par les ordres du duc d'Orléans, ib.
—Rétablie, 541.
Bouchers, leur milice, et leurs cruautés, II, a, 155.
Boufflers, IV, a, 147.
—Au siége de Lille, 160.
Bouillon (le duc de), frustré du commandement de l'armée, III,
b, 5.
—Ses services, 9.
—S'aigrit et excite le prince de Condé, 11.
Bouillon (hôtel de), IV, b, 478.
Boulevards anciens, II, b, 1343.
Bouquet (Geneviève), dite du saint nom de Jésus, réforme les
religieuses de l'Hôtel-Dieu, I, a, 373.
Bourbon (Louis de), fait bâtir un hôpital pour les pélerins, I, b,
578.
Bourbon (Antoine de), roi de Navarre, III, a, 39.
—Attaché à la réforme, 40.
—Se rend aux états généraux, 62.
—Ébranlé par les variations des réformés au colloque de
Poissy, 76.
—Gagné par les Guises, 77.
—Catholique, 81.
—Blessé à la prise de Rouen, 105.
Bourbon (le cardinal de), proclamé roi, III, a, 335.
—Sa mort, 346.
Bourbon (le duc de) intente un procès aux princes légitimés, IV,
b, 21.
—Issue de ce procès, 23.
—Premier ministre, 83.
—Son ministère pire que celui de Dubois, 87.
—Est menacé de perdre le pouvoir, 89.
—renvoie l'Infante d'Espagne, ib.
—Fait épouser au roi Marie Leczinska, 90.
—Exilé à Chantilly, 91.
—Mendie le secours des Anglais, 122.
—Entre dans Paris, 124.
—traite avec les Anglais, 137.
—Fuit et demande la paix, 140.
—Offre en vain ses services contre les Anglais, 143.
—S'unit à Henri V, 149.
—Délivre la reine, 151.
—Rentre dans Paris, 156.
Bourbon, célèbre poëte latin, I, b, 880.
Bourbon (hôtel de la duchesse de), II, a, 252.
Bourbon (le palais), IV, b, 450.
Bourbon (hôtel de), III, a, 615; IV, a, 363.
Bourgeois (grande confrérie des), I, a, 267.
Bourgogne (le duc de), frère du roi Charles V, II, a, 77.
—premier ministre, 101.
—Sa mort, 102.
Bourgogne (hôtel de), II, a, 556.
—Devient la propriété des confrères de la passion, 558.
—Leur salle louée aux comédiens d'Italie, 559, III, b, 569.
—— (collége de), III, b, 692.
—— (le duc de), IV, a, 147.
—— (le duc de) élève de Fénélon, IV, b, 4.
Bourguignons. Leur faction, II, a, 117.
—Les paysans prennent ce nom pour se livrer à divers excès,
121.
 —restent maîtres des environs de Paris, 125.
—Nouveaux excès, 129.
—Reçoivent un coup mortel, 133.
—Abandonnés du duc de Bourgogne, 134.
—Conspiration contre le roi, 146.
—rentrent dans Paris, 153.
—Versent des torrents de sang, 155.
Bourse (la), II, a, 291.
Bouthellier, maçon de Notre-Dame, I, a, 309.
Boutteville veut émouvoir le peuple en faveur de Condé, III, b,
213.
Bretagne (le duc de) devient le chef des mécontents, II, a, 611.
—Fait de fausses promesses, 612.
—Devient chef de la ligue des grands vassaux, 613.
—Condamné à Tours par la noblesse, 618.
—Paix de Conflans, 635.
Brétigny (paix de), II, a, 63.
Bretonvilliers (hôtel de), I, a, 418.
—Par qui bâti, 419.
—Ce qu'il devint en 1719, 419.
—Décoré par Bourdon et par Baptiste, ib.
Breul (dom Jacques du) retouche l'ouvrage de Corrozet et
Bonfons, I, a, Avert. IV, jugement sur son travail, ib.
Brissac (le maréchal de) défend Paris, III, a, 102.
—Médite d'y introduire Henri IV, 415.
—Livre Paris au roi, 421.
Brisson (président du parlement), III, a, 322.
—Sa mort, 375.
Broglie, IV, b, 302.
Brongniart, architecte de l'Église des Capucines (Chaussée
d'Antin), II, a, 245.
—De la Bourse, 292.
Broussel, conseiller, devient l'idole du peuple, III, b, 134.
—Envoyé en exil, 142.
—Troubles à son occasion, 143.
—Son retour, 163.
Bullion (hôtel de), II, a, 342.
Bureau des Pauvres (grand), II, b, 820.
Bureaux (l'isle aux), ce que c'était, I, a, 8.

C.

Cabinet d'histoire naturelle, III, a, 494.

Caboche et cabochiens, II, a, 123.
Caillard (Pierre), gouverneur du Louvre, II, a, 60.
Calais (hôtel), II, a, 341.
Calvaire (le), II, a, 455.
—— (les religieuses du), II, b, 1088, 1090.
—— (les dames du), IV, a, 281.
—Chapelle, 284.
Calvin, son portrait, III, a, 3.
—Retiré à Genève, 4.
Calvinistes (les) se font craindre, III, a, 21.
—Brûlés, 22.
—Leurs premières églises, ib.
—Leurs progrès, 23.
—Se défendent l'épée à la main auprès de la Sorbonne, 26.
—Conquête de leur parti, 28.
—Deviennent un parti politique, 41.
Cambray (collége de), III, b, 512.
Cambrai (place), III, b, 578.
Cambis (hôtel de), II, b, 1135.
Camisards, révoltés des Cévennes, IV, a, 150.
Camulogène, général des parisiens, I, a, 9.
—Défait par Labiénus, ib.
Camus (hôtel le) II, b, 1135.
Canning (lord), rapprochement curieux d'une de ses démarches
avec la conduite de Walpole envers Fleury, IV, b, 101, note.
Canaye, détails sur cette famille, III, a, 538.
Capets, obstacles qu'ils eurent à vaincre dans l'origine, II, a, 5.
—Cessation du plaid général, 6.
 —Nouvel ordre de succession, 7.
—Désignoient, jusqu'à Louis VIII, l'héritier du trône, 9.
—Cherchent un appui dans le peuple, 10.
—Ne comprirent pas assez la nécessité de la puissance
spirituelle, 11.
Capétiens, flattent le tiers-état, II, b, 590.
—Auraient dû chercher plutôt leur appui dans la puissance
spirituelle, 591.
Capuce, signe de ralliement des factieux, II, a, 40.
Capucines (monastère des), II, a, 171.
—Sa construction, 172.
—Leur régle, 173.
—Transférées rue Neuve-des-petits-Champs, 174.
—Portail de leur église, ib.
—Intérieur, 175.
—Curiosités, 176.
Capucins (les), origine, I, b, 992.
—S'établissent à Picpus, 994.
—Catherine de Médicis leur donne une maison, 995.
—Église, 996.
—Ne méritaient pas les dédains de la philosophie moderne,
997.
—Curiosité de leur église, 998.
—Bibliothèque, ib.
—— de la Chaussée d'Antin, II, a, 243.
—Église, 244.
—— du Marais, II, b, 1084.
—Curiosités, 1085.
—— du quartier Saint-Benoît, III, b, 486.
Cardinal (Palais-), V. Palais-Royal.
Carlos (l'infant don) envahit le royaume de Naples, IV, b, 106.
Carmélites de la rue du Chapon, II, b, 683.
—— (les), III, b, 462.
—Curiosités, 468.
—— (les), IV, b, 447.
Carmes billettes, II, b, 978.
—Embrassent le tiers-ordre, 981.
—Leur relâchement, 982.
—On laisse cet ordre s'éteindre, 983.
—Église, 984.
Carmes (les), III, b, 346.
—Leur arrivée en France avec saint Louis, 347.
—Église, 350.
Carmes déchaussés, IV, a, 269.
—Église, 271.
—Monastère, 272.
Carnavalet (hôtel de), II, b, 1327.
Carrouge (la dame de) accuse Legris d'avoir attenté à son
honneur, II, a, 165.
Carrousel (le plan du), I, b, 912.
—Origine de ce nom, 913.
—Détails sur les carrousels, 914.
Cas royaux, I, b, 514-516.
Cas de conscience, IV, a, 168.
Capel (hôtel de), IV, a, 365.
Catherine (l'hôpital Sainte-), I, b, 570.
—Son plus ancien titre, 571.
—Par qui administré anciennement, ib.
—Religieuses, 572.
—Statue de sainte Catherine, 573.
Catherine du Val-des-Écoliers (les chanoines réguliers de sainte),
I, b, 1214.
—Leurs progrès, 1218.
—Église, 1220.
—Réparations, 1223.
—Curiosités, 1225.
Catholiques (la religion). Son influence sur l'homme et la société,
IV, a, 187.
—Régulatrice universelle, 188.
Catholiques (les Nouvelles-). But de cette communauté, II, a,
178.
 —Libéralités à leur égard, 180.
—Leur maison, 181.
—Curiosités, ib.
Catinat, IV, a, 142.
—Rappelé, 143.
Caumont (Anne de) fonde le monastère des Filles-Saint-Thomas,
II, a, 230.
Célestins, II, b, 935.
—Introduits en France, ib.
—Affection de Charles V pour eux, 937.
—Église, 938.
—Richesse de leur couvent, 940.
—Curiosités, ib.
—Chapelles, 942.
—Vitraux, 950.
Cent-Filles (les), III, a, 505.
César fait rebâtir Paris, I, a, disc. prél., 9.
Chaillot, village près de Paris, I, b, 1039.
—Origine et étymologie de ce nom, 1040.
—Coutume singulière qui y régnoit, 1042.
—Église, 1097.
—Dépendoit du prieuré de Saint-Martin-des-Champs, 1045.
—Position remarquable de Chaillot, 1044.
Chalotais (la), IV, b, 333.
—Sa dispute avec l'abbé Georgel au sujet des Jésuites, 334,
note.
Chambre des comptes. Son origine, I, a, 180.
—Étoit résidente à Paris, 181.
—But de cette institution, 182.
—Divers ordres d'officiers et leurs fonctions, 183.
—Dignité du président, ib.
—Droits honorifiques de ce magistrat, 184.
—Bâtiment de la chambre des comptes, ib.
—Arcades de la chambre des comptes, 405.
—— du domaine et du trésor, I, a, 190.
—— de saint Louis, III, b, 137.
—Cesse de s'assembler, 139.
—— royale et syndicale des imprimeurs et libraires de Paris, III,
b, 723.
Chamillart (hôtel de), II, a, 330.
Champagne (Philippe de), peintre, I, b, 879.
Champ-de-Mars, I, a, 133; IV, b, 469.
Champigny (Jean-Simon de), évêque de Paris, I, b, 585.
Champeaux (Guillaume de), III, a, 552.
Champs-Élysées, I, b, 1017.
Chanai (collége de), III, a, 584.
—Nombre de boursiers, 585.
Chancellerie du palais, I, a, 190.
Change (pont au), I, a, 88-391.
Chanoines. Leur origine, I, a, 355.
—Louis-le-Débonnaire leur donne une règle fixe, 358.
—— De Paris, sous le nom de Frères de sainte Marie, 258.
Chantier du roi, II, b, 964.
Chapelle (la Sainte-), I, a, 107.
—Anciennes chapelles sur le même terrain, 110.
—Chapelle de Saint-Nicolas, 111.
—Saint Louis la fait bâtir pour y déposer la couronne d'épines,
ib.
—Description, 113.
—Ses vitraux, 114.
—Basse Sainte-Chapelle, 115.
—Par qui elle était desservie, 116.
—Reliques et autres objets précieux, 118.
—Tableaux, 120.
—Sculptures, 121.
—Tombeaux, ib.
—Cérémonie du vendredi saint, ib.
—Trésor des chartres, 123.
Chapitre. Ce que c'est, I, a, 355.
Charenton (attaque de), III, b, 176.
Charité (les filles de la), II, a, 548.
—Fondation, 549.
—Composées d'abord de filles de campagne, 551.
—Appelées sœurs grises, 552.
—— Notre-Dame (hôpital de la), I, b, 1244.
—Vœux des religieuses, 1245.
—— (frères de la), origine, IV, b, 397.
—S'établissent rue des Saints-Pères, 398.
—Curiosités de l'hospice, 400.
—Fontaine, 491.
Charlemagne et les Carlovingiens, I, a, 65.
—Ce qu'il faisoit avant de se mettre en campagne, 135.
—Interdit au clergé le service militaire, 206.
—Chute des Carlovingiens, I, b, 48.
Charles-le-Mauvais deux fois emprisonné au Louvre, I, b, 771; II,
a, 25.
—S'évade, 35.
—Gouverneur général de Paris, 52.
—Veut traiter, 53.
—Devient suspect, 54.
Charles, dauphin. Idée qu'on avoit de lui, II, a, 26.
—Est fait lieutenant général du royaume, ib.
—Va trouver à Metz l'empereur Charles IV, 28.
—Revient à Paris et harangue le peuple, 37.
—Conduite de Charles envers Marcel et Charles-le-Mauvais,
39.
—Harangue le peuple aux halles, 41.
—Contient les factieux, 43.
—Demande la vie à Marcel, 47.
—Signe un traité rédigé par les factieux, 43.
—Quitte Paris, 49.
—Demande qu'on lui livre les chefs de la faction, 52.
—Se prépare à rentrer dans Paris, 52.
—Se justifie devant le peuple d'avoir fait arrêter douze
bourgeois, 61.
—Devient roi, 68.
É
—— V. État de la France à son avènement, 68.
—— Merveilles des cinq premières années de son règne, 69.
—Fixe la majorité des rois à quatorze ans, 73.
—Sa mort, 75.
—Bienfaits de son règne, 76.
—— VI. Sa minorité, II, a, 79.
—Son sacre, 80.
—Troubles; états-généraux, 82.
—Sédition, 85.
—Marche au secours du comte de Flandre, 90.
—Exécutions terribles, 92.
—Paix avec les Flamands, 94.
—Anecdote de la forêt du Mans, 98.
—Premiers signes d'aliénation, 99.
—Naissance de son cinquième fils, 102.
—Fin malheureuse de ce règne, 103.
—Troubles des Armagnacs et des Bourguignons, 117.
—Reçoit son épouse, 156.
—Sa mort, 162.
—— VII. Monte sur le trône, II, a, 372.
—Sacré, ib.
—Conspiration en sa faveur, 374.
—Revers, 375.
—Bataille de Verneuil, 376.
—Ce qui le sauve, 378.
—Il offre l'épée de connétable à Richemont, 380.
—Est abandonné du duc de Bretagne, 383.
—Ses défenseurs assiégés dans Orléans, 385.
—Journée aux harengs, 386.
—La pucelle, 387.
—Charles est conduit à Reims et sacré de nouveau, 389.
—S'avance jusqu'à Dammartin, 391.
—Reprend Saint-Denis, 393.
—Succès, 399.
—Se réconcilie avec le duc de Bourgogne, 406.
—Sa valeur à Montereau Faut-Yonne, 415.
 —Entre à Paris, ib.
—Sa mort, 420.
—— le Téméraire, duc de Bourgogne, II, b, 639.
—Son ambition, 647.
—Cède aux troupes du roi, 649.
—Perdu par ses succès, 651.
—— VIII. II, b, 880.
—États de Tours, 881.
—Son armée triomphe à Saint-Aubin, 894.
—Se marie, 895.
—Fait revivre ses prétentions sur Naples, 897.
—Conquête de l'Italie, 898.
—Demande des secours aux Parisiens, 900.
—Mort du roi Charles VIII, 902.
Charles IX s'avoue auteur de la Saint-Barthélemy, 209.
—Sa mort, 218.
—— IV donne ses états à Louis XIV, IV, a, 27.
—— II, roi d'Angleterre, IV, a, 50.
—Sa politique, 51.
—Révoque la liberté de conscience, ib.
—Fait épouser sa fille au prince d'Orange, 76.
Charni (le sire de) frappe Marcel d'un coup de hache, II, a, 59.
Charni (hôtel de), II, b, 854.
Charniers (les), II, a, 451.
—Inscription, 452.
—Curiosités, ib.
—Démolis, 458.
Charollais (le comte de), chef des mécontents, II, b, 611.
—À la tête des flamands, 621.
—Veut s'emparer de Paris, 623.
—Fuit à Montlhéri, 625.
—Revient contre Paris, 627.
—Entre en conférence avec les parisiens, 628.
—Veut passer la Seine, 632.
—Conférences, 633.
—Fait la paix, 635.
Welcome to our website – the perfect destination for book lovers and
knowledge seekers. We believe that every book holds a new world,
offering opportunities for learning, discovery, and personal growth.
That’s why we are dedicated to bringing you a diverse collection of
books, ranging from classic literature and specialized publications to
self-development guides and children's books.

More than just a book-buying platform, we strive to be a bridge

connecting you with timeless cultural and intellectual values. With an
elegant, user-friendly interface and a smart search system, you can
quickly find the books that best suit your interests. Additionally,
our special promotions and home delivery services help you save time
and fully enjoy the joy of reading.

Join us on a journey of knowledge exploration, passion nurturing, and

personal growth every day!

ebookbell.com