144 100 13MB
English Pages [316] Year 2000
Table of contents :
Title page
Contents
Preface
1. Preliminary results
2. Permutation representations
3. Representations of groups on groups
4. Linear representations
5. Permutation groups
6. Extensions of groups and modules
7. Spaces with forms
8. pgroups
9. Change of field of a linear representation
10. Permutations of groups
11. The generalized Fitting subgroup
12. Linear representations of finite groups
13. Transfer and fusion
14. The geometry of groups of Lie type
15. Signalizer functors
16. Finite simple groups
Appendix: Solutions to selected exercises
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 12
Chapter 13
Chapter 14
Chapter 15
Chapter 16
References
List of symbols
Index
Finite group theory During the last 40 years the theory of finite groups has developed dramatically. The finite simple groups have been classified and are becoming better understood. Tools exist to reduce many questions about arbitrary finite groups to similar questions about simple groups. Since the classification there have been numerous applications of this theory in other branches of mathematics. Finite Group Theory develops the foundations of the theory of finite groups. It can serve as a text for a course on finite groups for students already exposed to a first course in algebra. For the reader with some mathematical sophistication but limited knowledge of finite group theory, the book supplies the basic background necessary to begin to read journal articles in the field. It also provides the specialist in finite group theory with a reference in the foundations of the subject. The second edition of Finite Group Theory has been considerably improved, with a completely rewritten chapter 15 considering the 2Signalizer Functor Theorem and the addition of an appendix containing solutions to exercises. M. Aschbacher is Shaler Arthur Hanisch Professor of Mathematics at Caltech. His books include Finite Group Theory (Cambridge University Press, 1986), Sporadic Groups (Cambridge University Press, 1994), and 3Transposition Groups (Cambridge University Press, 1997).
https://doi.org/10.1017/CBO9781139175319
CAMBRIDGE STUDIES IN ADVANCED MATHEMATICS Editorial Board B. Bollobas, W. Fulton, A. Katok, F. Kirwan, P. Sarnak Already published 2 K. Petersen Ergodic theory 3 P.T. Johnstone Stone spaces 5 J.P. Kahane Some random series of functions, 2nd edition 1 J. Lambek & PJ. Scott Introduction to higherorder categorical logic 8 H. Matsumura Commutative ring theory 9 C.B. Thomas Characteristic classes and the cohomology of finite groups 10 M. Aschbacher Finite group theory 11 J.L. Alperin Local representation theory 12 P. Koosis The logarithmic integral I 13 A. Pietsch Eigenvalues and snumbers 14 S.J. Patterson An introduction to the theory of the Riemann zetafunction 15 H.J. Baues Algebraic homotopy 16 V.S. Varadarajan Introduction to harmonic analysis on semisimple Lie groups 17 W. Dicks & M. Dunwoody Groups acting on graphs 18 L.J. Corwin & F.P. Greenleaf Representations of nilpotent Lie groups and their applications 19 R. Fritsch & R. Piccinini Cellular structures in topology 20 H. Klingen Introductory lectures on Siegel modular forms 21 P. Koosis The logarithmic integral II 22 MJ. Collins Representations and characters of finite groups 24 H. Kunita Stochastic flows and stochastic differential equations 25 P. Wojtaszczyk Banach spaces for analysts 26 J.E. Gilbert & M.A.M. Murray Clifford algebras and Dirac operators in harmonic analysis 27 A. Frohlich & MJ. Taylor Algebraic number theory 28 K. Goebel & W.A. Kirk Topics in metric fixed point theory 29 J.F. Humphreys Reflection groups and Coxeter groups 30 DJ. Benson Representations and cohomology I 31 D.J.Benson Representations and cohomology II 32 C. Allday & V. Puppe Cohomological methods in transformation groups 33 C. Soule et al. Lectures on Arakelov geometry 34 A. Ambrosetti & G. Prodi A primer of nonlinear analysis 35 J. Palis & F. Takens Hyperbolicity, stability and chaos at homoclinic bifurcations 37 Y. Meyer Wavelets and operators I 38 C. Weibel An introduction to homological algebra 39 W. Bruns & J. Herzog CohenMacaulay rings 40 V. Snaith Explicit Brauer induction 41 G. Laumon Cohomology ofDrinfeld modular varieties I 42 E.B. Davies Spectral theory and differential operators 43 J. Diestel, H. Jarchow, & A. Tonge Absolutely summing operators 44 P. Mattila Geometry of sets and measures in Euclidean spaces 45 R. Pinsky Positive harmonic functions and diffusion 46 G. Tenenbaum Introduction to analytic and probabilistic number theory 47 C. Peskine An algebraic introduction to complex projective geometry 48 Y. Meyer & R. Coifman Wavelets 49 R. Stanley Enumerative combinatorics I 50 I. Porteous Clifford algebras and the classical groups 51 M. Audin Spinning tops 52 V. Jurdjevic Geometric control theory 53 H. Volklein Groups as Galois groups 54 J. Le Potier Lectures on vector bundles 55 D. Bump Automorphic forms and representations 56 G. Laumon Cohomology ofDrinfeld modular varieties II 60 M.P. Brodmann & R.Y. Sharp Local cohomology
FINITE GROUP THEORY Second Edition
M. ASCHBACHER California Institute of Technology
US CAMBRIDGE XP UNIVERSITY PRESS
CAMBRIDGE UNIVERSITY PRESS Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, Sao Paulo Cambridge University Press The Edinburgh Building, Cambridge CB2 2RU, UK Published in the United States of America by Cambridge University Press, New York www. Cambridge. org Information on this title: www.cambridge.org/9780521781459 © Cambridge University Press 2000 This publication is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First Edition Published 1986 Second Edition Published 2000 A catalogue recordfor this publication is available from the British Library Library of Congress Cataloguing in Publication data Aschbacher, Michael, 1944Finite group theory / M. Aschbacher.  2nd ed. p. cm.  (Cambridge studies in advanced mathematics ; 10) Includes bibliographical references and index. ISBN 0521781450 (hb)  ISBN 0521786754 (pbk.) 1. Finite groups. I. Title. II. Series. QA177.A82 2000 512'.2dc21 99055693 ISBN13 9780521781459 hardback ISBN10 0521781450 hardback ISBN13 9780521786751 paperback ISBN10 0521786754 paperback Transferred to digital printing 2006
To Pam
Contents
Preface 1 1 2 3 4
Preliminary results Elementary group theory Categories Graphs and geometries Abstract representations
2 Permutation representations 5 Permutation representations 6 Sylow's Theorem
ix 1 1 6 7 9 13 13 19
3 7 8 9 10 11
Representations of groups on groups Normal series Characteristic subgroups and commutators Solvable and nilpotent groups Semidirect products Central products and wreath products
22 22 25 27 29 32
4 12 13 14
Linear representations Modules over the group ring The general linear group and special linear group The dual representation
35 35 42 46
5 Permutation groups 15 The symmetric and alternating groups 16 Rank 3 permutation groups
53 53 59
6 Extensions of groups and modules 17 1cohomology 18 Coprime action
64 64 70
7 19 20 21 22
75 75 81 85 88
Spaces with forms Bilinear, sesquilinear, and quadratic forms Witt's Lemma Spaces over finite fields The classical groups
8 p groups 23 Extremal pgroups 24 Coprime action on pgroups
105 105 112
viii
Contents
9 Change of field of a linear representation 25 Tensor products 26 Representations over finite 27 Minimal polynomials
fields
117 117 123 127
10 28 29 30
Presentations of groups Free groups Coxeter groups Root systems
138 138 141 148
11 31 32 33
The generalized Fitting subgroup The generalized Fitting subgroup Thompson factorization Central extensions
156 157 162 166
12 34 35 36
Linear representations of finite groups Characters in coprime characteristic Characters in characteristic 0 Some special actions
177 178 181 192
13 37 38 39 40
Transfer and fusion Transfer Alperin's Fusion Theorem Normal pcomplements Semiregular action
197 197 200 202 205
14 41 42 43
The geometry of groups of Lie type Complexes Buildings BNpairs and Tits systems
209 209 215 218
15 Signalizer functors 44 Solvable signalizer functors
229 229
16 45 46 47 48
Finite simple groups Involutions in finite groups Connected groups The finite simple groups An outline of the Classification Theorem
242 243 245 249 260
Appendix
269
References
297
List of Symbols
299
Index
301
Preface
Finite Group Theory is intended to serve both as a text and as a basic reference on finite groups. In neither role do I wish the book to be encyclopedic, so I've included only the material I regard as most fundamental. While such judgments are subjective, I've been guided by a few basic principles which I feel are important and should be made explicit. One unifying notion is that of a group representation. The term representation is used here in a much broader sense than usual. Namely in this book a representation of a group G in a category tf is a homomorphism of G into the automorphism group of some object of €. Among these representations, the permutation representations, the linear representations, and the representations of groups on groups seem to be the most fundamental. As a result much of the book is devoted to these three classes of representations. The first step in investigating representations of finite groups or finite dimensional groups is to break up the representation into indecomposable or irreducible representations. This process focuses attention on two areas of study: first on the irreducible and indecomposable representations themselves, and second on the recovery of the general representation from its irreducible constituents. Both areas receive attention here. The irreducible objects in the category of groups are the simple groups. I regard the finite simple groups and their irreducible linear and permutation representations as the center of interest in finite group theory. This point of view above all others has dictated the choice of material. In particular I feel many of the deeper questions about finite groups are best answered through the following process. First reduce the question to a question about some class of irreducible representations of simple groups or almost simple groups. Second appeal to the classification of the finite simple groups to conclude the group is an alternating group, a group of Lie type, or one of the 26 sporadic simple groups. Finally invoke the irreducible representation theory of these groups. The book serves as a foundation for the proof of the Classification Theorem. Almost all material covered plays a role in the classification, but as it turns out almost all is of interest outside that framework too. The only major result treated here which has not found application outside of simple group theory is the Signalizer Functor Theorem. Signalizer functors are discussed near the end of the book. The last section of the book discusses the classification in general terms.
x
Preface
The first edition of the book included a new proof of the Solvable Signalizer Functor Theorem, based on earlier work of Helmut Bender. Bender's proof was valid only for the prime 2, but it is very short and elegant. I've come to believe that my extension to arbitrary primes in the first edition is so complicated that it obscures the proof, so this edition includes only a proof of the Solvable 2Signalizer Functor Theorem, which is closer to Bender's original proof. Because of this change, section 36 has also been truncated. In some sense most of the finite simple groups are classical linear groups. Thus the classical groups serve as the best example of finite simple groups. They are also representative of the groups of Lie type, both classical and exceptional, finite or infinite. A significant fraction of the book is devoted to the classical groups. The discussion is not restricted to groups over finite fields. The classical groups are examined via their representation as the automorphism groups of spaces of forms and their representation as the automorphism groups of buildings. The Lie theoretic point of view enters into the latter representation and into a discussion of Coxeter groups and root systems. I assume the reader has been exposed to a first course in algebra or its equivalent; Herstein's Topics in Algebra would be a representative text for such a course. Occasionally some deeper algebraic results are also needed; in such instances the result is quoted and a reference is given for its proof. Lang's Algebra is one reference for such results. The group theory I assume is listed explicitly in section 1. There isn't much; for example Sylow's Theorem is proved in chapter 2. As indicated earlier, the book is intended to serve both as a text and as a basic reference. Often these objectives are compatible, but when compromise is necessary it is usually in favor of the role as a reference. Proofs are more terse than in most texts. Theorems are usually not motivated or illustrated with examples, but there are exercises. Many of the results in the exercises are interesting in their own right; often there is an appeal to the exercises in the book proper. In this second edition I've added an appendix containing solutions to some of the most difficult and/or important exercises. If the book is used as a text the instructor will probably wish to expand many proofs in lecture and omit some of the more difficult sections. Here are some suggestions about which sections to skip or postpone. A good basic course in finite group theory would consist of the first eight chapters, omitting sections 14, 16, and 17 and chapter 7, and adding sections 28, 31, 34, 35, and 37. Time permitting, sections 32, 33, 38, and 39 could be added. The classical groups and some associated Lie theory are treated in chapter 7, sections 29 and 30, chapter 14, and the latter part of section 47. A different sort of course could be built around this material.
Preface
xi
Chapter 9 deals with various concepts in the theory of linear representations which are somewhat less basic than most of those in chapters 4 and 12. Much of the material in chapter 9 is of principal interest for representations over fields of prime characteristic. A course emphasizing representation theory would probably include chapter 9. Chapter 15 is the most technical and specialized. It is probably only of interest to potential simple groups theorists. Chapter 16 discusses the finite simple groups and the classification. The latter part of section 47 builds on chapter 14, but the rest of chapter 16 is pretty easy reading. Section 48 consists of a very brief outline of the proof of the finite simple groups makes use of results from earlier in the book and thus motivates those results by exhibiting applications of the results. Each chapter begins with a short introduction describing the major results in the chapter. Most chapters close with a few remarks. Some remarks acknowledge sources for material covered in the chapter or suggest references for further reading. Similarly, some of the remarks place certain results in context and hence motivate those results. Still others warn that some section in the chapter is technical or specialized and suggests the casual reader skip or postpone the section. In addition to the introduction and the remarks, there is another good way to decide which results in a chapter are of most interest: those results which bear some sort of descriptive label (e.g. Modular Property of Groups, Frattini Argument) are often of most importance.
Preliminary results I assume familiarity with material from a standard course on elementary algebra. A typical text for such a course is Herstein [He]. A few deeper algebraic results are also needed; they can be found for example in Lang [La]. Section 1 lists the elementary group theoretic results assumed and also contains a list of basic notation. Later sections in chapter 1 introduce some terminology and notation from a few other areas of algebra. Deeper algebraic results are introduced when they are needed. The last section of chapter 1 contains a brief discussion of group representations. The term representation is used here in a more general sense than usual. Namely a representation of a group G will be understood to be a group homomorphism of G into the group of automorphisms of an object X. Standard use of the term representation requires X to be a vector space.
1 Elementary group theory Recall that a binary operation on a set G is a function from the set product GxG into G. Multiplicative notation will usually be used. Thus the image of a pair (x, y) under the binary operation will be written xy. The operation is associative if (xy)z = x(yz) for all x, v, z in G. The operation is commutative if xy = yx for all x, y in G. An identity for the operation is an element 1 in G such that xl = Ix = x for all x in G. An operation possesses at most one identity. Given an operation on G possessing an identity 1, an inverse for an element x of G is an element y in G such that xy = yx = 1. If our operation is associative and x possesses an inverse then that inverse is unique and is denoted by x~l in multiplicative notation. A group is a set G together with an associative binary operation which possesses an identity and such that each element of G possesses an inverse. The group is abelian if its operation is commutative. In the remainder of this section G is a group written multiplicatively. Let x e G and n a positive integer. xn denotes the product of x with itself n times. Associativity insures xn is a welldefined element of G. Define x~n to be (x~l)n and JC° to be 1. The usual rules of exponents can be derived from
2
Preliminary results
this definition: (1.1) Let G be a group, x e G, and n and m integers. Then (1) (jcn)(jcm) = jc rt+m = n m
(2) (x )
(xm)(xn).
nm
=x .
A subgroup of G is a nonempty subset HofG such that for each JC, y € H, xy and x~l are in H. This insures that the binary operation on G restricts to a binary operation on H which makes H into a group with the same identity as G and the same inverses. I write if < G to indicate that H is a subgroup of G. (1.2) The intersection of any set of subgroups of G is also a subgroup of G. Let S c G and define
L is a surjective homomorphism with ker(a) = H then the map fi: Hx h> xa is an isomorphism of G/H with L such that nfi = a. The group G/H is called the factor group of G by H. Therefore the factor groups of G over its various normal subgroups are, up to isomorphism, precisely the homomorphic images of G. (1.6) Let H ei > • • • > en > 1. Moreover the integers n and fa: 1 < i < n) are uniquely determined by G. The exponent of a finite group G is the least common multiple of the orders of the elements of G. An elementary abelian pgroup is an abelian /7group of exponent p. Notice that by 1.12, G is an elementary abelian pgroup of order pn if and only if G is the direct product of n copies of Hp. In particular up to isomorphism there is a unique elementary abelian pgroup of order pn, which will be denoted by Epn. The integer n is the prank of Epn. The prank of a general finite group G is the maximum prank of an elementary abelian psubgroup of G, and is denoted by mp(G). (1.13) Each group of exponent 2 is abelian. If TT is a set of primes and G a finite group, write On(G) for the largest normal 7rsubgroup of G, and O7r(G) for the smallest normal subgroup H of G such that G / # is a 7rgroup. O^(G) and O7r(G) are well defined by Exercise 1.1. Define Z(G) = CG(G) and call Z(G) the center of G. If G is a /?group then define
(JC^:JC G G).
For X < G define AutG(X) = NG(X)/CG(X) to be the automizer in G of X. Notice that by Exercise 1.3, Ax\iG(X) < Aut(Z) and indeed AutG(X) is the group of automorphisms induced on X in G. A maximal subgroup of a group G is a proper subgroup of G which is properly contained in no proper subgroup of G. That is a maximal subgroup is
6
Preliminary results
a maximal member of the set of proper subgroups of G, partially ordered by inclusion. If a: S > T is a function and R c. S then a# denotes the restriction of a to R. That is a/?: R > T is the function from R into T agreeing with a. Here's a little result that's easy to prove but useful. (1.14) (Modular Property of Groups) Let A, B, and C be subgroups of a group G with A B is an isomorphism define a* :Mor( A, A) > Mor(#, B)by /3 > oTl$a and observer* restricts to a group isomorphism of Aut(A) with Aut(#). Let (At'.ie I) be a family of objects in a category €. A coproduct of the family is an object C together with morphisms c,: A, > C, / e /, satisfying the universal property: whenever X is an object and a,: A, > X are morphisms, there exists a unique morphism a: C * X with c,a = at for each i e I. As a consequence of the universal property, the coproduct of a family is determined up to isomorphism, if it exists. The product of the family is defined dually. That is to obtain the definition of the product, take the definition of the coproduct and reverse the direction of all arrows. Exercise 1.2 gives a description of coproducts and products in the three categories listed above.
3 Graphs and geometries This section contains a brief discussion of two more categories which will make occasional appearances in these notes.
8
Preliminary results
A graph & — (V, *) consists of a set V of vertices (or objects or points) together with a symmetric relation * called adjacency (or incidence or something else). The ordered pairs in the relation are called the edges of the graph. I write u * v to indicate two vertices are related via * and say u is adjacent to v. A path of length n from u to v is a sequence of vertices u = uo,u\,... ,un = v such that Ui*ui+\ for each i. Denote by d(u, v) the minimal length of a path from u to v. If no such path exists set d(u, v) = oo. d(u, v) is the distance from w to t>. The relation ~ on V defined by u ~ i> if and only if &' of graphs is a function a:V —> V from the vertex set V of ^ to the vertex set V' of 3' which preserves adjacency; that is if u and v are vertices adjacent in § then wa is adjacent to va in # ' . So much for graphs; on to geometries. In this book I adopt a notion of geometry due to Tits. Let / be a finite set. A geometry over / is a triple (F, r, *) where F is a set of objects, r: F > / is a type function, and * is a symmetric incidence relation on F such that objects u and v of the same type are incident if and only if u = v. x(u) is the type of the object u. Notice (F, *) is a graph. I'll usually write F for the geometry (F, r, *). A morphism a: F  • F r of geometries is a function a: F > F' of the associated object sets which preserves type and incidence; that is if w, v e F with u * i> then r(w) = r^wa) and «a *' ua. Ayfag of the geometry F is a set T of objects such that each pair of objects in T is incident. Notice our one (weak) axiom insures that a flag T possesses at most one object of each type, so that the type function r induces an injection of T into / . The image x{T) is called the type of T. The rank and corank of T are the order of r(T) and / — r(!T), respectively. The residue FT of the flag T is {v e F — T: v * t for all r e 7} regarded as a geometry over / — r(T). The geometry F is connected if its graph (F, *) is connected. F is residually connected if the residue of every flag of corank at least 2 is connected and the residue of every flag of corank 1 is nonempty. Here's a way to associate geometries to groups. Let G be a group and & = (Gt'.i e I) a family of subgroups of G. Define F(G, &) to be the geometry whose set of objects of type / is the coset space GjG[ and with objects G\x and Gy v incident if G[X Pi G 7 v is nonempty. For J c / write J' for the complement I — J of J in I and define Gj = f>\j€j Gj. Observe that for x € G, SJtX = {GJX: j e J} is a flag of F(G, 3 0 of type / . A group H of automorphisms of a geometry F is said to btflag transitive if / / is transitive on flags of type / for each subset J of I.
Abstract representations
9
4 Abstract representations Let € be a category. A £representation of a group G is a group homomorphism it: G >• Aut(X) of G into the group Aut(X) of automorphisms of some object X in # . (Recall the definition of Aut(X) in section 2.) We will be most concerned with the following three classes of representations. A permutation representation is a representation in the category of sets and functions. The group Aut(X) of automorphisms of set X is the symmetric group Sym(X) of X. That is Sym(X) is the group of all permutations of X under composition. A linear representation is a representation in the category of vector spaces and linear transformations. Aut(X) is the general linear group GL(X) of the vector space X. That is GL(X) is the group of all invertible linear transformationsof X. Finally we will of course be interested in the category of groups and group homomorphisms. Of particular interest is the representation of G via conjugation on itself (cf. Exercise 1.3). Two &representations 7i[\G —> Aut(X,), / = 1,2, are said to be equivalent if there exists an isomorphism a: X\ > X2 such that 7T2 = 7t\a*, where a*: Aut(Xi) —> Aut(X2) is the isomorphism described in section 2. The map a is said to be an equivalence of the representations, ^representations 71/: G; > Aut(X/) / = 1, 2, are said to be quasiequivalent if there exists a group isomorphism /3: G2 > G\ of groups and a ifisomorphism a: X\ » X2 such that Equivalent representations of a group G are the same for our purposes. Quasiequivalent representations are almost the same, differing only by an automorphism of G. A representation it of G is faithful Hit is an injection. In that event n induces an isomorphism of G with the subgroup Gn of Aut(X), so G may be regarded as a group of automorphisms of X via n. Let7T/: G —> Aut(Xz), / = 1,2, be #representations. Define a Gmorphism a: X\ —> X2 to be a morphism a of X\ to X2 which commutes with the action of G in the sense that {g7t\)ot = a(g7t2) for each g e G. Write MoroC^i, X2) for the set of Gmorphisms of X\ to X2. Notice that the composition of Gmorphisms is a Gmorphism and the identity morphism is a Gmorphism. Similarly define a Gisomorphism to be a Gmorphism which is also an isomorphism. Notice the Gisomorphisms are the equivalences of representations ofG. One focus of this book is the decomposition of a representation n into smaller representations. Under suitable finiteness conditions (which are always present in the representations considered here) this process of decomposition must terminate, at which point we have associated to JT certain indecomposable
10
Preliminary results
or irreducible representations which cannot be broken down further. It will develop that the indecomposables associated to K are determined up to equivalence. Thus we are reduced to a consideration of indecomposable representations. In general indecomposables are not irreducible, so an indecomposable representation it can be broken down further, and we can associate to n a set of irreducible constituents. Sometimes these irreducible constituents are determined up to equivalence, and sometimes not. Even when the irreducible constituents are determined, they usually do not determine TX. Thus we will also be concerned with the extension problem'. Given a set S of irreducible representations, which representations have S as their set of irreducible constituents? There is also the problem of determining the irreducible and indecomposable representations of the group. It is possible to give a categorical definition of indecomposability (cf. Exercise 1.5). There is also a uniform definition of irreducibility for the classes of representations considered most frequently (cf. Exercise 1.6). I have chosen however to relegate these definitions to the exercises and to make the appropriate definitions of indecomposability and irreducibility for each category in the chapter discussing the elementary representation theory of the category. This process begins in the next chapter, which discusses permutation representations. However one case is of particular interest. A representation of a group G on itself via conjugation (in the category of groups and group homomorphisms) is irreducible if G possesses no nonidentity proper normal subgroups. In this case G is said to be simple. To my mind the simple groups and their irreducible linear and permutation representations are the center of interest in finite group theory. Exercises for chapter 1 1. Let G be a finite group, n a set of primes, Q the set of normal TX subgroups of G, and F the set of normal subgroups X of G with G/X a 7rgroup. Prove (1) If H, K e Q then HK e Q. Hence (Q) is the unique maximal member of Q. (2) If H, K e T then H D K e V. Hence f]HeF H is the unique minimal member of P. 2. Let # j be the category of sets and functions, # 2 the category of vector spaces and linear transformations, and 6\ the category of groups and homomorphisms. Let F = (A,: 1 < i < n) be a family of objects in €k. Prove (1) Let k = 1. Then the coproduct C of F is the disjoint union of the sets At with c,: At > C the inclusion map. The product P of F is
Abstract representations
11
the set product A\ x • • • x An with pi'. P > At the projection map Pi:(au...,an)\+ at. (2) Let k = 2. Then C = P = 0 " = 1 At is the direct sum of the subspaces A/, with Ci•: A, >• C defined by a,c, = ( 0 , . . . , at,..., 0) and pc. P > A; the projection map. (3) Let A: = 3. Then the product P of F is the direct product Ai x • • • x An. with pi'. P —> At the projection map. (The coproduct turns out to be the socalled free product of the family.) 3. Let G be a group, H • H by jc(g7r) = x g , x G / / . Let # be the category of groups and homomorphisms. Prove n is a ^representation of G with kernel CG(H). TT is the representation by conjugation of G on //. If / / = G, the image of G under 7t is the mwer automorphism group of G and is denoted by Inn(G). Prove Inn(G) < Aut(G). Define Out(G) = Aut(G)/Inn(G) to be the outer automorphism group of G. 4. Let # be a category, F = (A,;: 1 < i < n) a family of objects in # , C and P the coproduct and product of the family with canonical maps cx•: A/ > C and p,: P —> A/, respectively. For a, € Aut(A/) define a, to be the unique member of Mor(C, C) with a,c/ = c,a, and c, = c^a, for all / ^ j . Define &i e Mor(P, P) dually. Prove the map > Aut(X) 1=1
( a i , . . . , «„) h^ a i . . . « „
is an injective group homomorphism for X = C and P. 5. Assume the hypothesis and notation of Exercise 1.2, and let 7t: G > Aut(Z) be a #£representation, where X = C if k = 1 or 2, and X = P if /: = 3. Prove the following are equivalent: (a) There exist €krepresentations nt•: G —> Aut(A/), 1 < / < n, such that n = x//(/), where 0 is the injection of Exercise 1.4 and Aut(X) be faithful €representations. Prove it is quasiequivalent to a if and only if Gix is conjugate to Go in Aut(X). 8. Let G be a group and F by (Gix)gn = Gtxg. Prove n is a representation of G as a group of automorphisms of F.
Permutation representations Section 5 develops the elementary theory of permutation representations. The foundation for this theory is the notion of the transitive permutation representation. The transitive representations play the role of the indecomposables in the theory. It will develop that every transitive permutation representation of a group G is equivalent to a representation by right multiplication on the set of cosets of some subgroup of G. Hence the study of permutation representations of G is equivalent to the study of the subgroup structure of G. Section 6 is devoted to a proof of Sylow's Theorem. The proof supplies a nice application of the techniques developed in section 5. Sylow's Theorem is one of the most important results in finite group theory. It is the first theorem in the local theory of finite groups. The local theory studies a finite group from the point of view of its /^subgroups and the normalizers of these /^subgroups.
5 Permutation representations In this section X is a set, G a group, and 7t: G > Sym(Z) is a permutation representation of G. Recall Sym(X) is the symmetric group on X; that is Sym(Z) is the group of all permutations of X. Thus Sym(Z) is the automorphism group of X in the category of sets and functions, and n is a representation in that category. For x € X and a e Sym(Z) write xa for the image of x under a. Notice that, by definition of multiplication in Sym(X): x(aP) = (xa)P
x e X,
a, p e Sym(X).
I'll often suppress the representation n and write xg for x(g7t), x e X, g e G. One feature of this notation is that: x(gh) = {xg)h
xeX,
g,heG.
The relation ~ o n X defined by x ~ y if and only if there exists g e G with xg = y is an equivalence relation on X. The equivalence class of x under this relation is xG = {xg:geG} and is called the orbit of x under G. As the equivalence classes of an equivalence relation partition a set, X is partitioned by the orbits of G on X.
14
Permutation representations
Let F be a subset of X. G is said to act on Y if F is a union of orbits of G. Notice G acts on Y precisely when yg e Y for each y e F, and each g e G. Further if G acts on F then g\y is a permutation of F for each g e G, and the restriction map G > Sym(F) £i> Sir is a permutation representation with kernel GY = {g e G:yg = y
for all
y € F}.
Hence Gy > Sym(P) is a permutation representation of G on P where get: Y > Yg for each g e G and
FCZ. 7r is a transitive permutation representation if G has just one orbit on X; equivalently for each JC, y € X there exists g € G with jcg = y. G will also be said to be transitive on X.
Permutation representations
15
Here's one way to generate transitive representations of G: (5.4) Let H < G. Then a: G » Sym(G/H) is a transitive permutation representation of G on the coset space G/H, where get: Hx
/£cg.
H>
a is the representation ofG on the cosets ofH by right multiplication. H is the stabilizer of the coset H in this representation. We'll soon see that every transitive representation of G is equivalent to a representation of G by right multiplication on the cosets of some subgroup. But first here is another way to generate permutation representations of G. (5.5) The map a: G  • Sym(G) is a permutation representation of G on itself, where gcc:x \> x8
x, g G G.
a is the representation of G on itself by conjugation. For S c G, the global stabilizer of 5 in G is NG(S), while C G ( S ) is the pointwise stabilizer of S. Notice that 5.5 is essentially a consequence of Exercise 1.3. Recall NG(S) =
{g eG:S8 = S}, S8 = {s8:s e S}, and CG(S) = {g eG:s8 =s for all s e S}. By 5.3, G is also represented on the power set of G, and evidently, for K G , the set SG = {S8:g e G} of conjugates of S under G is the orbit of S under G with respect to this representation. (5.6) Let Y c X and g e G. Then G(7*) = G(Y)8 and Gy* = (GY)8. (5.7) Assume 7r is a transitive representation and let x e X and H = Gx. Then ker(Tr) = p  H8 = ker*(G) is the largest normal subgroup of G contained in //. (5.8) Assume n is a transitive permutation representation, let x e X, H = Gx, and let a be the representation of G on the cosets of H by right multiplication. Define
0: G/H + X Hg
H*
xg.
Then 0 is an equivalence of the permutation representations a and n.
16
Permutation representations
Proof. We must show 0 is a welldefined bijection of G/H with X and that, for each a, g e G, (Ha)P(ga) = (Ha)gnp. Both computations are straightforward. (5.9) (1) Every transitive permutation representation of G is equivalent to a representation of G by right multiplication on the cosets of some subgroup. (2) If n'\ G » Sym(X0 and n are transitive representations, x e X, and JC' G X', then 7T is equivalent to ix' if and only if Gx is conjugate to Gx> in G. Proo/. Part (1) follows from 5.8. Assume the hypothesis of (2). If 0: X > X' is an equivalence of n and it' then G* = Gxp and, by 5.6, G ^ is conjugate to Gx> in G. Conversely if G*/ is conjugate to Gx in G, then by 5.6 there is y e X with Gy = Gx> and by 5.8 both n and nf are equivalent to the representation of G on the cosets of Gx> and hence equivalent to each other. Let (Xt'.i e I) be the orbits of G on X and ni the restriction of n to Xt. By 5.1, 7T is a permutation representation of G on X( and, as X; is an orbit of G, Hi is even a transitive representation, (jti'.i e I) is the family of transitive constituents of 7T and we write 7T = ^2ieI7ti. Evidently: (5.10) The transitive constituents (jti'.i e I) of n are uniquely determined by 7t, and if n' is a permutation representation of G with transitive constituents (TTJ : 7 e J), then 7r is equivalent to n' if and only if there is a bijection a of / with / such that 7r/a is equivalent to 7r, for each / e / . So the study of permutation representations is effectively reduced to the study of transitive representations, and 5.9 says in turn that the transitive permutation representations of a group are determined by its subgroup structure. The transitive representations play the role of the indecomposable permutation representations. For example see Exercise 1.5. (5.11) If G is transitive on X then X has cardinality \G : Gx\ for each x e X. Proof. This is a consequence of 5.8. (5.12) Let S c G. Then S has exactly \G:NG(S)\ conjugates in G. Proof. We observed earlier that G is transitively represented on the set SG of conjugates of S via conjugation, while, by 5.5, NG(S) is the stabilizer of S with respect to this representation, so the lemma follows from 5.11.
Permutation representations
17
Let p be a prime and recall that a pgroup is a group whose order is a power of p. (5.13) If G is a pgroup then all orbits of G on X have order a power of p. Proof. This follows from 5.11 and the fact that the index of any subgroup of G divides the order of G. (5.14) Let G be a pgroup and assume X is finite. Then X = Fix(G) mod p. Proof. As thefixedpoints of G are its orbits of length 1,5.14 follows from 5.13. Here are a couple applications of 5.14: (5.15) Let G and H be pgroups with H ^ 1 and let a: G * Aut(H) be a group homomorphism. Then CH(G) ^ 1. Proof, a is also a permutation representation of G on / / . By 5.14, \H\ = Fix(G) mod p. But Fix(G) = CH(G) in this representation, while \H\ = 0 mod p as H is a pgroup with H ^ 1. So CH(G) ^ 1, as claimed. (5.16) If G is a pgroup with G ^ 1, then Z(G) ^ 1. /. Apply 5.15 to the representation of G on itself by conjugation and recall Z(G) = C G (G). The following technical lemma will be used in the next section to prove Sylow's Theorem: (5.17) Let X be finite and assume fpr each x e X that there exists a psubgroup P(x) of G such that {JC} = Fix(P(x)). Then (1) G is transitive on X, and (2) X = l m o d p . Proof. Let X = Y + Z be a partition of X with G acting on Y and Z. Let 7 7^ 0 and pick y e Y. For V = Y or Z and / / < G denote by Fix y (#) the fixed points of H on V. By hypothesis {y} = Fix(P(y)), so 1 = \¥ixY(P(y))\ andO= Fix z (P(y)). Hence, by 5.14, \Y\ = l m o d p and Z = 0 mod p. But if Z is nonempty, then, by symmetry, F = 1 mod p, a contradiction. Thus
18
Permutation representations
Y = X and, as \Y\ = 1 mod p, (2) holds. Since we could have chosen Y to be an orbit of G on X, (1) holds. Let Q be a partition of X. Q is Ginvariant if G permutes the members of Q. Equivalently regard Q as a subset of the power set P of X and represent G on P as in 5.3; then Q is Ginvariant if G acts on the subset Q of P with respect to this representation. In particular notice that if Q is Ginvariant then there is a natural permutation representation of G on Q. Q is nontrivial if G?M{*}:*€X}andG#{X}. Let G be transitive on X. G is imprimitive on X if there exists a nontrivial Ginvariant partition 2 of X. In this event g is said to be a system ofimprimitivity for G on X. G is primitive on X if it is transitive and not imprimitive. (5.18) Let G be transitive on X and y e X. (1) If 1, and let x e X. Then there is a sequence Gx = HQ < H\ < • • • < Hn = G with //, maximal in Hi+\. This gives rise to a family of primitive permutation representations: the representations of Hi+\ on the cosets of //,. This family of primitive representations can be used to investigate the representation n of G on X. From this point of view the primitive representations play the role of irreducible permutation representations. See also Exercise 1.6. I close this section with two useful lemmas. The proofs are left as exercises. (5.20) Let G be transitive on X, x e X, and H < G. Then H is transitive on XifandonlyifG = G^if. (5.21) Let G be transitive on X, x e X, H = Gx and K < H. Then NG(K) is transitive on Fix(£) if and only if KG n H = KH.
Sylow's Theorem
19 6 Sylow's Theorem
In this section G is a finite group. If n is a positive integer and p a prime, write np for the highest power of p dividing n. np is the ppart of n. A Sylow psubgroup of G is a subgroup of G of order \G\P. Write Sylp(G) for the set of Sylow psubgroups of G. In this section we prove: Sylow's Theorem. Let G be a finite group and p a prime. Then (1) Sy\p(G) is nonempty. (2) G acts transitively on Syl p (G) via conjugation. (3) Syl p (G) = \G: NG(P)\ = 1 mod p for P e Sy\p(G). (4) Every psubgroup of G is contained in some Sylow psubgroup of G. Let T be the set of all psubgroups of G and Q the set of all maximal psubgroups of G; that is partially order F by inclusion and let Q be the maximal members of this partially ordered set. It follows from 5.3 and 5.5 that G is represented as a permutation group via conjugation on the power set of G, and it is evident that G acts on F, Q, and Sylp(G) with respect to this representation. Let R e Q. Claim R is the unique point of Q fixed by the subgroup RofG. For if R fixes Q eQ then, by 5.5, R < NG(Q), so, by 1.7.2, RQ Q and R, Q e Q, we conclude R = RQ = (?. So the claim is established. I've shown that for each R e Q there is a psubgroup P(R) of G such that R is the unique point of Q fixed by P(#); namely R = P(R). So it follows from 5.17 that: (i) G is transitive on Q, and (ii) £2 = l m o d p . LetP € Q and suppose  P\ — G p .ThenP € Syl p (G), so, as G is transitive on Q and G acts on Syl p (G), we have Q c Syl^G). On the other hand as \R\ divides \G\ for each R e Q it is clear Sylp(G) c Q, so Q = Sy\p(G). Thus (i) implies parts (1) and (2) of Sylow's Theorem, while (ii) and 5.12 imply part (3). Evidently each member of F is contained in a member of £2, so, as Q = Syl p (G), the fourth part of Sylow's Theorem holds. So to complete the proof of Sylow's Theorem it remains to show \P\ = \G\P for P eQ. Assume otherwise and let M = NG(P). By (i), (ii), and 5.12, \G : M\ = 1 mod p, so \M\p = \G\P, and hence p divides \M/P\. Therefore, by Cauchy's Theorem (Exercise 2.3), there exists a subgroup R/P of M/P of order p. But now  R \ — /?/PPisapowerofp, soP < R € F, contradicting P eQ. This completes the proof of Sylow's Theorem.
20
Permutation representations
Next a few consequences of Sylow's Theorem. (6.1) Let P e Syl p (G). Then P < G if and only if P is the unique Sylow p subgroup of G. Proof. This is because G acts transitively on Sylp(G) via conjugation with NG(P) the stabilizer of P in this representation. Lemma 6.1 and the numerical restrictions in part (3) of Sylow's Theorem can be used to show groups of certain orders have normal Sylow groups. See for example Exercises 2.5 and 2.6. (6.2) (Frattini Argument) Let if < G and P e Sy\p(H). Then G = HNG(P). Proof. Apply 5.20 to the representation of G on Syl^if), using Sylow's Theorem to get H transitive on Sylp(H). Actually Lemma 6.2 is a special case of the following lemma, which has a similar proof, and which I also refer to as a Frattini Argument: (6.3) (Frattini Argument) Let K be a group, H < K, and X c H. Then K = HNK (X) if and only if XK = XH. Indeed H has  K : HNK (X)  orbits of equal length on XK, with representatives (Xy:y e 7), where Y is a set of coset representatives for HNK(X) in K. (6.4) Let H < G and P e Sy\p(G). Then P D H e Sy\p(H). Exercises for chapter 2 1. Prove Lemma 5.18. 2. Prove Lemmas 5.20 and 5.21. 3. Prove Cauchy's Theorem: Let G be a finite group and p a prime divisor of \G\. Then G contains an element of order p. (Hint: Prove p divides  C G ( * )  for some x e G # . Then proceed by induction on G.) 4. Let G be a finite group and p a prime. Prove: (1) If G/Z(G) is cyclic, then G is abelian. (2) If \G\ = p2 then G = Zpi or Epi. 5. (1) Let \G\ = pem, p > m, p prime, (/?, m) = 1. Prove G has a normal Sylow psubgroup. (2) Let  G  = /?#, p and # prime. Prove G has a normal Sylow /^subgroup or a normal Sylow gsubgroup.
Sylow's Theorem
21
6. Let  G  = pq2, where p and q are distinct primes. Prove one of the following holds: (1) q > p and G has a normal Sylow q group. (2) p > q and G has a normal Sylow /?group. (3) \G\ = 12 and G has a normal Sylow 2group. 7. Let G act transitively on a set X , i e X , and P e Sylp(Gx). Prove A^G(^) is transitive on Fix(P). 8. Prove Lemmas 6.3 and 6.4. 9. Prove that if G has just one Sylow ^subgroup for each p e n(G), then G is the direct product of its Sylow psubgroups.
Representations of groups on groups Chapter 3 investigates representations in the category of groups and homomorphisms, with emphasis on the normal and subnormal subgroups of groups. In section 7 the concept of an irreducible representation is defined, and the JordanHolder Theorem is established. As a consequence, the composition factors of a finite group are seen to be an invariant of the group, and these composition factors are simple. The question arises as to how much the structure of a group is controlled by its composition factors. Certainly many nonisomorphic groups can have the same set of composition factors, so control is far from complete. To investigate this question further we must consider extensions of a group G by a group A. Section 10 studies split extensions and introduces semidirect products. Section 9 investigates solvable and nilpotent groups. For finite groups this amounts to the study of groups all of whose composition factors are, in the first case, of prime order and, in the second, of order p for some fixed prime p. Commutators, characteristic subgroups, minimal normal subgroups, central products, and wreath products are also studied.
7 Normal series In this section G and A are groups, and it: A —> Aut(G) is a representation of A in the category of groups and homomorphisms. I'll also say that A acts as a group of automorphisms on G. Observe that n is also a permutation representation, so we can use the terminology, notation, and results from chapter 2. A normal series of length n for G is a series
The series is Ainvariant if A acts on each G;. (7.1) Let (G/: 0 < / < n) be an Ainvariant normal series and H an Ainvariant subgroup of G. Then (1) The restriction n 1#: A —> Aut(//) is a representation of A on H. (2) (G;? fl H: 0 < i < n) is an Ainvariant normal series for H. (3) If H < G then TTG/H • A > Aut(G/H) is a representation, where CMG/H • Hg h+ H(ga) for a e A, g e G.
Normal series
23
(4) If H < G then (GiH/H: 0 < / < n) is an Ainvariant normal series for G/H. (5) If X is an Ainvariant subgroup of G and H Sym(X) a permutation representation of G on X = { l , . . . , n } . Form the direct product Dofn copies of L. G acts as a group of automorphisms of D via the representation of defined by
The wreath product of L by G (with respect to 7r) is defined to be the semidirect product S(G, D, a). The wreath product is denoted by Lwr G or Lwr^G or Lwr^G. (11.3) Let W = LwrnG be the wreath product of L by G with respect to n. Then (1) W is a semidirect product of Z) by G where D = L\ x • • • x Ln is a direct product of n copies of L. (2) G permutes A = {Lt\ 1 < / wnere ag e F a n d at most a finite number of the coefficients ag are nonzero. Multiplication becomes
WG
/ \ heG
I
g,heG
36
Linear representations
As is well known (and easy to check), this multiplication makes R into a ring with identity and, as the multiplication on R commutes with scalar multiplication from F, R is even an Falgebra. R = F[G] is the group ring or group algebra of G over F. Observe that V becomes a (right) Rmodule under the scalar multiplication:
Conversely if U is an /^module then we have a representation a: G > GL(U) defined by u(ga) = ug, where ug is the module product of u e U by g e R. Further if nr. G > GL(V,), i = 1, 2, are FGrepresentations then 0: Vi > V2 is an equivalence of the representations precisely when /? is an isomorphism of the corresponding /^modules. Indeed y: V\ > V2 is an FGhomomorphism if and only if y is an /?module homomorphism of the corresponding /^modules. Here y: V\ > V2 is defined to be an FGhomomorphism if y is an Flinear map commuting with the actions of G in the sense that v(gn\)y = vy(g7i2) for each veV\, and g G G. In the terminology of section 4, the FGhomomorphisms are the Gmorphisms. The upshot of these observations is that the study of FGrepresentations is equivalent to the study of modules for the group ring F[G] = R.I will take both points of view and appeal to various standard theorems on modules over rings. Lang [La] is a reference for such results. Observe also that V is an abelian group under addition and n is a representation of G on V in the category of groups and homomorphisms. Indeed n induces a representation TT': F# XG+ Aut(V) in that category defined by (a, g)n': v i» av(g7t), fora e F # , g e G. Here F # is the multiplicative group of F. Two FGrepresentations n and a are equivalent if and only if 7if and o' are equivalent, so we can use the results of chapter 3 to study FGrepresentations. In the case where F is a field of prime order we can say even more. (12.1) Let F be the field of integers modulo p for some prime p and assume V is of finite dimension. Then (1) V is an elementary abelian pgroup and n is a representation of G in the category of groups and homomorphisms. (2) If U is an elementary abelian /7group written additively, then U is a vector space F U over F, where scalar multiplication is defined by ((/?) + n)u = nu, neZ,ueU. (3) Gh(FU) is equal to the group Aut(U) of group automorphisms of U. Indeed if W is an elementary abelian pgroup then the group homomorphisms from U into W are precisely the Flinear transformations from FU into F W.
Modules over the group ring
37
(4) The vector space F V defined using the construction in part (2) is precisely the vector space V. As a consequence of 12.1, if F is a field of prime order, the FGrepresentations are the same as the representations of G on elementary abelian pgroups. A vector subspace U of V is an FGsubmodule of V if U is Ginvariant. U is an FGsubmodule if and only if U is an /?submodule of the /^module V. From 7.1 there are group representations of F # x G on £/ and V/U. These representations are also FGrepresentations and they correspond to the Rmodules U and V/U. V is irreducible or simple if 0 and V are the only FGsubmodules. A composition series for V is a series 0 = Vo < Vi < • • • < Vn = V of FGsubmodules such that each factor module Vi+\/Vi is a simple FGmodule. This corresponds to the notion of composition series in section 7. The family (V/+i/ Vf. 0 < / < n) is the family of composition factors of the series. If V is of finite dimension then it is easy to see that V possesses a composition series. Appealing to the JordanHolder Theorem, established in section 7, and to remarks above, we get: (12.2) (JordanHolder Theorem for FGmodules) Let V be a finite dimensional FGmodule. Then V possesses a composition series and the composition factors are independent (up to order and equivalence) of the choice of composition series. The restrictions 7T/ =7ry./v;_1, 0 < / Mx(g) is an Falgebra isomorphism of End/r(V) with Fnxn. Hence the map restricts to a group isomorphism of GL(V) with the group of all nonsingular n by n matrices over F.
The general linear group and special linear group
43
(2) Let Y = (y\,..., yn) be a second ordered basis of V, let h be the unique element of GL(V) with *,•* = # , 1 < i 7\ y, = JC/ for i < m, and, subject to these constraints, with m maximal. Let U = (*,: i < m),x=xm+\, y = ym+\, and W = (U, x, y). Then Suppose k = 2 and let H be a hyperplane of V containing U and x — y but not x. Let f be the transvection with axis H and [y, f ] = x — y. Then yf = JC and *,•* = xi for / < m, so a^ € o>r by maximality of m. Then a e coT, contrary to the choice of a. So k = 1. Suppose m — n — I. As k = l, ax — y € U for some a e F#. As m = n — 1 and a 7^ co, ax — y ^ 0. So there is a transvection t with axis £/ and [y, i\—ax — y. Now atf = a>, contradicting a ^ a>7\ So m < n — 1, and hence there is z G V — W. An argument in the last paragraph shows there are transvections s and t with U < Cy(t) n C^(^), ys = z, and zt =x. But now jCjsf = xt for i < m and ysf = JC, contradicting the choice of a. (13.8) If n > 2 then SL n (F) is perfect unless n = 2 and  F  = 2 or 3. /. Let G = SL n (F). By 13.7 it suffices to show transvections are contained in G(1), and this follows from 13.6.4. 14 The dual representation In section 14, V continues to be an ndimensional vector space over F and n.G^ GL(V) is an FGrepresentation of a group G. Let (Vt'. —00 < i < 00) be a sequence of FGmodules and • • •  • V_i — ^ VQ — > V1  > • • •
The dual representation
Al
a sequence of FGhomomorphisms. The latter sequence is said to be exact if ker(a;+i)= V^a; for each /. A short exact sequence is an exact sequence of the form 0 ^ U A V 4> W• 0. The maps 0 ^ U and W+ 0 are forced to be trivial. Observe that the hypothesis that the sequence is exact is equivalent to requiring that a be an injection, f$ a surjection, and Ua = ker(^). Hence W = V/Ua and the sequence is essentially 0 + Ua + V > V/ Ua > 0 with Ua > V inclusion and V > V/ Ua the natural map. The sequence is said to split if V splits over Ua. As is well known, the sequence splits if and only if there is y e HomFG(W, V) with yf$ = 1, and this condition is equivalent in turn to the existence of 8 e Hom/rG(V, U) with a8 = 1. Let V* = Hom F ( V, F) and recall from section 13 that V* is a vector space over F. We call V* the dual space of V. It is well known that n = dim/r( V*). If U is an Fspace and a e HomF(U, V) define a* €Hom F (V*, U*) by
xa* =ax, x e V*. (14.1) Let U, V, and W be finite dimensional Fspaces, a e RomF(U, V), and peHomF(V, W).Then (1) The map y H> y* is an Fspace isomorphism of HomF(U, V) with HomF(V*, £/*). (2) (aP)* = p*a*. (3) If f/ A V  i W is exact then so is W* ^> V* X U*. If TT: G > GL(V) is an FGrepresentation then, from 14.1, 7t*: G  • GL(V*) is also an FGrepresentation, where n*: g h> (^~17r)*. The representation 7r* is called the dual of 7r and the representation module V* of 7T* is called the dw U —> V —> W —> 0 is an exact sequence of FGmodules if and only if 0  * W* ^ V* ^> U* + 0 is. The first sequence splits if and only if the second splits. (3) V is irreducible, indecomposable, semisimple, and homogeneous if and only if V* has the respective property. Proof. Part (1) follows from 14.1.1 and 14.1.2. The first part of (2) follows from 14.1.3 and 14.4. The second part follows from the remark about splitting at the beginning of this section and 14.1.2. Part (3) follows from (2), since the properties in (3) can be described in terms of exact sequences and the splitting of such sequences. (14.6) (1) Let a: V^* U bean FGhomomorphism offinitedimensional modules. Then [G, U] < Va if and only if ker(a*) < CV*(G), while [G, V*] < U*a* if and only if ker(a) < CV(G). (2) If U is a finite dimensional FGmodule then U = [U, G] if and only if CV*(G) = 0, while U* = [U*, G] if and only if CV(G) = 0.
The dual representation
49
Proof. We have the exact sequence
so, by 14.1.3,
is also exact. Let n be the representation of G on U/Va. Then [G, £/] < Va if and only if Gn = 1. This is equivalent to Gn* = 1 which in turn holds if and only if G centralizes (U/Va)*. As (U/Va)* is FGisomorphic to ker(a*) by the exactness of the second series above, the first part of (1) holds, while the second follows from the first and 14.4.3. Let U^[U,G] = V anda: V^U the inclusion. By (l),ker (a*) < CV*{G). As a is not a surjection, ker(a*)^0 by 14.5.2. Thus 0^Q/*(G). Hence by 14.4.3, if U* # [U*, G] then 0 ^ CV(G). Similarly, if 0 ^ Q/(G), let 0: U > U/CV(G) be the natural map. By (1), [G, U*] < (U/Cu(G))*P*. As ft is not an injection, 0* is not a surjection by 14.5.2. So f/* ^ [G, I/*]. Applying 14.4.3 we see that if 0 ^ CV*(G) then U 7^ [G, £/], completing the proof of (2). The character of an FGrepresentation it is the map x : G ~^ F defined by ^(g) =Tr(g7r). Remember Tr(gjt) is the trace of the matrix Mx(gTt) and is independent of the choice of the basis X for the representation module of n. (14.7) Let 7t be an FGrepresentation, 7r* the dual of n, and x and x* the characters of u and 7T*, respectively. Then x*(g) = xCg"1) f° r e a c n 8 ^G. Proof. By 14.2, M^(g7T*) = Mx(g"17r)T, so the lemma follows as Tr(A) = Tr(AT) for each n by n matrix A. Since characters have now been introduced I should probably record two more properties of characters which are immediate from 13.1 and the fact that conjugate matrices have the same trace. (14.8) (1) Equivalent FGrepresentations have the same character. (2) If x is the character of an FGrepresentation then x (gh) = X (g) for each g,heG. Remarks. The stuff in sections 12 and 13 is pretty basic but section 14 is more specialized. Section 14 is included here to prepare the way for the 1 cohomology in section 17. That section is also specialized. Both can be safely skipped or
50
Linear representations
postponed by the casual reader. If so, lemma 17.10 must be assumed in proving the SchurZassenhaus Theorem in section 18. But that's no problem. The reader who is not familiar with the theory of modules over rings might want to bone up on modules before beginning section 12. Exercises for chapter 4 1. Let G be a finite subgroup of GL(V), where V is a finite dimensional vector space over a field F with (char (F), \G\) = 1. Prove (1) V = [ G , V ] 0 C v ( G ) . (2) If G is abelian then V = {CV(D): D e A), where A is the set of subgroups D of G with G/D cyclic. (3) If G = Epn, n > 0, and V = [V, G], then V = 0 H G r CV(H), where F is the set of subgroups of G of index p. 2. Let V be a finite dimensional vector space over a field F, g e Endjr(V), and U a ^invariant subspace of V. Prove (1) g centralizes V/U if and only if [V,g], g] is a surjective linear transformation of V onto [V,g] with kernel C v (g). (3) dim F (V) = dim F (C v (g)) + dimF([V, g]). 3. Let G be a finite group, F a field of prime characteristic p, and 7t an irreducible FGrepresentation. Prove OP(GTV) = 1. 4. Let F be a field, r and # be primes, X a group of order r acting irreducibly on a noncyclic elementary abelian ggroup Q, and V = [V, Q] a faithful irreducible FXQmodule. Then dim^C V) = rk where k = dim^Cy (X)) = dimF(Cv(H)) for some hyperplane H of Q. 5. Leto?:G> Sym(/) be a permutation representation of afinitegroup G on afiniteset / , and let F be afieldand V an Fspace with basis X = (JC, : / € / ) . The FGrepresentation n induced by a is the representation on V with g7T: X( i^ jc,ga for each g e G and / € / . V is called the permutation module of a. Let / be the character of n. Prove (1) x(g) is the number of fixed points of get on / for each geG. ( 2 ) (YlgeG X(g))/\G\ is the number of fixed points of G on / . (3) If G is transitive on / then (Y,geG x(g) 2 )/G is the permutation rank of G on / . (See section 15 for the definition of permutation rank.) 6. Assume the hypothesis of the previous exercise with G transitive on / . Let z= £« € /**' z = te>'and
u= [Jel Iel U is the core of the permutation module V. Prove (1) Z = CV(G) and £/ = [V,G].
The dual representation
51
(2) If W is an FGmodule, ieI,H = G( is the stabilizer in G of i, w e Cw(H), and W = (wG), then there is a surjective homomorphism of V onto W. (3) Assume p = char(F) is a prime divisor of /. Then V does not split overt/, VdoesnotsplitoverZ,andifO p (G) = Gthen// 1 (G, U/Z)^ 0. (See section 17 for a discussion of the 1cohomology group Hl;in particular use 17.11.) 7. Let F be a field, U a 2dimensional vector space over F with basis {JC, y}, G = GL(£/), and V = F[JC , y] the polynomial ring in x and y over F. Prove (1) n is an FGrepresentation on V where TT is defined by / ( * , y)g7r = f(xg, yg) forfeV and g G G . (2) G acts on the (n 4 l)dimensional subspace yn of homogeneous polynomials of degree n. Let nn be the restriction of ntoVn. (3) If char(F) = p > 0, prove 7rn is not irreducible for p < n ^ — 1 mod /?, but 7tn is irreducible for 0 < n < p. (4) ker(7rn) is the group of scalar transformations alofU with a e F and an = \. (Hint: In (3) let T be the group of trans vections in G with center (JC) and for / < n let Mi be the subspace of M — Vn generated by yjxn~j,0 < j • G. Let ^2 be the points of the projective geometry of V. Prove (1) For A G G, 0(A) is a permutation of P. (2) G* = (0(A): A G G} is a subgroup of Sym(T), and 0: G > G* is a surjective group homomorphism with kernel Z(G), so 0 induces an isomorphism 0: G > G*, where G = PGL(V). (3) Define a: Q > F by a: FJCI i^ 00 and a: F(AJCI + X2) H> A for X e F.
Then a is a bijection such that (cog)a = (coa)^(g) for each co e Q and g e G. Hence a is an equivalence of the permutation representations of G on ft and G* on T.
Permutation groups This chapter derives a number of properties of the alternating and symmetric groups An and Sn of finite degree n. For example the conjugacy of elements in An and Sn is determined, and it is shown that An is simple if n > 5. Section 15 also contains a brief discussion of multiply transitive permutation groups. Section 16 studies rank 3 permutation groups.
15 The symmetric and alternating groups Let X be a set and S the symmetric group on X. A permutation group on X is a subgroup of S. Let G be a permutation group on X. In this section X is assumed to be of finite order n. Thus S is of order n!, so S and G are finite. Suppose g e S and let// = (g). Then g is of finite order m and// = {gl:0 < i < m). Further H has a finite number of orbits (JC/ //: 1 < / < &), a n d the orbit X(H is of finite order //. Let /// = Hx. be the stabilizer in H of JC/. By 5.11, /, = // : Ht\, so, as / / = (g) is cyclic, /// = (gli) and {g7': 0 < j < /,} is a set of coset representatives for //, in //. Hence, by 5.8, JC;// = {jc;gy: 0 < y < //}. Therefore g acts on JC/ / / as the following cycle: g\XiH
(xi,Xig,Xig2,...,Xigli~l).
=
This notation indicates that g: xtgj t^ xtgj+l forO g " 1 ^ . Proof. The cocycle condition implies y 0 is a homomorphism. (—y)0 is an inverse for y0, so y 0 G Aut(G V). By definition y 0 centralizes V and G V/ V, so y 0 G U(G, V). For u e U define wi/r: g H> g" 1 ^". An easy check shows ux// is a cocycle and ^ = 0" 1 , so 0 is an isomorphism. (17.3) U(G, V) acts regularly on the set of complements to V in GV. Indeed Gu = S{u(p1) for each u e U(G, V). Proof. As U = U(G, V) acts on V it permutes the complements to V in G V. By definition of the maps 0 and S, Gu = S{ucj)~l) for u e U. Hence, as S and 0 are bijections, the action of U is regular. Lemmas 17.1 and 17.3 give descriptions of the complements to V in GV in terms of T(G, V) and £/(G, V), while 17.2 and 17.3 give the correspondence between the two descriptions. The next few lemmas describe the
66
Extensions of groups and modules
representations of G on F(G, V) and U(G, V), and show these representations are equivalent. (17.4) Forg € Gandy e T(G, V) define y8: G > V by h(y8) = [(/* g ~VF, for h e G. Then if is a representation of G on F(G, V), where gif: y \+ y8. If 7r is an FGrepresentation so is if. (17.5) For v G V define va: G > V by g(va) = [g, v] = v  v*. Then the map a: v i> i>a is a Ghomomorphism of V into F(G, V) with kernel Cy{G). If 7r is an FGrepresentation then a is an FGhomomorphism. Proof. Lemma 8.5.4 says vot is a cocycle. The rest is straightforward. If V is an FGmodule then so is F(G, V) and 0 induces an Fspace structure on U(G, V) which makes 0 into an Fspace isomorphism. That is, for u e U(G, V) and a e F,au = (a(M0"1))0. Equivalently if gu = gv then gau = g(av). This is the Fspace structure on U(G, V) implicit in the remainder of the section. (17.6) Let c: GV > Aut(GV) and d: Aut(GV) n N(V) + Aut(£/(G, V)) be the conjugation maps. Then a
U(G,V) is a commutative diagram, the maps c, a, and 0 are Ghomomorphisms, and if V is an FGmodule the maps are FGhomomorphisms. Here 0, a, and if are defined in 17.2, 17.5, and 17.4, respectively, and JT, if, and cd are the representations of G on V, T(G, V), and U(G, V), respectively. Proof
Let v , w e V , u e U(G, V), and g , h e G . Then vc: gw
H>
guw = g(u — v8 + w) =
so c = ct(f) and the diagram commutes. By 17.5, a is a Ghomomorphism, and even an FGhomomorphism if V is an FGmodule. By 17.2, 0 is a homomorphism. Next u*cd:hv H> (hv)8'1"8 = h*~lu*v. Hence (hv)(y8(/>) = h{hy8 + v) = h(((h8~l)y)8 + v) = (h8~\h8~l)y)8v = ((/ig"1)(K0)Fv = (hv)((y4>Ycd), so = (y(p)gcd, and therefore 0 is a Ghomomorphism.
1cohomology
67
Suppose V is an FGmodule. For a e F , (au)gcd = ((a(u(t)l))l))8) U(G, V) making the following diagram commute:
In particular dim F (W/V£) < dimF(Hl(G, V)). Proof Let it' be the representation of G on W and consider the semidirect products H = S(F # x G, W, 7rr) and S = S(F # x G, V, it). As ^ is an injective FGhomomorphism it induces by 10.3 an injective group homomorphism 0:S > H which is the identity on F # x G. As [G, W] < Vj8, (GV)^ < //, so the conjugation map £ of H on (G V)f$ composed with (fi~l )*: Aut((G V)/?) > Aut(GV) = A maps / / into A. As CW(G) = 0, the restriction y of e(P~xy to W is an injection of W into £/ = U(G, V). As / is the composition of (F # x G)homomorphisms, y is an (F # x G)homomorphism, and hence is a Ghomomorphism preserving the multiplication by F. In particular if the multiplication u I)* ua, a e F # , M G £/ of F # on U is that of the Fspace structure on £/ defined earlier, then y is an FGhomomorphism. For this we need to show a u aM = gav, while g"° = ga~l"a = g» = g™ for g e G. But if g = gv then g a a g" _ (gtj)« = ^^i; as [a, g] = 1 and v = av. It remains to show fiy = c. Keeping in mind that /*: S > H is an injective homomorphism trivial on F # x G, we see that for v, w e V and g e G we have (gw)^ = (((gw)^)^)^ 1 = fe^w^)^"1 = (g[g, ^ J w ^ ) ^ " 1 = g[g, ^]v^ = ^u>^ = (gw)v = (gw)vc So f$y = c as desired. Lemma 17.11 says that if CV(G) = 0 then U(G, V) is the largest extension W of V such that [W, G] < V and C W (G) = 0. Recall the definition of the dual V* of a finite dimensional FGmodule V given in section 14, and define U*(G, V) to be (U(G, V*))*.
69
l'Cohomology
(17.12) Let V be afinitedimensional FGmodule, 0: W > V a surjective FGhomomorphism, and assume ker(/3) < CW(G) and W = [W, G]. Then there exists a surjective FGhomomorphism y: £/*(G, V) ^ W making the following diagram commute:
Here e* is the dual of the conjugation map e: V* > U(G, V*) and e* is a surjective FGhomomorphism with Hl(G, V*) = ker(^*) < Cu*(GtV)(G). Thus < dimF(Hl(G, V*)). /. As W = [W, G], CV*(G) = Oby 14.6. Similarly, asker(£) < C W (G), [G, W*] < V*^* by 14.6. Let e: V* + U(G, V*) be the conjugation map. By 17.11 there is an injective FGhomomorphism 8: W* > U(G, V*) such that the diagram commutes:
W*
• l/(G, V*) 8
Then applying 14.1.2 and 14.4.3 we conclude the following diagram commutes, e*
where y = 8*. As 8 is injective, y is surjective, so e* — yfi is surjective since P is surjective by hypothesis. Hl(Gy V*) = U(G, V*)/V*e, so Hl(G, V*) = Hl(G, y*)* =ker(^*)by 14.5. As [U(G, V*), G] < y*^, Gcentralizesker(e*) by 14.6. Lemma 17.12 says that if V = [y, G] then t/*(G, V) is the largest extension W of a module Z by V with Z < C W (G) and W = [ W, G].
70
Extensions of groups and modules
18 Coprime action (18.1) (SchurZassenhaus Theorem) Let G be a finite group, H Ga is a homomorphism then Ha is a nsubgroup of Ga. If H is a Hall 7rsubgroup of G and a is surjective then / / a is a Hall 7Tsubgroup of Ga. (2) If H is a Hall n subgroup of G and H < K < G then H is a Hall 7rsubgroup of K. (18.4) If p and # are distinct primes and H and £ are Hall p' and ^'subgroups of a finite group G, respectively, then (1) G = HK, and (2) if n K is a Hall {/?, gfsubgroup of G, a Hall /?'subgroup of K, and a Hall g'subgroup of H. Proof. This follows from 1.7.3. (18.5) (Phillip Hall's Theorem) Let G be a finite solvable group and n a set of primes. Then (1) G possesses a Hall 7rsubgroup. (2) G acts transitively on its Hall 7rsubgroups via conjugation. (3) Any 7rsubgroup of G is contained in some Hall nsubgroup of G. Proof. Let G be a minimal counterexample and M a minimal normal subgroup of G. By 9.4, M is a /?group for some prime p. Let G* = G/M. By minimality of G, G* satisfies the theorem. In particular G* possesses a Hall 7rsubgroup H*. Also if X is a ^subgroup of G then so is X*, so X* is contained in some conjugate H*g of //*, and hence X < H8. Suppose pen. Then H is a Hall 7rsubgroup of G. Further X is contained in the Hall 7rsubgroup H8 of G. Indeed if X is a Hall 7rsubgroup of G, then X = H* so X = # * is a conjugate of i/. Thus we may assume p £ n. By the SchurZassenhaus Theorem, 18.1, there is a complement K to M in H, and / / is transitive on such complements.
72
Extensions of groups and modules
But as \H*\ = \G\n> these complements are precisely the Hall 7rsubgroups of G contained in H. Therefore G possesses Hall 7Tsubgroups and H is transitive on the Hall nsubgroups of G contained in H. So, as X8 < H, X is conjugate to K if X is a Hall 7rsubgroup of G. This shows G is transitive on its Hall 7Tsubgroups. Finally if H ^ G then, by minimality of G, X is contained in a Hall itsubgroup of H8, which is also a Hall nsubgroup ofG. So assume H = G. Then G = KM so XM = XM n G = XM n KM = (XMH K)M by the Modular Property of Groups, 1.14. Now X andXMH K are Hall jrsubgroups of XM, so, by (2), there is y e XM with X? = XMD K 2. Let p e TT(G) and H a Hall p'subgroup of G. By 18.4, H n K is a Hall qrsubgroup of H for each prime q distinct from p and each Hall g'subgroup of K of G. Therefore H satisfies the hypothesis of the lemma, and hence H is solvable by minimality of G. Let M be a minimal normal subgroup of H. By 9.4, M is an rgroup for some prime r. As JT(G) > 2 there is q e n(G) — [p, r}. Let K be a Hall g'subgroup of G. Asq ^ r, K contains a Sylow rsubgroup of G. Hence, by Sylow's Theorem, M is contained in some conjugate of K, which we may take to be K. As q ^ p,G = HKby 18.4. So, as M < //, X = (M G ) = {MHK) = (MK) < K. Hence, as subgroups of solvable groups are solvable, X is solvable. Of course X < G and we conclude from 18.3 that G/X satisfies the hypothesis of the lemma. So, by minimality of G, G/X is solvable. Therefore G is solvable by 9.3.
Coprime action
73
(18.7) (Coprime Action) Let A and H be finite groups with (A,//) = 1. Assume A is represented as a group of automorphisms of H and either A or H is solvable. Let p be a prime. Then (1) There exists an Ainvariant Sylow /^subgroup of H. (2) CH(A) is transitive on the Ainvariant Sylow psubgroups of G. (3) Every Ainvariant /^subgroup of H is contained in an Ainvariant Sylow /^subgroup of H. (4) Let K be an Ainvariant normal subgroup of H and H* = H/K. Then CH*(A) = NH*(A) = CH(A)\ Proof. Form the semidirect product G of H by A with respect to the representation of A on H, and identify A and / / with subgroups of G via the injections of 10.1. Then H < G, A is a complement to / / in G, and the action of A on H is via conjugation. NG(A) = NG(A) nAH=ANH(A) by the Modular Property of Groups, 1.14. Also [A, NH(A)] < A H H = 1, so NH(A) = CH(A) and ATG(A) = A x C#(A). Let P € S y y i / j . By a Frattini Argument, 6.3, G = HNG(P). Then by SchurZassenhaus there is a complement 5 to NH(P) in NG(P) and / ^ = A for some g e G. Hence P g = g is an Ainvariant Sylow psubgroup of H. NG(Q) is transitive on AG Pi NG(Q) by SchurZassenhaus, so, by 5.21, NG(A) is transitive on the Ainvariant Sylow/7subgroups of H. As NG(A) = AC#(A) and A < NG(Q), CH(A) is also transitive on the Ainvariant Sylow /?subgroups of H by 5.20. Let R be a maximal Ainvariant /7subgroup of H.If R £ Sy\p(H) then, by Exercise 3.2, fl £ Sylp(NH(R)). But Afa(fl) is Ainvariant so by (1) there is an Ainvariant Sylow psubgroup of NH(R), contradicting the maximality of R. This establishes (3). Assume the hypothesis of (4) and let X* = CH*(A). We have already shown X* = NH*(A). Now AK (/ such that g(jca, ya) = /(JC, y) for all JC, y e V. A similarity is a nonsingular linear transformation a: V —> U such that g(xa, yot) = A.(a)/(jc, y) for all JC, y € V and some X(a) e F # independent of x and y. If (V, g ) and (£/, P) are orthogonal I'll also require P(JCCX) = i n the respective case. Forms / and g (or P and Q) on V are said to be equivalent if (V, / ) and (V, g) (or (V, 2 ) and (£/, P)) are isometric. / and g (or P and 2 ) are similar if the corresponding spaces are similar. O( V, f) (or O(V, 0 ) denotes the group of isometries of the space, while A(V, / ) (or A( V, Q)) denotes the group of similarities. Evidently O( V, / ) < A( V, / ) . Let X = (JC, : 1 < i < n) be a basis of V. Define / = 7(X, / ) to be the n by n matrix J — (J(j) with Jtj = f(xi,Xj). Observe that / uniquely determines the form / . Suppose Y = (y/: 1 < i < n) is a second basis for V, let y, = JV 0,yJt/, 0;7 € F, and A = (atj). Set Ae = (a?) and let AT be the transpose of A. Observe A9T = AT9 a n d J(y
f)
= A/A
r0
Further
(19.4) A form g on V is similar to / if and only if there exists a basis Y = (yt: 1 < i < n) of V with / ( F , g) = X7(X, / ) for some X e F#. Equivalence holds precisely when X can be chosen to be 1. If Q and P are quadratic forms associated to / and g, respectively, then Q is similar to P precisely when Y can be chosen so that 7(F, g) = XJ(X, f) and P{yt) = A.Q(xt) for each /, with X = 1 in case of equivalence. Proo/. Let a: (V, / ) > (V, g) be a similarity and let y, = JC/« and Y = (y,: 1 < i < n). Then J(Y, g) = X(a)J(X, / ) . Conversely if J(Y, g) = XJ{X, f) let a e GL(V) with jc^a = yt. Then a is a similarity with X(a) — X. Of course the same arguments extend to quadratic forms. (19.5) Aformg on V is similarto / if and only if/(X, g) = XAJ(X, f)ATe for some nonsingular matrix A and some X e F # , with X = 1 in case of equivalence.
Bilinear, sesquilinear, and quadratic forms
79
Proof. This follows from 19.4 and the remark immediately preceding it. One can see from the preceding discussion that equivalence of forms corresponds to equivalence of the associated defining matrices of the forms. Given a e GL(V) define Mx(ot) to be the n by n matrix (atj) defined by
(19.6) Let aeGL(V). Then a e A(V, / ) if and only if (xta, Xja) = (xt,Xj) for all i and j , and some X(a) e F#, with a e O(V, f) precisely when X(a) = 1. If (V, Q) is orthogonal then a e A(V, Q) if and only if a e A(V, / ) and Q(xta) = X(a)Q(x() for each /, with X(a) = 1 for equivalence. (19.7) Let a e GL(V), A = Mx(a), and J = J(X, / ) . Then a e O(V, / ) if and only if J = AJ ATe'. a e A(V, / ) if and only if kJ = AJATe for some X € F#. (19.8) If V is not a symplectic space then V contains a nonsingular vector. Proof Assume otherwise. Let x e V # andv e V —x^.Thenl = ((JC, y)~lx, y), so without loss (JC, y) = 1. Now (ax + by, ax + by) = ab6 + bae as x and y are singular and (JC, y) = 1. If char(F) ^ 2 take a = b = 1 to get ax + &y nonsingular. If char(F) = 2 and V is unitary take a = 1 and b ^ b9. Finally if V is orthogonal and char(F) = 2 then as x and y are singular, Q(x) = Q(y) — 0, so Q(x \y) = (x,y)=l9 and hence x + y is nonsingular. (19.9) Assume V is not symplectic, and if V is orthogonal assume char(F) ^ 2. Then there exists a basis X = (JC; : 1 < / < n) of V such that the members of X are nonsingular and distinct members are orthogonal. Proof By 19.8 there is a nonisotropic vector JCI e V.By 19.3, V = (JCI)©(JCI)X with (JCI)1 nondegenerate. By induction on n there is a corresponding basis (xrA) of 0 satisfies Fix(*i. We say V is definite if V possesses no nontrivial singular vectors. As a consequence of 19.14 and 19.3 we have: (19.15) Let U be a maximal hyperbolic subspace of V. Then V = U 0 f/1 and U1 is definite. Moreover every totally singular subspace of V of dimension m is contained in a hyperbolic subspace of dimension 2m and Witt index m. (19.16) All symplectic spaces are hyperbolic. In particular all symplectic spaces are of even dimension and, up to equivalence, each space of even dimension admits a unique symplectic form. Proof. This is immediate from 19.15, 19.4, and the fact that all vectors in a symplectic space are singular. If char(F) = 2 and (V, Q) is orthogonal then (V, f) is symplectic, where / is the bilinear form determined by Q. Hence by 19.16: (19.17) If V is orthogonal and char(F) = 2, then V is of even dimension.
20 Witt's Lemma This section is devoted to a proof of Witt's Lemma. I feel Witt's Lemma is probably the most important result in the theory of spaces with forms. Here it is: Witt's Lemma. Let V be an orthogonal, symplectic, or unitary space. Let U and W be subspaces of V and suppose a: U > W is an isometry. Then a extends to an isometry of V. Before proving Witt's Lemma let me interject an aside. Define an object X in a category •€ to possess the Witt property if, whenever Y and Z are subobjects
82
Spaces with forms
of X and a: Y > Z is an isomorphism, then a extends to an automorphism of X. Witt's Lemma says that orthogonal spaces, symplectic spaces, and unitary spaces have the Witt property in the category of spaces with forms and isometries. All objects in the category of sets and functions have the Witt property. But in most categories few objects have the Witt property; those that do are very well behaved indeed. If X is an object with the Witt property and G is its group of automorphisms, then the representation of G on X is usually an excellent tool for studying G. Now to the proof of Witt's Lemma. Continue the hypothesis and notation of the previous section. The proof involves a number of steps. Assume the lemma is false and let V be a counterexample with n minimal. (20.1) Let H < U and suppose a  # extends to an isometry f$ of V. Then y = af}~1: U > Wfl~l is an isometry with y\H = 1, and a extends to an isometry of V if and only if y does. (20.2) Assume 0 ^ H < U with H nondegenerate. Then (1) If H1 = (Ha)1 then a extends to an isometry of V. (2) If Ha = H then a extends to an isometry of V. Proof. Notice (1) implies (2). As H is nondegenerate, so is Ha, and V =
HQH1^ = HaQiHa^.Letp.H1
+ (Ha)1 be an isometry. By minimality
l
of n, (cc\unH^)P~ extends to an isometry y of HL. Then y$\ HL * (Ha)L is an isometry extending a\u^Hi. and a\n + yfi is an isometry of V extending a. (20.3) If H is a totally singular subspace of Rad(£/) and K a complement to H in Rad((7), then there exist subspaces Uf and W of V with K = Rad(£/') and U = 1, so, by the previous paragraph, a', and hence also a, extends to an isometry of V. (20.7) V is orthogonal and char(F) = 2. Proof. Assume not. By 20.3, we may take U to be nondegenerate. By 19.8 and 20.4 there is a nonsingular point L in U. By 20.6 applied to L in the role of U, 3. By 19.9, V possesses a nondegenerate subspace U of codimension 2. By induction on n, U possesses a hyperbolic hyperplane K. If n > 3 then, by induction on n, K1 possesses a hyperbolic plane W. Then K 0 W is a hyperbolic hyperplane of V. So n = 3. Choose a basis X = (*,: 1 < i < 3) for V as in 19.9. We may assume V is definite. Thus (JCI, X2) is definite, and hence possesses a vector y such that ). Thus there is a € F with a2Q(y) = — Q(x^). Now ay + JC3 is singular and 19.12 completes the proof. If V is an odd dimensional orthogonal space over a finite field then, by 21.3, V possesses a hyperbolic hyperplane H, and, by 20.8, H is determined up to conjugacy under the isometry group of V. Let x be a generator of HL and define the sign of V (or Q) to be +1 if Q(x) is a quadratic residue in F, and — 1 if Q(x) is not a quadratic residue. Then evidently when n is odd there are orthogonal spaces of sign s = +1 and —1, and, by the uniqueness of H (up to conjugacy), these spaces are not isometric. On the other hand if c is a generator for the multiplicative group F# of F, then cQ is similar to Q under the scalar transformation cl. Moreover (H, Q) is similar to (H, cQ), so (//, cQ) is also hyperbolic. Hence, as (cQ)(x) = cQ(x) has different quadratic character from Q(x), sgn(cQ) # sgn(2). Thus we have shown: (21.4) Let F be a field of odd order, n an odd integer, and c a generator of the multiplicative group F # of F. Then (1) Up to equivalence there are exactly two nondegenerate quadratic forms Q and cQ on an ^dimensional vector space V over F. (2) sgn(£) = +1 and sgn(c are is an isomorphism of /? with Fix(#), where e e F # with e* =  e . (iii) (V, Q) is orthogonal, char(F) = 2, R = Z2, U is nonsingular, and a, = Q(u)\ (3) If (V, / ) is symplectic or unitary then each singular point is the center of a transvection and G is transitive on the root groups of transvections. If (V, Q) is orthogonal each nonsingular point is the center of a unique transvection. (4) Assume either (V, / ) is symplectic and H = G or (V, / ) is unitary and H = SU(V). Then one of the following holds: (i) R < (ii) n = 2 and Fix(0) < 3. (iii) n = 4, (V, / ) is symplectic, and \F\ = 2. Now to the proof of 22.2 and 22.3. First 22.3.1 follows from 22.1 and the definition of a transvection. In particular if G possesses a transvection then V possesses isotropic points, so we may assume U = (u) is an isotropic point of V. By 19.12 there is an isotropic vector x e V — UL with JC, u a hyperbolic pair in the hyperbolic hyperplane W = (w, JC). Let X = {u, x] c Y be a basis for V with F  X a basis for WL. Let f = ta be the transvection in GL(V) with Cy(t) = UL and xt = JC f «M, where a is somefixedmember of F # . Then, by 19.6, t e Gifandonlyif(uir,u 2 0 = (vi,V2)foralli;i,i;2 e X,andif(V, Q) is orthogonal also Q(vt) = Q(v) for all v e X. By construction if suffices to
The classical groups
91
check these equalities when v\ = x = i>2, and, if (V, Q) is orthogonal, for v — x. The check reduces to a verification that: (*) a + ea6 = 0, and if (V, 0 is orthogonal also a =  g ( w ) " 1 ^ 0, where e = — 1 if (V, / ) is symplectic, and e = hi otherwise. If(V, / ) is symplectic then (*) holds for each a e F # ,so Av = {ta:a e F#}. Also the map a H* fa is an isomorphism of /? with the additive group of F. If (V, / ) is unitary then (*) has a solution if and only if there exists e e F# with e9 = —e, in which case a is a solution to (*) precisely when a = be with & G Fix(0). Observe there is c e F with c^c6 and, setting e — c — ce, ee = — e. Finally if (V, Q) is orthogonal then a is a solution to (*) if and only if a = Q(u) ^ 0 and char(F) = 2. Observe in each case ta\ y \^ y + a(y, u)u for each y e X, and hence also for each y e V. So 22.2 and the first two parts of 22.3 are established. The transitivity statement in 22.3.3 follows from Witt's Lemma, so it remains to establish 22.3.4. Assume the hypothesis of 22.3.4. Let L be the group generated by the transvections with centers in W. W1 < Cy(L), so L is faithful on W and hence L < O(W, / ) . Now, by Exercise 7.1 and 13.7, L = SL2(Fix( 2. If (V, / ) is unitary let v be a nonsingular vector in WL and Z = (W, t>), while if (V, / ) is symplectic let Z be a nondegenerate subspace containing W of dimension 4 or 6, for  F  = 3 or 2, respectively. Let K = CniZ1), so that K = Sp(Z) or SU(Z). If # < K(l) then the proof is complete, so without loss V = Z. But now Exercise 7.1 completes the proof. (22.4) Assume either (V, / ) is symplectic and G = O(V, / ) = Sp(V), or (V, / ) is unitary of dimension at least 2, Fix(0) = {aae:a e F}, and G = SL(V) Pi O(V, / ) = SU(V). Then either (1) G is generated by the transvections in O(V, / ) , or (2) (V, / ) is unitary,  F  = 4, and n = 3. Proof. If (V, / ) is symplectic let F = V# and £2 the set of hyperbolic bases of V. If ( V , / ) is unitary let r = {v€ V:(v,v) = 1}. Let r be the group generated by the transvections in O( V, / ) . I'll show: (i) T is transitive on F unless 22.4.2 holds, and (ii) T is transitive on Q if (V, / ) is symplectic.
92
Spaces with forms
Observe that the stabilizer in G of w e £2 is trivial, so (ii) implies T = G. Observe also that by Exercise 7.1 the lemma holds ifn = 2, so we may assume n > 2. Suppose (i) holds. If (V, / ) is unitary and x e V then Gx = SUO 1 ), and, as n > 2, induction on n implies Gx < T unless n = 4 and \F\ = 4 , where Exercise 7.3 says the same thing. Hence, by (i) and 5.20, G = T. So take (V, / ) symplectic and let X = (*,: 1 < * < n) and F = (#•: 1 < i < n) be members of £2. We need to prove Y = Xs for some s e T. By (i) we may take xi = vi. Claim y2 e x2(TXl). As (*i, x2) = Oi, y2) = 1, yi = *2 + v for some i> e (xi)1. If JC2 ^ f"1 then there is a transvection £ with center (v) and X2? = yi, and as i; G (xi) x , t e TXl. If X2 G v1 the same argument shows X2 and J2 arc conjugate to x\ + JC2 in TXl, and hence also to each other. So the claim holds and hence we may take x2 = y2 But now X is conjugate to Y in Sp((;ci, X2)1) fl T by induction on n, so the lemma holds. So it remains to prove (i). Let x, y e V andU = (x, v).If t/is nondegenerate then x e y(T n O(U, / ) ) since (i) holds when n = 2. Thus we may take 0 ^ u e Rad(£/) and it suffices to show there exists a point (z) (such that z is nonsingular if / is unitary) with (JC, z) and (v, z) nondegenerate. If n > 3 just choose Z G M 1 with (JC, Z) nondegenerate. Thus we can assume n = 3, so that (V, f) is unitary. Further we may assume \F\ > 4. Let«, 1; be a hyperbolic basis for y1. We may take x = y \u. Then JCX = (u,y — v) and if z = aw + y — v, then (v, z) fl y 1 = («M — f). It suffices to choose z so that z and au — v are nonsingular. Equivalently, if 7 = rF^x^^ is the trace of F over Fix(#), then T(a) T£ 0 or 1. Hence as  F  > 4 and T: F ^ Fix(^) is surjective, we can choose z as desired. A field F is perfect if char(F) = 0 or char(F) = p > 0 and the ppower map is a surjection from F onto F (i.e. F = F p ). For example finite fields and algebraically closed fields are perfect. (22.5) Let F be a perfect field of characteristic 2 and (V, Q) orthogonal of dimension at least 4. Let (u) be a nonsingular point of V, t the transvection with center (w), and G = O(V, Q). Then (1) G(M) = CG(t) is represented as Sp(M±/(w)) on w±/(w), with (f) the kernel of this representation. (2) Cc(t) is transitive on the nonsingular points in uL distinct from (w). (3) If \F\ > 2 then uL = [uL, CG(t)]. (4) Either G is generated by, and is transitive on, its transvections, or n = 4,  F  =2,andsgn(G) = + l .
The classical groups
93
Proof. Let U = (u) and H = Gu> As t is the unique transvection with center U, H = Co(t) and t is the kernel of the representation n of H on UL/ U = M. Observe that, if / is the bilinear form on V defined by Q, then (M, / ) is a symplectic space, where f(x, y) = f(x, y). Let x e M and W = (JC, u). As F is perfect we can choose u with Q(u) = 1, and W contains a unique singular point (w). For a € F # , let ffl be the transvection with center (aw+u). Then /a7r is a transvection on M with center W and, for v 6 M, J(^TT) = J + a2(y> w)w by 22.3.2. Thus, as F = F2,/?7r = (tan:a e F # ) is the full root group of ta7t in Sp(M) by 22.3.2. So, by 22.4, #TT = Sp(M). Therefore (1) is established. Also [y, ta\ = «(v, w)(aw + M) by 22.3.2, so, if \F\ > 2, then, choosing y £ w1, we have u e [y, /?], so, as M = [M, //7r], (3) holds. To prove (2) observe that Hn is transitive on M by (1), so it suffices to show NH(W) is transitive on the set F of points of W distinct from («) and (w). Let w, v be a hyperbolic pair in M. By (1), for a e F # there is ga e H with wga = aw and uga = a"1!;. Hence (gfl: a € F # ) is transitive on F. It remains to prove (4). Let T be the group generated by the transvections in G. We've seen that H < T, so to prove T = G it suffices by 5.20 to show r is transitive on the set A of nonsingular points of V. This will also show G is transitive on its trans vections. Let Z be a second nonsingular point. We must show Z e UT. This follows from (2) if (Z + JJ)L contains a nonsingular point distinct from U and Z, so assume otherwise. Then U + Z = (U + Z)1 and £/ and Z are the only nonsingular points in U + Z. This forces n = 4 and  F  = 2. Let A = Rad(£/ + Z). If B is a nonsingular point in A1  (U + Z) then f/ + 5 and Z + B are nondegenerate, so U, Z e BT and hence Z eUT. Thus no such point exists, which forces sgn(2) = + 1 . If char(F) ^ 2 and (V, g ) is orthogonal, then a reflection on V is an element r in O(V, Q) such that [V, r] is a point of V. [V, r] is called the center of r. (22.6) Let char(F) ^ 2 and (V, Q) orthogonal. Then (1) If r is a reflection on V then r is an involution, [V, r] is nonsingular, and Cv(r) = [V, r] 1 . (2) If U = (u) is a nonsingular point of V then there exists a unique reflection ru on V with center £/. Indeed xru = JC — (JC, U)U/Q(U) for each ;c e V. Prao/. Let r be a reflection on V. Then [V, r] = (v) is a point. By 22.1, Cy(r) — v1, so u1 is a hyperplane by 19.2. By 22.2, r is not a transvection, so v £ v1 and hence v is nonsingular. Next vr = av for some 1 / a G F # and ) = Q(i;r) = g(tf t>) = a2Q(v), so a = — 1. Hence r is an involution.
94
Spaces with forms
Conversely let U = (u) be a nonsingular point. By (1) there is at most one reflection with center U, while a straightforward calculation shows the map listed in (2) is such a reflection. The proof of the following lemma comes essentially from 1.5.1 on page 19 of Chevalley[Ch2]. (22.7) Let (V, Q) be an orthogonal space. Then either (1) O( V, Q) is generated by its transvections or reflections, or (2)  F  = 2, n = 4, and sgn(g) = + 1 . Proof. If n = 2 or  F  = 2 the result follows from Exercise 7.2 or 22.5.4, respectively. If n = 1, then char(F) ^ 2 and O(V, Q) is generated by the reflection —/. Thus we may take n > 2 and  F  > 2. Let T be the group generated by all transvections or reflections in G = O( V, Q) and suppose h e G — T. Pick /i so that dim(CV(/i)) is maximal in the coset/*7\ Suppose y e V withz = [y, /i] nonsingular. y/i = y+z and 2(v^) = dim((Cy(/i), y)) > dim(Cy(/i)), contrary to the choice of h. Therefore [V, h] is totally singular. I claim next that T is transitive on the maximal totally singular subspaces of V. Assume not and pick two such spaces M and N such that M £ NT and, subject to this constraint, with dim(M n AO maximal. Then M ^ N so M < M + N, and hence by maximality of M there is a nonsingular vector x = m+n e M + N. As JC is nonsingular, (m, n) ^ 0. Also :n h> [n,/i] is a vector space isomorphism of N and M. Hence there is y2 e N with x\ = [j2, A]. By the last remark of the previous paragraph, (x\, y2) = 0. As 0 is an isomorphism, (N  x^)(j) g vf, so there is yi e N  xf with 0(yi) = x2 2, we can choose a with a — 1 ^ 0. Then [h, g] = /z"1^^ = ((l)h)(ah) = (a  \)h e hG, contrary to an earlier remark. The proof is complete. Let (V, Q) be an orthogonal space. We next construct the Clifford algebra C = C(Q) of (V, Q). The treatment here will be abbreviated. For a more complete discussion see chapter 2 in Chevalley [Ch 1]. C is the tensor algebra (cf. Lang [La], chapter 16, section 5) of V, modulo the relations x (8) x — 2 0 ) 1 = 0, for x e V. For our purposes it will suffice to know the following: (22.8) Let (V, Q) be an orthogonal space with ordered basis X. Choose X to be orthogonal if char(F) ^ 2 and choose X to be a hyperbolic basis of the underlying symplectic space (V, / ) if char(F) = 2. Let C = C(Q) be the Clifford algebra of (V, Q). Then C is an Falgebra with the following properties: (1) There is an injective Flinear map p:V > C such that C is generated as an Falgebra by Vp. Write ex for xpifxeX. (2) For S = { x i , . . . , xm] c X with *i < • • • < * « write e 5 = e X l . . . e ^ . Then (^5: S c X) is a basis for C over F. In particular e 0 = 1 = l c and dim F (C) = 2n. (3) For H ^ G V , (up)2 = Q(u) • 1 and upvp 4 vpwp = («, u) • 1. (4) Let C; be the subspace of C spanned by the vectors e$, S c X, 5 = /mod2, / = 0 , 1 . Then {Co, Cx} is a grading of C. That is C = Co 0 Ci and Q C , c C,+y, for i, j e {0, 1}, where i + j is read mod 2.
96
Spaces with forms
(5) If u is a nonsingular vector of V then up is a unit in C with inverse Q(u)~lup, and, for i; e V, (vp)up = —(vru)p, where ru is the reflection or transvection in O(V, 2 ) with center (u). (6) The Clifford group G of C is the subgroup of units in C which permute Vp via conjugation. The representation n of G on V (subject to the identification of V with Vp via p) is a representation of G on (V, Q) with G7T = O(V, Q) if n is even and Gn = SO(V, (?) if rc is odd. If w is a nonsingular vector in V then upit = —rM. (7) ker(7r) is the set of units in Z(C) and Z(C) = F1 or F14 Fe* forrceven or odd, respectively. If n is odd, no unit in C induces — / on C by conjugation. (8) There is an involutory algebra antiisomorphism t of C such that est = eXm . . . eXx for each 5 = {JCI,..., xm] c X. Proof I'll sketch a proof. If char(F) 7^ 2 the multilinear algebra can be avoided as in chapter 5, section 4 of Artin [Ar]. A full treatment can be found in Chevalley [Ch 1]. By definition, C = T/K where T = 0 ^ o Tt(V) is the tensor algebra and K = (x 0 x  Q(u)l:x e V). In particular T0(V) = Fl and there is a natural isomorphism po* V' > TKV). Then p: V > C is the map 1; h> i;p0 + ^ induced by po, and (1) will follow from (2), once that part is established. es = eXl . . . eXm = x\ 0 • • • (8) xm + K, so C, is the image of 0 y . s . 7)(V) in C. Hence (4) follows from (2) and the definition of multiplication in T. The universal property of T implies there is an involutory antiisomorphism to of T with (JCI (g> • • • 0 xm)to = xm 0 • • • 0 x\. As to preserves K it induces t on C. Thus (8) holds. Part (3) is a direct consequence of the definition of C, since x 0 JC — 1 or p is odd. Hence as m(b) = 1 4 s with s = p if p is odd and s = 4 if /? = 2, it follows that m(bpn~2) = 1 + p"" 1 = m(^0) if P is odd, while m(b2n'3) = 2n~l + 1 = m(bo) if p = 2. So the proof is complete.
Extremal pgroups
107
Next the definition of four extremal classes of /7groups. The modular pgroup Modpn of order pn is the split extension of a cyclic group X = (JC) of order pn~l by a subgroup Y = (y) of order p with xy =xp"~2+l. Modp« is defined only when n > 3, where, by 23.3 and 10.3, Modpn is well defined and determined up to isomorphism. Similar comments hold for the other classes. If p = 2 and n > 2 the dihedral group D2n is the split extension of X by Y with xy = x~l and if n > 4 the semidihedral group SD2n is the split extension with JC3' = x2"~2~l. The fourth class is a class of nonsplit extensions. Let G be the split extension of X = (x) of order 2n~l > 4 by Y = (y) of order 4 with x* = JC""1. Notice (x2"~\ y2) = Z(G). Define the quaternion group Q2n of order 2n to be the group G/I V>. The modular, dihedral, semidihedral, and quaternion groups are discussed in Exercises 8.2 and 8.3. Observe Modg = Dg. (23.4) Let G be a nonabelian group of order pn with a cyclic subgroup of index p. Then G = Modp», D2«, SD2«, or Q2n. Proof. Notice that, as G is nonabelian, n > 3 by Exercise 2.4. Let X = (x) be of index /? in G. By Exercise 3.2, X < G. As X is abelian but G is not, X = CG(X) by Exercise 2.4. So y G G — X acts nontrivially on X. As yp eXyy induces an automorphism of X of order p. By 23.3, Aut(X) has a unique subgroup of order p unless p — 2 and n > 4, where Aut(X) has three involutions. In the first case by 23.3, xy = xz for some z of order p in X. In the remaining case p = 2 and xy = x~xz£, where £ = 1 or 0 and z is the involution in X. Now if the extension splits we may choose y of order p and by definition G = Modpn, D2n, or SD2«. So assume the extension does not split. Observe Cx(y) = {xp) if JC37 = xz, while Cx(y) = (z) otherwise. Also yp e Cx(y) As G does not split over X, (y, Cx(y)) does not split over Cx(y), so, as (y, Cx()0) is abelian, it is cyclic. Thus Cx(y) =(yp) Hence we may take yp = xp if xy = JCZ and y 2 = z otherwise. Suppose xy = xz. Then z = [JC, y] centralizes JC and y, so, by 8.6, (yx"1)77 = P y xPzP(pD/2 _ zp{pi)/29 w h i l e ZP(PD/2 _ j u n l e s s p = 2. So, as G does not split, p = 2. Here z = x2""2 and if w > 4 then, setting i = 2n~3  1, (yxz )2 = 1. If n = 3 then x^ = JC"1 , which we handle below. So p = 2, xy = J C  V , and y 2 = z. If £ = 0, then by definition G = Q2n, so take £ = 1. Then, as z G Z(G), (yx)2 = y 2 x J x = zx~lzx = 1, so the extension does indeed split. (23.5) Let G be a nonabelian pgroup containing a cyclic normal subgroup U of order pn with CG(U) = U. Then either
108
p groups
(1) G = D2n+i, Q2n+i, or SD 2 «+i, or
(2) M = CG(l5l(U)) = Mod^+i and Epi = QX(M) char G. Proof. Let G* = G/U. AsU = CG(U\ G* = AutG(U) < Aut(J7). As G is nonabelian, G* ^ 1 and n > 2. If G* is of order /? then the lemma holds by 23.4 and Exercise 8.2, so assume \G*\ > p. Then by 23.3 there exists y* e G* of order p with uy = upn~l+\ where U = («). Let M = ( j , £/). By 23.4, M = Modpn+i and, by Exercise 8.2, E = Q\(M) = Epi. It remains to show E char G. By 23.3, G* is abelian and either G* is cyclic, or p = 2 and there exists g* e G* with u8 = M" 1 . In the first case Q\(G*) = M*, so E = £2i(M) = £2i(G) char G. In the second &(U) = (u2) = ([u, g]) and as G* is abelian, G(1) < U. Hence G 0 ^ ^ 1 ^ ) or U, and in either case &(U) char G(1), so U^C/) char G. Therefore £ = Qi(CG(£ll(U))) char G. A critical subgroup of G is a characteristic subgroup H of G such that 0>(#) < Z ( # ) > [G, H] and CG(H) = Z(H). Observe that in particular a critical subgroup is of class at most 2. (23.6) Each pgroup possesses a critical subgroup. Proof. Let 5 be the set of characteristic subgroups H of G with (H) [G, / / ] . Let / / be a maximal member of 5; I claim H is a critical subgroup of G. Assume not and let K = CG(H), Z = Z(H), and define X by X/Z = fii(Z(G/Z)) Pi £ / Z . Then # £ H and Z = # n K, so, as # < G, X ^ Z by 5.15. But notice Xi/ € S, contradicting the maximality of H. A /7group G is special if (G) = Z(G) = G(1). A special /?group is said to be extraspecial if its center is cyclic. (23.7) The center of a special /7group is elementary abelian. Proof. Let G be special and g,heG. Then gp e 3>(G) = Z{G\ so, by 8.6.1, 1 = [gp, h] = [g, /iF. Hence G(1) is elementary, so, as Z(G) = G(1), the lemma holds. (23.8) Let E be an extraspecial subgroup of G with [G, E] < Z(E). Then
Proof. Let Z = {z)= Z(E). As £/Z < Aut G (£) < C = CAut(E)(E/Z), it suffices to show E/Z=C. Let a e C and (JQZ: 1 < i < n ) a basis for E/Z. Then
Extremal pgroups
109
[xt,a]=zmi for some 0 < m ? < p, and, as £ = (x/: 1 p2 and assume R satisfies 23.5.2. Let M = CR(l5l(U)). Then A^ = CG(t31(f/)) char G and AT = £M. By Exercise 8.2, £22(A0 = EQ2(M) = Zp x (E * Z p2 ) so Z(£22(AO) is noncyclic, a contradiction. (23.10) Let E be an extraspecial pgroup, Z = Z(£), and £ = E/Z. (1) Regard Z as the field of integers modulo p and E as a vector space over Z. Define f.ExE^Zby f(x, y) = [x, y]. Then / is a symplectic form on E, so (£, / ) is a symplectic space over Z. (2) ra(£) = In is even. (3) If p = 2 define Q: E > Z by 2(Jc) = x2. Then 2 is a quadratic form on E associated to / , so (£, Q) is an orthogonal space over Z.
110
pgroups
(4) Let Z ^ A < G. Show V = Q^H) = £ p 3 , m(AnH) = 2, and A is the unique Ep*subgroup of AV. Let K = NG(A) and geNG(K)K. Show AA* is of class at most 2 and AA* < AV.) Let G be a pgroup and (G/: 1 < / < n) a family of subgroups of G which generates G. Then, for any family (#,: 1 < / < n) of elements of G, G is generated by ((G/)*1': 1 < 1 < n).
Change of field of a linear representation Let n: G » GL(V, F) be an FGrepresentation, E a subfield of F, and K an extension field of F. Then V is also a vector space over £ with GL(V, F) < GL(V, E), so 7r also defines an FGrepresentation. Further, by a tensoring process discussed in section 25, n induces a ^Grepresentation nK ona Kspace V*. This chapter investigates the relationship among these representations. It will often be very useful to extend F to K by passing from n to ixK. For example several results at the end of chapter 9 are established in this way. n is said to be absolutely irreducible if nK is irreducible for each extension K of F, and F is said to be a splitting field for G if every irreducible FGrepresentation is absolutely irreducible. It develops in section 25 that n is absolutely irreducible precisely when F = End/rG( V) and in section 27 that if G isfinitethen a splittingfieldis obtained by adjoining a suitable root of unity to F. It's particularly nice to work over a splitting field. For example in section 27 it is shown that, over a splittingfield,the irreducible representations of the direct product of groups are just the tensor products of irreducible representations of the factors. Section 26 investigates representations over finite fields, where change of field goes very smoothly. Lemma 26.6 summarizes many of the relationships involved. Section 27 introduces the minimal polynomial of a linear transformation. Semisimple and unipotent elements are discussed and it is shown that if F is perfect then each member g of GL( V) admits a Jordan decomposition; that is g can be written uniquely as the commuting product of a semisimple element and a unipotent element.
25 Tensor products In this section G is a group, F is a field, and V a finite dimensional vector space over F. Let (V/: 0 < / < m) be vector spaces over F, and denote by L(V\,..., Vm; Vb) the set of all maps a: V\ x • • • x Vm > Vb such that for each /, 1 < i < m, and each choice of Vj e V), j ^ /, the map 0:Vt > Vb defined by vt0 = (v\,..., vm)a is an Flinear transformation. Such maps are called
118
Change of field of a linear representation
mlinear. L ( V i , . . . , Vm; Vb) is a vector space under F via
v{a + ft) = va + vp v(aa) = a(va)
a e F, v e V\ x • • • x Vm,
a, /3 e L(VU . . . , Vm; Vo).
A tensor product of V\,..., Vm is an FspaceT together with n e L(V\,..., Vm\ T) with the following universal property: whenever U is an Fspace and a e L(VU . . . , Vm\ U), there exists a unique fi e Hom F (7\ U) with nfi = a. (25.1) Tensor products exist and are unique up to isomorphism. Proof. See for example page 408 in Lang [La]. Because of 25.1 there is a unique tensor product of V\,..., Vm which is denoted by Vi ® • • • ® Vw or 0 ^ V/. Write v\ ® • • • ® vm for the image of (v\,..., vm) under the map (denoted by n above) associated to the tensor product. The elements v \ ® • • • GL( V) be an irreducible FGrepresentation such that K = EndFG(V) is a field, and let ft be the representation of G on V regarded as a ^TGmodule, and x the character of p. Then (1) K = F[x], where F[x] is the Fsubalgebra of K generated by the elements /(g), g e G. (2) Assume L is a normal extension of K and a e GSL\(K/F)#. Then is not LGisomorphic to L ag e F. By 12.16, the map J2ag(Sa) •* Jl^g^x(gP) is an isomorphism of M with the ring Kmxm of all m by m matrices over £ . Hence for each x e K there is A e M with Tr(A) = x, and A = J2geG agMx(gfi) for some ag G F. Now x = YlgeG agX(g) € F[x]. So (1) is established. Assume the hypothesis of (2) and let E be the fixed field of a. As a ± 1, E ^ K.As K = End^G(^) we may assume E = F. Let / be an extension of a to L and [/ = L ®K V. Then L ^ F = £/y and the character ofGonU is still the character x of j8. Thus if £/ is LGisomorphic to r/K then x = Xy» so X(g) is contained in thefixedfieldfcof y. But ^ n K — F, so, by (1), K = F , a contradiction. (25.10) Let V be an irreducible FGmodule, k a Galois extension of F, and K = End FG (V). Then (1) VK = 0 a € A Wa for some irreducible A:Gmodule W and some A c Gal(A:/F) = T with T = AA^r(W), where Nr(W) = {y e T : Wy = W}. (2) Let U be an irreducible AGmodule. Then V is an FGsubmodule of U (regarded as an FGmodule) precisely when U is &Gisomorphic to Wa for some a G P. (3) If k < K then A = T and Wa is ^Gisomorphic to V for some a G T. (4) If K is a Galois extension of F then A is a set of coset representatives
Proof. Let V = Gal(fc/F). By 25.7, T x G is represented on VK. Let W be an irreducible A:Gsubmodule of Vk and M = {Wy: y e T). If M ^ V* then, by 25.7.2, M = Uh, for some FGsubmodule f/ of V. As 0 ^ M # V*, 0 ^ U # V contradicting the irreducibility of V. Hence Vfc = M and then (1) follows from 12.5. Also Vk is generated as an Fmodule by the copies (aV:a e fc#) of V, so Vk is a homogeneous FGmodule and hence each summand Wa is the sum of copies of V, as an FGmodule. This gives half of (2).
Representations over
finite
fields
123
Assume U is an irreduciblefcGmoduleand V an FGsubmodule of U. Let X be an Fbasis of V. As U is irreducible and V an FGsubmodule of U, X generates U as a fcGmodule. Also 1 ® X is a basis for V* over &, so we can define:
a:Vk+U
Then a is a surjective fcGhomomorphism, so Vk/ker(a) = £/ as a &Gmodule. Hence (1) and 12.5 imply U = W° for some a e A . S o (2) holds. In (3) we may regard V as an irreducible fcGmodule, so, by (2), V = Wa for some a e A. Then, by (1), \A\ = dim F (V)/dim fc (V) = \k:F\ = \T\ so A = T and (3) is established. To prove (4) let L be the extension generated by k and K and assume K is Galois over F. Then L is Galois over K, and, by (3), 25.5, and 25.3.3:
VL = L ®K VK =
©
L®KUa
GL(V) be an FGrepresentation and K a subfield of F. We say IT can be written over K if there exists an Fbasis X of V such that each entry of is in K for each g e G. (26.3) Let n: G > GL(V) be an irreducible FGrepresentation, K a subfield of F, and (a) = Gdl(F/K). Then the following are equivalent: (1) TC can be written over K. (2) V = F®KU for some irreducible £Gsubmodule (3) V is FGisomorphic to V°'.
UofV.
Proof The equivalence of (1) and (2) is trivial as is the implication (1) implies (3). Assume (3) and let U be an irreducible A^Gsubmodule of V. Then r = Gal(F/10 = N r (V) as T = (a) and V = V°. Hence, by 26.2, UF = V. That is (3) implies (2). (26.4) Let V be an irreducible FGmodule, K a subfield of F, U an irreducible /^Gsubmodule of V, and E = NF(U). Then V = F 0 £ U. Proof Let UF = F®EU and T = Gal(F/F). By 26.2, UF = ® a G A V\ where A is a set of coset representatives for A = A^r(^) in P. Let L be the fixed field of A and W an irreducible LGsubmodule of V; as V is
Representations over
finite
fields
125
a homogeneous FGmodule we may assume U < W. If L ^ F then, by induction on \F: E\, L ®E U = W, while, by 26.3, V = F 0 L W, So V = F £ U. Thus we may take L = F. But then A = 1 so dimE(U)
= dimF(UF)
so U = V. Hence F =
A^F(^)
= \F:E\ dim F (V) = dim £ (V),
= F , and the lemma holds.
(26.5) Let V be an irreducible FGmodule. Then the following are equivalent: (1) V can be written over no proper subfield of F. (2) V is an irreducible A'Gmodule for each subfield K of F. (3) Proof. This follows from 26.3 and 26.4. An FGmodule V is condensed if V is absolutely irreducible and can be written over no proper subfield of F. Theorem 26.6. Let p be a prime, Fp the field of order /?, F^ its algebraic closure, A the set of finite subfields of Fp, and ft the set of pairs (F, V) where F G A and V is an (isomorphism type of an) irreducible finite dimensional FGmodule. Define a relation / on Q by (F, VM^T, (7) if F < # and V is an FGsubmodule of U. Let ~ be the equivalence relation on ft generated by /. Then (1) (F, V)/(K, U) if and only if F < £ and U is a summand of K ®F V. (2) Let A be an equivalence class of ~ . Then, for each F e A, AF = {(F, V)e A] is nonempty and Aut(F) is transitive on AF. In particular \AFp\ = 1 and the map A i> AFp is a bijection between the set of equivalence classes of ~ and the isomorphism classes of irreducible finite dimensional FPG modules. (3) If (F, V), (K, U)eft with F < K then (F, V)  ( £ , £/) if and only if (F, V * ) / ^ , U), for some a € Aut(F). (4) In each equivalence class A of ~ there exists a unique F e A such that the members of AF are condensed. Indeed for (Fp, V) e A, F = End/rpG(V) and (F, V) 6 A with V a condensed FGmodule. Proof. Part (1) follows from 26.2. Let (F, V) e ft. If F < F then there is an irreducible FGmodule VF of V, and we saw during the proof of 25.10 that V is a homogeneous FGmodule, so V^ is determined up to isomorphism. Write VpforVv Let (K, U) e ft. Claim (F, V)  (K, U) if and only if VP = UP. The sufficiency of Vp = Up is immediate from the definition of ~ ; to prove necessity
126
Change of field of a linear representation
it suffices to take (F, V)/(K, U) and to show Vp = Up. But this follows from the last paragraph. Let A be an equivalence class of ~ and (Fp, V) e A. By 26.2, for each F e A, VF = 0 a e A Wa, for some set A of coset representatives for NAut(F)(W) in Aut(F). By (1) and the claim, A F = {(F, Wa):a e Aut(F)}. That is (2) holds. To prove (3) observe that if (K, U) e Q and F < K then (F, UF)/(K, U). Then, by (2), (F, W) ~ (K, U) if and only if W° = UF for some a e Aut(F). So (3) holds. Let F = En&FpG{V). Then (F, V) e A and, by 25.8, V is an absolutely irreducible FGmodule. By 25.10.3, 25.10.4, and 26.5, V can be written over no proper subfield of F, so V is condensed. Finally suppose (K, U) is another condensed member of A. To complete the proof of (4) we must show K = F. Let k be the subfield of Fp generated by K and F. Use 26.5 and the fact that V is condensed as an FGmodule to conclude V ¥ V° for a e Aut(F) # ; then by 26.2,
0 oreAut(F)
Then by 25.3 and 25.5,
k ®GF(p) V=k
®GFO»
(F ®GF(P) V)=k®F(
0
Vy)
0 yeAut(F)
As V is absolutely irreducible as an FGmodule, k 0/r Vy is irreducible for each y. Hence k Fp V has exactly \F : Fp\ irreducible summands. But, by symmetry between K and F, k®Fp V also has  £ : Fp\ irreducible summands, so K = F. Theorem 26.6 defines an equivalence relation on the finite dimensional representations of G over finite fields of characteristic p. This equivalence relation has the property that each class contains a representative over each finite field of characteristic p. Hence we can think of such a representation as written over any finite field of characteristic p. However the lemma suggests that to each class there is associated a field F over which the representation is best written: namely the unique field over which the representation is condensed. I will refer to F as the field of definition of the representation. F can also be described as the smallest field over which the representation is absolutely
Minimal polynomials
127
irreducible. Equivalently F = EndfpG(V), where V is the unique F^Gmodule in the class.
27 Minimal polynomials In section 27 F is a field, V is a finite dimensional vector space over F, and G is a group. Suppose for the moment that A is a finite dimensional algebra over F and F[x] is a polynomial ring. For a e A and /(JC) = YlT=o^ixi e ^M> define f(a) = J2T=obiai e A. Then the map afl: F[x] > A such that aa: f h> / ( a ) , is an Falgebra homomorphism. The assumption that A is finite dimensional forces ker(a a ) ^ 0 since F[x] is of infinite dimension. As F[x] is a principal ideal domain (PID)9 ker(a a ) is a principal ideal, and indeed there is a unique monic polynomial fa(x) with ker(a a ) = (fa). By definition / a is the minimal polynomial of a. By construction fa divides each polynomial which annihilates a. Further fa is monic of degree at most dimF(A), since dim F (A) > dim F (F[jc]/(/ fl » = deg(/fl). Applying these observations to the «2dimensional Falgebra Endf(V), it follows that each g € Endjr(V) has a minimal polynomial min(g) = min(g, F, V). Observe that if n: A > B is an Falgebra isomorphism then a and an have the same minimal polynomial. In particular if X is a basis for V then Af*: End/r(V) > F n x n is such an isomorphism, so min(g) = min(Mx(g)). If K is an extension of F, then Mi®x(l (g)g) = Mx(g), so the minimal polynomial of 1 (8) g over £ divides the minimal polynomial of g over F. Indeed an easy application of rational canonical form shows the two minimal polynomials are equal. (Reduce to the case where V is a cyclic FGmodule. Then there is a basis X = (*;: 1 < / < n) for V in which xig = xi+\ for / < n and xng = — X^=o ^i+i*/' where /(JC) = jcn h J21=o aixi *s m e minimal polynomial for g over F. Then / ( I (8) g) = 0 and if h(x) e K[x] properly divides / then h{\ ® g) ^ 0 as is linearly independent and 1 (8) Jt;+i = (1 (8) ^ I ) ^ 1 . ) Thus we have shown: (27.1) The minimal polynomial of a linear transformation is unchanged by extension of the base field. That is, if K is an extension of F and g e End/r( V), then min(g, F, V) — min(l (8) g, # , VK). Let g € End/r( V) and a e F. We say a is a characteristic value for g if there exists i; e V# with vg = av. We call v a characteristic vector for a. (27.2) Let g € EndF(V) and a e F. Then a is a characteristic value for g if and only if a is a root of the minimal polynomial of g.
128
Change of field of a linear representation
Proof. Let f(x) = min(g). If a is not a root of / then (/, x — a) = 1 so there exist r,se F[x] with fr + (x — a)s = 1. Now if v e V# with vg = av
then v = vl = v(f(g)r(g) + (g  al)s(g)) = 0, since /(g) = 0 = v(g al). This contradiction shows characteristic values of g are roots of / . Conversely if a is a root of / , then / = (JC — a)h, for some h e F[x], If a is not a characteristic value of g then ker(g — a I) = 0 so (g —al)~l exists. Hence, as 0 = f{g) = (g — al)h(g), we also have h(g) = 0. But then / divides h, a contradiction. g e End/r(V) is semisimple if the minimal polynomial of g has no repeated roots. (27.3) Letg e End^V) and assume min(g) splits over F. Then g is semisimple if and only if g is diagonalizable. Proof This is Exercise 9.2. (27.4) Let S be a finite subset of commuting elements of End/r( V), and assume the minimal polynomial of each number of S splits over F. Then there exists a basis X of V such that for each s e S the following hold: (1) Mx (s) is lower triangular. (2) The entries on the main diagonal of Mx(s) are the eigenvalues of min(^). (3) If s is semisimple then Mx(s) is diagonal. Proof Induct on n + \S\. If n — 1 the result is trivial, so take n > 1. If some g e S is a scalar transformation then by induction on 5, the result holds for S ~ {#}> a n d then also for S. So no member of S is a scalar transformation. Let g e S. By 27.2, g possesses a characteristic value a\. Let Vi be the eigenspace of a\ for g. Then 5 c C(g) < N(V\). As g is not a scalar, Vi ^ V, so, by induction on n there is a basis X\ for Vi with Mx^Slv^ as claimed in the lemma. In particular there is a 1dimensional subspace U of V\ fixed by 5. If g is semisimple, then, by 27.3, V = O ^ V;, where V, is the eigenspace of the characteristic value a, of g. Now, choosing a basis X, for V, as in the last paragraph, we see that X = J£Li ^/ is a basis with the desired properties. So we can assume no member of S is semisimple. Thus (3) is established. Finally S acts on V/U = V and, by induction on n, there is a basis X for V with Afx(Sv) triangular. Now pick X = (xt'A 0. Then gp" = 1 if g is unipotent. Conversely if pm g = 1forsome positive integer m, then g is unipotent. (6) If char(F) = 0 and g e GL( V) is of finite order then g is semisimple. (7) Ifchar(F) = p > Oandg e GL( V) is of finite order m then g is semisimple if and only if (m, p) = 1. Proof. All parts of the lemma are reasonably straightforward, but I'll make a couple of remarks anyway. If g e GL(V) is of finite order m the minimal polynomial of g divides xm — 1, which has no multiple roots if (m, char(F)) = 1. Hence (6) and half of (7) hold. Parts (4) and (5) imply the remaining half of (7), since any power of a semisimple element is semisimple. Recall a field F is perfect if char(F) = 0 or char(F) = p > 0 and F = Fp, where Fp is the image of F under the ppower map a i> ap. For example finitefieldsare perfect as are algebraically closed fields. We need the following elementary fact, which appears for example as the Corollary on page 190 of Lang [La]. (27.6) If F is perfect then every polynomial in F[JC] is separable. (27.7) If F is perfect and a e End F ( V), then there exists / e F[x] and a positive integer e with (/, / ' ) = 1 (where / ' is the derivative of / ) and fe(a) = 0. If ft G End F ( V) with f(p) = 0 then p is semisimple. Proof. Let min(a) = n ^ i / T
with
ft irreducible. Let m
e = maxfe/i I JC"1 is a permutation of X of order 2. Define two words « and w to be adjacent if there exist words a, b e M and JC € X such that w = axx~lb and w = ab, or vice versa. Thus adjacency is a reflexive and symmetric relation. Define an equivalence relation ~ on M by u ~ w if there exists a sequence « = u\,..., wrt = w of words such that w, and «j+i are adjacent for each /, 1 < / < n. That is ~ is the transitive extension of the adjacency relation. Write w for the equivalence class of a word w under ~ and let F be the set of equivalence classes. (28.2) If w, v, w e M with u ~ v then uw ~ t>w and ww ~ w u . Proo/. There is a sequence « = MI, . . . , un = v of words with w, adjacent to W/+1. Observe M/W = w? is adjacent to w, + i and MW = w\,..., wn = vw, so MW ~ VW.
Now define a product on F by MD = TTu. By 28.2 this product is well defined. Further the product of the equivalence classes of the elements JC"1 , . . . , xf 1 is an inverse for x\... Jcn, so F is a group. Hence (28.3) F is a group and w H> w is a surjective monoid homomorphism of M onto F. (28.4) F is a free group with free generating set Y. Proof. Observe first that Y generates F. This follows from 28.3 together with the fact that X generates M and X = Y U Y~l. Now let H be a group and a: ? > i/ a function. Define ^: X > Hbyyfi = ya and y"1/J = (ya)" 1 for y G 7. As M is a free monoid on X, /? extends to a morphism y:M ^ H. Define 8: F > / / by w5 = wy. I must show 5 is well defined; that is if u ~ i; then uy = vy.lt suffices to assume M is adjacent to v, say w =ajcjc~~1Z?andi> = aZ?.ThenMy =(axx~lb)y =ayxf}(xj3)~lby =ayby,
140
Presentations of groups
as desired. Evidently 8 is a homomorphism extending a. As Y generates F, an earlier remark shows 8 is the unique extension of a. Lemma 24.8 shows that for each set S there exists a free group with free generating set S. The universal property implies: (28.5) Up to isomorphism there exists a unique free group with free generating set of cardinality C for each cardinal C. If W c M is a set of words in X, write Grp(y : W) for the group F/N, where AT = (WF) is the normal subgroup of F generated by the subset W of F. Grp(y : W) is the group generated by Y subject to the relations w = 1 for w e W. That is Grp(F : W) is the largest group generated by the set Y in which w = 1 for each w € W. To be more precise Grp(Y : W) = F/Af = G with 7 and W identified with
(yN:yeY)
and (wN'.weW),
respectively. As Y generates F, Y generates G. As w £ N,w = 1 in G for each w e W. So G is generated by Y and each of the words in W is trivial. I'll also say the relation w = 1 is satisfied in G to indicate that w = 1 in G. G is the largest group with these properties in the following sense: (28.6) Let a: Y » Ya be a function of Y onto a set Ya, H a group generated by Ya, and W a set of words w = yf1 . . . y8nn in Y U F" 1 with wa = (jia) 51 . . . (yna)8n = UnH for each w e W. (That is / / is generated by Ya and satisfies the relations w = 1 for w e W.) Then a extends uniquely to a surjective homomorphism of Grp(Y : W) onto # . Proof Let F be the free group on Y. Then there exists a unique homomorphism p:F > H of F onto # extending a. Let N = (WF) and 8: v H> UN the natural map of F onto G = F/Af. Then Af = ker( / / with £ = 2 so i> = x\X2U for some word u of length n — 2. Now w = x\X2{x\X2)~l 6 W c iV, so w~lv = (JCIJC2)M € ker(a) — N. As (XIJC2)M is of length at most n — 1, the choice of u of minimal length is contradicted. Here's a slightly more nontrivial example. The dihedral group of order In is defined to be the semidirect product of a cyclic group X = (x) of order n by a group F = (y) of order 2, with respect to the automorphism xy = JC"1. The case where n = oo and x is the infinite cyclic group is also allowed. Denote the dihedral group of order 2n by D2n • Dihedral 2groups have already been discussed in the chapter on /^groups. (28.8) D2n = Grp(jc, y : xn = y2 = 1 = JC^JC).
If n = oo the relation xn = 1 is to be ignored. The proof of 28.8 is easy. Let D = XY = D2n and G = Grp(Jc, y : xn = f
= 1 = xyx).
By 28.6 there is a homomorphism a of G onto D with Jca = x and }>« = );. Then w = JC divides jc, so, as xn = l,\x\ = n and a:X —> X is an isomorphism, where X = (x). Similarly, setting Y = (y),a:Y > 7 is an isomorphism. 1 = JcJc^ so xy = (Jc)" 1 . Thus X < G = (Jc, y), so G = X f . Hence, as a restricted to X and Y is an isomorphism, a itself is an isomorphism.
29 Coxeter groups Define a Coxeter matrix of size n to be an n by n symmetric matrix with Is on the main diagonal and integers of size at least 2 off the main diagonal. To each Coxeter matrix M = (m/7) of rank n there is associated a Coxeter diagram: this diagram consists of n nodes, indexed by integers 1 < i < n, together with an edge of weight m/7 — 2 joining distinct nodes / and j , I < i < j < n. We
142
Presentations of groups
will be most concerned with Coxeter matrices with the following diagrams: 1 2
1
2
n\
n
n2
n\
n
n\
Thus a diagram of type An defines a Coxeter matrix of size n with m/7 = 3 if \i — j  = 1 and mjy = 2 if \i — j \ > 1. Similarly a diagram of type Cn defines a matrix with m/y = 3 if \i — j \ = 1 and /, j < n, mn\,n = mn?n_i = 4, and m/7 = 2 if \i — j \ > 1. A Coxeter system with Coxeter matrix M = (m,7) of size n is a pair (G, S) where G is a group, S = (^•: 1 < / < n) a family of elements of G, and G = Grp(S: 0;S/)m'7 = 1, 1 < i < n, 1 < j < n). G is a Coxeter group if there exists a family 5 such that (G, S) is a Coxeter system. In the remainder of this section let (G, S) be a Coxeter system with matrix M = (m,;) of size n. Let 5 = (•?,•: 1 < / < n). Notice
(29.1) Let T be the set of conjugates of members of S under G and for each word r = r\... rm in the alphabet 5 and each ^ G T define N(r, t) = {i: f = r^"1*"'ri), 1 < i < m} Then, if n . . . rm = r[ • • • r'k in G, we have N(r, 01 = I^V(r', 01 m od 2 for each t e T. Proof. Let A be the set product (±1) x T and for s e S define sn e Sym(A) by (e, t)sn = (e8(s, t), ts\ where 8(s, t) =  1 if s = r and 3. (29.10) Let (A*: 1 < k < r) be the connected components of the graph of the Coxeter diagram A of (G, S) and let Gk = {st: i e Ak). Then (1) G = G\ x • • • x Gr is the direct product of the subgroups G*, 1 < k < r. (2) V is the orthogonal direct sum of the subspaces V* = [G^a, V], 1 < k 2. But, for such j , (st, Sj) is irreducible on (*,,*/) by 29.7, so as JC/ e U and U is Ginvariant, Xj e U. I've shown G is irreducible on V = V/VL.F = EndiRGC^) acts on [V, 51/] = # (JC/>, so, for a e F , ajct = bx\ for some ^? e IR , and hence, as G is irreducible on V and centralizes a, a acts as a scalar transformation via bonV. That is F = R. So, by 25.8, G is absolutely irreducible on V. Suppose W is finite. Then, by Maschke's Theorem, V = V1 0 Z for some (RGsubmodule Z of V. V is RGisomorphic to Z and [V, 5,] ^ 1, so [Z, arf] ^ 1. Hence (JC/) = [Z, $,] < Z, so V = (xt: 1 < i < n) < Z. Thus V1 = 0 and (2) holds. (29.12) Assume (G, S) is an irreducible Coxeter system and W is finite. Then (V, Q) is isometric to ndimensional Euclidean space under the usual inner product. Proof. Let h be the bilinear form on V which makes X into an orthonormal basis and define g: V x V > R by #(M, U) = Xlwew MMW> vw). It is straightforward to check that g is a symmetric bilinear form on V preserved by G. As the quadratic form of h is positive definite, so is the form P of g, so (V, g) is nondegenerate. But, by 29.11, V is an absolutely irreducible RGmodule, so, by Exercise 9.1, P = aQ for some a e R#. As P is positive definite and Q(xt) = 1/2 > 0, a > 0, so Q is positive definite. By 19.9 there is a basis Y = (y,: 1 < / < n) for V with (y/, y7) = 0 for i ^ j . As Q is positive definite, Q(yt) > 0 so, adjusting by a suitable scalar, we can take Q(yi) = 1, since every positive member of R is a square in R. Thus Y is an orthonormal basis for (V, Q), so (V, Q) is Euclidean space under the usual inner product. Let A = { 1 , . . . , n] and for J c A let S/ = {Sj: j e J} and Gj = {Sj). The subgroups Gj and their conjugates under G are the parabolic subgroups of the Coxeter system (G, S).
148
Presentations of groups
(29.13) Let / , ^ C A a n d g € G 7 . Then (1) If l(g) = m and g = stl . . . sim with sik e S then ik e J for each 1 < k < m. (2) (Gy, Sj) is a Coxeter system with Coxeter matrix My = (m, ; ), /, j e J. (3) (Gj, GK) = GJUK and G 7 n ( i = GmK. (4) IfGy = G Proof. Let g = s ai . . . s^ with ak e J andfcminimal subject to this constraint. Claim k = m. By induction on k, l(saig) = k — 1, so by the Exchange Condition either k = l(g) or sai . . . s a / 1 = s a 2 . . . sat for some £, in which case g = sa2... Sa^Sa^s^, contrary to minimality of k. Hence (1) follows from 29.5. Next (1) says the Exchange Condition is satisfied by (Gy, Sy), so (Gy, Sj) is a Coxeter system by 29.4. 29.9 says Mj is the Coxeter matrix of (Gy, Sj). The first remark in (3) and the inclusion Gyn*: < Gj HGK are trivial. Part (1) gives the inclusion Gj DGK < GJnKIf Gy = GK then Gj = GynA: by (3), so we may assume K c J. By (2) we may assume / = A. Hence G = Gy = GK, SO, by (1), S = SK> Hence ^ = A = 7 b y 29.9.1.
30 Root systems In this section V is afinitedimensional Euclidean space over a field F equal to the reals or the rationals. That is V is an «dimensional space over F together with a quadratic form Q such that (V, Q) possesses an orthonormal basis. Hence Q is positive definite. Let (, ) be the bilinear form defined by Q. For v e V# there exists a unique reflection with center (v) by 22.6.2; denote this reflection by rv. A root system is afinitesubset £ of V# invariant under W(E) = (rv: i; e E) and such that  {v) H E  < 2 for each D G E . Observe that if v e £ then — v = vrv e £ , so, as \(v) D E  < 2, (u) n £ = {u,  u } . We call W(E) the Wey/ group of £ . Here's one way to obtain root systems: (30.1) Let G be a finite subgroup of O(V, Q) generated by a Ginvariant set R of reflections. Let £ consist of those v e V# with Q(v) = 1/2 and (v) the center of some member of R. Then £ is a root system and G = W(£). /V00/. For u G £ , (f) is the center of some r e R,sor = rv. Thus G = (R) = W(£), so it remains to show £ is a root system. lfu=avey£ then, by definition of £ , 1/2 = Q(u) = a2Q(v) = a2/!, soa = ± 1 . Thus  £ n (v)\ < 2.
Root systems
149
Also if g e G then, as R is Ginvariant, r8 e R and (vg) is the center of r8 with Q(vg) = Q(v) = 1/2, so vg e £ . Hence G = W(£) acts on E. Finally  £  =2\R\ < 2\G\ < oo. S o E is a root system. By 29.12 and 30.1, every finite Coxeter group can be represented as the Weyl group of some root system. We'll see later in this section that on the one hand this representation is faithful and on the other that the Weyl group of each root system is a finite Coxeter group. Thus the finite Coxeter groups are precisely the Weyl groups of root systems. For the remainder of this section let £ be a root system and W = W(£) its Weyl group. The elements of £ will be called roots. (30.2) (1) (£) is a nondegenerate subspace of V and W centralizes E x , so W is faithful on (£). (2) The permutation representation of W on E is faithful. (3) W is finite. Proof. Let U = (£). Then H = CW(U) = CV(£) and W/H is faithful on £ , so W/H is finite. Thus to prove (2) and (3) it suffices to show H = 1. As Q is positive definite, U is nondegenerate. Thus V = U ®UL. But, for v elu,rv centralizes vL 2 UL, so W = (rv: v e E) centralizes UL. Hence H centralizes V, so H = 1, completing the proof of the lemma. An ordering of V is a total ordering of V preserved by addition and multiplication by positive scalars; that is if w, v, w e V with u > v, and 0 < a e F, then u + w > v\w and au > av. I leave the following lemma as an exercise. (30.3) (1) If < is an ordering on V and V+ = {v e V: v > 0} then (1) V+ is closed under addition and multiplication by positive scalars, and (ii) for each v e V # , \{v, v] n V +  = 1. (2) If S c V# satisfies (i) and (ii) of (1) then there exists a unique ordering of V with S = V+. (3) If T g V# satisfies (l.i) and \{v, v} n T\ < 1 for each v e V # , then J C V + for some ordering of V. A subset P of £ is & positive system if P = E + = £ 0 V+ for some ordering of V. A subset n of £ is a simple system if 7r is linearly independent and each v G £ can be written v = Ylxen a*x s u c n t n a t e i t n e r 0 — ax £ ^ for all JC en or 0 > ax e F for all x en.
150
Presentations of groups
(30.4) Each simple system is contained in a unique positive system and each positive system contains a unique simple system. Proof. If ix is a simple system let T consist of those elements Ylxen a*x e ^ # with ax > 0. By 30.3.3, T c y+ for some ordering of V. By definition of simple systems and 30.3.1, P = T Pi E is the unique positive system containing Tt. Let S be the set of those v e P such that, if v = YlyeY cyy f° r s o m e Y c. P and 0 < cy e F, then Y = {v}. Evidently S c n. I'll show TX c S which will prove TT = S is the unique simple system in P. So assume v e TT and i; = X^er cyy for some F c p and 0 < cy 6 F. Now, for y e Y, y = Y2xejT byxx for some 0 < byx e F, so v = ^2y x cybyxx and hence, by the linear independence of 7r, 0 = J2y cybyx for x e it — {v}. Therefore byx — 0 for x ^ v, so y = byvv for each y e Y. Then, as P fl (u) = {u}, F = {v}9 completing the proof of the claim. It remains to show that if P is a positive system then P contains a simple system. In the process I'll show: (30.5) If n is a simple system and x and y are distinct members of n, then (x,y) N(w). Suppose that the lemma is false and pick u = ror\.. .rn e W with l(u) = n + 1 > N(u), and subject to this constraint with n minimal. Let w = r\... rn. As l(u) — n + 1, /(w) = n, and, by minimality of l(u), N(w) = l(w). As N(row) = N(u) < n + 1, there exists k with rorx . . . r^_i =rx...rkby 30.11. Thus M = r 0 . . . r^_ir^ . . . rn = rx... r^r^ + i . . . rn = r\ . . . r ^ _ i r ^ + i . . . r n is of length at most n — 1, contrary to the choice of u.
(30.13) (W, R) is a Coxeter system.
Root systems
153
Proof. This is immediate from 29.4, 30.11, and 30.12. (30.14) W is regular on the positive systems and on the simple systems. Proof. By 30.8 and 30.4 it suffices to show NW(P) = 1. But NW(P) = {w e W: N(w) = 0} so 30.12 completes the proof. Let D consist of those v eV such that (v, x) > 0 for all x e n. (30.15) (1) vW DD is nonempty for each v e V. (2) (d, u) > 0 for each d e D and u e P. Proof. Pick z € v W maximal with respect to the ordering defining P. Then, for x e 7r, z > zrx = z — 2(z, x)x, so (z, x) > 0 as x > 0. That is z G vW fl D. Let d e D and u e P. Then M = ^ G 7 r a^jc with ax > 0 so
( 0. Then N(w) = n > 0 so there is x e n with JCW < 0. Now, by 30.15.2, 0 > (xw, d) = (x, dw~l) = (x, d), so x € dL by another application of 30.15.2. Thus rx e U and, by 30.10, l(rxw) < n, so, by minimality of n, rxw e U. But then w eU. So U = Cw(d). Evidently E Pi dL is a root system and an easy calculation using 30.15.2 shows n D d1 is a simple system. (30.17) Let 5 c V. Then C w (5) is the Weyl group of the root system £ Pi S1. Proof. Let U = (rw: U G E H S1). It suffices to show U = CW(S). CW(S) = Cw((S)) = Cw(So) where 5o is a basis for (S), so without loss S is finite. Replacing S by a suitable conjugate under W and appealing to 30.15, we may t a k e J e D H 5 . L e t G = C w (J) and £0 = 2 0 ^ . T h e n , by 30.16,G = W(S 0 ) and CW(S) = C G (S), while, by induction on the order of E, CG(5') = U. (30.18) Let (G, S) be a Coxeter system with G finite. Then the representation a of 29.8 is faithful and G is the Weyl group of a root system.
154
Presentations of groups
Proof. By 29.12 and 30.1, Ga is the Weyl group of a root system. By 29.7 and 30.13, Ga is a Coxeter group of type M, so \Ga\ — \G\. Hence a is an isomorphism. (30.19) Let H be the symmetric group on ft = { 1 , . . . , « } , (e) = Z2, and G = {e)wr$iH the wreath product of (e) by //. Choose notation so that C#(e) is the stabilizer in H of n e SI. Let Gx = H,SX = {(1, 2), (2, 3 ) , . . . , (n 1, w)}, G 2 = G, S2 = Si U {*?}, S3 = Si U {(n  1, n)e], and G 3 = (S3). Then (G,, S,) is a Coxeter system of type A n _i, Cni Dn, for / = 1,2,3, respectively. Further G3 is of index 2 in G2 and is the semidirect product of E2n\ by Sn. Proof Let V be ndimensional Euclidean space with orthonormal basic X = fe: 1 < i < «), e; the reflection with center (jc,), and E = (e,: 1 < i < n). Represent HonV viax t h = xih forh e H. Then G = (//, E) < O(V) and G is the wreath product (e)wrnH, where e — en. Hence G is the semidirect product of E = E2n, by H = Sn, and G 3 is the semidirect product of D = E n G3 by / / where D = (eiey.! < i < j 9. If H = 9 then, by 33.18, Ko = (Z, # : 1 0 there
174
The generalized Fitting subgroup
is Kt fixing X — Yt pointwise with Kt = SL2(3) and Kx centralizing Gyi. Thus (Kt: 1 < / < k) = #1 * • • • * Kk is a central product with identified centers and t = t\...tk with tt e Kt. As Kt = SL2(3), tt is of order 4 with {tf) = Z, so t is of order 4 if and only if k is odd. Hence the proof of 33.15 is at last complete. Remarks. I'm not sure who shares credit for the notion of 'components'. Certainly Bender [Be 1], Gorenstein and Walter [GW], and Wielandt [Wi 1] should be included. I use Bender's notation of E(G) for the subgroup generated by the components of a group G. The Gorenstein and Walter notation of L(G) is also used in the literature to denote this subgroup. I believe Bender [Be 1] was the first to formally define the generalized Fitting subgroup. Thompson factorization was introduced by Thompson in [Th 1] and [Th 2], although 32.5 was presumably first proved by Glauberman [Gl 2]. There are analogues of Thompson factorization for arbitrary finite groups G with F*(G) = OP(G). Such results require deep knowledge of the GF(/?)representations of nearly simple groups. In particular one needs to know the pairs (G, V) with G a nearly simple finite group and V an irreducible GF(/?)Gmodule such that 8P(G, V) is nonempty. Generalized Thompson factorization plays an important role in the classification; see in particular the concluding remarks in section 48. Thompson factorization for solvable groups is used in this book to establish the Thompson Normal pComplement Theorem, 39.5, and the nilpotence of Frobenius kernels (cf. 35.24 and 40.8). Exercises for chapter 11 1. Let r be a prime, G a solvable r'group, and A an rgroup acting on G. Prove (1) If TT c TT(G) and//is a Hall 7rsubgroup of G, then 0^(7/) < 1. (3) Let G be the subgroup of GL( V) generated by (sk:l 2. 6. Let G be a nonabelian simple group and G the universal covering group of G. Prove Aut(G) = Aut(G). 7. Let G be a solvable group with F(G) = OP(G) = T, let R be a /^subgroup of G containing T, let (NG(C): 1 ^ C char /?) < /f < G, let X = J(ROP,F(G)), V = {Qi(Z(R))x), andXR* = XR/CXR(V). Prove either (1) O p (//) = r , or (2) p < 3, X* = X* x • • • x X* with X* = SL2(/?), /? n X e Sylp(X), and A^G(^) permutes {X,: 1 < i < n}.
8. Let G be a finite group, r a prime, n a set of primes with r g n, and Er3 ^ A < G. For Eri = B # € cl(G) define
\ I\G\. It is straightforward to check that (, ) is hermitian symmetric and sesquilinear. Indeed the next lemma shows the form is nondegenerate. (35.3) The irreducible characters form an orthonormal basis for the unitary space (cl(G), (, )). That is (x,, Xj) = it follows
Characters in characteristic 0
187
that g = / . As b is an algebraic integer, g e Z[JC], so a]jd~k is an integer. As r = hj/rit with (hj,rii) = 1, it follows that nf~* divides a* for eachfc.Hence d k=l
But a/rii is a root of h(x) and /I(JC) is monic, so a/rii is an algebraic integer. On the other hand Norm (a/nt)\ < 1 by 35.9.1. Thus Norm (a) =/i, by 35.7.3, so, by 35.9.1, gjiti = col. Therefore (2) holds, completing the proof. (35.12) Assume hj = pe is a prime power for some j > 1 and G is simple. Then G is of prime order. Proof. We may assume G is not of prime order. Then, as G is simple, Z{G) = 1 andker(xi) = 1 for each/ > 1. So, by 35.11, for each i, y > 1 either x;(gy) = 0 or /? divides n,. Next, by the orthogonality relations:
1=1
for some algebraic integer c. Hence c = —p~l, impossible as — p~l is not an algebraic integer, by 35.7.2. (35.13) (Burnside's paqbTheorem). Let \G\ = paqb, with /?, # prime. Then G is solvable. /. Let G be a minimal counterexample. If 1 ^ H < G then G/// and / / are of order less then G and both are {p, #}groups, so, by minimality of G, each is solvable. But now 9.3.2 contradicts the choice of G. So G is simple. Let QeSy\q(G). If (2 = 1 then G is a pgroup and hence G is solvable. So 2 # 1» so in particular there is gj e Z(Q)#. Then Q < Co(gj), so hj = \G : CG(gj)\ divides \G:Q\= pa. So, by 35.12, G is of prime order, and hence G is solvable. (35.14) Let yjf e cl(G). Then (1) ^ = ET=i(^X.)Xi,and
(2) 0/MA) = £r=i(^X/) 2 . /V00/. As the irreducible characters are a basis for cl(G), \jr = J2?=i a(Xi for some complex numbers at. By 35.3, (i/r, Xj) = (HiaiXii Xj) = Eifli(Xi, Xj) = *hso(1)holds.Similarly^, V0= T,iaiaMi^ Xj)= E,«,?» so (2) holds. We next consider induced representations. Let H < G, F a. field, and a an FGrepresentation. It will be convenient to regard the image ha of he H under
188
Linear representations of finite groups
a as a matrix rather than a linear transformation. Extend a to G by defining ga = 0 for g € G — H. Let X = (JC; : 1 vu is a surjection ofGxK
For V e cl(#) define fG:G^F
I\K\\H\.
/] '
onto G whosefibresare
by iAGte) = ( E V 6 G ^te u ))/l^l, where as
usual f(x) = 0 for x e G  H. If f is a character of # then, by 35.17 , i/rG is a character of G, and evidently the map i/s h^ \jrG preserves addition and scalar multiplication, so as the irreducible characters form a basis for c\(H) we conclude: (35.19) The map ^ i> \frG is a linear transformation of cl(G) into c\(H) which maps characters to characters and generalized characters to generalized characters. The map i/r i> V"G is called the induction map of cl(G) into cl(H). Notice that 35.17 and the definition of fG show: (35.20) Let f e c\(H). Then (1) 1,G(g) = 0 forgeG (2) ^G(l)=\G
(Jv€GHv)9wd
190
Linear representations of finite groups
Recall that there are hermitian symmetric forms ( , )H and ( , ) G defined on c\(H) and cl(G), respectively.
(35.21) (Frobenius Reciprocity Theorem) Let V e cl(H) and x € cl(G). Then
)X(g)j
Proof.
\G\
geG
')x(g)) f\G\\H\ v,geG
')X(8V)J
I\G\\H\
v,geG
since x is a class function. As the map g h> gv is a permutation of G for each i; e G, it follows that (^ G , X)G = (Z8eG VKs)x(s))/l#. As ^ t e ) = 0 for geGH, this sum reduces to (ZheH t(f0x(h))/\H\ = (V% X I//)//A subset T of G is said to be a 77sef in G if T n T^ c {1} for each geG

(35.22) Let T be a 77set in G, H = iVG(3T), and T/T, 0 e cl(H) with ^ and 0 equal to 0 on H  T. Then (1) yj,G(t) = ty(t) for each f e 7 # . (2) Proo/. Let g e G # . Then V^Gte) = ( £ U € G ^ t e v ) ) /  H  with ^ w ) = 0 unless gv e T. Thus \lrG(g) = 0 unless geTu for some « 6 G, in which case Exercise 12.3 says Tu is the unique conjugate of T containing g while gv eT if and only
if i; € u~lH. In particular if g e T then fG{g) = (£heH ^(gh))/\H\ = t(g). Thus (1) holds. Also, as \/rG is a class function, \frG(g) = f{gv) if gv e T for some v e G, and tyG{g) = 0 otherwise. Assume ^(1) = 0. Then V G 0 ) = 0 by 35.20.2, so \G\
X
Characters in characteristic 0
191
where A consists of those g G G# with gv^g) e T for some v(g) e G. Then, by Exercise 12.3,
as \fr is 0 on H  T # . A Frobenius group is a transitive permutation group G on a finite set X such that no member of G # fixes more than one point of X and some member of G# fixes at least one point of X. The following lemma is left as Exercise 12.4. (35.23) (1) If G is a Frobenius group on a set X, x e X, and H = GX9 then H is a proper nontrivial subgroup of 7\ H is a 77set in G, and / / = NG(H). Let £ be the subset of G consisting of 1 together with the elements of G fixing no points of X. Then \K\ = \X\. (2) Assume H is a proper nontrivial subgroup of a finite group G such that 7/ is a 77set in G and H = NG(H). Then G is faithfully represented as a Frobenius group by right multiplication on the coset space G/H. Notice that, under the hypothesis of Lemma 35.23.1, the representation of G on X is equivalent to the representation of G by right multiplication on the coset space G/H by 5.8. Hence the permutation group theoretic hypotheses of 35.23.1 are equivalent to the group theoretic hypothesis of 35.23.2 by that lemma. I'll refer to a group G satisfying either hypothesis as a Frobenius group and call the subgroup H the Frobenius complement of G. Exercise 12.4 says H is determined up to conjugacy in G. The subset K of 35.23.1 can be described group theoretically by
K will be called the Frobenius kernel of G. The following important theorem of Frobenius shows A' is a normal subgroup of G. (35.24) (Frobenius' Theorem) The Frobenius kernel of a Frobenius group G is a normal subgroup of G. Proof. Let H and K be the Frobenius complement and kernel of G, respectively. The idea is to produce a character x of G with K — ker(x); then K P.Let(j2,, JC,: 1 < i < n\)accomplish Pgl + P. As A, A* c P, A c P n P*~\ so, by definition of  • , A c P n P^"1 < P n 2 ! and A*1*' c (P n P^" 1 )^ ^ < P n Qi+X for 1 < i < n — 1. Also, setting JC = JCI . . . JCW_I, P8 xx = P, so ^ = x~lg e NG(P) and g = ;tjtn =JCI . . . x n . Finally let Qn = P and observe A*1*111 = A8X" < x~ll px~ = p = p n Q n , so the theorem holds. 39 Normal p complements In this section p is a prime and G is a finite group. A normal pcomplement for G is a normal Hall //subgroup of G; that is a normal pcomplement is a normal complement to a Sylow psubgroup of G. (39.1) (Burnside Normal pComplement Theorem) If a Sylow psubgroup of G is in the center of its normalizer then G possesses a normal pcomplement. Proof. This is immediate from 37.7. (39.2) If p is the smallest prime divisor of the order of G and G has cyclic Sylow pgroups, then G has a normal pcomplement. Proof Let P e Syl p (G). By hypothesis P is cyclic. As P is abelian and Sylow in G, Aut G (P) is a p'group, so, by 23.3, Aut G (P) divides p  1. Hence, as
Normal pcomplements
203
p is the smallest prime divisor of G, AutG(P) = 1. Equivalently, P is in the center of its normalizes so 39.1 completes the proof. G is metacyclic if there exists a normal subgroup H of G such that H and G/H are cyclic. (39.3) Assume each Sylow group of G is cyclic. Then G is metacyclic. Proof. Let p be the smallest prime divisor of \G\. By 39.2, G has a normal pcomplement H. By induction on the order of G, H is metacyclic. In particular H is solvable, so, as G/H is cyclic, G is solvable. Let K = F(G). K is nilpotent with cyclic Sylow groups, so K is cyclic. Thus Aut(£) is abelian. However, by 31.10, K = CG(K), so Aut G (iO = G/K is abelian. As G/K has cyclic Sylow groups, G/K is cyclic, so G is metacyclic. A subgroup H of G is ^plocal subgroup if H = NG(P) for some nontrivial /7subgroup P of G. (39.4) (Frobenius Normal /^Complement Theorem) The following are equivalent: (1) G has a normal /7complement. (2) Each /7local subgroup of G has a normal /7complement. (3) AutoiP) is a pgrowp for each /7subgroup P of G. Proo/. The implications (1) implies (2) and (2) implies (3) are easy and left as exercises. Assume G satisfies (3) but not (1), and, subject to this constraint, choose G minimal. Observe first that G = OP(G). For if not, by minimality of G, OP(G) has a normal /7complement, which is also a normal /7complement for G. Next let's see that a Sylow /7subgroup P of G controls fusion in P. For let geG, aeP, and a8 e P. Apply Alperin's Theorem to obtain Qt e Sy\p(G) and X( e NG(P D Qt) satisfying the conditions of that theorem with A = {a}. In particular g = x\...xn. It will suffice to show a*1'** eap for each 1 < i < n. Assume otherwise and let / be a minimal counterexample. Then b =
a*...*,, €pnQi
= U,xieH = NG(U), PHHe Sy\p(H), and a*1"*' =bXi.
By hypothesis kutG{U) is a /7group, so H = CG(U)(P n # ) , as P n # e S y y t f ) . Thus, as 6 e £/, &*' = bf for some f e P n # , so, as b e ap, aXl~'Xi =
bXieap. So P controls fusion in P. Hence by 37.5 (O^(G)G(1)) Pi P = O^(P)P (1) . But Op(P) = 1 and, as G = CF(G), (O^(G)G(1)) n P = P. Thus P = P (1) , so, as /7groups are solvable, P = 1. But then G is its own normal /7complement.
204
Transfer and fusion
(39.5) (Thompson Normal /^Complement Theorem) Let p be odd and P e Sy\p(G). Assume NG(J(P)) and C G ( ^ I ( Z ( P ) ) ) have normal /^complements. Then G has a normal /^complement. Proof. Assume otherwise and let G be a minimal counterexample. By the Frobenius pComplement Theorem there is a /?local subgroup HofG which possesses no normal /?complement. By Sylow's Theorem we take Q = P D H e Sy\p(H). Choose H with Q maximal subject to these constraints. Claim P = Q. If not Q < NP(Q), so \NG(C)\P > \Q\ for each C char Q. Hence, by maximality of Q, NG(C) has a normal /^complement. So NH(C) also has a normal /^complement. In particular this holds for C = J(Q) and Qi(Z(Q)), so the hypotheses of the theorem hold in H. Hence, by minimality of G, H has a normal /?complement, contrary to the choice of H. So P e Sy\p(H). Hence, as H has no pcomplement, if = G by minimality of G. Moreover if OP(G) # 1 then, by 18.7 and minimality of G, G/OP(G) has a pcomplement, and then G does too. So OP(G) = 1. As G = H is a plocal, O P (G) ^ 1. Let G* = G/OP(G). Then OP(G*) = 1 so NG(J(P*)) and C G ( ^ I ( Z ( P * ) ) ) are proper subgroups of G containing P, and hence by minimality of G have /^complements. So, by minimality of G, G* has a /7complement. Hence G = OPtP>,p(G). Thus £(G) = OPfP>,p(E(G)). But [£(G), F(G)] = 1 so O / ,(£(G)) < Z{E(G)\ and thus O ^ ( £ ( G ) ) = Op (E(G)) x CV(£(G)). Now OP>(E(G)) < OP(G) = 1, so £(G) is a pgroup. Hence, as E(G) is perfect, £(G) = 1. So F*(G) = F(G)E(G) = OP(G). Letp^re n(G) and R € Syl r (G). # < OPyP>{G\ so, by a Frattini Argument, OP(G)NG(Z(R)) contains a Sylow /7group of G which we may take to be P. In particular P acts on OP(G)Z(R) so PZ(R) = K is a subgroup of G. Now if K ^ G then, by minimality of G, Z(R) = Op/(ZO < # . But then Z(R) < CG(OP(G)) < OP(G) by 31.10, and hence Z(R) = 1, a contradiction. So G = P Z(R). In particular G is solvable and R — Z(R) is abelian. But now by Thompson Factorization, 32.6, G = G\G2 where G\ = NG(J(P)) and G2 = C G (^i(Z(P)). By hypothesis G, = O^(G,)P. As O^(G,) < C G (O P (G)) < O P (G), Op,{Gi)= l,soG/ = P.ThusG = GiG 2 = P, contradicting the choice of G as a counterexample. The next result does not involve normal pcomplements, but it has the same flavor. (39.6) (BaerSuzuki Theorem) Let X be a /7subgroup of G. Then either X < OP(G) or there exists g e G with (X, X8) not a pgroup.
Semiregular action
205
Proof. Assume the theorem is false and let P e Sylp(G) and A = XG n P. {XG) < G, so, as X £ OP(G), (XG) is not a /7group. Thus A # XG. For y 6 XG — A, (F, A) is not a pgroup, by Sylow's Theorem. Let F be of maximal order subject to F c A and (F, Y) a pgroup for some Y eXG — A. Then F / A, but on the other hand as G is a counter example to the theorem, at least F is nonempty. Let Q = (F, Y). By maximality of F, F = A n Q. Hence by Exercise 11.4 we may take Y < N(T) and there is Z e NA(F)  F. As X £ OP(G), NG(T) ± G, so, by induction on the order of G, {XG n NG(T)) is a pgroup. But now F C F U {Z} = V and (F r , Y) is a pgroup, contradicting the maximality of F.
40 Semiregular action In this section G is a nontrivial finite group and A is a nontrivial group of automorphisms of G which acts semiregularly on G. Recall this means CG(CI) = 1 for each aeA#. (40.1) \G\ = 1 mod A. In particular (  A  ,  G  ) = 1 . Proof. As A is semiregular, each orbit of A on G# is of order  A. We will wish to apply coprime action, 18.6, to the representation of A on G. Thus, until 40.7, assume either G or A is solvable. In 40.7 we prove G is nilpotent, at which point we see the assumption was unnecessary. (40.2) A is semiregular on each Ainvariant subgroup and factor group of G. Proof. The first remark is trivial and the second follows from coprime action, 18.7. (40.3) For each p e n(G), there is a unique Ainvariant Sylow psubgroup ofG. Proof. By coprime action, 18.7, the set A of Ainvariant Sylow pgroups is nonempty and CQ(A) is transitive on A. So as CG(A) = 1, the lemma follows. (40.4) For each a £ A, the map g H> [g, a] is a permutation of G. Proof, [g, a] = g~lga, So [g, a] = [h, a] if and only if hg~l e CG(a). So, as Cc(a) = 1, the commutator map is an injection, and hence also a bijection as G is finite.
206
Transfer and fusion
(40.5) If A is of even order there is a unique involution t in A, g* = g~l for g e G, and G is abelian. Proof. As \A\ is even there is an involution t e A.Letg e G.By40.4,g = [h, t] for some heG. Thus g* = (Tr1/*')' = h~lh = g" 1 . Therefore, for each xeG, x* = x~l9 so xg = (jcg)~* = (g~lx~ly = g~*x~* = gx. So G is abelian. Finally, if s is any involution in A, then I've shown s inverts G, so st e CA(G) = 1. Thus t is unique. (40.6) (1) (2) (3) (4)
Let p,qe n(A). Then If p is odd then Sylow pgroups of A are cyclic. Sylow 2groups of A are cyclic or quaternion. Subgroups of A of order pq are cyclic. Subgroups of A of odd order are metacyclic.
Proof. By 40.2 and 40.3 we may assume G is an rgroup for some prime r, and indeed replacing G by G/&(G) we may assume G is elementary abelian. Observe that, for B < A, {CG(b): beB#) # G as CG(b) = 1 for each b e B#. So, by Exercise 8.1, mp(A) = 1. Hence Exercise 8.4 implies (1) and (2). Part (3) follows from 27.18, while (1) and 39.3 imply (4). (40.7) G is nilpotent. Proof. Let G be a minimal counterexample and a an element of A of prime order. By induction on the order of A we may take A = (a). In particular A is solvable, so all lemmas in this section apply. Suppose q e n(G) and 1 / Q is an Ainvariant normal elementary abelian ^subgroup of G. By 40.2 and minimality of G, G/Q is nilpotent so RQ < G for each Sylow rgroup R of G. In particular if r —q then R