INTRODUCTION MATHIEU GROUPS. Lecture 5: Sporadic simple groups. Sporadic simple groups. Robert A. Wilson. LTCC, 10th November 2008

Similar documents
The Golay code. Robert A. Wilson. 01/12/08, QMUL, Pure Mathematics Seminar

THERE IS NO Sz(8) IN THE MONSTER

Umbral groups. Robert A. Wilson. LMS EPSRC Durham Symposium, 4th August 2015

Sporadic and Related Groups. Lecture 1 Classification of finite simple groups Steiner Systems

Conway s group and octonions

The Witt designs, Golay codes and Mathieu groups

The Jordan Hölder Theorem

Linear binary codes arising from finite groups

A Design and a Code Invariant

TRIPLE GENERATIONS OF THE LYONS SPORADIC SIMPLE GROUP MALEBOGO JOHN MOTALANE MASTER OF SCIENCE MATHEMATICS UNIVERSITY OF SOUTH AFRICA

6 Orthogonal groups. O 2m 1 q. q 2i 1 q 2i. 1 i 1. 1 q 2i 2. O 2m q. q m m 1. 1 q 2i 1 i 1. 1 q 2i. i 1. 2 q 1 q i 1 q i 1. m 1.

ON THE ORDERS OF AUTOMORPHISM GROUPS OF FINITE GROUPS

Binary codes related to the moonshine vertex operator algebra

SOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi

On the single-orbit conjecture for uncoverings-by-bases

Error-correction and the binary Golay code

Frames of the Leech lattice and their applications

Permutation Groups and Transformation Semigroups Lecture 4: Idempotent generation

Permutation decoding for the binary codes from triangular graphs

School of Mathematics and Statistics. MT5824 Topics in Groups. Handout 0: Course Information

Difference sets and Hadamard matrices

Hadamard matrices, difference sets and doubly transitive permutation groups

Strongly regular graphs and Borsuk s conjecture

A Projection Decoding of a Binary Extremal Self-Dual Code of Length 40

Permutation Group Algorithms

SYMMETRIC PRESENTATIONS OF COXETER GROUPS

Sporadic and related groups. Lecture 15 Matrix representations of sporadic groups.

Permutation groups/1. 1 Automorphism groups, permutation groups, abstract

An Atlas of Sporadic Group Representations

MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.

Groups and Symmetries

Automorphism groups of Lorentzian lattices.

Mathieu Moonshine. Matthias Gaberdiel ETH Zürich. String-Math 2012 Bonn, 19 July 2012

The Leech lattice. 1. History.

Strongly regular graphs and Borsuk s conjecture

Algebraic aspects of Hadamard matrices

Nonsolvable Groups with No Prime Dividing Three Character Degrees

School of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation

The Mathieu groups. Leo Taslaman

Solutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16

Math 451, 01, Exam #2 Answer Key

Square 2-designs/1. 1 Definition

Semiregular automorphisms of vertex-transitive cubic graphs

Computer construction of the Monster

Root systems and optimal block designs

A construction for the outer automorphism of S 6

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Monomial modular representations and symmetric generation of the Harada Norton group

Borcherds proof of the moonshine conjecture

Independent generating sets and geometries for symmetric groups

HUPPERT S CONJECTURE FOR F i 23

Subspace stabilizers and maximal subgroups of exceptional groups of Lie type

Michael Giudici. on joint work with variously John Bamberg, Martin Liebeck, Cheryl Praeger, Jan Saxl and Pham Huu Tiep

Error-correcting codes from permutation groups

Strongly regular graphs and the Higman-Sims group. Padraig Ó Catháin National University of Ireland, Galway. June 14, 2012

Some computations in the Monster group and related topics.

Lattices. SUMS lecture, October 19, 2009; Winter School lecture, January 8, Eyal Z. Goren, McGill University

MATH 433 Applied Algebra Lecture 22: Review for Exam 2.

THE TRANSITIVE AND CO TRANSITIVE BLOCKING SETS IN P 2 (F q )

The alternating groups

An eightfold path to E 8

Groups of Prime Power Order with Derived Subgroup of Prime Order

A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:

Limits of cubes E1 4NS, U.K.

List of topics for the preliminary exam in algebra

Rank 3 permutation groups

Construction of quasi-cyclic self-dual codes

HW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).

D-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups

The maximal subgroups of the Baby Monster, I

GENERATING GROUPS USING HYPERGRAPHS

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

On the Least Number of Cell Orbits of a Hadamard Matrix of Order n

5 Structure of 2-transitive groups

THE 7-MODULAR DECOMPOSITION MATRICES OF THE SPORADIC O NAN GROUP

DOUBLE CIRCULANT CONSTRUCTIONS OF THE LEECH LATTICE

On certain Regular Maps with Automorphism group PSL(2, p) Martin Downs

MT5821 Advanced Combinatorics

Simple connectedness of the 3-local geometry of the Monster. A.A. Ivanov. U. Meierfrankenfeld

EXHAUSTIVE DETERMINATION OF (511, 255, 127)-CYCLIC DIFFERENCE SETS

1 Fields and vector spaces

Isomorphism Testing Standard Presentations Example. Isomorphism testing. Go to Classifications. Go to Automorphisms

The extended Golay code

Notes 10: Consequences of Eli Cartan s theorem.

0 Sets and Induction. Sets

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson

Characters and triangle generation of the simple Mathieu group M 11

School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet V: Direct and semidirect products (Solutions)

Regular permutation groups. and Cayley graphs. Cheryl E Praeger. University of Western Australia

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

Planes and MOLS. Ian Wanless. Monash University

Course 2316 Sample Paper 1

GROUP ACTIONS EMMANUEL KOWALSKI

Extended 1-perfect additive codes

ORBIT-HOMOGENEITY IN PERMUTATION GROUPS

Projection Theorem 1

Open Questions in Coding Theory

INTRODUCTION TO THE GROUP THEORY

arxiv: v1 [math.co] 1 Jan 2019

Type I Codes over GF(4)

Transcription:

Lecture 5: Sporadic simple groups Robert A. Wilson INTRODUCTION Queen Mary, University of London LTCC, 0th November 2008 Sporadic simple groups The 26 sporadic simple groups may be roughly divided into five types: The five Mathieu groups M, M 2, M 22, M 23, M 24 : permutation groups on,..., 24 points. The seven Leech lattice groups Co, Co 2, Co 3, McL, HS, Suz, J 2 : (real) matrix groups in dimension at most 24. The three Fischer groups Fi 22, Fi 23, Fi 24 : automorphism groups of rank 3 graphs. The five Monstrous groups M, B, Th, HN, He: centralisers in the Monster of elements of order, 2, 3, 5, 7. The six pariahs J, J 3, J 4, ON, Ly, Ru: oddments which have little to do with each other. MATHIEU GROUPS

The hexacode F 4 = {0,,, } is the field of order 4 Take six coordinates, grouped into three pairs Let the hexacode C be the 3-space spanned by ( ) ( ) ( ) This is invariant under scalar multiplications, permuting the three pairs, and reversing two of the three pairs. The hexacode, II This group 3 S 4 has four orbits on non-zero vectors in the code: 6 of shape ( ) 9 of shape ( 00) 2 of shape ( ) 36 of shape (0 0 ) The full automorphism group of this code is 3A 6, obtained by adjoining the map (ab cd ef ) (a, b cf de) We can extend to 3S 6 by mapping (ab cd ef ) (ab cd f e) The binary Golay code Some Golay code words Take 24 coordinates (for a vector space over F 2 ), corresponding to 0,,, in each of the six coordinates of the hexacode: 0 0 0 0 0 0 For each column, add up the (entry 0 or ) (row label 0,, or ) These six sums must form a hexacode word. The parity of each column equals the parity of the top row (even or odd). 0 0

The weight distribution For each of the 64 hexacode words, there are 2 5 even and 2 5 odd Golay codewords, making 2 2 = 4096 altogether. The 32 odd words are 6 of weight 8, 20 of weight 2 and 6 of weight 6. The 32 even words are For the hexacode word 000000, one word each of weight 0 or 24, and 5 words each of weight 8 or 6 For each of the 45 hexacode words of weight 4, 8 Golay code words of each weight 8 or 6, and 6 of weight 2. For each of the 8 hexacode words of weight 6, we get all 32 Golay code words of weight 2. So the full weight distribution is 0 8 759 2 2576 6 759 24. The cosets of the code The Golay code is a vector subspace of dimension 2 in F 2 24, so has 2 2 = 4096 cosets. The sum (= difference) of two representatives of the same coset is in the code, so has weight at least 8. The identity coset has representative (0 24 ) = (000000000000000000000000) There are 24 cosets with representative of shape (, 0 23 ). There are 24.23/2 = 276 cosets with representatives of shape ( 2, 0 22 ). There are 24.23.22/3.2 = 2024 cosets with representatives ( 3, 0 2 ). The sextets The group 2 6 3S 6 The 2 6 consists of adding a hexacode word to the labels on the rows. The 3S 6 arises from automorphisms of the hexacode. This leaves exactly 77 = 24.23.22.2/4.3.2.6 more cosets, so each one has six representatives of shape ( 4, 0 20 ) Each of these 77 cosets defines a sextet, that is a partition of the 24 coordinates into 6 sets of 4. 0 0 0 e a b c d f a b c d f e

Generating M 24 M 24 may be defined as the automorphism group of the Golay code, that is the set of permutations of 24 points which preserve the set of codewords. Besides the subgroup 2 6 3S 6, we can show that the permutation preserves the code. We can show that M 24 acts transitively on the 77 sextets, and that the stabilizer of a sextet is 2 6 3S 6 Therefore M 24 = 244823040 = 2 0.3 3.5.7..23. Properties of M 24 M 24 acts 5-transitively on the 24 points: Every set of 4 points is a part of a sextet. The sextet stabilizer is transitive on the 6 parts (tetrads), and a full S 4 of permutations of one part can be achieved. Fixing the four points in the first part is a group 2 4 A 5 which is transitive on the remaining 20 points. M 24 is simple: can be proved using Iwasawa s Lemma applied to the primitive action on the sextets. Subgroups of M 24, I Subgroups of M 24, II The stabilizer of a point has index 24, and is called M 23. It has order 0200960. The stabilizer of two points is M 22, and has order 443520. The stabilizer of three points has order 2060, and is in fact PSL 3 (4), acting 2-transitively on the 4 2 + 4 + = (4 3 )/(4 ) points of the projective plane of order 4. The stabilizer of an octad (a codeword of weight 8) has the shape 2 4 A 8, acting as A 8 on the 8 coordinates, and as AGL 4 (2) on the remaining 6. The stabilizer of a dodecad (a codeword of weight 2) has order M 24 /2576 = 95040 and is called M 2. It acts 5-transitively on the 2 points in the dodecad. The stabilizer of a point in M 2 is called M and has order 7920. The five groups M, M 2, M 22, M 23 and M 24 are called the Mathieu groups, after Mathieu who discovered them in the 860s and 870s.

COFFEE BREAK THE LEECH LATTICE AND THE CONWAY GROUPS The Leech lattice The group 2 2 M 24 Consider the set of integer vectors (x,..., x 24 ) Z 24 which satisfy x i m mod 2, that is either all the coordinates are even, or they are all odd; 24 i= x i 4m mod 8, and for each k, the set {i x i k mod 4} is in the Golay code. This set of vectors, with the inner product (x i ).(y i ) = 24 8 i= x iy i, is called the Leech lattice. The lattice is clearly invariant under the group M 24 acting by permuting the coordinates. It is also invariant under changing sign on the coordinates corresponding to a Golay code word. These sign changes form an elementary abelian group of order 2 2, that is a direct product of 2 copies of C 2. This is normalised by M 24. Together these generate a group of shape 2 2 M 24 of order 2 2 M 24 = 4096.244823040 = 0027957840.

The minimal vectors The minimal vectors, II If the coordinates are odd, assume that all coordinates are mod 4. Since 24 0 mod 8, the smallest norm is achieved when the vector has shape ( 3, 23 ). The norm is then (9 + 23) = 4. 8 If the coordinates are even, and some are 2 mod 4, then at least 8 of them are 2 mod 4, and the minimal norm is achieved with vectors of shape (2 8, 0 6 ). Otherwise they are all divisible by 4, and the minimal norm is achieved with vectors of shape (4 2, 0 22 ). Under the action of the group 2 2 M 24, there are 24.2 2 = 98304 images of the vector ( 3, 23 ). For each of the 759 octads, there are 2 7 vectors of shape (±2 8, 0 6 ), making 2 7.759 = 9752 in all. There are (24.23/2).2 2 = 04 vectors of shape (±4 2, 0 22 ). So in total there are 98304 + 9752 + 04 = 96560 vectors of norm 4 in the Leech lattice. Vectors of norms 6 and 8 Similar arguments can be used to classify the vectors of norms 6 and 8. The 677320 vectors of norm 6 are 2.2576 of shape (±2 2, 0 2 ) 24.2 2 of shape (5, 23 ) (24.23.22/3.2).2 2 of shape ( 3 3, 2 ) 759.6.2 8 of shape (2 7, 2, 4) There are 398034000 vectors of norm 8. Congruence classes modulo 2 Define two vectors in the Leech lattice to be congruent mod 2 if their difference is twice a Leech lattice vector. Every vector is congruent to its negative. If x is congruent to y, we may assume x.y is positive so that 6 (x y).(x y) x.x + y.y Therefore the only non-trivial congruences between vectors of norm 8 are between perpendicular vectors of norm 8. This accounts for at least + 96560/2 + 677320/2 + 398034000/48 congruence classes. But this = 2 24, so these are all.

Crosses In particular, each congruence class of norm 8 vectors consists of 24 pairs of mutually orthogonal vectors, called a cross. Thus there are 8292375 crosses. The stabilizer of a cross (or coordinate frame) is 2 2 M 24 By verifying that the linear map which acts on each column as 2 preserves the lattice, we can show that the automorphism group of the lattice acts transitively on the crosses. Conway s group Hence this automorphism group has order 83555363086720000. It has a centre of order 2, consisting of the scalars ±. Quotienting out the centre gives a simple group Co Conway s first group of order 457776806543360000. Using the primitive action on the 8292375 crosses, and Iwasawa s Lemma, we can easily prove that Co is simple. Subgroups of the Conway group The automorphism group is transitive on the norm 4 vectors, and the stabiliser of a norm 4 vector is Co 2, Conway s second group Similarly, the stabiliser of a norm 6 vector is Co 3, Conway s third group The stabiliser of two norm 4 vectors whose sum has norm 6 is the McLaughlin group McL The stabiliser of two norm 6 vectors whose sum has norm 4 is the Higman Sims group HS THE END