CAMBRIDGE TRACTS IN MATHEMATICS
General Editors
B. BOLLOBÁS, W. FULTON, F. KIRWAN, P. SARNAK, B. SIMON, B. TOTARO
214 The Mathieu Groups CAMBRIDGE TRACTS IN MATHEMATICS
GENERAL EDITORS B. BOLLOBÁS, W. FULTON, F. KIRWAN, P. SARNAK, B. SIMON, B. TOTARO
A complete list of books in the series can be found at www.cambridge.org/mathematics. Recent titles include the following:
181. Totally Positive Matrices. By A. PINKUS 182. Nonlinear Markov Processes and Kinetic Equations. By V. N. KOLOKOLTSOV 183. Period Domains over Finite and p-adic Fields. By J.-F. DAT,S.ORLIK,andM.RAPOPORT 184. Algebraic Theories. By J. ADÁMEK,J.ROSICKÝ,andE.M.VITALE 185. Rigidity in Higher Rank Abelian Group Actions I: Introduction and Cocycle Problem. By A. KATOK and V. NIT. ICAˇ 186. Dimensions, Embeddings, and Attractors. By J. C. ROBINSON 187. Convexity: An Analytic Viewpoint. By B. SIMON 188. Modern Approaches to the Invariant Subspace Problem. By I. CHALENDAR and J. R. PARTINGTON 189. Nonlinear Perron–Frobenius Theory. By B. LEMMENS and R. NUSSBAUM 190. Jordan Structures in Geometry and Analysis. By C.-H. CHU 191. Malliavin Calculus for Lévy Processes and Infinite-Dimensional Brownian Motion. By H. OSSWALD 192. Normal Approximations with Malliavin Calculus. By I. NOURDIN and G. PECCATI 193. Distribution Modulo One and Diophantine Approximation. By Y. BUGEAUD 194. Mathematics of Two-Dimensional Turbulence. By S. KUKSIN and A. SHIRIKYAN 195. A Universal Construction for Groups Acting Freely on Real Trees. By I. CHISWELL and T. M ÜLLER 196. The Theory of Hardy’s Z-Function. By A. IVIC´ 197. Induced Representations of Locally Compact Groups. By E. KANIUTH and K. F. TAYLOR 198. Topics in Critical Point Theory. By K. PERERA and M. SCHECHTER 199. Combinatorics of Minuscule Representations. By R. M. GREEN 200. Singularities of the Minimal Model Program. By J. KOLLÁR 201. Coherence in Three-Dimensional Category Theory. By N. GURSKI 202. Canonical Ramsey Theory on Polish Spaces. By V. KANOVEI,M.SABOK,andJ.ZAPLETAL 203. A Primer on the Dirichlet Space. By O. EL-FALLAH,K.KELLAY,J.MASHREGHI,and T. R ANSFORD 204. Group Cohomology and Algebraic Cycles. By B. TOTARO 205. Ridge Functions. By A. PINKUS 206. Probability on Real Lie Algebras. By U. FRANZ and N. PRIVAULT 207. Auxiliary Polynomials in Number Theory. By D. MASSER 208. Representations of Elementary Abelian p-Groups and Vector Bundles. By D. J. BENSON 209. Non-homogeneous Random Walks. By M. MENSHIKOV,S.POPOV and A. WADE 210. Fourier Integrals in Classical Analysis (Second Edition). By C. D. SOGGE 211. Eigenvalues, Multiplicities and Graphs. By C. R. JOHNSON and C. M. SAIAGO 212. Applications of Diophantine Approximation to Integral Points and Transcendence. By P. C ORVAJA and U. ZANNIER 213. Variations on a Theme of Borel. By S. WEINBERGER 214. The Mathieu Groups. By A. A. IVANOV 215. Slenderness I: Abelian Categories. By RADOSLAV DIMITRIC The Mathieu Groups
A. A. IVANOV Imperial College London and Institute for System Analysis FRC, CSC, RAS University Printing House, Cambridge CB2 8BS, United Kingdom One Liberty Plaza, 20th Floor, New York, NY 10006, USA 477 Williamstown Road, Port Melbourne, VIC 3207, Australia 314–321, 3rd Floor, Plot 3, Splendor Forum, Jasola District Centre, New Delhi – 110025, India 79 Anson Road, #06–04/06, Singapore 079906
Cambridge University Press is part of the University of Cambridge. It furthers the University’s mission by disseminating knowledge in the pursuit of education, learning, and research at the highest international levels of excellence.
www.cambridge.org Information on this title: www.cambridge.org/9781108429788 DOI: 10.1017/9781108555289 c A. A. Ivanov 2018 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 published 2018 Printed in the United Kingdom by Clays, St Ives plc A catalogue record for this publication is available from the British Library. Library of Congress Cataloging-in-Publication Data Names: Ivanov, A. A. (Aleksandr Anatolievich), 1958– author. Title: The Mathieu groups / A.A. Ivanov (Imperial College London). Description: Cambridge ; New York, NY : Cambridge University Press, [2018] | Series: Cambridge tracts in mathematics Identifiers: LCCN 2018011064 | ISBN 9781108429788 Subjects: LCSH: Mathieu groups. | Permutation groups. | Finite groups. Classification: LCC QA171 .I93 2018 | DDC 512/.23–dc23 LC record available at https://lccn.loc.gov/2018011064 ISBN 978-1-108-42978-8 Hardback Cambridge University Press has no responsibility for the persistence or accuracy of URLs for external or third-party internet websites referred to in this publication and does not guarantee that any content on such websites is, or will remain, accurate or appropriate. In gratitude to Ernie Shult
Contents
Preface page xi
1 The Mathieu Group M24 As We Knew It 1 1.1 The Golay Code 1 1.2 The Octad Graph 4 1.3 A Review 5 2 The Amalgam Method 8 2.1 Amalgams 8 2.2 Goldschmidt’s Amalgams 10 2.3 Constrained Amalgams 12 2.4 Understanding Completions 13 2.5 The Mathieu Amalgam 14
3 L4(2) in Two Incarnations and L3(4) 17 3.1 The Fano Plane 17 3.2 The Group L3(2) 19 3.3 Elements and Subgroups of L3(2) 20 3 3.4 An Automorphism of 2 : L3(2) 23 ∼ 3.5 Another Look at the Isomorphism L3(2) = L2(7) 25 3.6 A7 and a Space of Fano Planes 26 ∼ 3.7 L4(2) = A8 28 3.8 Subgroup Correspondence 31 3.9 Symplectic Identification 34 3 3.10 Restricting Automorphisms of 2 : L3(2) 37 3.11 Projective Plane of Order 4 39 3.12 Outer Automorphism of S6 42
4FromL5(2) to the Mathieu Amalgam 44 4.1 Maximal Parabolics in GLn(2) 44
vii viii Contents
4.2 Five-dimensional GF(2)-Space 45 4.3 The Universal Completion of the L5(2)-Amalgam 47 4.4 Automorphisms of H12 49 4.5 Building up {G1, G2} 50 4.6 An Explicit Form of α 52 4.7 Incorporating G3 54 4.8 The Minimality of G3 57
5 M24 As Universal Completion 59 5.1 Completing the Mathieu Amalgam 59 5.2 The Octad Graph As the Coset Graph 62 5.3 The Octad Graph on 8-Subsets 66 5.4 Simplicity, 5-Transitivity and the Steiner Property 68 5.5 Octad Space and the Golay Code 70 5.6 Maximal Parabolic Geometry 71 5.7 Tilde Geometry of M24 74 6 Maximal Subgroups 77 6.1 The Point Stabilizer M23 78 6.2 The Pair Stabilizer M22.2 79 6.3 The Triple Stabilizer PL3(4) 81 6.4 Small Mathieu Groups 83 6.5 Turyn’s Construction 95 6.6 Quadratic Residues over GF(23) 96 6.7 The Smallest Maximal Subgroup 96
7The45-Representation of M24 105 ( ) 7.1 Representing L3 2 in Three Dimensions√ 105 7.2 An Explicit Form of L3(2) → L3(Q( −7)) 106 7.3 Hyperplanes in R2 109 7.4 Representing G1 110 7.5 Restricting from G1 to G12 111 7.6 Lifting from G12 to G2 114 7.7 Hyperplanes in R3 and Covers of G3 115 7.8 Identifying G3 118 8 The Held Group 120 8.1 The Tilde Mathieu Amalgam 120 8.2 Dichotomy 122 1 8.3 G3-Subamalgams in G3 123 8.4 Constructing the Cocycle 125 8.5 Two Completions 127 Contents ix
8.6 Presenting 3 · S6 128 8.7 Presentations for M24 and He 130 9 The Inevitability of Mathieu Groups 133 9.1 M11 in O’Nan’s Group 133 9.2 K 3 Surfaces 137 9.3 Mathieu Moonshine 139 10 Locally Projective Graphs and Amalgams 140 10.1 Definitions and Preliminaries 140 10.2 Some (n, 3)-Examples 143 10.3 Densely Embedded and Geometric Subgraphs 143 10.4 The Thompson–Wielandt–Weiss Theorem 146 10.5 Large Goldschmidt Amalgams 147 10.6 Geometric Subgraphs Exist in the Universal Cover 150 10.7 Dual Space Graphs and Amalgams 156 10.8 Towards the Planes of Symplectic Type 159 10.9 Constructing Densely Embedded Subgraphs 163
References 166 Index 170
Preface
“There are almost as many different constructions of M24 as there have been mathematicians interested in that most remarkable of all finite groups”.1 In this book the study of the Mathieu group M24 (and other Mathieu groups it contains) falls within the scope of what E. E. Shult2 called the Ivanov– Shpectorov theory of geometries. This theory has been developed to construct and identify large sporadic simple groups including the Baby Monster,3,4 the 5 6 Fourth Janko Group J4 and the Monster. The most dramatic outcome of the theory was the proof of the famous Y -presentation conjecture for the Monster, which for a long time remained unobtainable by use of the other techniques.7 In the case of M24 the way in which the theory develops can be projected onto the familiar structures of the Steiner system on 24 points and the Golay code, thus presenting a bold illustration of the theory as well as providing a fresh look at familiar, nearly classical structures. I am extremely grateful to Madeleine Whybrow, William Giuliano and the anonymous referees for sug- gesting thoughtful corrections, clarifications and modifications after reading earlier versions of the book.
1 J. H. Conway, The Golay Codes and the Mathieu Groups, in Sphere Packings, Lattices and Groups, ed. J. Conway and N.J.A Sloane, Springer, New York, 1988, pp. 299–330. 2 E. E. Shult, lecture notes on coverings of graphs, Kansas State University, 1997. 3 A. A. Ivanov, Geometry of Sporadic Groups I, Cambridge University Press, Cambridge, 1999. 4 A. A. Ivanov and S. V. Shpectorov, Geometry of Sporadic Groups II, Cambridge University Press, Cambridge, 2002 5 A. A. Ivanov, J4, Oxford University Press, Oxford, 2004. 6 A. A. Ivanov, The Monster Group and Majorana Involutions, Cambridge University Press, Cambridge, 2009. 7 A. A. Ivanov, Y -groups via transitive extensions, J. Algebra 218 (1999), 412–435.
xi
1
The Mathieu Group M24 As We Knew It
In this chapter we start by reviewing the common way to describe the Math- ieu group G = M24 as the automorphism group of the binary Golay code and of the Steiner system formed by the minimal codewords in the Golay code. This discussion will lead us to the structure of the octad–trio–sextet stabiliz- ers {G1, G2, G3}. The starting point is the observation that, when forming a similar triple {H1, H2, H3} comprised of the stabilizers of one-, two- and three-dimensional subspaces in H = L5(2),wehave ∼ ∼ 4 ∼ ∼ 6 G1 = H1 = 2 : L4(2), G2 = H2 = 2 : (L3(2) × S3),
[G1 : G1 ∩ G2]=[H1 : H1 ∩ H2]=15,
[G2 : G1 ∩ G2]=[H2 : H1 ∩ H1]=3, so that the amalgams {G1, G2} and {H1, H2} have the same type according to Goldschmidt’s terminology, although they are not isomorphic and differ by a twist performed by an outer automorphism of
∼ ∼ 3 3 H1 ∩ H2 = G1 ∩ G2 = (2 × 2 ) : (L3(2) × 2), which permutes conjugacy classes of L3(2)-subgroups. This observation led us to the construction of M24 as the universal completion of a twisted L5(2)- amalgam.
1.1 The Golay Code
Commonly the Mathieu group M24 is defined as the automorphism group of the Golay code, which by definition is a (a) binary (b) linear code (c) of length 24, which is (d) even, (e) self-dual and (f) has no codewords of weight 4. By (a) we can identify a codeword with its support in the standard basis and view the Golay code as a pair (P, C), where P is a set and C is a collection
1 2 The Mathieu Group M24 As We Knew It of subsets of P, so that P together with an ordering can be identified with the standard basis of the vector space 2P := {A | A ⊆ P} in which addition is performed by the symmetric difference operator: A + B := (A ∪ B) \ (A ∩ B).
The weight of A ⊆ P is its cardinality |A| and the remaining defining properties of the Golay code can be restated as follows: (b) C is closed under addition; (c) |P|=24; (d) every subset in C has an even number of elements; (e) a subset B of P intersects evenly every A ∈ C exactly when B is taken from C; (f) the minimal weight of C is 8. It is convenient to deduce the numerology of the Golay code starting with con- sideration of its co-code C∗ := 2P/C.ForA ⊆ P let A∗ denote the image of A in the co-code: A∗ = A+C. The following cardinality attribute is immediately evident from the minimal weight of C being 8.
Lemma 1.1 Whenever two distinct subsets A and B in P, each of cardinality at most 4, have the same image in C∗, the equality |A|=|B|=4 holds, and A is disjoint from B.
Let P(4) be the set of all subsets of cardinality at most 4 in P. Since it is not possible to find more than six pairwise disjoint 4-subsets in a 24-set, the cardinality attribute Lemma 1.1 gives the following lower bound on the size of P∗ P C∗ the image (4) of (4) in : ∗ 24 24 1 24 12 |P( )|≥1 + 24 + + + = 2 . 4 2 3 6 4 On the other hand, the self-duality of C means that it is a maximal isotropic subspace in 2P with respect to the non-degenerate symplectic form f : (A, B) →|A ∩ B| mod 2. Thus the dimension of C is exactly half the dimension of 2P, so that |C|= |C∗|= 12 C∗ = P∗ 2 , and the above lower bound is attained. Therefore (4), which brings about the following representative principle.
Lemma 1.2 For every X ⊆ P the coset X ∗ contains a subset A of cardinality at most 4. The cardinality of such a subset A is uniquely determined by X. If the cardinality of A is strictly less than 4 then A itself is uniquely determined by 1.1 The Golay Code 3
X, but if the cardinality is 4 then there are precisely six choices for A forming a partition of P into six disjoint 4-subsets.
Let us introduce some further terminology by calling the minimal non-empty subsets of C (having size eight) octads, and denoting by B the set of octads. A partition of P into six 4-subsets such that the union of any two of them is an octad is known as a sextet. Notice that the partition which appeared in the last sentence of the representative principle Lemma 1.2 is a sextet. A partition of P into three disjoint octads is called a trio.LetS and T denote the sets of sextets and trios, respectively. Given a sextet, one can easily construct a trio by taking a sub-partition of the sextet, and then P is an element of C, since it is the sum of the octads in a trio. Also two distinct octads cannot share a 5-set, because of the minimal weight property. These observations, together with the representative principle, give the following Steiner attribute.
Lemma 1.3 Every 4-subset of P is a member of a unique sextet, and every 5- subset is contained in a unique octad. Furthermore, trios exist and P,viewed as an element from 2P, is contained in C.
Now easy combinatorial counting demonstrates the equalities 24 1 24 5 |S|= = 1771 and |B|= = 759. 6 4 8 5 The pair (P, B) is a Steiner system of type S(24, 8, 5), which by definition is a collection of 8-subsets in a 24-set such that every 5-subset is covered by exactly one 8-subset from the collection. In order to calculate the number of trios we first analyze how two octads can intersect. Let ni denote the number of octads intersecting a given octad B in exactly i elements. Clearly n8 = 1, while ni = 0 whenever i is odd by the self- duality condition, and n6 = 0 by the minimal weight condition. A 4-subset X is contained in five octads which are unions of the pairs of 4-subsets in the sextet determined by X and B is one of them. This readily gives the equality 8 n = (5 − 1) = 280. 4 4
In order to calculate n2 we consider a 5-subset Q which intersects B in exactly two elements. The unique octad B(Q) containing Q might intersect B in four points, but all such subsets Q can be counted, since n4 is known. For the remaining Qswehave|B ∩ B(Q)|=2, which gives 4 The Mathieu Group M24 As We Knew It