ON CERTAIN OF (2) AND THEIR BRAUER CHARACTER TABLES

A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Science and Engineering

2018

Peter J Neuhaus School of Mathematics Contents

Abstract 5

Declaration 6

Copyright Statement 7

Acknowledgements 8

1 Introduction 9

2 Background Material 16 2.1 MaximalSubgroupsofAlgebraicGroups ...... 19

3 Preliminary Results 23

3.1 E8(2)...... 23 3.1.1 Maximal Subgroups ...... 23

3.1.2 Elements of E8(2) ...... 26 3.2 Brauer Characters ...... 32 3.2.1 Conway Polynomials ...... 33 3.2.2 Brauer Character of L(G)...... 34 3.2.3 Feasible Decompositions ...... 35 3.3 Irreducible Modules of Groups of Lie Type ...... 36 3.3.1 DimensionsofHighestWeightModules ...... 38 3.4 Determining Maximality ...... 39

4 Proof of Theorems 1.2 and 1.3 45

4.1 L2(7)...... 45

2 4.2 L2(11) ...... 46

4.3 L2(13) ...... 46

4.4 L2(17) ...... 46

4.5 L2(25) ...... 47

4.6 L2(27) ...... 48

4.7 L4(3)...... 49

4.8 U3(3)...... 49

4.9 G2(3)...... 49

4.10 M11 ...... 49

4.11 M12 ...... 50

4.12 L3(8)...... 50

4.13 F4(2)...... 50 2 4.14 F4(2)0 ...... 50 3 4.15 D4(2)...... 51

4.16 L3(3)...... 51 4.16.1 Case (ii) ...... 51 4.16.2 Case (i) ...... 52

4.17 L3(4)...... 56

4.18 U3(8)...... 57 4.18.1 Case (ii) ...... 57 4.18.2 Case (i) ...... 58

4.19 U3(16) ...... 61

5 Proof of Theorem 1.4 62 5.1 Methodology ...... 62

5.2 L2(128) ...... 66

5.3 L2(32) ...... 67 5.3.1 P(1234) ...... 67 5.3.2 P(1345) ...... 68 5.3.3 P(2456) ...... 68 5.3.4 P(3456) ...... 69 5.3.5 P(4567) ...... 69

3 5.3.6 P(5678) ...... 70

6 Brauer Character Tables 71

7 Further Work 123

Bibliography 124

APrograms 130 A.1 FeasibleCharacterCode ...... 130 A.2 IndecomposableModuleCode ...... 135

N A.3 L2(2 )code...... 138

B Supplementary Code 149

B.1 E8(2) setup ...... 149

4 The University of Manchester

Peter J Neuhaus Doctor of Philosophy On Certain Subgroups of E8(2) and their Brauer Character Tables December 4, 2018

For the exceptional of Lie type E8(2) a maximal is either one of a known set or it is almost simple. In this thesis we compile a complete list of almost simple groups that may have a maximal embedding in E8(2) and in many cases it is proved that such an embedding does not exist. For the groups L2(32) and L2(128) we go further and find all conjugacy classes of their embeddings in E8(2). Extensive use is made of the theory of Brauer characters and modular representation theory, and as such include Brauer character tables in characteristic 2 for many small rank simple groups. The work in this thesis relies heavily on the computer package Magma and includes a collection of useful procedures for computational . The results presented are the author’s contribution to the ongoing attempt to classify the maximal subgroups of E8(2).

5 Declaration

No portion of the work referred to in the thesis has been submitted in support of an application for another degree or qualification of this or any other university or other institute of learning.

6 Copyright Statement

i. The author of this thesis (including any appendices and/or schedules to this thesis) owns certain copyright or related rights in it (the “Copyright”) and s/he has given The University of Manchester certain rights to use such Copyright, including for administrative purposes.

ii. Copies of this thesis, either in full or in extracts and whether in hard or electronic copy, may be made only in accordance with the Copyright, Designs and Patents Act 1988 (as amended) and regulations issued under it or, where appropriate, in accordance with licensing agreements which the University has from time to time. This page must form part of any such copies made. iii. The ownership of certain Copyright, patents, designs, trade marks and other intel- lectual property (the “Intellectual Property”) and any reproductions of copyright works in the thesis, for example graphs and tables (“Reproductions”), which may be described in this thesis, may not be owned by the author and may be owned by third parties. Such Intellectual Property and Reproductions cannot and must not be made available for use without the prior written permission of the owner(s) of the relevant Intellectual Property and/or Reproductions. iv. Further information on the conditions under which disclosure, publication and com- mercialisation of this thesis, the Copyright and any Intellectual Property and/or Reproductions described in it may take place is available in the University IP Policy (see http://documents.manchester.ac.uk/DocuInfo.aspx?DocID=487), in any rele- vant Thesis restriction declarations deposited in the University Library, The Univer- sity Library’s regulations (see http://www.manchester.ac.uk/library/aboutus/regul- ations) and in The University’s Policy on Presentation of Theses.

7 Acknowledgements

First and foremost, I would like to thank Peter Rowley, for his guidance throughout my time at Manchester, his invaluable expertise and mathematical advice, as well as his patience and understanding. Without him this thesis would certainly not exist.

I also wish to thank the other members of my research group; John Ballantyne for sharing his expertise in Magma so clearly, Jamie Phillips and David Ward for showing me the ropes and making me feel so welcome when I was just starting, and Alexander McGaw, for being a constant friend throughout, willing to be a sounding board for new ideas and frustrations alike.

IwouldliketothankMatthewGwynneforhisfriendshipandhelpinnavigating the stresses that a PhD entails.

Finally, I would like to thank my parents, without whose unwavering support and belief I could not have achieved any of what I have done.

8 Chapter 1

Introduction

When studying finite groups and their properties there is a natural desire to obtain classifications of the objects in question, and in the case of simplicity this has been achieved by the classification of finite simple groups. This remarkable result was the work of countless mathematicians over more than a century, starting with Galois in 1830 and generally being considered to be finally complete with two volumes by As- chbacher and Smith in 2004 [5]. Whilst this classification provides constructions for all the groups, for example see Wilson [58], there is still much that is not known about their properties.

For almost as long as they have been studied, the structure of the maximal sub- groups of these finite simple groups has been of great interest, and whilst a complete classification has not been achieved much progress has been made. In 1901 the max-

a imal subgroups of L2(q), for q = p a power of a prime, were classified by Dickson

[20], and this was followed up by the classification of maximal subgroups for L3(q) by Mitchell [53], for q odd, and Hartley [29], for q even. Since then, after extensive study, the maximal subgroups of the finite simple groups have either been classified or categorised with the exception of the Monster group.

The categorising of maximal subgroups was first achieved by the O’Nan-Scott the- orem, initially proved independently by O’Nan and Scott; however, due to the impor- tance of the result, there are now many proofs, for example by Aschbacher [3]. In this theorem it is proved that any maximal subgroup of a is one

9 CHAPTER 1. INTRODUCTION 10 of five well understood types, or is almost simple. This is a common theme in the classification of maximal subgroups and is mirrored by Liebeck, Praeger and Saxl in their classification of the maximal subgroups of the finite (simple) alternating groups [40]. In 1984 Aschbacher [2] proved a similar theorem for the finite simple groups of classical Lie type.

The sporadic simple groups can have full classifications as they are finite in number. They have been tackled in a more piecemeal fashion across many papers by several authors, although the majority can be attributed to Wilson. For the classifications of maximal subgroups of sporadic simple groups one can read the following papers; M24

[15] [19], J1 [32], J2 [25], J3 [26], J4 [38], Co1 [59], Co2 [60], Co3 and McL [24], Fi22

[61], Fi23 [37], Fi240 [47], HS [52], He [13], Ru [62], Suz [63], O0N [64], HN [54], Ly [65], Th [46] and B the baby monster group [66]. The last of these is of particular interest as it was achieved using a 4370-dimensional GF (2)B-module. There are five sporadic groups not yet covered, M11, M12, M22, M23 and M, the monster group. For the first four of these there seems to be no paper giving their maximal subgroups, although the information is well known and can be found easily using modern com- putational methods. The last, M, is the only for which the maximal subgroups are as yet unknown, with the current state of a↵airs described by Wilson [67].

This leaves just the groups of exceptional Lie type to cover, and here progress is more recent. Extensive work by Liebeck and Seitz [44], among others, has yielded a categorisation of the maximal subgroups of the simple exceptional groups of Lie type.

Maximal subgroups for G2(q)wereclassifiedin1981byCooperstein[17]forq even and in 1988 by Kleidman [35] for q odd. The only other families of exceptional groups

3 whose maximal subgroups have been classified are D4(q), also by Kleidman [36], and

F4(q)forqnotapowerof2or3byMagaard[51].Thereareahandfulofcomparatively small exceptional groups outside of these families for which the maximal subgroups have been classified, the first of which is F4(2) by Norton and Wilson in 1989 [55].

Kleidman and Wilson classified the maximal subgroups of E6(2) in the same year [39] 2 and Wilson published a proof for E6(2) [68], although the classification had been CHAPTER 1. INTRODUCTION 11

known for some time. Finally, the maximal subgroups of E7(2) were classified in 2015 by Ballantyne, Bates and Rowley [8].

This list of finite simple groups whose maximal subgroups have been classified has aparticulargroupwhichisconspicuousbyitsabsence,namelyE8(2). E8(2) is the only exceptional defined over GF (2) without a classification of max- imal subgroups, a gap that will hopefully be filled by an as yet unpublished paper of Aubad, Ballantyne, McGaw, Neuhaus, Rowley and Ward [6]. This thesis details the contribution of the author as part of that work to determine non-maximality of cer- tain subgroups of E8(2), as well as determining the conjugacy classes of some of those subgroups. Much of the work done has been computer assisted, making extensive use of the functionality provided by the computer package Magma.

In Chapter 2 we cover the background material required for the work described in this thesis. This starts with a general definition of algebraic groups and some of their properties, including defining the Lie algebra of an , maximal tori and through them the root system and associated weights. We also include the Frobenius morphisms necessary for the definition of the Chevalley groups as our context for E8(2).

Chapter 2 continues by exploring work of Liebeck and Seitz in first classifying the maximal subgroups of positive dimension in exceptional algebraic groups and then in producing a list of groups in which any maximal subgroup of a simple exceptional group of Lie type must be contained. The chapter ends with a summary of this work in the form of Theorem 2.3, a very important result for all that follows as it guides our analysis and makes a case by case approach to the problem possible.

In the four sections of Chapter 3 we give some preliminary results which are to be of use in this thesis. In Section 3.1 we turn to E8(2) and collect a variety of lists and theorems detailing the information already known about E8(2) which we will use in our analysis. We use Theorem 2.3 to produce an exhaustive list of maximal closed -stable subgroups of positive dimension along with a list, Tables 3.1.1 and 3.1.2, of those almost simple groups whose potential embeddings into E8(2) forms the focus of CHAPTER 1. INTRODUCTION 12 our study. Also included here are several preliminary results that eliminate many of the groups within that list for which there are no embeddings.

We then turn to what is known about the conjugacy classes of E8(2). The cen- tralisers and fixed point dimensions of the involutions and semisimple elements were found by Rowley et al. [7], and we detail those results in Table 3.1.4. This leads to another set of groups from Tables 3.1.1 and 3.1.2 for which it is proven there can be no embeddings of them into E8(2) by consideration of element orders and centraliser sizes. A brief summary of some useful procedures is also included here.

In Section 3.2 we describe some of the theory of modular representations and Brauer characters. This will be of great importance in the calculations detailed in Chapter 6. To complement this we give some definitions of feasible decompositions and fusion patterns as well as much of the Brauer character of E8(2) on its Lie algebra L(G). In Section 3.3 we show how similar calculations can be done for the relevant groups from Tables 3.1.1 and 3.1.2. This requires the theory of dominant weights and is based on work by Steinberg [57] and L¨ubeck [49]. We also include here the final part of the proof of Theorem 1.1.

Finally, in Section 3.4 we give a method developed by Alistair Litterick and David Craven [48] [18] for determining maximality in groups of Lie type. This method builds from a very important result, Lemma 3.2, by Seitz [56], which allows us to often re- duce the problem to one of finding fixed vectors of L(G). Chapter 3 ends with a set of lemmas needed for the implementation of the method.

Chapters 4 and 5 contain the main results of the thesis. Chapter 4 details the results of Theorems 1.2 and 1.3 on a case-by-case basis. The methods used in Chapter 4 are mainly those detailed in Chapter 3 and where exceptions occur the method is described in situ. The groups in Theorem 1.4, are the focus of Chapter 5 in which we describe the method and Magma functionality required for their analysis. It then proceeds to detail the results of Theorem 1.4 also on a case by case basis. CHAPTER 1. INTRODUCTION 13

In Chapter 6 we give, for all groups we have encountered, the Brauer character tables along with all feasible decompositions of L(G) and the dimension of H1(S, V ) for their irreducible modules. The tables in this chapter are consistent with the atlas [16] except where noted and have been calculated using the methods from Chapter 3Section3.3.TherearealsotwoappendicescontainingMagma code used for the calculations in this thesis.

Our results can be described by the following four theorems, each summarising a collection of groups from Tables 3.1.1 and 3.1.2 and what is known of their embeddings in E8(2).

Theorem 1.1. Let G = E (2) and H G. Then H cannot be isomorphic to any of ⇠ 8  the following groups:

L2(29) L2(37) L2(41) L2(49) L2(61)

L2(256) L2(512) L2(1024) L3(16) L4(5)

L4(8) U4(8) U3(16) G2(8) F4(4) 2 3 F4(8) F4(8) D4(8) Sp6(8) Sp8(4) + + Sp8(8) ⌦8 (4) ⌦8 (8) ⌦8(8) Sz(32) Sz(128) Sz(512).

Theorem 1.2. Let G = E (2) and H G such that H is maximal. Then H cannot ⇠ 8  be isomorphic to any of the following groups:

L2(7) L2(13) L2(17) L2(27) L4(3)

L3(8) U3(8) G2(3) U3(3) F4(2) 2 3 F4(2)0 D4(2) M11 M12.

Theorem 1.3. Let G = E (2) and H G such that either H = L (3) or H = L (4). ⇠ 8  ⇠ 3 ⇠ 3 Then up to isomorphism the restriction M = L(G) is known and has a direct sum |H decomposition of one of the following forms: CHAPTER 1. INTRODUCTION 14

H = L (3) M = 144 104 ⇠ 3 ⇠ d

H = L (4) M = 20 20 ⇠ 3 ⇠ 4 5 5 5 M = 20 36 ⇠ b 5 5 5 M = 56 . ⇠ b 5 5 5

The modules given here are denoted by their dimension if they are not irreducible and by their name in the relevant character table if they are. Their structure shall be explained in Chapter 4.

Theorem 1.4. Let G ⇠= E8(2) and M either L2(32) or L2(128). Then there is no H G with H maximal such that H = M. Furthermore there are the following upper  ⇠ bounds for the number of conjugacy classes, nc, of subgroups H ⇠= M.

L (32) nc 5, 200, 000 2  L (128) nc 8. 2 

We note that the upper bounds given in Theorem 1.4 are not very close upper bounds; however, it is not unreasonable to hope that future work will improve these significantly. We also note that all the results of Theorems 1.1-1.4 concern the simple groups in Tables 3.1.1 and 3.1.2 but take no account of their automorphism groups. This will be dealt with in [6] and so is beyond the scope of this thesis. CHAPTER 1. INTRODUCTION 15 Index of Symbols

Throughout this thesis we use atlas notation for the simple groups with the exception that we use ⌦n±(q)forthesimpleorthogonalgroups.

Symbol Meaning

VX (), Irreducible KX-module of high weight (X reductive) L(X) Lie algebra of X (X an arbitrary algebraic group) V W Direct sum of V and W V + W Module having the same factors as V W X/Y Quotient of X by Y V V ... V Module with socle series V , V /V , ..., V /.../V /V 1| 2| | n 1 2 1 n 2 1 nV V + V + + V (n times) ··· V ⇤ Dual module Hom(V,K) V Restriction of V to the subgroup H |H G Fixed points of in G Z(G) Center of G

p O 0 (G) Minimal of p0 index (G finite) G0 Connected component of the algebraic group G

F ⇤(H) Fitting subgroup of H GF (q) Finite field of q elements

P (i) Projective cover of the module i Chapter 2

Background Material

Before we start looking at E8(2) specifically, we first recall some general theory of ane algebraic groups; for detailed coverage of this material we suggest reference materials of Humphreys [30] and Borovik[9]. For this section K denotes an algebraically closed field of characteristic p 0.

An ane algebraic group over K is a subgroup of GLn(K)forsomeintegern>0 defined by zeros of a collection of finitely many polynomials in the matrix coordinates x , i.e. closed in the Zariski topology. It inherits many properties from GL (K) { ij} n including the Zariski topology and a coordinate ring K[G] as a quotient of K[ x ]by { ij} the ideal of functions vanishing on G. If G is an irreducible variety the we can define the dimension of G to be the transcendence degree of K[G]:G.

We are frequently interested in closed subgroups of an algebraic group G and there are many obvious classes of these [30, 8]. The and of an algebraic § homomorphism are closed subgroups, where an algebraic homomorphism is a that is also a morphism of varieties. The stabiliser of a vector or sub- space in a rational G-module is a closed subgroup; a rational G-module, V , being a module such that the representation G GL(V ) is an algebraic homomorphism. An ! algebraic group is unipotent if all its elements are unipotent, which is equivalent to it being isomorphic to a group of upper triangular matrices. A semisimple (or reduc- tive) algebraic group is one for which the radical R(G)(orunipotentradicalRu(G)) is trivial. These radicals are the unique largest normal, connected, soluble, (unipotent)

16 CHAPTER 2. BACKGROUND MATERIAL 17 subgroup of G.

Another important property of an algebraic group is its Lie algebra L(G). Many algebraic groups were first studied as the automorphism groups of semisimple Lie alge- bras, see Carter [14]. The study of semisimple algebraic groups and their Lie mirrors that of the semisimple Lie algebras themselves. We can view L(G)asthe space of left-invariant derivations of K[G], which leads to the characterisation of L(G) as the adjoint module, a rational G-module with the same dimension as G. Just as in Carter [14, p.34], this Lie algebra comes equipped with a symmetric bilinear form called the Killing form.

There are two further very important closed subgroups to introduce: a maximal torus T and a corresponding Borel subgroup B. A torus is a connected algebraic group consisting of semisimple elements and it is simultaneously diagonalisable [30, 15] and § therefore isomorphic to a product of the K⇤.Amaximaltorusis atorusthatismaximalinthesetofalltori.IfT is a fixed maximal torus in G then every semisimple element of G is conjugate to an element in T [28], and from this there are several useful consequences. We get that all maximal tori in G are conjugate and have the same dimension, which defines the rank of G. For a given choice of maximal torus T we also get the Weyl group W = NG(T )/T . A Borel subgroup is a maximal closed, connected, solvable algebraic subgroup of G.

In Carter’s exposition of groups of Lie type [14] the root system is inherited from the Lie algebra of a group. An abstract root system E, for E afinite-dimensional ⇢ Euclidian vector space, is a finite set of vectors satisfying the following four conditions: i) is a spanning set for E, ii) for ↵, ↵ then = 1, iii) for any ↵, the 2 ± 2 reflection ():=–2((↵, )/(↵, ↵))↵ and iv) for any ↵, the number ↵ 2 2 ↵, := 2(↵, )/(↵, ↵) Z. Sometimes condition iv) is not required and a root sys- h i 2 tem that does satisfy it is known as crystallographic. A root system can be defined for any reductive (and hence semisimple) algebraic group in such a way that in con- curs with the root system given by Carter wherever relevant. To do this we need the concept of a weight of a module. CHAPTER 2. BACKGROUND MATERIAL 18

Let G be a reductive algebraic group over K, T amaximaltorusofG and the character group of T ; X(T ) ⇠= Hom(T,K⇤). For any G-module V the restriction of V to T can be decomposed into subspaces called weight spaces. These weight spaces are defined for some X(T )asV := v V : t v = (t)v for all t T .A 2 { 2 · 2 } weight, ,ofV (with respect to T )isanelementofX(T )suchthatV = 0 and the 6 { } multiplicity of is the dimension of V.

We now get our required root system as the non-zero weights of the Lie algebra

L(G). For a root i and its weight space Vi we can define a root subgroup, Ui ,asthe unique connected unipotent subgroup of G normalised by T such that L(Ui )=Vi . For any maximal torus T and choice of simple roots there is a unique Borel subgroup generated by T and the root subgroups U for +. i i 2

A simple algebraic group is a semisimple algebraic group whose root system is ir- reducible. The irreducible root systems were classified by Dynkin [21] and when G is semisimple Z(G)isfiniteandG/Z(G) is determined up to isomorphism by the root system of G. There are two (sometimes isomorphic) important semisimple algebraic groups for each irreducible Dynkin diagram, the adjoint and simply-connected groups. These are defined by the character group of their torus X(T ). Given a root system for G we have the Euclidean space E = X(T ) R in which there exists a ⌦Z of weights ⇤ defined as x E such that x, ↵ Z for all ↵ +. We then have 2 h i2 2 Z X(T ) ⇤ and ⇤/Z is finite. The simply-connected and adjoint subgroups are   the extremes of these inclusions, where G is simply-connected when X(T )=⇤ and adjoint when X(T )=Z.

If G is a semisimple algebraic group and ' an algebraic homomorphism from G G ! that is an automorphism of G as an abstract group, then there are two types of pos-

1 sibilities for '. If ' is also an algebraic homomorphism then it is known as an algebraic automorphism. Otherwise by Steinburg [57] the fixed-point subgroup G' is finite and ' is known as a Frobenius morphism. Inner automorphisms are always al- gebraic automorphisms, as are graph automorphisms, defined as those automorphisms CHAPTER 2. BACKGROUND MATERIAL 19 induced from symmetries of the Dynkin diagram. Turning our attention to Frobenius morphisms, they exist, induced by field automorphisms in positive characteristic p for each power q of p defined by sending K x xk. When is a Frobenius morphism 3 ! the fixed-point subgroup G is a group of Lie type and when G is simple of adjoint

p0 type then O (G) is usually simple. We denote by Aut(G)thegroupgeneratedby the inner automorphisms of G along with graph and field morphisms.

2.1 Maximal Subgroups of Algebraic Groups

The study of the subgroup structure of a finite algebraic group G G splits into  two types; Lie primitive where H G is contained in no proper positive-dimensional  subgroup of G, and non Lie primitive otherwise. Knowledge of the maximal positive dimensional subgroups of arbitrary algebraic groups is therefore useful to the study of finite subgroups.

A classification of the subgroups of positive dimension started with Dynkin who classified the maximal connected subgroups of a classical group [22]. He also gave a classification of the maximal Lie subalgebras of exceptional complex Lie algebras [23]. This, combined with Humphrey’s result [30, 13] that in characteristic zero there is a § 1-1 correspondence between the Lie subalgebras of L(G)andtheconnectedsubgroups of an algebraic group, gives an equivalent result for exceptional algebraic groups. Since then work by Seitz and Liebeck [56] [42] [43] has extended this classification to positive characteristic and we now have a classification of maximal (not necessarily connected) subgroups of algebraic groups in any characteristic.

Theorem 2.1 (Liebeck Seitz). Let G be an exceptional algebraic group and G G  1  Aut(G). Let M be a proper closed connected subgroup of G which is maximal among proper closed connected NG1 (M)-invarient subgroups of G. Then one of the following holds:

(i) M is either parabolic or of maximal rank;

(ii) G = E , p =2and M =(22 D ).Sym(3); 7 6 ⇥ 4 CHAPTER 2. BACKGROUND MATERIAL 20

(iii) G = E , p =2, 3, 5 and M = A Sym(5); 8 6 1 ⇥ (iv) The connected component of M, M 0, is as in Table 2.1.1 below.

The subgroups M in (ii), (iii) and (iv) exist, and are unique up to conjugacy in Aut(G) and are maximal in G.

Table 2.1.1

G M 0 simple M 0 not simple

G A (p 7) 2 1 F A (p 13), G (p =7), A G (p =2) 4 1 2 1 2 6 E A (p =2, 3), G (p =7), A G 6 2 6 2 6 2 2 C (p =2),F 4 6 4 E A (2 classes,p 17, 19 resp,), A A (p =2, 3), A G (p =2), 7 1 1 1 6 1 2 6 A (p 5) A F , G C 2 1 4 2 3 E A (3 classes,p 23, 29, 31 resp,), A A (p =2, 3), A G G (p =2), 8 1 1 2 6 1 2 2 6 B (p 5) G F 2 2 4

The maximal parabolic subgroups are well known and Liebeck, Seitz and Saxl [41] give the reductive subgroups of maximal rank, ie those that contain a maximal torus. As any Lie imprimitive subgroup is contained in a subgroup of positive dimension we now know all maximal Lie imprimitive subgroups and can turn our attention to Lie primitive groups. For Lie primitive subgroups less is known; however, Liebeck and Seitz [42], extending an earlier result of Borovik [10], give a reduction theorem that limits the possibilities.

Theorem 2.2 (Liebeck Seitz). Let G be an adjoint simple algebraic group of excep- tional type over K, algebraically closed of characteristic p>0. Let be a Frobenius morphism of G and G be the fixed point group of G under .LetH be a maximal subgroup of G then one of the following holds:

(i) H = M, where M is a maximal -stable closed subgroup of positive dimension in G;

(ii) H is an exotic local subgroup; CHAPTER 2. BACKGROUND MATERIAL 21

(iii) G = E ,p>5 and H =(Alt(5) Alt(6)).22. 8 ⇥ (iv) H is almost simple;

The groups on part (i) are exactly those found in Theorem 2.1 with G = G 1 h i and those in part (ii) are listed by Liebeck and Seitz [44]. They also give two theorems giving the possibilities for part (iv) for when H Lie(p)[42]andH/Lie(p)[45].We 2 2 can now summarise the results of Section 2.1 with the following theorem:

Theorem 2.3 (Liebeck Seitz). Let H be a maximal subgroup of the finite exceptional

a group G over Fq, q = p where p is a prime. Then one of the following holds:

(i) H = M where M is a maximal closed -stable subgroup of positive dimension in G; the possibilities are as follows;

(a) Both M and H are parabolic subgroups;

(b) M is a of maximal rank. The possibilities for M are deter- mined in [41].

(c) G = E , p>2 and H =(22 ⌦+(q).22).Sym(3) or 3D (q).3; 7 ⇥ 8 4 (d) G = E , p>5 and H = PGL (q) Sym(5); 8 2 ⇥

(e) M is as in Table 1 of [44], and H = M as in Table 3 of [44].

(ii) H is of the same type as G;

(iii) H is an exotic local subgroup (see [44]);

(iv) G is of type E , p>5 and H (Alt(5) Alt(6)).22; 8 ⇠ ⇥

(v) F ⇤(H)=H0 is simple, and not in Lie(p): the possibilities for H0 are given up to isomorphism by [45];

1 (vi) F ⇤(H)=H(q ) is simple and in Lie(p); moreover rk(H(q )) rk(G), and one 0 0  2 of the following holds:

(a) q 9; 0  2 (b) H(q0) ⇠= A2(16) or A2(16); CHAPTER 2. BACKGROUND MATERIAL 22

(c) q (2,p 1)u(G) and H(q ) = A (q ), 2B (q ) or 2G (q ), where the 0  0 ⇠ 1 0 2 0 2 0 values of u(G) for each type of exceptional group are as follows:

G G2 F4 E6 E7 E8 u(G) 12 68 124 388 1312

In cases (i) (iv), H is determined up to G -conjugacy. Chapter 3

Preliminary Results

3.1 E8(2)

We now turn to E8(2), the focus of this thesis, and outline the information necessary for the methods used in Chapters 4-6. First we use Theorem 2.1 and the results of [41] to determine the maximal subgroups in E8(2) from Theorem 2.3 part (i), which we shall now refer to as maximal restricted subgroups of positive dimension. We then list all the possibilities for F ⇤(H)fromTheorem2.3parts(v)and(vi).Wemakeextensive use of information about the semisimple elements of E8(2), i.e. those of odd . We therefore include the results of Rowley et al. [7] on the classes of semisimple elements, their centraliser and fixed-point spaces on L(G). The order of E8(2) is as follows

G =2120.313.55.74.112.132.172.19.312.41.43.73.127.151.241.331 | |

3.1.1 Maximal Subgroups

We have the following list of maximal restricted subgroups of positive dimension

(i) Maximal Parabolic Subgroups:

[278]:⌦+ (2) [298] : (Sym(3) L (2)) 14 ⇥ 7 [2106] : (Sym(3) L (2) L (2)) [2104] : (Alt(8) L (2)) ⇥ 3 ⇥ 5 ⇥ 5 [297]:(L (2) ⌦+ (2)) [283] : (Sym(3) E (2)) 3 ⇥ 10 ⇥ 6 92 57 [2 ]:L8(2) [2 ]:E7(2)

23 CHAPTER 3. PRELIMINARY RESULTS 24

(ii) Reductive Subgroups of Maximal Rank:

⌦+ (2) Sym(3) E (2) 16 ⇥ 7 L (2) : 2 3 U (2) : 2 9 · 9 (L (2) E (2)) : 2 3 (U (2) 2 E (2)) : Sym(3) 3 ⇥ 6 · 3 ⇥ 6 2 2 (L5(2)) .4(U5(2)) .4

SU5(4).4 PGU5(4).4 (⌦+(2))2.(Sym(3) 2) ⌦+(4).(Sym(3) 2) 8 ⇥ 8 ⇥ 3 2 3 ( D4(2)) .6 D4(4).6 4 2 4 2 (L3(2)) .GL2(3) [3 ].(U3(2)) .[3 ].GL2(3) 2 (U3(4)) .8 U3(16).8 38.(2.⌦+(2).2) 54.((4 21+4).Alt(6).2) 8 ⇤ 74.(2.(3 U (2))) 112.(5 SL (5)) ⇥ 4 ⇥ 2 132.(12 GL (3)) 312.(5 SL (5)) ⇤ 2 ⇥ 2 151.30 331.30

We now need a list of possibilities for F ⇤(H)givenbyTheorem2.3parts(v)and (vi)

Alt(5 17) L (7) L (11) L (13) L (17) 2 2 2 2 L2(19) L2(25) L2(27) L2(29) L2(31)

L2(37) L2(41) L2(61) L3(3) L3(5)

L4(3) L4(5) PSp4(5) U3(3) G2(3)

M11 M12 J2 J3

Table 3.1.1: Simple groups / Lie(2) 2 CHAPTER 3. PRELIMINARY RESULTS 25

L2(8) L2(16) L2(32) L2(64) L2(128) L2(256) L2(512)

L2(1024) L3(4) L3(8) L3(16) L4(4) L4(8) L5(2)

L5(4) L5(8) U3(4) U3(8) U3(16) U4(2) U4(4)

U4(8) U5(2) U5(4) U5(8) Sp4(4) Sp4(8) Sp6(2)

Sp6(4) Sp6(8) Sp8(2) Sp8(4) Sp8(8) Sz(8) Sz(32) + + + Sz(128) Sz(512) ⌦8 (2) ⌦8 (4) ⌦8 (8) ⌦8(2) ⌦8(4) 3 3 3 ⌦8(8) D4(2) D4(4) D4(8) F4(2) F4(4) F4(8) 2 2 F4(2)0 F4(8)

Table 3.1.2: Simple groups Lie(2) 2

The groups missing from Table 3.1.2 are those isomorphic to some group in Table

3.1.1, i.e. L2(4) ⇠= Alt5, L3(2) ⇠= L2(7) and L4(2) ⇠= Alt8.

Using Lagrange’s theorem we can immediately remove the following groups from consideration.

F ⇤(H) F ⇤(H) Invalid divisor | | 2 L2(29) 2 .3.5.7.29 29 2 2 L2(37) 2 .3 .19.37 37 2 L2(61) 2 .3.5.31.61 61 7 2 6 6 L4(5) 2 .3 .5 .13.31 5 32 5 4 2 Sp8(4) 2 .3 .5 .7.13.17 .257 257 24 4 3 ⌦8(4) 2 .3 .5 .7.13.17.257 257 3 36 6 2 2 2 D4(8) 2 , 3 .7 .19 .37.73 .109 109 48 6 4 2 2 2 F4(4) 2 .3 .5 .7 .13 .17 .241.257 257 72 10 2 4 2 2 2 F4(8) 2 .3 .5 .7 .13 .17.19 .37.73 .109.241 109 2 36 5 2 2 2 F4(8) 2 .3 .5 .7 .13 .19.37.109 109 8 L2(256) 2 .3.5.17.257 257 Sz(128) 214.5.29.113.127 113 Sz(512) 218.5.7.13.37.73.109 37

Table 3.1.3: Invalid group orders CHAPTER 3. PRELIMINARY RESULTS 26

3.1.2 Elements of E8(2)

We now wish to detail various properties of the elements in E8(2) up to conjugacy. We start with the elements of order 2, of which there are four classes.

Proposition 3.1. Let G ⇠= E8(2), V = L(G)andt be an involution in G. Also let

U = Ru(CG(t)) and L be such that CG(t)=UL. Then the possibilities for t are as follows:

(i) If t 2A, then dim(C (t)) = 190, U = 21+56 and L = E (2), 2 V ⇠ ⇠ 7 (ii) If t 2B, then dim(C (t)) = 156, U [278]andL = Sp (2), 2 V ⇠ ⇠ 12 (iii) If t 2C, then dim(C (t)) = 138, U [281]andL = Sym(3) F (2), 2 V ⇠ ⇠ ⇥ 4 (iv) If t 2D, then dim(C (t)) = 128, U [284]andL = Sp (2). 2 V ⇠ ⇠ 8

Proof. For the shape of CG(t) see Aschbacher, Seitz [4]. The dimension of CV (t)can be calculated directly in Magma.

We now consider the semisimple elements of E8(2). Table 3.1.4 contains the results of [7] in which the semisimple conjugacy classes of E8(2) are identified with their corresponding number in L¨ubeck’s ordering from [50] where much of the data was determined. It also contains the shape and size of the centraliser of the element, as well as its fixed space dimension and the class of its powers. CHAPTER 3. PRELIMINARY RESULTS 27 ------3C 3C 3C 3C 3B,5B 3B,5A 3B,5A 3C,5A 3D,5B 3A,5A 3D,5A Powers )) x ( V 92 86 80 68 48 80 38 48 34 30 28 28 32 20 48 34 28 26 24 20 16 32 16 14 C 248 134 dim( 127 · 73 · 43 · 19 73 43 43 31 · · · · (2). 31 · 8 · 17 41 31 19 31 E 17 17 31 · · 2 · · · 17 · · · 2 17 2 · 2 17 2 13 · 7 17 13 13 11 17 17 19 13 17 11 19 13 13 11 17 · · 11 · 3 · · · · · · 13 7 · · · · · · 13 · · · 17 | · | 5 19 7 2 · · 4 2 2 ) · · 3 2 2 5 7 · 7 7 · · 5 11 7 7 5 5 2 13 2 x 13 11 5 5 7 17 · · 11 · · 5 · 6 · 4 · · · · ( (2) 5 · 5 5 · · · · · · 11 · · 8 7 3 8 2 3 3 6 · 2 G · · 5 7 5 6 5 4 2 2 · 4 7 3 3 · 5 5 · 3 7 7 3 3 3 3 3 E 5 6 4 7 3 3 3 C 3 · 13 · · 2 | · · · · 8 · | · 3 · · · · · 3 3 · · · · · · 7 2 2 8 6 2 9 4 2 4 · · 2 2 11 10 6 6 4 · 5 3 3 15 13 10 10 2 5 5 2 12 3 5 2 2 2 2 2 · 3 · · 2 2 2 2 11 · · 13 12 2 · · 5 · 2 2 6 12 6 · 20 20 13 3 3 20 3 3 2 2 3 7 · 2 · · 10 · · 3 30 2 36 36 · 39 2 5 2 2 2 · 42 2 12 3 · 63 2 3 . (2) (2) (8) (2) 4 (2) (2) (2) 5 3 4 4 4 (2) 8 D (2)) U U L 3 U 3 D 3 ⌦ (2) (2) 3 (2) (2) (4) (2) (4) (2) (2) (2) ) 4 ⇥ ⇥ ⇥ U (2) (2) (16) (16) (2) ⇥ 5 3 5 3 ⇥ 8 + 10 7 6 x 2 2 9 ⇥ (4) 14 12 10 ⇥ D ( U U U U (2) 5 ⇥ ⌦ ⌦ U L L 3 E E PGU 8 ⌦ ⌦ ⌦ G (2) · (4) :2 3 ⇥ ⇥ ⇥ ⇥ 2 ⇥ E 3 ⇥ (2) ⇥ ⇥ ⇥ C ⇥ ⇥ ⇥ SU ⇥ ⇥ ⇥ (2) 2 3 L 3 6 3 7 3 ⇥ 3 5 9 11 13 15 15 L 17 GU 15 Sym(3) Sym(3) 15 17 13 Sym(3) E ⇥ ⇥ 2 ⇥ 19 ⇥ ⇥ ⇥ ( ⇥ . 5 15 7 5 9 9 3 9 Table 3.1.4: Conjugacy classes of semisimple elements of 1 294 376 147 258 480 247 441 516 560 656 580 366 679 712 709 540 636 686 621 600 706 695 738 693 823 ¨bc Number L¨ubeck A A A A F C G E B B D A A A A A C C B B B B D D AB CD 1 3 5 7 9 3 9 3 5 7 9 3 9 11 13 15 19 15 15 15 15 13 15 15 17 17 Conjugacy Class CHAPTER 3. PRELIMINARY RESULTS 28 - - - - 3B,7B 3C,7B 3A,7B 3B,7A 3A,7B 3C,7A 3D,7B 3A,7A 5A,7A Powers 3B,13B 3B,11A 3C,11A 3C,13A 3A,11A 3A,13A 3D,11A 3B,17AB 3C,17AB 3A,17AB 3D,17CD 3C,9C,5A,15D 3C,9A,5A,15D 3C,9A,5A,15D )) x ( V 8 8 8 8 38 32 32 26 20 20 14 14 28 20 16 14 12 20 14 14 10 20 12 10 20 14 14 C dim( 2 31 17 17 31 2 · · 7 7 13 · · 7 11 13 17 · · 3 2 2 2 · 3 2 7 | · · · · 7 7 7 5 5 11 11 11 13 7 17 7 7 7 2 2 3 ) 43 · 13 17 · · · · · · · · · · · · · · 5 5 5 5 7 5 7 · x 2 5 · · 41 · · · 4 5 4 4 4 · · · 5 5 4 4 4 · ( 5 5 5 5 2 3 · 3 3 3 3 3 3 3 3 3 5 3 5 6 4 4 · G 5 4 3 · · · 5 31 3 · · · · · · · · · · · · · 3 3 3 3 3 5 3 3 · 3 5 5 2 C 3 · · · 6 6 3 2 | · · · 4 3 2 3 3 · 2 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 9 6 6 · 6 4 3 · · · 12 2 2 2 2 2 2 6 2 15 12 10 2 2 2 2 2 (8) 2 (8) (4)) : 3 : 2Alt(4) 2 3 L Alt(5) (8) : 2Alt(4) L L 2 (2) (2) (2) ⇥ (2) (2) (2) (2) (2) (2) 3 ⇥ ) 1+2 + 4 L ⇥ Alt(5) 6 5 4 4 4 4 8 ⇥ 3 Sym(3) x : 2Alt(4) : 2Alt(4) : 2Alt(4) 2 1+2 + Sym(3) D ( U U L L L L 8 ⌦ ⇥ Sym(3) 3 3 ⇥ GU ⇥ G ⇥ 31 195 205 255 (2) ⇥ 3 Q ⇥ ⇥ ⇥ ⇥ ⇥ ⇥ 3 3 ⇥ ⇥ ⇥ 1+2 + 1+2 + 1+2 + C 3 ⇥ ⇥ : 3 3 3 3 L ⇥ ⇥ 2 Sym(3) 33 35 21 31 45 51 ⇥ 21 Sym(3) ⇥ 21 17 (2) ⇥ ⇥ ⇥ ⇥ 129 (3 21 3 ⇥ 45 . ⇥ 45 33 3 L Sym(3) 21 33 13 21 13 51 ⇥ ⇥ ⇥ 7 7 11 610 720 728 469 594 697 760 826 672 857 768 748 811 790 778 762 820 872 864 837 773 798 853 783 764 832 870 ¨bc Number L¨ubeck A A A A F F C G C C E E B B B D D H AB AB AB EF CD CD GH ABC ABC 21 35 39 45 21 33 21 21 39 45 21 33 21 39 45 21 31 21 33 41 51 51 33 51 51 31 43 Conjugacy Class CHAPTER 3. PRELIMINARY RESULTS 29 - - Powers 5B,13B 5A,13B 7B,13A 3C,19A 5A,11A 3A,19A 7A,13A 3D,19A 5B,17CD 5A,17AB 7A,17AB 3B,31ABC 3A,31ABC 3C,9B,7B,21F 3C,9D,7B,21F 3C,9B,7A,21D 3C,9A,7A,21D 3C,9B,13A,39B 3C,9C,11A,33CD 3C,9A,11A,33CD 3B,5A,7A,15A,21C,35A 3A,5A,7A,15B,21A,35A 3C,5A,7A,15D,21D,35A )) x ( V 8 8 8 8 8 8 8 8 14 16 12 10 10 12 14 12 14 14 12 10 14 12 10 10 10 C dim( 7 7 7 7 13 17 13 31 31 2 73 · · · 2 | · · · · · · 7 7 19 · 7 ) 11 13 5 5 5 11 17 17 · · · 2 2 5 5 7 5 127 · · · x 19 19 13 7 13 11 · · · · · · 5 7 · 4 4 · · · 4 ( · 3 · · · · · · 3 3 3 4 3 · · 3 3 5 3 5 7 3 G 2 2 2 3 3 3 3 3 2 2 2 3 3 3 3 3 · · · · · · 3 3 3 3 3 3 · · · · 3 3 5 7 3 C · · · · · 4 | · · · · · 3 2 3 3 3 2 2 2 2 2 3 2 3 2 2 2 2 3 3 2 2 2 2 2 2 2 2 2 2 2 (2) 3 2 2 (2) L 3 9 (2) 2 ⇥ (2) (2) (2) 3 ) 3 7 3 ⇥ 5 Sym(3) 3 3 3 Sym(3) Sym(3) x ( L L L ⇥ ⇥ ⇥ Alt(5) Alt(5) Alt(5) Sym(3) Sym(3) ⇥ ⇥ Sym(3) GU PGU Sym(3) 19 G ⇥ ⇥ Sym(3) · 165 255 357 ⇥ ⇥ ⇥ 3 3 ⇥ ⇥ ⇥ ⇥ ⇥ C 7 3 57 91 99 ⇥ ⇥ ⇥ ⇥ 13 ⇥ ⇥ ⇥ 3 Sym(3) 73 91 93 ⇥ ⇥ 63 65 93 35 99 85 117 127 105 ⇥ 19 63 63 105 63 877 823 861 863 754 802 843 849 800 858 814 804 870 817 865 808 788 841 867 829 794 851 845 878 835 ¨bc Number L¨ubeck C D A C E D D AB AB AB AB AB EF CD DE ABC ABC ABC ABC DEF FGH 55 57 63 63 91 ABCD ABCD CDEF 105 105 57 85 99 65 99 57 105 119 63 91 93 93 63 117 65 73 85 ABCDEF GHI Conjugacy Class 127 CHAPTER 3. PRELIMINARY RESULTS 30 - - - Powers 5B,41AB 3A,43ABC 5A,31ABC 7A,31ABC 3D,43ABC 3B, 43ABC 3A,73ABCD 7A,73ABCD 3C,9D,19A,57AB 3C,9A,17AB,51EF 3A,127ABCDEFGHI 3D,5A,11A,15C,33AB,55A 3A,7B,13A,21B,39A,91ABC 3B,5B,13B,15F,39C,65ABCD 3B,5A,15A,17AB,51AB,85AB 3A,5A,15B,17AB,51CD,85AB 3B,7A,17AB,21C,51AB,119AB 3D,5B,15G,17CD,51GH,85CDEF 3B,5A,15A,31ABC,93DEF,155ABC 3A,7A,21A,31ABC,93ABC,217ABCDEF 3C,5A,7A,9A,15D,21D,35A,45A,63D,105AB )) x ( V 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 10 10 10 10 C dim( 17 31 | 7 · ) 43 19 17 · 31 11 13 17 13 17 31 31 · · · · x 43 43 17 5 · · · · · · · · 41 7 73 73 ( 5 127 · · · · 2 3 5 · · · · 5 5 5 5 7 7 5 7 · G · 3 3 151 241 331 · 2 2 2 2 · · · · · · · · 5 3 3 7 2 · · 3 3 3 3 C 3 2 | · 3 3 3 3 3 3 3 3 3 · 2 2 3 2 2 3 3 3 ) x ⇥ ⇥ ⇥ ( Sym(3) Sym(3) Sym(3) Sym(3) G 151 153 465 165 195 205 219 241 255 273 315 331 357 381 465 511 651 ⇥ ⇥ ⇥ ⇥ C 129 129 255 129 171 217 255 837 859 859 868 879 876 877 847 872 864 839 875 866 855 860 870 873 871 869 878 874 876 862 880 ¨bc Number L¨ubeck AB AB AB EF GHI ABC ABC ABCD ABCD ABCD ABCD ABCDE 153 165 315 255 ABCDEF ABCDEF ABCDEF ABCDEF ABCDEF JKLMNO 129 155 273 195 219 255 357 GHIJKLMN ABCDEF GH ABCDEF GH 151 ABCDEF GHI ABCDEF GHIJ 129 171 217 465 651 129 ABCDEF GHIJK Conjugacy Class 255 205 511 381 241 331 CHAPTER 3. PRELIMINARY RESULTS 31

One immediate consequence of the information in Table 3.1.4 is knowledge of the exponents of the Sylowp subgroups of G. The exponent of a Sylow3 subgroup is 9 and all other Sylowp subgroups are elementary abelian. This allows us to rule out another set of subgroups whose Sylowp subgroups are incompatible with those of G.

F ⇤(H) p prime Invalid Exponent of Sylowp

L2(49) 7 49

L2(512) 5 25

L2(1024) 3 27 Sz(32) 5 25

Sp6(8) 3 27

Sp8(8) 3 27 + ⌦8 (8) 3 27

⌦8(8) 3 27

Table 3.1.5: Invalid Sylow Exponents

Finally, we can also rule out L4(8) and U4(8) by the order of the centraliser of an element of order 13. In L (8) there exists x of order 13 such that C (x) =32.5.13 4 | L4(8) | which does not divide either centraliser order in E8(2); likewise, in U4(8) there exists x of order 13 such that C (x) =5.7.13 which does not divide either centraliser | U4(8) | order in E8(2).

In the course of this thesis we often need to find the centraliser of a semisimple

2 t 1 element g or all inverting involutions for it, i.e. all t G such that t =1andg = g . 2 In smaller groups than E8(2) this is a fairly straightforward calculation; however, due to the size of the group normal methods do not work here. We therefore introduce methods for finding these two objects developed by Rowley and Ballantyne for use in [6].

Given a semisimple element x G = E (2) and a centraliser C (y)wherey xG, 2 ⇠ 8 G 2 the code in Appendix B returns a subgroup of CG(x)thathasaverygoodchanceof being the whole centraliser. As we know the orders of all semisimple centralisers we CHAPTER 3. PRELIMINARY RESULTS 32 can easily check whether we have indeed found the whole centraliser.

For inverting involutions suppose g G = E (2) is an element of odd order, then 2 ⇠ 8 all inverting involutions are contained in the subgroup

x x 1 C (g),t = C⇤ (g)= x G g = g or g = g . h G i G { 2 | }

We therefore only need to find a single inverting involution and CG(g)usingthecen- traliser code described earlier. To find an inverting involution for g we use the following procedure. First we find an involution t and y G such that h = tty gG. Then 2 2 t inverts h and we can use them as a guide for where to search for an inverting in- volution for g. We can calculate K = CG(h)anduseBray’smethodtofindCK (t).

Choosing an element z of odd order out of CK (t)insuchawaythatanequivalent element of CG(g)canbechosen,wenowknowthatCG(z)containsaninvertinginvo- lution for g. In some cases more must be done to find an inverting involution inside

CG(z). For our purposes this is easy, as we can employ LMGRadicalQuotient to get

CG(z)=CG(z)/ z in which the inverse image of N ( g )containsaninverting h i CG(z) h i involution, and is very small. Examples of the odd order element z that are picked are as follows

g 3C z C (g), z 13A 2 2 G 2 g 3B z C (g), z 11A, 13B, or 17AB 2 2 G 2 g 3D z Syl (C (g)), z 7B 2 h i2 7 G 2 g 7B z C (g), z 13A 2 2 G 2 g 31ABC z C (g), z 5A 2 2 G 2

3.2 Brauer Characters

An important tool in studying embeddings of groups is that of the Brauer charac- ters. Just as ordinary characters encode the information about the eigenvalues of an element of a complex representation, so too do the Brauer characters on a modular representation. For a GF (q)G-module V with q = pn we can define a complex valued function V on the set of p-regular conjugacy classes in the following way. For ordinary representations the value of 'V (x)isthesumoftheeigenvaluesoftheactionofx on CHAPTER 3. PRELIMINARY RESULTS 33

V ; however, in finite fields we lose information when taking such a sum so we first map the values into a field of characteristic 0, i.e. C. This map, known as a lifting, th takes the elements of the multiplicative group GF (q)⇤ and maps them to the q roots of unity. We can now sum the images of our eigenvalues and we have our required complex valued function.

An important fact of modular representation theory is that Maschke’s theorem frequently doesn’t hold as p - G is a requirement for it to do so. Whilst this makes | | finding the set of indecomposable modules for G a much harder task it also allows for deeper insight if they are well understood. In Section 3.2.3 we use the irreducible Brauer characters of H G to determine the feasible decompositions of the restriction  L(G) . |H

3.2.1 Conway Polynomials

In order for the Brauer characters calculated for H G to be consistent with the  restrictions of those of G we must fix our lifting of the finite fields. We do this in the way introduced in the atlas [33] via the Conway polynomials. Up to isomorphism there is a unique field GF (q)oforderq = pn, p prime n N.Forn =1,GF (p) 2 is the field Z/pZ and then GF (q)maybedefinedasGF (p)[X]/(fn)wherefn is an irreducible polynomial of degree n. For our consistent lifting to be possible, we must

th fix an fn for each n which will be called the n Conway polynomial.

This choice is made with certain conditions in mind; fn is a monic and primitive polynomial ensuring that zn = X +(fn) is a generator for the multiplicative group

GF (q)⇤. We also require fn to be consistent with fd where d is any divisor of n, i.e. if ↵ =(pn 1)/(pd 1) then z↵ is a root of f . A lexographic ordering is now defined n d on the set of all such polynomials as

n n 1 n n n 1 n X an 1X + +( 1) a0

Having now got an fixed definition for GF (q)andageneratorforitsmultiplicative group z = X +(f )weusetheliftingz ⇣ =exp(2⇡i/(q 1)). We note that n n n ! in Magma this choice of finite field definition and lifting is automatic wherever its database knows the nth Conway polynomial, which in characteristic 2 is for n 94. 

3.2.2 Brauer Character of L(G)

E8(2)-class Brauer character value E8(2)-class Brauer character value 3A 77 21E 0 3B 14 21F 12 3C 5 21G 0 3D -4 21H 3 5A 23 31ABC 23+c31+6&5 ( 3, 5) 5B -2 31D 0 ⇤ ⇤ 7A 52 33AB 21+6b33 ( ) 7B 3 33CD 12 +3b33 (⇤⇤ ) 9A 29 33E 0 ⇤⇤ 9B 8 33F 3 9C 2 35A 2 9D -1 39A -1 11A 6 39B 5 13A 14 39C 1 13B 1 41AB 2 15A 44 43ABC 4-c43 ( 3, 7) 15B 2 45A 14⇤ ⇤ 15C 11 45B -1 15D 5 45C 2 15E -1 51AB 12+v51&2&19&35 ( 5) 15F 4 51CD v51&2&19&35 ( 5)⇤ 15G 1 51EF 4+2v51&2&19&35⇤ ( 5) 17AB 22+b17 ( ) 51GH 4+v51&2&19&35 ( ⇤5) 17CD 2+b17 ( ⇤⇤) 55A 1 ⇤ 21A 7 ⇤⇤ 57AB 16+3b57 ( ) 21B 21 57C 1 ⇤⇤ 21C 7 57DE 6+b57 ( ) 21D -2 ... ⇤⇤

Table 3.2.1: Brauer Values of semisimple classes of E8(2) on L(G)

Table 3.2.1 contains the Brauer character values of the conjugacy classes of E8(2) on L(G). These values were calculated either using the code in Appendix B or by CHAPTER 3. PRELIMINARY RESULTS 35 hand. The algebraic irrationalities, both here and in Chapter 6 were converted into atlas notation, described in [16], by use of the method outlined by Bosma [11].

3.2.3 Feasible Decompositions

Definition 3.2. A Fusion pattern from H to G is a map f from the p-regular conjugacy classes of H to the conjugacy classes of G which preserves element orders.

This definition is a weaker version of the definition given by Frey [27] and Litterick [48] as it doesn’t take account of power maps.

Definition 3.3. A feasible decomposition of H on a finite-dimensional G-module V is a KH-module V0 such that, for some fusion pattern f, the Brauer character at x for any x H on V is equal to the Brauer character at x on V . The Brauer character 2 0 of V0 is then called a feasible character.

This definition is again a weaker version of that given by Litterick [48], and, like him, we note that not every feasible decomposition or fusion pattern corresponds to an embedding of H in G.

For a given group from Tables 3.1.1 or 3.1.2 we wish to determine all feasible decompositions of L(E8(2)). To do so we need the Brauer character values of all ir- reducible GF (2)H-modules of dimension 248. These are calculated either directly  in Magma or by using the theory in Section 3.3. We also need the Brauer character values of E (2) on L(G)whicharegiveninTable3.2.1forelementsoforder 57 8  and can be calculated using the code in Appendix B. Whilst it is possible to calculate the feasible decompositions by solving a set of simultaneous equations, we instead ap- proach this problem by e↵ectively constructing all decompositions of 248-dimensional GF (2)H-modules and checking which are feasible decompositions using the code in Appendix A. The results of this analysis for the relevant groups from Tables 3.1.1 and 3.1.2 are presented in Chapter 6.

Lemma 3.1. Let G = E (2) and H G, then H is not isomorphic to L (41), L (16) ⇠ 8  2 3 or G2(8).

Proof. In Chapter 6 L2(41), L3(16) and G2(8) are found to have no feasible decompo- sitions and therefore there are no embeddings of these groups into E8(2). CHAPTER 3. PRELIMINARY RESULTS 36 3.3 Irreducible Modules of Groups of Lie Type

Whilst there are algorithms in Magma for calculating the irreducible modules of a group G, these sometimes are insucient and we must use the theory of highest weights to find the irreducible modules of dimension 248. 

For the rest of this section we let G be a connected reductive simple algebraic group of simply-connected type and rank r over K an algebraically closed field of character- istic p>0. Let be a Frobenius endomorphism of G and G(q)=G be the fixed point subgroup of . We denote by G˜ the quotient G/Z(G)andusethenotation from Chapter 2 for tori and weights.

A weight ! ⇤ is called dominant if !, ↵ 0forall↵ +. For a choice of sim- 2 h i 2 ple roots ↵ ,...,↵ X(T )ofG with respect to T we can define a set, ! ,...,! , { 1 r} ⇢ { 1 r} of fundamental dominant weights as the weights such that ! , ↵ = . Any domi- h i ji ij nant weight can be written as a non-negative linear combination of the fundamental dominant weights. The Weyl group W of G acts on X(T )andunderthisactioneach W -orbit on X contains a unique dominant weight. There is then a partial ordering of

X(T ) defined by ! !0 if, and only if, !0 ! is a non-negative linear combination of  the simple roots.

Let V be a finite-dimensional G-module over K, then considering V as a T -module there is a direct sum decomposition V = ! X(T ) V! into weight spaces V! such that 2 t T acts by multiplication with !(t)onLV!. A theorem of Chevalley characterises 2 the irreducible modules of G via their set of weights.

Theorem 3.4 (Chevalley). Let G and V be as above.

(i) If V is irreducible then the set of weights of V contains a (unique) element such that for all weights ! of V we have ! . This is called the highest  weight of V , it is dominant and we have dim(V)=1.

(ii) An irreducible G-module V is determined up to isomorphism by its highest weight.

(iii) For each dominant weight X(T ) there is an irreducible G-module V () with 2 CHAPTER 3. PRELIMINARY RESULTS 37

highest weight .

Proof. See Humphreys [31]

A dominant weight = a ! + + a ! X(T )iscalledp-restricted if 0 a 1 1 ··· r r 2  i  p 1for1 i r. Steinberg’s tensor product theorem gives a way of constructing   all highest weight modules V ()ofg from those with p-restricted highest weights.

Theorem 3.5 (Steinberg). Let F0 be the Frobenius automorphism of K of character- istic p, raising elements to their pth power. Twisting the G-action on a G-module V

i (i) with F0,i Z 0, we get another G-module which we denote by V .If0,...,n are 2 p-restricted weights then

V ( + p + + pn ) = V ( ) V ( )(1) V ( )(n). 0 1 ··· n ⇠ 0 ⌦ 1 ⌦ ···⌦ n

Proof. See Humphreys [31]

This pairs with another theorem of Steinberg to give us the result we want linking the irreducible modules of G with those of G(q).

Theorem 3.6 (Steinberg). Let G and G(q) be as before. We define a subset ⇤ of dominant weights. If G(q) is not of type 2B , 2G or 2F then ⇤ = a ! + +a ! 0 2 2 4 { 1 1 ··· r r|  a q 1 for 1 i r .IfG(q) is of type 2B , 2G or 2F then ⇤ = a ! + + i    } 2 2 4 { 1 1 ··· ar!r 0 ai (q/pp) 1 if ↵i is a long root, 0 ai (qpp) 1 if ↵i is a short root |     } (note that q is the square root of an odd power of p=2,3 or 2, respectively, in these cases). Then the restictions of the G-modules V () with ⇤ to G(q) form a set of pairwise 2 inequivalent representatives of all equivalence classes of irreducible KG(q)-modules.

Proof. See Humphreys [31]

These three theorems show that from knowledge of the dimensions of the modules V () we can get the dimensions of all irreducible modules of G(q). We note that the dimension of V ()=V ()(i). It is also worth noting that with some further e↵ort it would also be possible to determine all irreducible modules for G˜, however for our purposes G(q)=G˜ in all cases. CHAPTER 3. PRELIMINARY RESULTS 38

3.3.1 Dimensions of Highest Weight Modules

L¨ubeck has determined the dimension of the highest weight module for all simple types over all characteristics with some upper limits on dimensions [49]. For our purposes all highest weight modules are of small enough dimension to be included, those that are too high are marked N/A but have dimension higher that 248 so are not needed. We will need the following highest weight dimensions, all of which are for characteristic 2

(as Bi ⇠= Ci in characteristic 2 we show only Ci for convenience):

Dimensions

Highest Weight A2 C2 [0, 0] 11 [1, 0] 34 [0, 1] 34 [1, 1] 816

Table 3.3.1: Rank 2 groups

Dimensions

Highest Weight A3 C3 [0, 0, 0] 11 [1, 0, 0] 46 [0, 0, 1] 48 [0, 1, 0] 614 [1, 0, 1] 14 48 [0, 1, 1] 20 64 [1, 1, 0] 20 112 [1, 1, 1] 64 512

Table 3.3.2: Rank 3 groups CHAPTER 3. PRELIMINARY RESULTS 39

Dimensions

Highest Weight A4 C4 D4 [0, 0, 0, 0] 111 [0, 0, 0, 1] 588 [1, 0, 0, 0] 5168 [0, 0, 1, 0] 10 26 26 [0, 1, 0, 0] 10 48 8 [1, 0, 0, 1] 24 128 48 [0, 0, 1, 1] 40 160 160 [0, 1, 0, 1] 40 246 48 [1, 0, 1, 0] 40 416 160 [1, 1, 0, 0] 40 768 48 [0, 1, 1, 0] 74 784 160 [1, 0, 1, 1] 160 2560 784 [1, 1, 0, 1] 160 3696 246 [0, 1, 1, 1] 280 N/A 784 [1, 1, 1, 0] 280 N/A 784 [1, 1, 1, 1] 1024 N/A 4096

Table 3.3.3: Rank 4 groups

3.4 Determining Maximality

Having now found the feasible characters for the groups we are interested in we now turn to determining if they are maximal in E8(2). To this end we shall now outline some methods developed by Litterick [48] and Craven [18]. The basis of this method relies on the following Lemma from Seitz [56]:

Lemma 3.2 (Seitz). Let 0 = v L(G) and C = C (v). Then 6 2 G (i) If v is semisimple then C contains a maximal torus of G. (ii) If v is nilpotent then R (C) =1and hence C is contained in a proper parabolic u 6 subgroup of G.

To make use of this lemma we must observe the following from the theory of alge- braic groups. Let G be an algebraic group over an algebraically closed field K, G be CHAPTER 3. PRELIMINARY RESULTS 40 the fixed point group under some Frobenius morphism of G and H G .Weknow  if H fixes a nonzero vector on L(G)thenH fixes the same nonzero vector v on L(G). Then H is contained in the closed stabiliser subgroup of v, C (v)= g G g.v = v . G { 2 | } We also use the Jordan decomposition of L(G), which states for w L(G)thereexists 2 auniquesumws +wn = w where ws is semisimple and wu is nilpotent. As this decom- position is unique, any endomorphism of L(G)fixingw also fixes wu and ws, thereby implying that if H fixes a non-zero vector on L(G)italsofixeseitherasemisimpleor nilpotent vector so Lemma 3.2 applies.

We are therefore interested in conditions that, for a given feasible decomposition, will imply a fixed vector in L(G). To do this we need to use the theory of cohomology groups. For a group S and an KS-module V the cohomology group H1(S, V )isthe quotient of the additive group Z1(S, V )of1-cocyclesbythesubgroupB1(S, V )of 1-coboundaries. Whilst this definition is fairly technical for our purposes it suces that the cohomology group parameterises the classes of non-split exact sequences of KS-modules 0 V E K 0 { } ! ! ! ! { } up to equivalence under isomorphisms inducing the identity on V and K.Fromthis and Jansen [34] we get to

1 1 1 Ext (V,W) = Ext (K, V ⇤ W ) = H (S, V ⇤ W ) S ⇠ S ⌦ ⇠ ⌦

1 where V and W are KS-modules and ExtS(V,W) is the set of equivalence classes of short exact sequences of S-modules:

0 W E V 0. ! ! ! ! The following result of Litterick [48] is often very useful in determining fixed vectors, whose proof we shall include as it is instructive for what follows.

Lemma 3.3 (Litterick). Let S be a finite group and M a finite-dimensional KS- module, with composition factors W1,...,Wr, of which m are trivial. Set n = dim H1(S, W ), and assume H1(S, K)= 0 . i { } P (i) If n

(ii) If m = n and M contains no nonzero trivial submodule, then H1(S, M)= 0 , { }

(iii) Suppose that m = n>0, and that for each i we have H1(S, W )= 0 i { } () 1 H (S, W ⇤)= 0 . Then M has a nonzero trivial submodule or quotient. i { } Proof. In each case, we proceed by induction on the number r of composition fac- tors of M.

(i) If r =1orifM has only trivial composition factors, the result is immediate. So let r>1andassumethatM has a nontrivial composition factor. Let W M be ✓ asubmodulewhichismaximalsuchthatM/W has a nontrivial composition factor.

1 Let n0 = dim H (S, Wi), the sum being over composition factors of W , and let m0 be theP number of trivial composition factors of W . If n n0

(ii) Suppose that n = m,thatM has no trivial submodule and that H1(S, M) =0, 6 so that there exists a non-split extension 0 M N K 0 . Since M con- { } ! ! ! ! { } tains no trivial submodules, neither does N. However, this contradicts (i), since N has

1 m +1trivialcompositionfactors,whilethesum dim H (S, Wi)overcomposition factors Wi of N is equal to m. P

(iii) Now suppose n = m>0. Assume that M has no trivial submodules. We will show that M has a trivial quotient. Let N be a maximal submodule of M. Then N has no nonzero trivial submodules (since M doesn’t). Hence H1(S, M/N)= 0 , { } otherwise N would have a trivial submodule by part (i), a contradiction. By induc- tion on r, we deduce that N has a trivial quotient. Let Q be a maximal submodule of N such that N/Q is trivial. Then M/Q is an extension of a trivial module by the irreducible module M/N. By our hypothesis on cohomology groups, we have

1 1 1 Ext (M/N,K) = Ext (K, (M/N)⇤) = H (S, (M/N)⇤)= 0 . Thus the extension S ⇠ S ⇠ { } splits and M has a trivial quotient, as required. CHAPTER 3. PRELIMINARY RESULTS 42

Lemma 3.3 is very powerful and allows for many feasible decompositions to be ruled out from leading to maximal subgroups; however, when it fails to do so we must turn to more computationally intense methods. For this we must use the theory of projective covers, which we shall now briefly outline from Alperin [1].

For a KS-module V we define several important submodules or quotients. The Ja- cobson Radical, Rad(V ), is the intersection of all maximal submodules and V/Rad(V ) known as the head of V is necessarily completely reducible. The socle, Soc(V ), is the sum of all irreducible submodules of V . The head and socle of V are dual concepts; i.e. Soc(V ⇤)⇤ ⇠= V/Rad(V ).

A KS-module, V , is projective if any exact sequence

0 A B V 0 ! ! ! ! must split. Dually a KS-module V is injective if any exact sequence

0 V B A 0 ! ! ! ! must split.

Lemma 3.4. Let V be a finite-dimensional KS-module. Then

(i) There exists a finite-dimensional projective KS-module P such that V/Rad(V ) ⇠= P/Rad(P ).

(ii) This P is unique up to isomorphism.

(iii) V is a homomorphic image of P .

(iv) P/Rad(P ) ⇠= Soc(P ).

(v) dim(P ) is divisible by the order of a Sylowp subgroup of S.

(vi) If V = W U then there exists P and P such that P is projective and W is W U i a homomorphic image of PW and equivalently U of PU . CHAPTER 3. PRELIMINARY RESULTS 43

With the notation from Lemma 3.4, P is called the projective cover of V and the dual notion is called the injective hull. Importantly the dual concept of Lemma 3.4 (iii) is that any module can be embedded in an injective module. A consequence of Lemma 3.4 (iii) is that any finite-dimensional KS-module can be found as a quotient of some finite-dimensional projective module. It is also true that every finite-dimensional projective module is a direct sum of indecomposable projective modules, which are in 1-1 correspondence with the irreducible KS-modules as their projective covers. When searching for the restriction of L(G)toS we therefore only need to know the structure of the quotients of direct sums of projective indecomposables. Whilst that would be an infinite number of quotients to find, a useful lemma of Litterick [48] limits the possibilities to an often manageable finite set.

Lemma 3.5 (Litterick). Let S1,...,Sr be the irreducible KS-modules and P1,...,Pr the corresponding projective indecomposables. Let V be a self-dual KS-module having composition factors Si with multiplicity ri, such that V has no irreducible direct sum-

n(Pi) mands, and let P = P be the projective cover of V . Then n(P )+n(P ⇤) r i i i  i for all i. In particular,Ln(Pi) ri/2 when Si is self-dual.  With the restrictions the Lemma 3.5 places on the projective cover of L(G) we |S can now often calculate all such modules. We outline this method and its applications in more detail in Section 4.16.

We also introduce the following lemmas to complement Lemma 3.5 when deter- mining fixed vectors.

Lemma 3.6. Let V be a sum of projective indecomposables ⌃Pi whose trivial compo- sition factors all of which are in Soc(V/Soc(V )). Then for any proper quotient Q of V if Q has no trivial submodules then there exists a projective quotient S of Q such that S contains all trivial composition factors of Q.

Proof. Let K be the kernel of the quotient map of Q, then Soc(K) Soc(V ). As  Soc(V )issemisimplethereexistsasubmoduleW Soc(V )suchthatSoc(V )=  Soc(K) W . As V is projective it must be injective and therefore is the injective hull of Soc(V ). By Lemma 3.4 there must exist P and P such that V = P P and P K W K W K CHAPTER 3. PRELIMINARY RESULTS 44

and PW are the injective hulls of Soc(K)andW respectively. As PK is the injective hull of Soc(K)weknowSoc(PK )=Soc(K)andthereforePK /K is a quotient of

PK /Soc(PK ). By our initial setup all of the trivial composition factors of PK /Soc(PK ) are in Soc(PK /Soc(PK )) and therefore if PK /K has no trivial submodules it must have no trivial composition factors. As PK /K has no trivial composition factors we have S = PW = Q/(PK /K)whereS is an injective (hence projective) quotient of Q containing all the trivial composition factors of Q, as required.

Lemma 3.7. Let H be a finite group and let V be a GF (p)H-module, p a prime. For v V , set K = Stab (v) and U = vH . Then U is isomorphic to a quotient of the 2 H h i GF (p) permutation module with H acting on the right cosets of K in H. Chapter 4

Proof of Theorems 1.2 and 1.3

From this point on G is always E8(2) and all modules are defined over GF (2) unless otherwise stated.

4.1 L2(7)

From Chapter 6 p71 we have that there are seven feasible decompositions of L(G)for embeddings of subgroups H ⇠= L2(7) in E8(2). By Lemma 3.3(i), decompositions (ii), (iv), and (vi) have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. For the remaining decompositions we need to know the structure of the projective covers of the non-trivial irreducible modules of L2(7). By direct calculation in Magma we find the following;

P ( )= ( ) , P ( )= ( ) and P ( )= . 2 2| 3 1 | 2| 3| 2 3 3| 2 1 | 3| 2| 3 4 4

From this it is clear that all trivial composition factors must be in the second socle layer and so Lemma 3.6 applies. We can therefore conclude that if there are no trivial submodules then there exists a projective quotient containing all trivial composition factors, so there must be at least 5 composition factors of dimension 3 for each trivial. As in none of the remaining cases are there enough 3-dimensional composition factors, we may conclude all remaining feasible decompositions must have a trivial submodule and therefore that any subgroup H ⇠= L2(7) of E8(2) cannot be maximal as required.

45 CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 46

4.2 L2(11)

The situation for L2(11) is very similar to that of L2(7). From Chapter 6 p76 we have that there are six feasible decompositions of L(G)forembeddingsofsubgroups

H ⇠= L2(11) in E8(2). By Lemma 3.3(i) decompositions (v) and (vi) have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. For the remaining decompositions we need to know the structure of the projective covers of the non-trivial irreducible modules of

L2(11). By direct calculation in Magma we find the following;

P ( )= ( ) , P ( )= and P ( )= 2 2| 1 1 | 2 3 3| 3 4 4

From this it is clear that if there is no trivial submodule all trivial composition factors must be in the second socle layer and so Lemma 3.6 applies. This implies that if there is no trivial submodule then for each trivial composition factor there must be at least as many 2 and trivials, which allows us to know feasible decompositions (ii), (iii) and

(iv) must have a trivial submodule and therefore that any subgroup H ⇠= L2(11) of

E8(2) cannot be maximal as required. The remaining feasible decomposition, (i), is dealt with in [6] in which all subgroups of E8(2) with such a fusion are found, up to conjugacy, along with a suitable proper subgroup containing them.

4.3 L2(13)

From Chapter 6 p77 we have that there are six feasible decompositions of L(G)for embeddings of subgroups H ⇠= L2(13) in E8(2). By Lemma 3.3(i) and (iii) all decom- positions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. L2(13) therefore cannot be a maximal subgroup of E8(2).

4.4 L2(17)

From Chapter 6 p78 we have that there are twenty feasible decompositions of L(G) for embeddings of subgroups H ⇠= L2(17) in E8(2). In Table 3.1.4 we may note that in E8(2) all elements of order 9 powered into elements in 3CE8(2) and therefore there CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 47 can be no embeddings corresponding to decompositions (i), (ii) and (ix) - (xvi). By Lemma 3.3(i) decompositions (iii) - (vi) and (xvii) - (xx) have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. This leaves decompositions (vii) and (viii), for which we will need to know the structure of the projective covers of the non-trivial irreducible modules of L2(17). By direct calculation in Magma we find the following;

P ( )= , 2 2| 1| 3| 1| 2| 1| 3| 1| 2| 1| 3| 1| 2| 1| 3| 1| 2

P ( )= , 3 3| 1| 2| 1| 3| 1| 2| 1| 3| 1| 2| 1| 3| 1| 2| 1| 3

P (4)=4 and P (5)=5

We know from Lemma 3.5 that the restriction, V, of L(G) to a subgroup H ⇠= L2(17) must be a quotient of some direct sum, D, of these projective covers. By considering the number of composition factors of 1 in P (2)andP (3) and in the decompositions

(vii) and (viii), we see that in these cases we see that there must be at least two P (2) or P (3)inthedirectsumD, implying that there are at least two composition factors of dimension 8 in the top of V . As, by assumption, there are no trivial quotients of V , then rad(V )containsasmanytrivialcompositionfactorsasV with at most fifteen composition factors of dimension 8, which by Lemma 3.3(i) gives us a trivial submodule. As all feasible decompositions have now been shown to imply a fixed vector we can say that L2(17) cannot be a maximal subgroup of E8(2).

4.5 L2(25)

From Chapter 6 p84 we have that there are eight feasible decompositions of L(G)for embeddings of subgroups H ⇠= L2(25) in E8(2). By Lemma 3.3(i), (iii) decompositions (ii) - (viii) have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. For the remaining case there are no trivial composition factors and it therefore cannot fix a vector. In [6] it is found that there are no embeddings H with fusion corresponding to case (i) in E (2) on the assumption that for V = L(G) , R Syl (H)ande H of order 4 8 |H 2 5 2 the following holds; dimCV (R)=8anddimCV (e)=16.Thefirstoftheseproperties can be checked on each composition factor linearly as R is coprime to 2. In order | | CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 48 to check that the second property must hold we need to know the structure of the projective covers of 4 and 5. By direct calculation in Magma we find the following;

P ( )= and P ( )= 4 4| 4| 4| 4 5 5

From Lemma 3.5 we know that any direct summands of V not isomorphic to an irreducible L2(25)-module must be quotients of a direct sum of no more than two

P (4). We find by direct calculation all such quotients and find the corresponding fixed spaces of e and R. The results split into three cases; V 144 26 26 26 26 ⇠ | | and V 144 26 26 26 26 and V 144 26 26 26 26, with dimC (e) ⇠ | ⇠ V 64, 66 and 68 respectively. From the atlas [16] and Chapter 6 we see that L2(25) has elements of order 12 whose 3rd power is conjugate to e and whose 4th power is in 3D , therefore e C (x) = 3 U (2) for some x 3D . Using the E8(2) 2 E8(2) ⇠ ⇥ 9 2 E8(2) Magma command LMGRadicalQuotient we get H ⇠= U9(2) as a permutation group as well as a homomorphism, from C (x) H. In H we find conjugacy class E8(2) ! representatives for all classes of order 4 and 12 and find their inverse image under , giving us representatives of all classes of order 12 in H. Only a single class of these elements has the correct fixed space, 128, when taken to the 6th power and therefore it is in the 3rd power of this class that e must lie. By direct calculation we are therefore able to determine that dimCV (e)=16.

4.6 L2(27)

From Chapter 6 p86 we have that there are two feasible decompositions of L(G)for embeddings of subgroups H ⇠= L2(27) in E8(2). By Lemma 3.3(i) all decompositions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these de- compositions lie in a maximal subgroup from Section 3.1.1. L2(27) therefore cannot be a maximal subgroup of E8(2). CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 49

4.7 L4(3)

From Chapter 6 p95 we have that there are four feasible decompositions of L(G)for embeddings of subgroups H ⇠= L4(3) in E8(2). By Lemma 3.3(i) and (iii) all decom- positions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. L4(3) therefore cannot be a maximal subgroup of E8(2).

4.8 U3(3)

From Chapter 6 p83 we have that there are four feasible decompositions of L(G)for embeddings of subgroups H ⇠= U3(3) in E8(2). By Lemma 3.3 (i) and (iii) all decom- positions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. U3(3) therefore cannot be a maximal subgroup of E8(2).

4.9 G2(3)

From Chapter 6 p94 we have that there are two feasible decompositions of L(G)for embeddings of subgroups H ⇠= G2(3) in E8(2). By Lemma 3.3 (i) and (iii) both decom- positions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. G2(3) therefore cannot be a maximal subgroup of E8(2).

4.10 M11

From Chapter 6 p85 we have that there are three feasible decompositions of L(G) for embeddings of subgroups H ⇠= M11 in E8(2). By Lemma 3.3 (i) and (iii) all decompositions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. M11 therefore cannot be a maximal subgroup of E8(2). CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 50

4.11 M12

From Chapter 6 p90 we have that there are three feasible decompositions of L(G) for embeddings of subgroups H ⇠= M12 in E8(2). By Lemma 3.3 (i) and (iii) all decompositions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. M12 therefore cannot be a maximal subgroup of E8(2).

4.12 L3(8)

From Chapter 6 p106 we have that there is one feasible decompositions of L(G)for embeddings of subgroups H ⇠= L3(8) in E8(2). By Lemma 3.3 (i) both decompositions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these de- compositions lie in a maximal subgroup from Section 3.1.1. L3(8) therefore cannot be amaximalsubgroupofE8(2).

4.13 F4(2)

From Chapter 6 p114 we have that there are four feasible decompositions of L(G)for embeddings of subgroups H ⇠= F4(2) in E8(2). By Lemma 3.3 (i) all decompositions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these de- compositions lie in a maximal subgroup from Section 3.1.1. F4(2) therefore cannot be amaximalsubgroupofE8(2).

2 4.14 F4(2)0

From Chapter 6 p96 we have that there are two feasible decompositions of L(G)for

2 embeddings of subgroups H ⇠= F4(2)0 in E8(2). By Lemma 3.3 (i) all decompositions have a trivial submodule and therefore by Lemma 3.2 any subgroups with these de-

2 compositions lie in a maximal subgroup from Section 3.1.1. F4(2)0 therefore cannot be a maximal subgroup of E8(2). CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 51

3 4.15 D4(2)

From Chapter 6 p98 we have that there are four feasible decompositions of L(G)

3 for embeddings of subgroups H ⇠= D4(2) in E8(2). By Lemma 3.3 (i) and (iii) all decompositions have a trivial submodule and therefore by Lemma 3.2 any subgroups

3 with these decompositions lie in a maximal subgroup from Section 3.1.1. D4(2) therefore cannot be a maximal subgroup of E8(2).

4.16 L3(3)

From Chapter 6 p83 we have that there are five feasible decompositions of L(G)for embeddings of subgroups H ⇠= L3(3) in E8(2). By Lemma 3.3(i) decompositions (iii) - (v) have a trivial submodule and therefore by Lemma 3.2 any subgroups with these decompositions lie in a maximal subgroup from Section 3.1.1. The remaining two cases will now be approached separately.

4.16.1 Case (ii)

For this case we assume there exists a subgroup H ⇠= L3(3) in E8(2) following fusion pattern ii. From the atlas [16] we can see that H has maximal subgroup of the form

13 : 3 which is the normailser of a Sylow13 subgroup. From Chapter 6 we have that all elements of order 13 in H are in the 13BE8(2) class. Therefore as we are only looking for such groups up to conjugacy without loss of generality we may choose an element x in 13B . We therefore choose one in N 132.(12 GL (3)), the normaliser of a E8(2) ⇠ ⇤ 2 Sylow13 subgroup of G constructed in [6]. We then use the FindCentProc outlined in Section 3.2 to get C (x), and, combined with an element y N of order 3 which E8(2) 2 acts non-trivially on x, we get a group L containing all possible 13 : 3 containing x. By checking the fixed space dimensions of conjugacy class representatives of L we

find there are no elements of 3CE8(2) in L, which is a contradiction with our initial assumption as all elements of order 3 in fusion case (ii) are in 3CE8(2). CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 52

4.16.2 Case (i)

For case (i) we will need to know the structure of the projective covers of the non-trivial irreducible modules of L3(3). By direct calculation in Magma we find the following;

P ( )= ( ) , 2 2| 1 2 | 3| 1| 2

P ( )= ( ) ( ) ( ) and 3 3| 1 3 | 2 3 | 1 3 | 3

P (4)=4

.

We now assume that there exists a subgroup H ⇠= L3(3) in E8(2) following fusion pattern (i). Applying Lemma 3.5 we know that for any direct summand D of V = L(G) , V/Rad(V )isthedirectsumofsomesubsetofthemultiset , , , , . |H { 2 3 3 3 3} Again we split this analysis into two: we first tackle those subsets S with four or more elements, , , , , , , , and , , , , . In each case we may { 3 3 3 3} { 2 3 3 3} { 2 3 3 3 3} assume that D is a submodule of PD = ⌃P (i)fori in S whose socle coincides with that of PD. We shall now show that no such D can exist.

Proposition 4.1. Let H ⇠= L3(3) be a subgroup of E8(2) following fusion pattern (i) which does not fix a vector on L(G). Then let D be an indecomposable direct summand of V = L(G) for which D/Rad(D)andSoc(D)areoneof |H

(a) , 2 3 3 3

(b) or 3 3 3 3 (c) . 2 3 3 3 3 Then there are exactly 4 trivial composition factors of D.

Proof. We shall assume the contrary that there exists another indecomposable sum- mand A with a trivial composition factor. We note that as D is indecomposable Rad(D) Soc(D), therefore dim(D) > 124, which implies that D is self-dual because ◆ V is. In each case we now know an upper bound for the composition factors of each isomorphism type for A. For case (a) A has at most one 2 and two 3, which by

Lemma 3.5 means A is a quotient of P (3). By direct calculation in Magma we can confirm that there are no quotients of P (3)withnotrivialsubmodulesandatthe CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 53

required composition factors. Similarly for case (b) A has at most three 2 and no

3, which by Lemma 3.5 means A is a quotient of P (2). Again by direct calcula- tion in Magma we can confirm that there are no quotients of P (2)withnotrivial submodules and at the required composition factors. This leaves case (c) for which A can have at most one 2 as non-trivial composition factors, which by Lemma 3.5 im- plies A is irreducible, a contradiction. Having exhausted the possibilities for A we can now conclude that such a direct summand cannot exist, and therefore the proposition holds.

In what follows we shall find all indecomposable modules m whose composition factors are consistent with fusion case (i) with Soc(m)adirectsumofthreeorfewer irreducibles, and so dually pick up all those with m/Rad(m)likewise.Wetherefore need to determine the possibilities for indecomposable modules m whose composition factors are consistent with fusion case (i) with four or more irreducible modules in both Soc(m)andm/Rad(m), i.e. those covered by Proposition 4.1. We again note that such m must be self-dual as above. In each of the three cases we apply the code in Appendix A whose function shall now be briefly explained

The main building block of the method for finding the indecomposable modules comprises taking minimal submodules of ever smaller quotients and collecting their inverse images under the quotient map. Let S be a submodule of some direct sum of projective indecomposables DM, whose composition factors are a subset of those in agivenfeasibledecomposition.Thenwefindallminimalsubmodulesofthequotient DM/S and check first whether their inverse images also have compatible composition factors, and secondly whether they have a trivial quotient. We then keep a set of all submodules, up to isomorphism, which pass the first check to repeat the process and any that pass both sets are the indecomposable modules we are trying to find. By repeating this process starting with the zero submodule and continuing until no submodules pass the first check we generate a list of all possible indecomposable sub- modules of DM that could be a direct summand of our feasible decomposition such that no non zero vector is fixed.

As an extension of this method we can be more specific and look only for those CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 54 modules with a given socle and head. To do so we simply start the previous method at the required socle rather than at the zero module and then collect all modules that pass the first check with the composition factors required for the top removed from the feasible decomposition. Finally, for each case remaining we look for all submodules isomorphic to the required top in the quotient.

In case (a) we get 26 intermediate submodules and 70 final submodules, in case (b) we get 4 intermediate submodules and 16 final submodules and in case (c) we get 3 intermediate submodules and 3 final submodules. Checking all the final submodules we find that none of them are self-dual. We can therefore conclude that there are no direct summands m of V = L(G) with four or more composition factors in both |H Soc(m)andm/Rad(m).

We now turn to the case where either Soc(m)orm/Rad(m)hasthreeorfewer composition factors, and, by duality, it is sucient to look just at Soc(m). We first look for all submodules up to isomorphism of P ( ) P ( ) P ( ). We do this using 2 3 3 the code in Appendix A, then filtering out reducible submodules. The results are shown in Table 4.16.1 with the following labelling; the module name is the dimension of the module with an arbitrary labelling to distinguish those of equal dimension, we use SD to denote a self-dual module and N/A to denote a non-self dual module which when added to its dual has too many of a particular composition factor to be in fusion case (i) and which can therefore be ignored when analysing the results below. We also repeat this process for P ( ) P ( ) P ( ); however, we get no new 3 3 3 modules with 26, 39a, 52, 65a, 78a, 91a, 105, 117a and 144 reoccurring in this case.

From the feasible decomposition associated with fusion case (i) we know that there are more trivial composition factors than there are of composition factors isomorphic to 2, therefore there is at least one direct summand where the same is true. Looking through Table 4.16.1 we see that there are only two such modules, 105 and 144. For 105 we now need to find all combinations of modules from Table 4.16.1 whose direct sum has composition factors exactly 3 , 3 , 4 . We first note that this direct sum { 1 2 3} cannot contain a 2 module as then we would once again have more trivial composition CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 55

Module Dual #1 #2 #3 Module Dual #1 #2 #3 12 SD 0 1 0 129a N/A 1 2 4 24 SD 0 2 0 129b N/A 1 2 4 26 SD 0 0 1 130a SD 2 2 4 39a 39b 1 1 1 130b N/A 2 2 4 39b 39a 1 1 1 130c SD 2 2 4 51a 51b 1 2 1 130d N/A 2 2 4 51b 51a 1 2 1 130e SD 2 2 4 52 SD 0 0 2 142 N/A 2 3 4 64 SD 1 3 1 143a N/A 3 3 4 65a 65b 1 1 2 143b N/A 3 3 4 65b 65a 1 1 2 144 SD 2 1 5 77a 77b 1 2 2 156a N/A 2 2 5 77b 77a 1 2 2 156b N/A 2 2 5 78a SD 0 0 3 156c N/A 2 2 5 78b SD 2 2 2 156d N/A 2 2 5 78c SD 2 2 2 169a N/A 3 3 5 78d SD 2 2 2 169b N/A 3 3 5 90 N/A 2 3 2 169c N/A 3 3 5 91a 91b 1 1 3 182a N/A 2 2 6 91b 91a 1 1 3 182b SD 2 2 6 103a N/A 1 2 3 182c N/A 2 2 6 103b N/A 1 2 3 195a N/A 3 3 6 104a SD 2 2 3 195b N/A 3 3 6 104b N/A 2 2 3 195c N/A 3 3 6 104c N/A 2 2 3 208a N/A 2 2 7 104d SD 2 2 3 208b N/A 2 2 7 105 SD 1 0 4 221a N/A 3 3 7 116 SD 2 3 3 221b N/A 3 3 7 117a 117b 1 1 4 234 SD 2 2 8 117b 117a 1 1 4 247 N/A 3 3 8 117b N/A 3 3 3

Table 4.16.1: Indecomposable L3(3)-modules

factors than 2 factors and there can be no more than one of 105 or 144. There are no self-dual modules or pairs of dual modules with an odd number of composition factors isomorphic to 2 and less than five composition factors isomorphic to 3 so it is impossible to find a combination of the form required for 105. For 144 we need to find all combinations of modules from Table 4.16.1 whose direct sum has composition factors exactly 2 , 2 , 3 . There are no self-dual modules or pairs of dual modules { 1 2 3} with trivial composition factors and less than two composition factors isomorphic to , so the combinations we are looking for are all of the form A i for some i 0 2 3 and A from Table 4.16.1. By checking which modules can be A we find the following possibilities for V . 144 39 39 ,144 78 , a b 3 b 3 CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 56

144 78 ,144 78 , c 3 d 3 144 104 and 144 104 a d We now check the dimension of the fixed point space of an involution on these six modules and compare it to that of E8(2) from Section 3.2. In the first five cases we get 126 and in the last case we get 128. There is no conjugacy class of involutions in E8(2) with fixed point space dimension 126 but there is one with dimension 128, 2D . This implies that if there exists a subgroup H L (3) in E (2) following E8(2) ⇠= 3 8 fusion pattern (i) then V = L(G) = 144 104 . |H ⇠ d

4.17 L3(4)

From Chapter 6 p87 we have that there are two feasible decompositions of L(G)for embeddings of subgroups H ⇠= L3(4) in E8(2). In [6] it is found that no there are no 2 elementary abelian subgroups of order 3 in E8(2) with compatible fixed space to that of feasible decomposition (i). We therefore proceed with feasible decomposition (ii) in a similar fashion to that applied to L3(3). We assume that there is a subgroup H ⇠= L3(4) in E (2) compatible with feasible decomposition (ii), such that M = L(G) has no 8 |H trivial submodules or quotients. From Lemma 3.5 we know that M is a submodule of P ( ) P ( ). We find the following irreducible modules: 2 3 From the feasible decomposition we are working with we know there is a submodule of dimension 56 containing all composition factors not isomorphic to 5. We can therefore ignore all indecomposable modules of dimension > 28 which are not self- dual. We also note that there are no modules with more trivial composition factors than composition factors of dimension 9, which given there are equal numbers in our feasible decomposition implies they are equal in all indecomposable summands. This allows us to ignore modules 34 and 54b, leaving the irreducibles and 20, 36b and 56b. This now leaves us with three types of possibilities for V = L(G) . |H

20 20 4 5 5 5

20 36 b 5 5 5 56 b 5 5 5 CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 57

Module Dual Multiplicity #1 #2 #3 #4 #5 9a 9b 1 0 1 0 0 0 9b 9a 1 0 0 1 0 0 16 SD 1 0 0 0 1 0 20 SD 2 2 1 1 0 0 34 SD 6 0 1 1 1 0 36a 36c 3 2 2 0 1 0 36b SD 6 2 1 1 1 0 36c 36a 3 2 0 2 1 0 45a 45b 42 2 2 1 1 0 45b 45a 42 2 1 2 1 0 54a 54c 18 2 2 2 1 0 54b SD 9 2 2 2 1 0 54c 54a 18 2 2 2 1 0 56a 56c 57 4 2 2 1 0 56b SD 27 4 2 2 1 0 56c 56a 57 4 2 2 1 0 64 SD 1 0 0 0 0 1

Table 4.17.1: Indecomposable L3(4)-modules

Unfortunately there is little further that can be determined. When checking the fixed space of involutions the modules of type 56b split into two cases, one with fixed space dimension 30 and one with fixed space dimension 32. Of the possibilities given above, the only cases with fixed space dimensions incompatible with those of E8(2) are the 56 where the 56 is one with fixed space dimension of an involution 30. b 5 5 5 b

4.18 U3(8)

From Chapter 6 p102 we have that there are two feasible decompositions of L(G)for embeddings of subgroups H ⇠= U3(8) in E8(2).

4.18.1 Case (ii)

For this case we assume there exists a subgroup H such that the restriction M = L(G) has no trivial quotients or submodules and is compatible with feasible decom- |H position (ii). There exists a minimal submodule S subject to the condition that all trivial composition factors are in S and S also has no trivial quotients or submodules. As M is self dual and the only irreducible module of U (8) in with dim H1(H, ) =0 3 i 6 is 3 then there must be a quotient of S isomorphic to 3. Taking the kernel, K,ofthis CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 58 quotient we now have a submodule of S with 8 trivial composition factors and only one 3 composition factor therefore by Lemma 3.3 there exists a trivial submodule of dimension at least 2. This is a contradiction and therefore no subgroup compatible with feasible decomposition (ii) can be maximal in E8(2) by Lemma 3.2.

4.18.2 Case (i)

From the atlas [16] we know that U3(8) has a maximal subgroup, M, isomorphic to 3 L (8), and by direct calculation combined with the fusion information in Chapter 6 ⇥ 2 we know that any element of order 3 in the center of M is in the 3D conjugacy class of

E8(2). Without loss of generality we may choose an element, x,in3DE8(2) and find its centraliser, C (x) = 3 U (2). We now wish to find up to conjugacy all subgroups E8(2) ⇠ ⇥ 9 of this U9(2) isomorphic to L2(8) which we shall do using the methods outlined in

Chapter 5. We first find an isomorphism from our U9(2) to the natural 43605-degree permutation representation of it using LMGRadicalQuotient. We must then find all cuspidal classes of subgroups of order 7 in U9(2), which is simple to do as the Sylow7 subgroup of U9(2) is of order 7, and so we get two parabolics with a single cuspi- 30 dal class each, P (1, 2, 7, 8) and P (2, 3, 6, 7), both with shape [2 ]:3.L3(4).3. Here, as in Chapter 5, we use P (xi,...,xj)todenotetheparabolicwithsimpleroots(xi,...xj).

In order to find these parabolics within our permutation representation of U9(2) we use the following stabilisers to form the maximal parabolics and then take appropriate intersections. We use PR to denote the permutation group isomorphic to U9(2) and ⌦ as the PR-set it acts upon.

P 1=P (2, 3, 4, 5, 6, 7) [215]:U (2) = Stab (1). ⇠ 7 PR Let T Sylow (P 1) and let SST be the fourth term in the upper central series of T , 2 2 4 of order 26. We then get

P 2=P (1, 2, 4, 5, 7, 8) [224]:U (2) 3.L (4).3=Stab (Fix (SST )). ⇠ 3 ⇥ 3 PR ⌦ 4

Letting T 0 be the derived subgroup of T and T 00 the derived subgroup of T 0 we get the final two maximal parabolics as

24 P 3=P (1, 3, 4, 5, 6, 8) [2 ] : Alt U (2) = Stab (Fix(T 0)) and ⇠ 5 ⇥ 5 PR CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 59

24 P 4=P (1, 2, 3, 5, 6, 7, 8) [2 ]:L (4) = Stab (Fix(T 00)). ⇠ 4 PR

Having applied the method to these subgroups and found two sets of copies of L2(8) we can check conjugacy in U9(2) and get five representative subgroups, 1 5.

1 3

For this case we assume there exists a subgroup i

4

For this case we assume there exists a subgroup 4

5

We now note that S ,aSylow subgroup of the chosen maximal 3 L (8) in U (2), is 2 2 ⇥ 2 9 elementary abelian of order 8 and there exists an element y of order 4 in CU9(2)(S2)such that y2 S . We therefore now search for all such elements in C (Sylow ( )). For 2 2 E8(2) 2 5 5 we let g1,g2,g3 be the three generators of S2 and use CentraliserOfInvolution to find C (g ), which as g 2D we know must be of shape [284]:Sp (2), E8(2) 1 1 2 E8(2) 8 therefore we can check we have the whole centraliser as CentraliserOfInvolution is Monte Carlo. We then use LMGRadicalQuotient, with quotient map q, to find just

2 the Sp8(2) and map S2 into this quotient. When we do this we find q(S2)isoforder2 and can calculate C (q(S )) and find it to be of order 210 3, and that the Sylow Sp8(2) 2 · 2 of the centraliser is self-normalising. Taking the inverse image of this centraliser we get a group C1oforder294 3whichcontainsC (S ). As we are only interested is · E8(2) 2 elements of order 4 we can take just the Sylow2sofC1, of which there are 3 by Sylow’s theorems. We know any element of C1thatcentralisesS2 must stabilise the fixed space, E,ofS2, so we use the command UnipotentStabiliser to find the stabiliser of E in each of the Sylow subgroups. We can now directly calculate the centraliser in these stabilisers giving us a collection of all unipotent elements which centralise S2. We now proceed to create an isomorphism to a PC group and make a transversal of the center in these centralisers and check each element of order 4 as to whether it squares into S2. When we do this none of the elements have the required properties so there are no copies of U3(8) generated in this case. CHAPTER 4. PROOF OF THEOREMS 1.2 AND 1.3 61

4.19 U3(16)

From Chapter 6 p122 we have that there are two feasible decompositions of L(G)for embeddings of subgroups H ⇠= U3(16) in E8(2). We assume that there exists a sub- group H = U (16) in G. We may infer that L(G) is semisimple as it is self dual ⇠ 3 |H with two non-isomorphic self dual composition factors, therefore there is exactly one possible restriction in each case that we shall denote M1 and M2. From the atlas [16], U (16) has a maximal subgroup S = 17 L (16) where any element in the center 3 ⇠ ⇥ 2 of S is in a U3(16) conjugacy class that fuses to 17CDE8(2) for both case (i) and (ii). As for x 17CD we know C (x) = 17 L (16) so C (x)=C (x)ifx H.We 2 E8(2) G ⇠ ⇥ 2 G H 2 may now choose up to conjugacy an x 17CD and must find its centraliser in G. 2 E8(2)

92 We choose an x such that it lies in a Levi complement, L,ofthe[2 ]:L8(2) stan- dard parabolic. Using the method from Section 5.1 we can search for the subgroup

S4 in the 2-core such that S4 is a four-dimensional trivial module for x. Having found this, we find the centraliser CL(x)oforder3.5.17 and choose an element, y, of order

15 in CL(x)thatactsirreduciblyonS4 (this should be all of them). Now in order to generate L2(16) from S4 and y we require an inverting involution for y. Using the method from Section 3.2 we can find an inverting involution and extended centraliser, EC, for y5 3D and in the radical quotient EC of this group we search for an 2 E8(2) inverting involution in the normaliser in EC of the image of y3 5B . We can also 2 E8(2) 5 find C (y) C (x )inasimilarfashionandsohavetheextendedcentraliserC⇤ (y). G  G G We now simply find any inverting involution in CG⇤ (y)thatcommuteswithx and we have full generation for CG(x).

We now compare the restriction of our two possible U3(16) modules M1andM2 to the maximal 17 L (16) with the restricition L(G) that we just obtained. For ⇥ 2 |CG(x) both M and M the composition factors of M have dimension 1 2 i|S 2,2,2,2,24,24,48,48,48,48; whereas for L(G) the composition factors have dimen- |CG(x) sion 1,1,1,1,1,1,1,1,8,8,16,16,16,16,32,32,32,64. This is a contradiction so we may con- clude that there are no subgroups isomorphic to U3(16) in E8(2). This, along with Tables 3.1.3 and 3.1.5 and Lemma 3.1, completes the proof of Theorem 1.1. Chapter 5

Proof of Theorem 1.4

5.1 Methodology

For the many groups in Table 3.1.2 the methods used for the groups in the previous section are either insucient to determine maximality, or too computationally dicult to complete, so we will now outline an alternative approach. In this method we find all embeddings of the groups in question up to conjugacy in E8(2) and then check individually if they are maximal.

Lemma 5.1. Let H be a group isomorphic to L (2n) n 3, 4, 5, 6, 7 and H 2 2 { } S Syl (H). Then S is elementary abelian of order 2n, there exists an element 2 2 x N (S) of order 2n 1 and an involution t that inverts x such that N (S)= S, x 2 H H h i and H = S, x, t . Furthermore x acts irreducibly on S. h i Proof. This can be easily checked by direct calculation in Magma.

Theorem 5.1 (Borel-Tits Theorem). Let H be a simple defined over an algebraically closed field of characteristic p =0. Let be a Frobenius morphism 6 on H and H the fixed point group of . Then let U be a non-identity p-subgroup of H . There then exists a parabolic subgroup P such that N (U) P and U O (P ). H ✓ ✓ p Proof. See Burgoyne, Williamson [12].

We now define a cuspidal class in an analogous fashion to those of Coxeter groups. A cuspidal class of G, a group of Lie type, is a conjugacy class C of G such that

62 CHAPTER 5. PROOF OF THEOREM 1.4 63

C H = for all parabolic subgroups H of G. \ ;

Lemma 5.2. Let G be a finite algebraic group with a parabolic subgroup H, p a prime, S (G) a Sylow subgroup of G and S (H) a Sylow subgroup of H. Then if S (G) = p p p p | p | S (H) there are no cuspidal classes of G of order p. | p |

Proof. By Sylow’s theorems we know that Sp(H)isaSylowp subgroup of G.For any element x of order p we can therefore find a Sylowp subgroup of G containing it and an element conjugating that subgroup to a Sylowp subgroup of H. This element conjugates x into H thereby proving the lemma.

By Lemma 5.1 for a subgroup H G, H = L (2n)wehaveS Syl (H)isele-  ⇠ 2 2 2 mentary abelian order 2n. As N (S) N (S)wecanuseTheorem5.1tosaythat H  G N (S) P for some parabolic subgroup P G, which as we are interested up to H   conjugacy can be chosen to be a standard parabolic. If the element x of order 2n 1 is in a cuspidal class then P is as small as possible; however, if it is not, then within P we can conjugate H into a smaller parabolic P 0 P whilst maintaining S O (P 0).   2 By choosing all parabolic subgroups with cuspidal classes we get, for a given n>3, a set ⇧ of parabolic subgroups for which all subgroups N (S) G for H = L (2n)exist H  ⇠ 2 as a subgroup of at least one parabolic. We then proceed to search each parabolic for all such NH (S).

Within a chosen parabolic subgroup P ⇧ we can choose representatives of the 2 cuspidal classes of its Levi complement and study the action of these elements on

O2(P ). Let x be such an element, then by Lemma 5.1 x acts irreducibly on S, so n we are looking for all subgroups of order 2 in O2(P )thatarefixedundertheac- tion of x. To do this we first find the action of x on the quotient O2(P )/F (O2(P )) where F (O2(P )) is the of Op(P )usingtheMagma code GModule, and find the preimage of all irreducible n-dimensional modules. As any possible S either projects fully or trivially into this quotient, S is then a subgroup of at least one of these preimages, so this process is repeated until the groups are small enough to allow all subgroups of order 2n fixed by x to be found. Due to the number of submodules of a direct sum of isomorphic irreducible modules, when the action of x CHAPTER 5. PROOF OF THEOREM 1.4 64

on O2(P )/F (O2(P )) has isomorphic irreducibles in its direct sum decomposition we instead take the preimage of the direct sum of these irreducibles, which will contain the preimages of all of the submodules we would otherwise have to find. Once all the irreducible subgroups of order 2n have been found we then must run through all

n inverting involutions in CG⇤ (x)tocheckiftheygenerateL2(2 ).

There are several stumbling blocks to the smooth running of the method outlined above that we shall now explain alongside the Magma code, found in Appendix A, that was used both for the method as a whole as well as the problem cases. In the first section of code we approach the general situation where we have some 2-group P and we know nothing of the structure of P or the action of x on P . Here we find the Frattini subgroup F (P )andnotethatthequotientP/F(P )iselementaryabelian and normal under the action of x, therefore can be considered as an -module using the GModule command. We are interested in n-dimensional minimal submodules of this module as any irreducible subgroup of order 2n will either be in the kernel of the quotient or project fully as such an irreducible module. We find a direct sum de- composition of the module and split the n-dimensional components into isomorphism classes; as a submodule s of a direct sum of irreducibles is a submodule of the direct sum of only those components isomorphic to s. Having found these direct sums we return to the group setting, where we now have a collection of smaller groups in which all irreducible subgroups reside. At this point we must split further calculation into two cases; one where there was more than one isomorphism class, and the other where there was only one. In the first case the subgroups we found are proper and we can repeat the process until we are left with just a collection of irreducible elementary abelian subgroups which we can then easily split up into groups of order 2n defined by the orbits of x on them. In the second case we must use a more computationally intense method.

In this second case repeating the method above would result in an infinite loop where the original subgroup P would be repeatedly returned, so we need a method of splitting this into smaller subcases. First we choose an element from every minimal n-dimensional submodule of M = P/F(P ). We do this by choosing an ordering on CHAPTER 5. PROOF OF THEOREM 1.4 65

the direct sum decomposition of S, and fixing a non-zero vector wi in each summand. Then we work through the summands collecting all vectors which are of the form v = w v where v is any vector contained in the direct sum of all sumands with i i i j>i. By pulling these back into the group setting this allows us to find all irreducible subgroups, Hi, as required, however there will commonly be far more of these than is practical to then perform any of the calculations previously described. We therefore look for properties of the generating element, hi of each group to allow us to rule many of them out. For this we require a subgroup A F (P ) such that F (P )/A Z(P/A)   and F (P )/A is elementary abelian. This subgroup can be found by first taking the commutator subgroup C =[P, F(P )] which gives F (P )/C Z(P/A), and then find-  ing the Frattini subgroup of F (P )/C gives us the subgroup containing C such that

F (P )/A is elementary abelian. Taking some Hi found before we know A E F (P ) E Hi and for an irreducible subgroup s to project non-trivially into Hi/F (P )itmustalso do so into H/A and therefore we are only interested in Hi such that hi is an involu- tion in Hi/A. This gives us an easy to check condition that frequently reduces the subcases drastically down to manageable proportions. In the cases that remain this extra condition implies that Hi/A is elementary abelian so we can proceed using our original method on each Hi.

Finally having found all the irreducible subgroups we need an ecient way of de- termining which pairs of an irreducible subgroup, s, and inverting involution generate

n acopyofL2(2 ). To do this we first check that the elements of s are in the same

E8(2) conjugacy class by checking their fixed space dimension. We then check the orders of products x t where x s, sieving out all those that give element orders · 2 n not in L2(2 ). Finally we check the number of composition factors of the restriction L(G) is consistent with a feasible decomposition. Having done this we generate the |s group s as a subgroup of GL248(2) and proceed from there.

In the following sections we shall use P (ij . . . )todenotetheparabolicsubgroup of G corresponding to the choice of roots xi,xj,.... CHAPTER 5. PROOF OF THEOREM 1.4 66

5.2 L2(128)

The Sylow-127 subgroup of G is cyclic of order 127, so without loss of generality we may choose a single 127-element in each parabolic that we have to search, for which all other 127-elements can be conjugated within the parabolic into the same Sylow- 127. The three standard parabolic subgroups containing elements cuspidal classes of order 127 are all isomorphic to L (2) and correspond to the roots 1, 3, 4, 5, 6, 7 , 7 { } 2, 4, 5, 6, 7, 8 and 3, 4, 5, 6, 7, 8 respectively. For each of these groups we need to { } { } choose an element of order 127, noted as x1,x2,x3 respectively, as well as the extended centraliser CG⇤ (xi)foreach.

From Table 3.1.4 the centraliser of an element of order 127 is Sym(3) 127. In ⇥ the case of P (134567) this centraliser can be found easily from the root elements as the longest root in the extended Dynkin diagram of E8 commutes with the whole parabolic and so generates the necessary Sym(3). Likewise in the P (245678) case, the group generated by the root 1 generates the necessary Sym(3). In the P (345678) case there is no such easy root construction; however, both it and P (245678) are contained in the maximal rank subgroup generated from the roots of the extended Dynkin dia- + gram without root 1, of shape ⌦16(2). Inside this group there exists both an element conjugating Sylow-127 subgroup of P (245678) containing x2 to a Sylow-127 subgroup of P (345678) and an involution which inverts x2. This allows us to generate CG⇤ (x2) and conjugate it to find x3 and CG⇤ (x3). The inverting involution for x1 was found using the method from section X applied within a Levi complement of P (1234567) ⇠= E7(2), giving us CG⇤ (x1). These CG⇤ (xi) contain four inverting involutions, so for each irre- ducible 27 subgroup found, we need to check with these four involutions to check for generation of an L2(128).

Using the method outlined above and the code in Appendix A we proceed to check each of the parabolic subgroups in turn. In each case there are no large bad cases as defined above, so the analysis runs smoothly and quickly and returns four subgroups in the case of P (134567) and two each for P (245678) and P (345678). We can directly calculate the dimension of the fixed space of these groups on V = L(G) , and we get |H CHAPTER 5. PROOF OF THEOREM 1.4 67

1fortwoofthegroupsinthecaseofP (134567) and 6 for all other groups. We can therefore use Lemma 3.2 to show that these groups are not maximal as required.

5.3 L2(32)

From Chapter 6 p105 we know there is only one feasible decomposition of L2(32) on L(G), from which we know that all elements of order 31 in a subgroup isomorphic to L2(32) must lie in the 31ABC class(es) in E8(2). There are 6 standard parabolics containing cuspidal classes of elements of order 31, all isomorphic to L5(2) and cor- responding to the roots 1, 2, 3, 4 , 1, 3, 4, 5 , 2, 4, 5, 6 , 3, 4, 5, 6 , 4, 5, 6, 7 and { } { } { } { } { } 5, 6, 7, 8 respectively. As before, for each of these groups, we need to choose an { } element of order 31, noted as x1,x2,x3,x4,x5,x6 respectively, as well as the extended centraliser CG⇤ (xi)foreach.

From Table 3.1.4 the centraliser of an element of 31ABC has centraliser 31 L (2). ⇥ 5 To find CG(x1) we use the extended Dynkin diagram to see that there is an L5(2) generated by the roots 6, 7, 8 and the longest root which commutes with P (1234) and { } therefore x1 and so we have CG(x1). We then find all other CG(xi)usingFindCentProc having picked the other xi to be of the appropriate conjugacy class in E8(2). To find an inverting involution for the xi we choose an element of order 5 in CG(xi)inE8(2)-class

5A and find its centraliser in E8(2). We then find the normaliser of in this centraliser and choose an inverting involution from there. This gives us all CG⇤ (xi)and in each there are 13888 inverting involutions for xi. We shall now describe the results for each parabolic that has to be checked. In this section we use the notation 84/64 to denote a subgroup of order 284 whose Frattini subgroup is of order 264, equivalently any other values in place of 84 and 64.

5.3.1 P(1234)

In the initial application of the method none of the irreducible subgroups found gen- erate an L2(32) with any inverting involution and we get the following bad cases:

b1 =84/64, b2 =84/64, b3 =40/10 CHAPTER 5. PROOF OF THEOREM 1.4 68

b4 =35/20, b5 =35/20, b6 =15/5, b7 =15/5

All of these bad cases apart from b3 can be tested using the method described in the previous section with no diculty and in these cases none of the irreducible subgroups found generate an L2(32) with any inverting involution. In the case of b3,dueto the large number of irreducible subgroups found, 150,000, we must parallelise the ⇠ ensuing checks with the set of inverting involutions. To do this we save the elements found that square into our chosen subgroup A and split them into ten sets to work with separately. Saving 150,000 matrices of dimension 248 even over GF (2) comprises a ⇠ vast amount of data, so we must also find an isomorphism between b3 and a PC group using the Magma code PCGroup. Having done all of this we find 1,500,000 copies ⇠ of L2(32) in this case, all of which fix a vector on L(G)andthereforebyLemma3.2 are not maximal.

5.3.2 P(1345)

In the initial application of the method none of the irreducible subgroups found gen- erate an L2(32) with any inverting involution and we get the following bad cases:

b1 =40/10, b2 =35/20, b3 =35/20, b4 =35/10, b5 =30/10

b6 =15/5, b7 =15/5, b8 =15/5, b9 =15/5

As in the case of P (1234) all of these bad cases except b1 can be tested using the method described in the previous section with no diculty and in these cases we get 140,000 copies of L (32), all of which fix a vector on L(G)andthereforebyLemma ⇠ 2 3.2 are not maximal. For b1 we go through the same steps as before and get the same results with 1,500,000 copies of L (32) in this case, all of which fix a vector on L(G) ⇠ 2 and therefore by Lemma 3.2 are not maximal.

5.3.3 P(2456)

In the initial application of the method none of the irreducible subgroups found gen- erate an L2(32) with any inverting involution and we get the following bad cases:

b1 =62/37, b2 =35/20, b3 =35/20, b4 =35/10, b5 =30/10 CHAPTER 5. PROOF OF THEOREM 1.4 69

b6 =15/5, b7 =15/5, b8 =15/5, b9 =15/5

As in the case of P (1345) all of these bad cases except b1 can be tested using the method described in the previous section with no diculty and in these cases we get 150,000 ⇠ copies of L2(32), all of which fix a vector on L(G)andthereforebyLemma3.2are not maximal. For b1 we get 37,921 elements that square into our chosen subgroup A, which, due to the combination of a large number of elements and a relatively large Frattini subgroup, requires a similar parallelisation to that used before. In this case we get 38,000 irreducible subgroups and 112,000 copies of L (32), all of which fix ⇠ ⇠ 2 avectoronL(G)andthereforebyLemma3.2arenotmaximal.

5.3.4 P(3456)

In the initial application of the method none of the irreducible subgroups found gen- erate an L2(32) with any inverting involution and we get the following bad cases:

b1 =62/37, b2 =35/20, b3 =35/20, b4 =35/10, b5 =30/10

b6 =15/5, b7 =15/5, b8 =15/5, b9 =15/5

As in the case of P (2456) all of these bad cases except b1 can be tested using the method described in the previous section with no diculty and in these cases we get 125,000 ⇠ copies of L2(32), all of which fix a vector on L(G)andthereforebyLemma3.2are not maximal. For b1 we get 37,921 elements that square into our chosen subgroup A, which, as before due to the combination of a large number of elements and a relatively large Frattini subgroup, requires a similar parallelisation to that used before. In this case we get 38,000 irreducible subgroups and 112,000 copies of L (32), all of which ⇠ ⇠ 2 fix a vector on L(G)andthereforebyLemma3.2arenotmaximal.

5.3.5 P(4567)

In the initial application of the method none of the irreducible subgroups found gen- erate an L2(32) with any inverting involution and we get the following bad cases:

b1 =101/76, b2 =35/20, b3 =35/20

b4 =30/10, b5 =30/10, b6 =15/5, b7 =15/5 CHAPTER 5. PROOF OF THEOREM 1.4 70

As in the case of P (3456) all of these bad cases except b1 can be tested using the method described in the previous section with no diculty and in these cases we get 33,000 copies of L (32), all of which fix a vector on L(G)andthereforebyLemma3.2 ⇠ 2 are not maximal. For b1 we get 1681 elements that square into our chosen subgroup A, which despite a small number of elements requires a similar parallelisation to before due to the size of the Frattini subgroup; however, in this case finding an isomorphism to a PC group is unnecessary. In this case we get 250,000 copies of L (32), all of ⇠ 2 which fix a vector on L(G)andthereforebyLemma3.2arenotmaximal.

5.3.6 P(5678)

In this case the initial application of the method stalls very quickly as a single bad case is found:

b1 =106/76

Fortunately in this case there are only 5000 elements that square into our chosen ⇠ subgroup A so we can progress as in the b1 case of P (4567). Running through these elements we find four more bad cases for each, however as these actually lie in A there are only four cases total. Outside of these bad cases we get 5400 irreducible ⇠ subgroups and 1,000,000 copies of L (32), all of which fix a vector on L(G)and ⇠ 2 therefore by Lemma 3.2 are not maximal. The extra bad cases found are of the form

b1 =35/20, b2 =35/20, b3 =15/5, b4 =15/5

In these cases we get 22 irreducible subgroups and no copies of L2(32).

As we have now checked all necessary parabolic subgroups and found no subgroups isomorphic to L2(32) that do not fix a vector on L(G), we can conclude that there are no maximal subgroups of E8(2) isomorphic to L2(32). We note at this point that the total number of subgroups isomorphic to L2(32) found by this analysis is less than 5,200,000 which concludes our proof of Theorem 1.4. Chapter 6

Brauer Character Tables

The tables in this section have all been calculated by the methods detailed in Section 3.3 and are given in full for modules with dimension 248 with the following excep-  tions. The tables for L3(16), U3(16), Sp8(4), G2(8), L3(8) and L4(4) have had their elements of orders > 21 omitted as reproducing these would require too much space, + likewise ⌦8 (4) has had the elements of orders > 7omitted.Thetablesmostlyfollow atlas notation with a few modifications for simplicity, notably in many cases the

1 notation for slave classes has been omitted. In this section we refer to dimH (G, i) as the cohomological dimension of i.

Table 6.0.1

L (7) 1A 3A 7A 7B 2 ⇤⇤ 1 111 1 30b7 2 ⇤⇤ 30 b7 3 ⇤⇤ 4 8-11 1

Feasible Decompositions (L2(7))

(i) 10 +21 +21 +14 (3A 3D, 7A 7B, 7B 7B) 1 2 3 4 ! ! ⇤⇤ !

(ii) 24 +0 +0 +28 (3A 3D, 7A 7A, 7B 7A) 1 2 3 4 ! ! ⇤⇤ !

71 CHAPTER 6. BRAUER CHARACTER TABLES 72

(iii) 16 +24 +24 +11 (3A 3C, 7A 7B, 7B 7B) 1 2 3 4 ! ! ⇤⇤ !

(iv) 30 +3 +3 +25 (3A 3C, 7A 7A, 7B 7A) 1 2 3 4 ! ! ⇤⇤ !

(v) 22 +27 +27 +8 (3A 3B, 7A 7B, 7B 7B) 1 2 3 4 ! ! ⇤⇤ !

(vi) 36 +6 +6 +22 (3A 3B, 7A 7A, 7B 7A) 1 2 3 4 ! ! ⇤⇤ !

(vii) 78 +27 +27 +1 (3A 3A, 7A 7A, 7B 7A) 1 2 3 4 ! ! ⇤⇤ !

Cohomological Dimensions (L2(7))

2 =1,3 =1,4 =0.

Table 6.0.2

Alt(6) 1A 3A 3B 5AB

1 111 1

2 41-2-1

3 4-21 -1

4 16 -2 -2 1

Feasible Decompositions (Alt(6))

(i) 24 +16 +16 +6 (3A 3D, 3B 3D, 5AB 5B) 1 2 3 4 ! ! !

(ii) 24 +6 +6 +11 (3A 3D, 3B 3D, 5AB 5A) 1 2 3 4 ! ! !

(iii) 28 +16 +19 +5 (3A 3D, 3B 3C, 5AB 5B) 1 2 3 4 ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 73

(iv) 28 +6 +9 +10 (3A 3D, 3B 3C, 5AB 5A) 1 2 3 4 ! ! !

(v) 32 +16 +22 +4 (3A 3D, 3B 3B, 5AB 5B) 1 2 3 4 ! ! !

(vi) 32 +6 +12 +9 (3A 3D, 3B 3B, 5AB 5A) 1 2 3 4 ! ! !

(vii) 60 +6 +33 +2 (3A 3D, 3B 3A, 5AB 5A) 1 2 3 4 ! ! !

(viii) 28 +19 +16 +5 (3A 3C, 3B 3D, 5AB 5B) 1 2 3 4 ! ! !

(ix) 28 +9 +6 +10 (3A 3C, 3B 3D, 5AB 5A) 1 2 3 4 ! ! !

(x) 32 +19 +19 +4 (3A 3C, 3B 3C, 5AB 5B) 1 2 3 4 ! ! !

(xi) 32 +9 +9 +9 (3A 3C, 3B 3C, 5AB 5A) 1 2 3 4 ! ! !

(xii) 36 +19 +22 +3 (3A 3C, 3B 3B, 5AB 5B) 1 2 3 4 ! ! !

(xiii) 36 +9 +12 +8 (3A 3C, 3B 3B, 5AB 5A) 1 2 3 4 ! ! !

(xiv) 64 +9 +33 +1 (3A 3C, 3B 3A, 5AB 5A) 1 2 3 4 ! ! !

(xv) 32 +22 +16 +4 (3A 3B, 3B 3D, 5AB 5B) 1 2 3 4 ! ! !

(xvi) 32 +12 +6 +9 (3A 3B, 3B 3D, 5AB 5A) 1 2 3 4 ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 74

(xvii) 36 +22 +19 +3 (3A 3B, 3B 3C, 5AB 5B) 1 2 3 4 ! ! !

(xviii) 36 +12 +9 +8 (3A 3B, 3B 3C, 5AB 5A) 1 2 3 4 ! ! !

(xix) 40 +22 +22 +2 (3A 3B, 3B 3B, 5AB 5B) 1 2 3 4 ! ! !

(xx) 40 +12 +12 +7 (3A 3B, 3B 3B, 5AB 5A) 1 2 3 4 ! ! !

(xxi) 68 +12 +33 +0 (3A 3B, 3B 3A, 5AB 5A) 1 2 3 4 ! ! !

(xxii) 60 +33 +6 +2 (3A 3A, 3B 3D, 5AB 5A) 1 2 3 4 ! ! !

(xxiii) 64 +33 +9 +1 (3A 3A, 3B 3C, 5AB 5A) 1 2 3 4 ! ! !

(xxiv) 68 +33 +12 +0 (3A 3A, 3B 3B, 5AB 5A) 1 2 3 4 ! ! !

Cohomological Dimensions (Alt(6))

2 =1,3 =1,4 =0.

Table 6.0.3

L2(8) 1A 3A 7AC 9AC

1 11 1 1

2 6-3-10

3 8-11 -1

4 12 3 -2 -3 CHAPTER 6. BRAUER CHARACTER TABLES 75

Feasible Decompositions (L2(8))

(i) 64 +2 +8 +9 (3A 3A, 7AC 7A, 9AC 9A) 1 2 3 4 ! ! !

(ii) 30 +13 +4 +9 (3A 3B, 7AC 7B, 9AC 9D) 1 2 3 4 ! ! !

(iii) 32 +14 +3 +9 (3A 3B, 7AC 7B, 9AC 9C) 1 2 3 4 ! ! !

(iv) 36 +16 +1 +9 (3A 3B, 7AC 7B, 9AC 9B) 1 2 3 4 ! ! !

(v) 28 +14 +5 +8 (3A 3C, 7AC 7B, 9AC 9D) 1 2 3 4 ! ! !

(vi) 30 +15 +4 +8 (3A 3C, 7AC 7B, 9AC 9C) 1 2 3 4 ! ! !

(vii) 34 +17 +2 +8 (3A 3C, 7AC 7B, 9AC 9B) 1 2 3 4 ! ! !

(viii) 26 +15 +6 +7 (3A 3D, 7AC 7B, 9AC 9D) 1 2 3 4 ! ! !

(ix) 28 +16 +5 +7 (3A 3D, 7AC 7B, 9AC 9C) 1 2 3 4 ! ! !

(x) 32 +18 +3 +7 (3A 3D, 7AC 7B, 9AC 9B) 1 2 3 4 ! ! !

(xi) 32 +0 +24 +2 (3A 3B, 7AC 7A, 9AC 9C) 1 2 3 4 ! ! !

(xii) 36 +2 +22 +2 (3A 3B, 7AC 7A, 9AC 9B) 1 2 3 4 ! ! !

(xiii) 50 +9 +15 +2 (3A 3B, 7AC 7A, 9AC 9A) 1 2 3 4 ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 76

(xiv) 28 +0 +26 +1 (3A 3C, 7AC 7A, 9AC 9D) 1 2 3 4 ! ! !

(xv) 30 +1 +25 +1 (3A 3C, 7AC 7A, 9AC 9C) 1 2 3 4 ! ! !

(xvi) 34 +3 +23 +1 (3A 3C, 7AC 7A, 9AC 9B) 1 2 3 4 ! ! !

(xvii) 48 +10 +16 +1 (3A 3C, 7AC 7A, 9AC 9A) 1 2 3 4 ! ! !

(xviii) 26 +1 +27 +0 (3A 3D, 7AC 7A, 9AC 9D) 1 2 3 4 ! ! !

(xix) 28 +2 +26 +0 (3A 3D, 7AC 7A, 9AC 9C) 1 2 3 4 ! ! !

(xx) 32 +4 +24 +0 (3A 3D, 7AC 7A, 9AC 9B) 1 2 3 4 ! ! !

(xxi) 46 +11 +17 +0 (3A 3D, 7AC 7A, 9AC 9A) 1 2 3 4 ! ! !

Cohomological Dimensions (L2(8))

2 =3,3 =0,4 =0.

Table 6.0.4

L2(11) 1A 3A 5AB 11AB

1 11 1 1

2 10 -2 0 -1

3 10 1 0 -1

4 24 0 -1 2 CHAPTER 6. BRAUER CHARACTER TABLES 77

Feasible Decompositions (L2(11))

(i) 4 +6 +4 +6 (3A 3D, 5AB 5B, 11AB 11A) 1 2 3 4 ! ! !

(ii) 24 +16 +4 +1 (3A 3D, 5AB 5A, 11AB 11A) 1 2 3 4 ! ! !

(iii) 4 +3 +7 +6 (3A 3C, 5AB 5B, 11AB 11A) 1 2 3 4 ! ! !

(iv) 24 +13 +7 +1 (3A 3C, 5AB 5A, 11AB 11A) 1 2 3 4 ! ! !

(v) 4 +0 +10 +6 (3A 3B, 5AB 5B, 11AB 11A) 1 2 3 4 ! ! !

(vi) 24 +10 +10 +1 (3A 3B, 5AB 5A, 11AB 11A) 1 2 3 4 ! ! !

Cohomological Dimensions (L2(11))

2 =2,3 =0,4 =0.

Table 6.0.5

L2(13) 1A 3A 7AC 13AB

1 11 1 1

2 12 0 -2 -1

3 14 -1 0 1

4 36 0 1 -3

Feasible Decompositions (L2(13))

(i) 4 +2 +8 +3 (3A 3D, 7AC 7B, 13AB 13B) 1 2 3 4 ! ! !

(ii) 8 +3 +12 +1 (3A 3D, 7AC 7B, 13AB 13A) 1 2 3 4 ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 78

(iii) 10 +5 +5 +3 (3A 3C, 7AC 7B, 13AB 13B) 1 2 3 4 ! ! !

(iv) 14 +6 +9 +1 (3A 3C, 7AC 7B, 13AB 13A) 1 2 3 4 ! ! !

(v) 16 +8 +2 +3 (3A 3B, 7AC 7B, 13AB 13B) 1 2 3 4 ! ! !

(vi) 20 +9 +6 +1 (3A 3B, 7AC 7B, 13AB 13A) 1 2 3 4 ! ! !

Cohomological Dimensions (L2(13))

2 =2,3 =0,4 =0.

Table 6.0.6

L (17) 1A 3A 9AC 17A 17B 2 ⇤ 1 11 1 1 1 8-1-1b17 2 ⇤ 8-1-1 b17 3 ⇤ 4 16 -2 1 -1 -1

5 48 3 0 -3 -3

Feasible Decompositions (L2(17))

(i) 16 +4 +5 +1 +3 (3A 3B, 9AC 9B, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(ii) 16 +5 +4 +1 +3 (3A 3B, 9AC 9B, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(iii) 16 +5 +6 +3 +2 (3A 3C, 9AC 9B, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(iv) 16 +6 +5 +3 +2 (3A 3C, 9AC 9B, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤! CHAPTER 6. BRAUER CHARACTER TABLES 79

(v) 16 +7 +8 +1 +2 (3A 3C, 9AC 9C, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(vi) 16 +8 +7 +1 +2 (3A 3C, 9AC 9C, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(vii) 16 +8 +9 +0 +2 (3A 3C, 9AC 9D, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(viii) 16 +9 +8 +0 +2 (3A 3C, 9AC 9D, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(ix) 32 +1 +8 +6 +1 (3A 3B, 9AC 9A, 17A 17AB, 17B 17AB) 1 2 3 4 5 ! ! ! ⇤!

(x) 32 +8 +1 +6 +1 (3A 3B, 9AC 9A, 17A 17AB, 17B 17AB) 1 2 3 4 5 ! ! ! ⇤!

(xi) 16 +6 +7 +5 +1 (3A 3D, 9AC 9B, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(xii) 16 +7 +6 +5 +1 (3A 3D, 9AC 9B, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(xiii) 16 +8 +9 +3 +1 (3A 3D, 9AC 9C, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(xiv) 16 +9 +8 +3 +1 (3A 3D, 9AC 9C, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(xv) 16 +9 +10 +2 +1 (3A 3D, 9AC 9D, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(xvi) 16 +10 +9 +2 +1 (3A 3D, 9AC 9D, 17A 17CD, 17B 17CD) 1 2 3 4 5 ! ! ! ⇤!

(xvii) 32 +2 +9 +8 +0 (3A 3C, 9AC 9A, 17A 17AB, 17B 17AB) 1 2 3 4 5 ! ! ! ⇤! CHAPTER 6. BRAUER CHARACTER TABLES 80

(xviii) 32 +9 +2 +8 +0 (3A 3C, 9AC 9A, 17A 17AB, 17B 17AB) 1 2 3 4 5 ! ! ! ⇤!

(xix) 32 +9 +16 +1 +0 (3A 3C, 9AC 9B, 17A 17AB, 17B 17AB) 1 2 3 4 5 ! ! ! ⇤!

(xx) 32 +16 +9 +1 +0 (3A 3C, 9AC 9B, 17A 17AB, 17B 17AB) 1 2 3 4 5 ! ! ! ⇤!

Cohomological Dimensions (L2(17))

2 =1,3 =1,4 =0,5 =0.

Table 6.0.7

L2(19) 1A 3A 5AB 9AC 19AB

1 11 1 1 1

2 18 0 -2 0 -1

3 20 2 0 -1 1

4 36 0 1 0 -2

5 60 -3 0 0 3

Feasible Decompositions (L2(19))

(i) 0 +2 +1 +2 +2 (3A 3D, 5AB 5B, 9AC 9D, 19AB 19A) 1 2 3 4 5 ! ! ! !

(ii) 2 +3 +0 +2 +2 (3A 3D, 5AB 5B, 9AC 9C, 19AB 19A) 1 2 3 4 5 ! ! ! !

(iii) 2 +3 +3 +2 +1 (3A 3C, 5AB 5B, 9AC 9D, 19AB 19A) 1 2 3 4 5 ! ! ! !

(iv) 4 +4 +2 +2 +1 (3A 3C, 5AB 5B, 9AC 9C, 19AB 19A) 1 2 3 4 5 ! ! ! !

(v) 8 +6 +0 +2 +1 (3A 3C, 5AB 5B, 9AC 9B, 19AB 19A) 1 2 3 4 5 ! ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 81

(vi) 4 +4 +5 +2 +0 (3A 3B, 5AB 5B, 9AC 9D, 19AB 19A) 1 2 3 4 5 ! ! ! !

(vii) 6 +5 +4 +2 +0 (3A 3B, 5AB 5B, 9AC 9C, 19AB 19A) 1 2 3 4 5 ! ! ! !

(viii) 10 +7 +2 +2 +0 (3A 3B, 5AB 5B, 9AC 9B, 19AB 19A) 1 2 3 4 5 ! ! ! !

Cohomological Dimensions (L2(19))

2 =2,3 =0,4 =0,5 =0.

Table 6.0.8

L2(16) 1A 3A 5AB 15AD 17AD 17EH

1 11 1 1 1 1 8-4-2 1 b17 2 ⇤ 82 3 -3 b17 3 ⇤ 4 16 4 -4 -1 -1 -1

5 16 1 1 1 -1 -1 32 -4 2 -4 2b17-1 6 ⇤

Feasible Decompositions (L2(16))

(i) 32 +1 +8 +8 +1 +0 (3A 3A, 5AB 5A, 15AD 15B, 17AD 17AB, 1 2 3 4 5 6 ! ! ! ! 17EH 17AB) !

(ii) 16 +8 +9 +2 +4 +0 (3A 3B, 5AB 5A, 15AD 15E, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) !

(iii) 16 +9 +8 +1 +5 +0 (3A 3C, 5AB 5A, 15AD 15D, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) ! CHAPTER 6. BRAUER CHARACTER TABLES 82

(iv) 32 +8 +1 +1 +8 +0 (3A 3B, 5AB 5A, 15AD 15A, 17AD 17AB, 1 2 3 4 5 6 ! ! ! ! 17EH 17AB) !

(v) 16 +7 +4 +5 +2 +1 (3A 3B, 5AB 5B, 15AD 15F, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) !

(vi) 16 +7 +6 +1 +5 +1 (3A 3C, 5AB 5A, 15AD 15D, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) !

(vii) 16 +8 +5 +0 +6 +1 (3A 3D, 5AB 5A, 15AD 15C, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) !

(viii) 16 +9 +4 +4 +0 +2 (3A 3D, 5AB 5B, 15AD 15G, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) !

(ix) 16 +5 +2 +5 +2 +2 (3A 3B, 5AB 5B, 15AD 15F, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) !

(x) 16 +6 +3 +0 +6 +2 (3A 3D, 5AB 5A, 15AD 15C, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) !

(xi) 16 +7 +2 +4 +0 +3 (3A 3D, 5AB 5B, 15AD 15G, 17AD 17CD, 1 2 3 4 5 6 ! ! ! ! 17EH 17CD) !

Cohomological Dimensions (L2(16))

2 =4,3 =0,4 =0,5 =0,6 =0. CHAPTER 6. BRAUER CHARACTER TABLES 83

Table 6.0.9

L3(3) 1A 3A 3B 13AD

1 111 1

2 12 3 0 -1

3 26 -1 -1 0

4 64 -8 4 -1

Feasible Decompositions (L3(3))

(i) 4 +3 +8 +0 (3A 3C, 3B 3D, 13AD 13B) 1 2 3 4 ! ! !

(ii) 6 +4 +5 +1 (3A 3C, 3B 3C, 13AD 13B) 1 2 3 4 ! ! !

(iii) 14 +0 +9 +0 (3A 3C, 3B 3C, 13AD 13A) 1 2 3 4 ! ! !

(iv) 8 +5 +2 +2 (3A 3C, 3B 3B, 13AD 13B) 1 2 3 4 ! ! !

(v) 16 +1 +6 +1 (3A 3C, 3B 3B, 13AD 13A) 1 2 3 4 ! ! !

Cohomological Dimensions (L3(3))

2 =1,3 =1,4 =0.

Table 6.0.10

U (3) 1A 3A 3B 7A 7B 3 ⇤⇤ 1 111 1 1

2 6-30 -1-1

3 14 5 -1 0 0 32 -4 -1 -b7 4 ⇤⇤ 32 -4 -1 -b7 5 ⇤⇤ CHAPTER 6. BRAUER CHARACTER TABLES 84

Feasible Decompositions (U3(3))

(i) 6 +5 +6 +2 +2 (3A 3C, 3B 3D, 7A 7B, 7B 7B) 1 2 3 4 5 ! ! ! ⇤⇤ !

(ii) 14 +12 +7 +1 +1 (3A 3C, 3B 3C, 7A 7B, 7B 7B) 1 2 3 4 5 ! ! ! ⇤⇤ !

(iii) 22 +19 +8 +0 +0 (3A 3C, 3B 3B, 7A 7B, 7B 7B) 1 2 3 4 5 ! ! ! ⇤⇤ !

(iv) 78 +26 +1 +0 +0 (3A 3C, 3B 3A, 7A 7A, 7B 7A) 1 2 3 4 5 ! ! ! ⇤⇤ !

Cohomological Dimensions (U3(3))

2 =1,3 =0,4 =0,5 =0.

Table 6.0.11

L2(25) 1A 3A 5A 5B 13AF

1 1111 1

2 12 0 -3 2 -1

3 12 0 2 -3 -1

4 26 -1 1 1 0

5 144 0 -6 -6 1

Feasible Decompositions (L2(25))

(i) 0 +0 +0 +4 +1 (3A 3D, 5A 5B, 5B 5B, 13AF 13B) 1 2 3 4 5 ! ! ! !

(ii) 6 +3 +3 +1 +1 (3A 3C, 5A 5B, 5B 5B, 13AF 13B) 1 2 3 4 5 ! ! ! !

(iii) 10 +7 +2 +5 +0 (3A 3C, 5A 5B, 5B 5A, 13AF 13B) 1 2 3 4 5 ! ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 85

(iv) 10 +2 +7 +5 +0 (3A 3C, 5A 5A, 5B 5B, 13AF 13B) 1 2 3 4 5 ! ! ! !

(v) 14 +0 +0 +9 +0 (3A 3C, 5A 5A, 5B 5A, 13AF 13A) 1 2 3 4 5 ! ! ! !

(vi) 16 +10 +5 +2 +0 (3A 3B, 5A 5B, 5B 5A, 13AF 13B) 1 2 3 4 5 ! ! ! !

(vii) 16 +5 +10 +2 +0 (3A 3B, 5A 5A, 5B 5B, 13AF 13B) 1 2 3 4 5 ! ! ! !

(viii) 20 +3 +3 +6 +0 (3A 3B, 5A 5A, 5B 5A, 13AF 13A) 1 2 3 4 5 ! ! ! !

Cohomological Dimensions (L2(25))

2 =1,3 =1,4 =0,5 =0.

Table 6.0.12

M11 1A 3A 5A 11AB

1 111 1

2 10 1 0 -1

3 32 -4 2 -1

4 44 -1 -1 0

Feasible Decompositions (M11)

(i) 14 +3 +5 +1 (3A 3D, 5A 5A, 11AB 11A) 1 2 3 4 ! ! !

(ii) 16 +6 +4 +1 (3A 3C, 5A 5A, 11AB 11A) 1 2 3 4 ! ! !

(iii) 18 +9 +3 +1 (3A 3B, 5A 5A, 11AB 11A) 1 2 3 4 ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 86

Cohomological Dimensions (M11)

2 =1,3 =0,4 =1.

Table 6.0.13

L2(27) 1A 3AB 7AC 13AF

1 111 1

2 26 -1 -2 0

3 78 -3 1 0

4 168 6 0 -1

Feasible Decompositions (L2(27))

(i) 2 +0 +1 +1 (3AB 3C, 7AC 7B, 13AF 13B) 1 2 3 4 ! ! !

(ii) 14 +6 +1 +0 (3AB 3C, 7AC 7B, 13AF 13A) 1 2 3 4 ! ! !

Cohomological Dimensions (L2(27))

2 =2,3 =0,4 =0.

Table 6.0.14

L (31) 1A 3A 5AB 15AD 31A 31B 2 ⇤⇤ 1 11 1 1 1 1 15 0 0 0 b31 2 ⇤⇤ 15 0 0 0 b31 3 ⇤⇤ 4 32 -1 2 -1 1 1

5 64 4 -1 -1 2 2

6 128 -4 -2 1 4 4 CHAPTER 6. BRAUER CHARACTER TABLES 87

Feasible Decompositions (L2(31))

(i) 0 +4 +4 +0 +0 +1 (3A 3D, 5AB 5B, 15AD 15G, 31A 31D, 1 2 3 4 5 6 ! ! ! ! 31B 31D) ⇤⇤ !

Cohomological Dimensions (L2(31))

2 =1,3 =1,4 =0,5 =0,6 =0.

Table 6.0.15

L (4) 1A 3A 5AB 7A 7B 3 ⇤⇤ 1 11 1 1 1 90 -1b7-1 2 ⇤⇤ 90 -1 b7-1 3 ⇤⇤ 4 16 -2 1 2 2

5 64 1 -1 1 1

Feasible Decompositions (L3(4))

(i) 2 +3 +3 +4 +2 (3A 3D, 5AB 5B, 7A 7B, 7B 7B) 1 2 3 4 5 ! ! ! ⇤⇤ !

(ii) 4 +2 +2 +1 +3 (3A 3C, 5AB 5B, 7A 7B, 7B 7B) 1 2 3 4 5 ! ! ! ⇤⇤ !

Cohomological Dimensions (L3(4))

2 =2,3 =2,4 =0,5 =0. CHAPTER 6. BRAUER CHARACTER TABLES 88

Table 6.0.16

U4(2) 1A 3AB 3C 3D 5A 9AB

1 111111

2 6-33010

3 8-1-42-2-1

4 14 5 2 -1 -1 -1

5 40 4 -8 -2 0 1

6 64 -8 4 -2 -1 1

Feasible Decompositions (U4(2))

(i) 6 +4 +4 +3 +2 +1 (3AB 3C, 3C 3D, 3D 3C, 5A 5B, 9AB 9C) 1 2 3 4 5 6 ! ! ! ! !

(ii) 8 +8 +7 +4 +2 +0 (3AB 3C, 3C 3D, 3D 3B, 5A 5B, 9AB 9D) 1 2 3 4 5 6 ! ! ! ! !

(iii) 12 +0 +5 +2 +1 +2 (3AB 3C, 3C 3D, 3D 3B, 5A 5B, 1 2 3 4 5 6 ! ! ! ! 9AB 9B) !

(iv) 2 +5 +2 +4 +2 +1 (3AB 3C, 3C 3C, 3D 3D, 5A 5B, 1 2 3 4 5 6 ! ! ! ! 9AB 9D) !

(v) 10 +5 +6 +4 +1 +1 (3AB 3C, 3C 3C, 3D 3B, 5A 5B, 1 2 3 4 5 6 ! ! ! ! 9AB 9C) !

(vi) 4 +2 +1 +4 +1 +2 (3AB 3C, 3C 3B, 3D 3D, 5A 5B, 9AB 9C) 1 2 3 4 5 6 ! ! ! ! !

(vii) 6 +6 +4 +5 +1 +1 (3AB 3C, 3C 3B, 3D 3C, 5A 5B, 9AB 9D) 1 2 3 4 5 6 ! ! ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 89

(viii) 46 +10 +16 +1 +0 +0 (3AB 3C, 3C 3B, 3D 3A, 5A 5A, 1 2 3 4 5 6 ! ! ! ! 9AB 9A) !

(ix) 18 +17 +2 +8 +0 +0 (3AB 3C, 3C 3A, 3D 3B, 5A 5A, 1 2 3 4 5 6 ! ! ! ! 9AB 9B) !

Cohomological Dimensions (U4(2))

2 =0,3 =2,4 =1,5 =0,6 =0.

Table 6.0.17

L2(41) 1A 3A 5AB 7AC 21AF 41A 41B

1 11 1 1 1 1 1 20 -1 0 -1 -1 b41 2 ⇤ 20 -1 0 -1 -1 b41 3 ⇤ 4 40 1 0 -2 1 -1 -1

5 84 0 -1 0 0 2 2

6 120 -6 0 1 1 -3 -3

7 240 6 0 2 -1 -6 -6

Feasible Decompositions (L2(41))

There are no feasible decompositions for L2(41)

Cohomological Dimensions (L2(41))

2 =13 =14 =05 =06 =07 =0 CHAPTER 6. BRAUER CHARACTER TABLES 90

Table 6.0.18

M12 1A 3A 3B 5A 11AB

1 1111 1

2 10 1 -2 0 -1

3 32 -4 2 2 -1

4 44 -1 2 -1 0

5 144 0 -3 -1 1

Feasible Decompositions (M12)

(i) 16 +6 +4 +1 +0 (3A 3C, 3B 3B, 5A 5A, 11AB 11A) 1 2 3 4 5 ! ! ! !

Cohomological Dimensions (M12)

2 =2,3 =0,4 =1,5 =0.

Table 6.0.19

L3(5) 1A 3A 5A 5B 31AE 31FJ

1 1111 1 1

2 30 0 5 0 -1 -1

3 124 1 -1 -1 0 0

4 124 -2 -1 -1 0 0 480 0 -20 5 b31 5 ⇤⇤ 480 0 -20 5 b31 6 ⇤⇤

Feasible Decompositions (L3(5))

(i) 0 +0 +0 +2 +0 +0 (3A 3D, 5A 5B, 5B 5B, 31AE 31D, 1 2 3 4 5 6 ! ! ! ! 31FJ 31D) !

Cohomological Dimensions (L3(5))

2 =1,3 =0,4 =1,5 =0,6 =0. CHAPTER 6. BRAUER CHARACTER TABLES 91

Table 6.0.20

J2 1A 3A 3B 5AB 5CD 7A 15AB

1 111 1 11 1

2 12 -6 0 2 -3 -2 -1

3 28 10 -2 3 3 0 0

4 36 9 0 -4 1 1 -1

5 84 -15 0 -6 -1 0 0

6 128 -16 -4 8 -2 2 -1

7 160 16 1 -5 0 -1 1

Feasible Decompositions (J2)

(i) 16 +8 +1 +3 +0 +0 +0 (3A 3C, 3B 3B, 5AB 5A, 5CD 5B, 1 2 3 4 5 6 7 ! ! ! ! 7A 7B, 15AB 15D) ! !

Cohomological Dimensions (J3)

2 =2,3 =0,4 =0,5 =1,6 =0,7 =0.

Table 6.0.21

Sp4(4) 1A 3A 3B 5AB 5CD 5E 15AB 15CD 17AB 17CD

1 111 1 11 1 1 1 1 8-42 -23-2 1 -3b17 2 ⇤ 82-43 -2-2-31 b17 3 ⇤ 4 16 4 1 -4 1 1 -1 1 -1 -1

5 16 1 4 1 -4 1 1 -1 -1 -1 32 -4 -4 2 -8 2 -4 1 2b17-1 6 ⇤ 32 -4 -4 -8 2 2 1 -4 2b17-1 7 ⇤ 128 8 -4 -12 -2 -2 3 1 -b17 8 ⇤ 128 -4 8 -2 -12 -2 1 3 -b17 9 ⇤ 10 256 4 4 -4 -4 1 -1 -1 1 1 CHAPTER 6. BRAUER CHARACTER TABLES 92

Feasible Decompositions(Sp4(4))

(i) 8 +4 +2 +2 +0 +1 +0 +0 +1 +0 (3A 3D, 3B 3B, 1 2 3 4 5 6 7 8 9 10 ! ! 5AB 5B, 5CD 5B, 5E 5B, 15AB 15G, 15CD 15F 17AB 17CD, 17CD 17CD) ! ! ! ! ! ! !

(ii) 8 +2 +4 +0 +2 +0 +1 +1 +0 +0 (3A 3B, 3B 3D, 1 2 3 4 5 6 7 8 9 10 ! ! 5AB 5B, 5CD 5B, 5E 5B, 15AB 15F, 15CD 15G, 17AB 17CD, 17CD 17CD) ! ! ! ! ! ! !

(iii) 32 +8 +1 +1 +8 +0 +0 +0 +0 +0 (3A 3B, 3B 3A, 1 2 3 4 5 6 7 8 9 10 ! ! 5AB 5A, 5CD 5A, 5E 5A, 15AB 15A, 15CD 15B, 17AB 17AB, 17CD 17AB) ! ! ! ! ! ! !

(iv) 32 +1 +8 +8 +1 +0 +0 +0 +0 +0 (3A 3A, 3B 3B, 1 2 3 4 5 6 7 8 9 10 ! ! 5AB 5A, 5CD 5A, 5E 5A, 15AB 15B, 15CD 15A, 17AB 17AB, 17CD 17AB) ! ! ! ! ! ! !

(v) 16 +4 +9 +0 +4 +0 +2 +0 +0 +0 (3A 3B, 3B 3D, 1 2 3 4 5 6 7 8 9 10 ! ! 5AB 5A, 5CD 5B, 5E 5B, 15AB 15E, 15CD 15G, 17AB 17CD, 17CD 17CD) ! ! ! ! ! ! !

(vi) 16 +9 +4 +4 +0 +2 +0 +0 +0 +0 (3A 3D, 3B 3B, 1 2 3 4 5 6 7 8 9 10 ! ! 5AB 5B, 5CD 5A, 5E 5B, 15AB 15G, 15CD 15E, 17AB 17CD, 17CD 17CD) ! ! ! ! ! ! !

(vii) 8 +4 +2 +0 +0 +2 +0 +1 +0 +0 (3A 3D, 3B 3D, 1 2 3 4 5 6 7 8 9 10 ! ! 5AB 5B, 5CD 5B, 5E 5B, 15AB 15G, 15CD 15G, 17AB 17CD, 17CD 17CD) ! ! ! ! ! ! !

(viii) 8 +2 +4 +0 +0 +0 +2 +0 +1 +0 (3A 3D, 3B 3D, 1 2 3 4 5 6 7 8 9 10 ! ! 5AB 5B, 5CD 5B, 5E 5B, 15AB 15G, 15CD 15G, 17AB 17CD, 17CD 17CD) ! ! ! ! ! ! !

Cohomological Dimensions (Sp4(4))

2 =2,3 =2,4 =0,5 =0,6 =0,7 =0,8 =0,9 =0,10 =0. CHAPTER 6. BRAUER CHARACTER TABLES 93

Table 6.0.22

Sp6(2) 1A 3A 3B 3C 5A 7A 9A 15A

1 1111111 1

2 63-301-10-2

3 8-4-12-21-11

4 14 2 5 -1 -1 0 -1 2

5 48 -12 3 0 -2 -1 0 -2

6 64 4 -8 -2 -1 1 1 -1

7 112 -8 -5 -2 2 0 1 2

8 512 -16 8 -4 2 1 -1 -1

Feasible Decompositions (Sp6(2))

(i) 6 +4 +2 +3 +2 +1 +0 +0 (3A 3D, 3B 3C, 3C 3C, 5A 5B, 1 2 3 4 5 6 7 8 ! ! ! ! 7A 7B, 9A 9C, 15A 15G) ! ! !

(ii) 8 +8 +5 +4 +2 +0 +0 +0 (3A 3D, 3B 3C, 3C 3B, 5A 5B, 1 2 3 4 5 6 7 8 ! ! ! ! 7A 7B, 9A 9D, 15A 15G) ! ! !

(iii) 4 +2 +0 +4 +1 +2 +0 +0 (3A 3B, 3B 3C, 3C 3D, 5A 5B, 1 2 3 4 5 6 7 8 ! ! ! ! 7A 7B, 9A 9C, 15A 15F) ! ! !

(iv) 6 +6 +3 +5 +1 +1 +0 +0 (3A 3B, 3B 3C, 3C 3C, 5A 5B, 1 2 3 4 5 6 7 8 ! ! ! ! 7A 7B, 9A 9D, 15A 15F) ! ! !

(v) 46 +10 +16 +1 +0 +0 +0 +0 (3A 3B, 3B 3C, 3C 3A, 1 2 3 4 5 6 7 8 ! ! ! 5A 5A, 7A 7A, 9A 9A, 15A 15A) ! ! ! !

(vi) 18 +17 +2 +8 +0 +0 +0 +0 (3A 3A, 3B 3C, 3C 3B, 1 2 3 4 5 6 7 8 ! ! ! 5A 5A, 7A 7B, 9A 9B, 15A 15B) ! ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 94

Cohomological Dimensions (Sp6(2))

2 =1,3 =0,4 =0,5 =1,6 =0,7 =0,8 =0.

Table 6.0.23

G2(3) 1A 3A 3B 3C 3D 3E 7A 9A 9BC 13AB

1 11111111 1 1

2 14 5 5 -4 2 -1 0 2 -1 1

3 78 -3 -3 -3 -3 6 1 0 0 0

4 90 9 9 9 0 0 -1 0 0 -1

5 90 -9 18 0 3 -3 -1 -3 0 -1

6 90 18 -9 0 3 -3 -1 -3 0 -1

7 128 -16 -16 2 8 -4 2 2 -1 -2

8 378 -9 -9 9 -3 -6 0 3 0 1

9 832 -32 -32 -5 4 4 -1 1 1 0

10 896 32 32 -22 -4 -4 0 0 2 -1

Feasible Decompositions (G2(3))

(i) 2 +2 +0 +1 +0 +0 +1 +0 +0 +0 (3A 3C, 3B 3C, 1 2 3 4 5 6 7 8 9 10 ! ! 3C 3C, 3D 3B, 3E 3D, 7A 7B, 9A 9B, 9BC 9D, 13AB 13B) ! ! ! ! ! ! !

(ii) 2 +0 +2 +1 +0 +0 +0 +0 +0 +0 (3A 3C, 3B 3C, 1 2 3 4 5 6 7 8 9 10 ! ! 3C 3C, 3D 3D, 3E 3B, 7A 7B, 9A 9C, 9BC 9C, 13AB 13B) ! ! ! ! ! ! !

Cohomological Dimensions (G2(3))

2 =0,3 =0,4 =1,5 =1,6 =1,7 =0,8 =0,9 =0,10 =0. CHAPTER 6. BRAUER CHARACTER TABLES 95

Table 6.0.24

L4(3) 1A 3A 3B 3C 3D 5A 9A 9B 13AD

1 11111111 1

2 26 -1 -1 8 -1 1 2 -1 0

3 26 -1 8 -1 -1 1 -1 2 0

4 38 11 2 2 2 -2 -1 -1 -1

5 208 -8 -8 10 1 -2 -2 1 0

6 208 -8 10 -8 1 -2 1 -2 0

7 260 17 -10 -10 -1 0 -1 -1 0

8 416 -16 2 2 2 1 -1 -1 0

9 2560 -32 -32 -32 4 0 4 4 -1

Feasible Decompositions (L4(3))

(i) 2 +0 +0 +1 +0 +1 +0 +0 +0 (3A 3C, 3B 3B, 3C 3D, 1 2 3 4 5 6 7 8 9 ! ! ! 3D 3C, 5A 5B, 9A 9C, 9B 9D, 13AD 13B) ! ! ! ! !

(ii) 2 +0 +0 +1 +1 +0 +0 +0 +0 (3A 3C, 3B 3D, 3C 3B, 1 2 3 4 5 6 7 8 9 ! ! ! 3D 3C, 5A 5B, 9A 9D, 9B 9C, 13AD 13B) ! ! ! ! !

(iii) 14 +1 +8 +0 +0 +0 +0 +0 +0 (3A 3C, 3B 3A, 3C 3B, 1 2 3 4 5 6 7 8 9 ! ! ! 3D 3C, 5A 5A, 9A 9B, 9B 9A, 13AD 13A) ! ! ! ! !

(iv) 14 +8 +1 +0 +0 +0 +0 +0 +0 (3A 3C, 3B 3B, 3C 3A, 1 2 3 4 5 6 7 8 9 ! ! ! 3D 3C, 5A 5A, 9A 9A, 9B 9B, 13AD 13A) ! ! ! ! !

Cohomological Dimensions (L4(3))

2 =0,3 =0,4 =2,5 =0,6 =0,7 =1,8 =0,9 =0. CHAPTER 6. BRAUER CHARACTER TABLES 96

Table 6.0.25

2 F4(2)0 1A 3A 5A 13AB

1 111 1

2 26 -1 1 0

3 246 3 -4 -1

4 4096 -8 -4 1

2 Feasible Decompositions ( F4(2))

(i) 2 +0 +1 +0 (3A 3C, 5A 5B, 13AB 13B) 1 2 3 4 ! ! !

(ii) 14 +9 +0 +0 (3A 3C, 5A 5A, 13AB 13A) 1 2 3 4 ! ! !

2 Cohomological Dimensions ( F4(2))

2 =1,3 =1,4 =0.

Table 6.0.26

J 1A 3A 3B 5A 9AC 15AB 17A 17B 19AB 3 ⇤ 1 1111 1 1 1 1 1 80 8 -1 0 -1 3 3-b17 4 2 ⇤ 156 -6 -6 1 0 4 2-2b17 4 3 ⇤ 4 168 -12 6 -2 0 -2 -2 -2 -3 244 1 1 -1 1 -4 b17-2 -3 5 ⇤ 6 644 14 -4 -1 -4 -1 -2 -2 -2 966 3 -6 1 0 -2 r17-3 -3 7 ⇤ 8 2432 -16 2 2 -1 -1 1 1 0

9 5760 0 9 0 0 0 -3 -3 3 CHAPTER 6. BRAUER CHARACTER TABLES 97

Feasible Decompositions (J3)

(i) 0 +1 +0 +1 +0 +0 +0 +0 +0 (3A 3D, 3B 3C, 5AB 5B, 1 2 3 4 5 6 7 8 9 ! ! ! 9C 9D, 15AB 15G, 17A 17CD, 17B 17CD, 19AB 19A) ! ! ! ⇤! !

Cohomological Dimensions (J3)

2 =0,3 =0,4 =2,5 =1,6 =2,7 =0,8 =0,9 =0.

Table 6.0.27

⌦8(2) 1A 3A 3B 3C 5A 7A 9A 15AB 15C 17AB 17CD 21AB

1 1111111 1 1 1 1 1 852-1312 -30 b17 -2 2 ⇤ 3 16 -8 4 -2 -4 2 -2 -1 2 -1 -1 -1 26 8 -1 -1 1 -2 -1 4 -2 -b17 1 4 ⇤ 5 48 6 0 3 -2 -1 -3 -5 1 -3 -3 -1 96 -24 0 6 -4 -2 0 5 -4 2-b17 4 6 ⇤ 160 34 -2 -2 5 -1 1 -7 -1 -1+b17 -1 7 ⇤ 246 12 -6 3 -4 1 0 -1 2 b17 -2 8 ⇤ 320 -40 -4 -4 0 -2 2 -9 0 b17-2 -5 9 ⇤ 10 784 10 -8 1 -6 0 1 -3 0 2 2 3 1568 -88 -16 2 8 0 2 14 2 2b17+5 3 11 ⇤ 12 4096 64 -8 -8 -4 -1 1 2 -1 -1 -1 1

Feasible Decompositions (⌦8(2))

(i) 21 +02 +03 +04 +05 +06 +07 +18 +09 +010 +011 +012 (3A 3B, 3B 3D, 3C 3C, 5A 5B, 7A 7B, 9A 9C, 15AB 15G, 15C 15F, ! ! ! ! ! ! ! ! 17AB 17CD, 17CD 17CD, 21AB 21E) ! ! !

(ii) 41 +22 +23 +24 +15 +16 +07 +08 +09 +010 +011 +012 (3A 3D, 3B 3B, 3C 3C, 5A 5B, 7A 7B, 9A 9D, 15AB 15F, 15C 15G, ! ! ! ! ! ! ! ! 17AB 17CD, 17CD 17CD, 21AB 21H) ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 98

(iii) 81 +52 +03 +44 +25 +06 +07 +08 +09 +010 +011 +012 (3A 3A, 3B 3B, 3C 3C, 5A 5A, 7A 7B, 9A 9B, 15AB 15E, 15C 15B, ! ! ! ! ! ! ! ! 17AB 17CD, 17CD 17CD, 21AB 21E) ! ! !

(iv) 161 +12 +13 +84 +05 +06 +07 +08 +09 +010 +011 +012 (3A 3A, 3B 3B, 3C 3C, 5A 5A, 7A 7B, 9A 9B, 15AB 15A, 15C 15B, ! ! ! ! ! ! ! ! 17AB 17AB, 17CD 17AB, 21AB 21A/C/G) ! ! !

(v) 30 +8 +8 +1 +0 +0 +0 +0 +0 +0 +0 +0 (3A 3B, 1 2 3 4 5 6 7 8 9 10 11 12 ! 3B 3A, 3C 3C, 5A 5A, 7A 7A, 9A 9A, 15AB 15B, 15C 15A, 17AB 17AB, ! ! ! ! ! ! ! ! 17CD 17AB, 21AB 21A/C/G) ! !

Cohomological Dimensions (⌦8(2))

2 =0,3 =0,4 =2,5 =1,6 =0,7 =0,8 =1,9 =2,10 =0,11 =0,

12 =0.

Table 6.0.28

3 D4(2) 1A 3A 3B 7AC 7D 9AC 13AC 21AC

1 111 11 1 1 1

2 24 6 -3 -4 3 -3 -2 -1

3 26 -1 -1 5 -2 2 0 -1

4 144 0 9 -3 -3 0 1 0

5 246 -6 3 1 1 -3 -1 1

6 480 -6 -6 -17 -3 -6 -1 1

7 2352 -24 3 0 0 3 -1 -3

8 4096 -8 -8 8 1 -2 1 -1

3 Feasible Decompositions ( D4(2))

(i) 2 +0 +0 +0 +1 +0 +0 +0 (3A 3D, 3B 3C, 7AC 7B, 1 2 3 4 5 6 7 8 ! ! ! 7D 7B, 9AC 9D, 13AC 13B, 21AC 21H) ! ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 99

(ii) 4 +2 +2 +1 +0 +0 +0 +0 (3A 3B, 3B 3C, 7AC 7B, 1 2 3 4 5 6 7 8 ! ! ! 7D 7B, 9AC 9C, 13AC 13B, 21AC 21E) ! ! ! !

(iii) 16 +1 +8 +0 +0 +0 +0 +0 (3A 3B, 3B 3C, 7AC 7A, 1 2 3 4 5 6 7 8 ! ! ! 7D 7B, 9AC 9A, 13AC 13A, 21AC 21C) ! ! ! !

(iv) 30 +8 +1 +0 +0 +0 +0 +0 (3A 3A, 3B 3C, 7AC 7B, 1 2 3 4 5 6 7 8 ! ! ! 7D 7A, 9AC 9B, 13AC 13A, 21AC 21B) ! ! ! !

3 Cohomological Dimensions ( D4(2))

2 =0,3 =2,4 =0,5 =1,6 =3,7 =0,8 =0.

Table 6.0.29

L (16) 1A 3A 5AD 5EF 7A 7B 13AD 15AD 15EH 17AD 17EH 3 ⇤⇤ 1 11 1 1 1 1 1 1 1 1 1 32 -4 12 2 4 4 6 11 6 8+3b17 2 ⇤⇤ 36 0 1 -4 -4-b7 -3 5 -5 3+2b17 3 ⇤⇤ ⇤⇤ 36 0 1 -4 -4-b7 -3 5 -5 3+2b17 4 ⇤⇤ ⇤⇤ 5 36 0 -9 6 8 8 -3 0 0 2 2 81 0 11 1 2+b7 3-55-3-2b17 6 ⇤⇤ ⇤⇤ 81 0 11 1 2+b7 3 -5 5 -3-2b17 7 ⇤⇤ ⇤⇤ 108 0 -7 -2 8b7 4 -5 5 b17-2 8 ⇤⇤ ⇤⇤ 108 0 -7 -2 8b7 4-55 b17-2 9 ⇤⇤ ⇤⇤ 128 2 28 3 2 2 11 -3 7 1+b17 10 ⇤⇤ 256 4 16 -4 4 4 -4 29 4 23+10b17 11 ⇤⇤

Feasible Decompositions (L3(16))

There are no feasible decompositions for L3(16). CHAPTER 6. BRAUER CHARACTER TABLES 100

Cohomological Dimensions (L3(16))

2 =0,3 =4,4 =4,5 =0,6 =0,7 =0,8 =0,9 =0,10 =0,11 =0.

Table 6.0.30

G2(8) 1A 3A 3B 7AC 7DF 7G 9AC 9DF 9GI 19AC 21AC 21DF

1 111 1 11 1 1 1 1 1 1

2 18 -9 0 -3 4 -3 0 6 -3 -1 0 -2

3 42 15 -3 7 7 0 6 12 3 4 4 1

4 108 27 0 -4 -4 3 -9 0 0 -6 -7 -1

5 192 -24 -6 -4 24 3 12 42 -3 2 8 -3

6 216 -27 0 13 -8 -1 9 -24 3 7 7 1

Feasible Decompositions (G2(8))

There are no possible Decompositions for G2(8).

Cohomological Dimensions (G2(8))

2 =3,3 =0,4 =0,5 =0,6 =0.

Table 6.0.31

Sz(8) 1A 5A 7AC 13AC

1 11 1 1

2 12 -3 -2 -1

3 48 3 -1 -4

4 64 -1 1 -1

Feasible Decompositions (Sz(8))

(i) 12 +5 +1 +2 (5A 5B, 7AC 7B, 13AC 13B) 1 2 3 4 ! ! !

Cohomological Dimensions (Sz(8))

2 =3,3 =0,4 =0. CHAPTER 6. BRAUER CHARACTER TABLES 101

Table 6.0.32

U3(4) 1A 3A 5AD 5EF 13AD 15AD

1 11 1 1 1 1

2 12 0 -3 2 -1 0

3 16 -2 6 1 3 3

4 36 0 1 -4 -3 -5

5 64 1 4 -1 -1 1

6 96 0 -4 -4 5 5

Feasible Decompositions (U3(4))

(i) 16 +9 +1 +3 +0 +0 (3A 3B, 5AD 5B, 5EF 5A, 13AD 13B, 1 2 3 4 5 6 ! ! ! ! 15AD 15F) !

(ii) 12 +0 +0 +3 +2 +0 (3A 3B, 5AD 5B, 5EF 5B, 13AD 13B, 1 2 3 4 5 6 ! ! ! ! 15AD 15E) !

(iii) 4 +0 +1 +1 +3 +0 (3A 3C, 5AD 5A, 5EF 5B, 13AD 13B, 1 2 3 4 5 6 ! ! ! ! 15AD 15D) !

(iv) 0 +4 +2 +2 +0 +1 (3A 3D, 5AD 5B, 5EF 5A, 13AD 13B, 1 2 3 4 5 6 ! ! ! ! 15AD 15G) !

(v) 4 +1 +4 +2 +0 +1 (3A 3D, 5AD 5A, 5EF 5A, 13AD 13A, 1 2 3 4 5 6 ! ! ! ! 15AD 15C) !

Cohomological Dimensions (U3(4))

2 =0,3 =0,4 =4,5 =0,6 =0. CHAPTER 6. BRAUER CHARACTER TABLES 102

Table 6.0.33

U3(8) 1A 3AB 3C 7AC 9AC 19AF 21AF

1 11111 1 1

2 24 6 -3 3 6 5 6

3 54 -9 0 -2 0 -3 -2

4 54 9 0 -2 -6 -3 -5

5 192 12 3 -4 3 2 5

6 432 18 0 -2 -18 -5 -11

7 512 8 -1 1 -1 -1 1

Feasible Decompositions (U3(8))

(i) 8 +1 +3 +1 +0 (3AB 3D, 3C 3C, 7AC 7B, 9AC 9B, 19AF 19A, 1 2 3 4 5 ! ! ! ! ! 21AF 21H) !

(ii) 8 +1 +2 +2 +0 (3AB 3B, 3C 3C, 7AC 7B, 9AC 9C, 19AF 19A, 1 2 3 4 5 ! ! ! ! ! 21AF 21G) !

Cohomological Dimensions (U3(8))

2 =0,3 =6,4 =0,5 =0,6 =0,7 =0. CHAPTER 6. BRAUER CHARACTER TABLES 103

Table 6.0.34

U5(2) 1A 3AB 3CD 3E 3F 5A 9AB 9CD 11AB 15AB

1 11111111 1 1

2 10 -5 1 4 -2 0 -2 1 -1 0

3 20 2 -7 2 2 0 -1 -1 -2 -3

4 24 12 6 3 0 -1 3 0 2 2

5 74 14 11 -4 -1 -1 -4 -1 -3 -1

6 80 -22 8 -4 2 0 2 -1 3 3

7 80 20 -10 2 -4 0 5 -1 3 0

8 320 8 -13 -10 2 0 -1 2 1 3

9 560 -28 2 -10 -4 0 5 2 -1 -3

10 1024 64 16 -8 4 -1 -2 1 1 -1

Feasible Decompositions (U5(2))

(i) 24 +10 +5 +1 +0 +0 +0 (3AB 3D, 3CD 3C, 3E 3A, 3F 3B, 1 2 3 4 5 6 7 ! ! ! ! 5A 5A, 9AB 9C, 9CD 9A, 11AB 11A, 15AB 15C) ! ! ! ! !

(ii) 0 +2 +1 +2 +0 +1 +1 (3AB 3B, 3CD 3C, 3E 3B, 3F 3D, 1 2 3 4 5 6 7 ! ! ! ! 5A 5B, 9AB 9B, 9CD 9D, 11AB 11A, 15AB 15F) ! ! ! ! !

Cohomological Dimensions (U5(2))

2 =0,3 =2,4 =0,5 =1,6 =0,7 =0,8 =0,9 =0,10 =0. CHAPTER 6. BRAUER CHARACTER TABLES 104

Table 6.0.35

G2(4) 1A 3A 3B 5AB 5CD 7A 13AB 15AB 15CD 21AB

1 111 1 11 1 1 1 1

2 12 -6 0 2 -3 -2 -1 -1 0 1

3 28 10 2 3 3 0 2 0 3 3

4 36 9 0 -4 1 1 -3 -1 -5 -5

5 128 -16 -4 8 -2 2 -2 -1 1 5

6 168 -30 0 -12 -2 0 -1 0 -5 -9

7 196 25 1 -9 1 0 1 0 1 -3

8 768 48 0 -12 -2 -2 1 3 -5 -8

9 1792 -80 4 -18 2 0 -2 0 -1 -3

10 4096 64 4 -4 -4 1 1 -1 -1 1

Feasible Decompositions (G2(4))

(i) 16 +8 +1 +3 +0 +0 +0 (3A 3C, 3B 3B, 5AB 5A, 5CD 5B, 1 2 3 4 5 6 7 ! ! ! ! 7A 7B, 13AB 13B, 15AB 15D, 15CD 15F, 21AB 21F) ! ! ! ! !

Cohomological Dimensions (G2(4))

2 =2,3 =0,4 =1,5 =0,6 =2,7 =0,8 =0,9 =0,10 =0. CHAPTER 6. BRAUER CHARACTER TABLES 105

Table 6.0.36

L (32) 1A 3A 11AE 31AE FJ 3KO5 33AE FJ 2 ⇤ ⇤ ⇤⇤ 1 11 1 1 1 1 1 1 10 -5 -1 c31 3 51+b33 2 ⇤ ⇤ ⇤⇤ 20 5 -2 c31+&3 3 5b33 3 ⇤ ⇤ ⇤⇤ 20 5 -2 3 5c31&3 b33 4 ⇤ ⇤ ⇤⇤ 5 32 -1 -1 1 1 1 -1 -1 40 -5 -7 3 5c31+3&3 -2+2b33 6 ⇤ ⇤ ⇤⇤ 40 -5 -4 3 5-1+c31 2+b33 7 ⇤ ⇤ ⇤⇤ 80 5 3 5-2-2c31 3 -3+2b33 8 ⇤ ⇤ ⇤⇤

Feasible Decompositions (L2(32))

(i) 20 +6 +1 +1 +4 +0 +0 +0 (3A 3D, 11AE 11A, 31AE 31AC, 1 2 3 4 5 6 7 8 ! ! ! 31FJ 3 31AC, 31KO 5 31AC, 33AE 33AB, 33FJ 33AB) ⇤ ! ⇤ ! ! ⇤⇤ !

Cohomological Dimensions (L2(32))

2 =5,3 =0,4 =0,5 =0,6 =0,7 =0,8 =0. CHAPTER 6. BRAUER CHARACTER TABLES 106

Table 6.0.37

L (8) 1A 3A 7AC 7DF 7GI 7J 7K 9AC 21AC 21DF 3 ⇤ 1 11 1 1 1 1 1 1 1 1 90 b7-1 2 3b7 3 2b7+1 2 ⇤ ⇤ ⇤ 90 b7-1 2 3b7 3 2b7+1 3 ⇤ ⇤ ⇤ 4 24 -3 10 10 3 3 3 6 4 4 27 0 b7+3 -1 3b7-3 0b7-3 5 ⇤ ⇤ ⇤ 27 0 b7+3 -1 3b7-3 0 b7-3 6 ⇤ ⇤ ⇤ 27 0 7b7-1 -1 6 6 0 2b7+1 7 ⇤ ⇤ 27 0 7b7-1 -1 6 6 0 2b7+1 8 ⇤ ⇤ 27 0 2b7+7 -1 b7+3 -3 2b7+1 9 ⇤ ⇤ ⇤ 27 0 2b7+7 -1 b7+3 -3 2b7+1 10 ⇤ ⇤ ⇤ 72 0 8b7+6 -5 3b7 -3 b7+4 11 ⇤ ⇤ ⇤ 72 0 8b7+6 -5 3b7 -3 b7+4 12 ⇤ ⇤ ⇤ 72 0 6b7-2 2 3b7 6 3b7-2 13 ⇤ ⇤ ⇤ 72 0 6b7-2 23b7 6 3b7-2 14 ⇤ ⇤ ⇤ 81 0 5b7+3 -3 6b7 -9 b7+4 15 ⇤ ⇤ ⇤ 81 0 5b7+3 -3 6b7 -9 b7+4 16 ⇤ ⇤ ⇤ 17 192 3 24 24 -4 3 3 3 3 3 216 0 8b7-4 -1 3b7-3 -9 b7-3 18 ⇤ ⇤ ⇤ 216 0 8b7-4 -1 3b7-3 -9 b7-3 19 ⇤ ⇤ ⇤ 216 0 14b7-8 -1 6 6 -9 2b7+1 20 ⇤ ⇤ 216 0 14b7-8 -1 6 6 -9 2b7+1 21 ⇤ ⇤

Feasible Decompositions (L3(8))

(i) 81 +02 +03 +14 +05 +06 +37 +38 +19 +110 +011 +012 + 0 +0 +0 +0 +0 +0 +0 +0 +1 (3A 3C, 7AC 7B, 13 14 15 16 17 18 19 20 21 ! ! 7DF 7B, 7GI 7B, 7J 7A, 7K 7A, 9AC 9B, 21AC 21F, 21DF 21F) ! ! ! ! ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 107

Cohomological Dimensions (L3(8))

2 =0,3 =0,4 =0,5 =3,6 =3,7 =0,8 =0,9 =0,10 =0,11 =0,

12 =0,13 =0,14 =0,15 =0,16 =0,17 =0,18 =0,19 =0,20 =0,

21 =0.

Table 6.0.38

L2(64) 1A 3A 5AB 7AC 9AC 13AF 21AF

1 11 1 1 1 1 1

2 12 -6 -3 -2 0 -1 1

3 12 3 -3 5 6 -1 -4

4 16 -2 -4 2 -2 3 5

5 24 6 9 -4 -6 -2 -1

6 24 6 -6 -4 -6 -2 -1

7 48 -6 3 -8 -6 9 1

8 48 -6 3 6 -6 -4 -6

9 48 -6 3 6 12 -4 -6

10 48 3 3 6 9 -4 3

11 64 1 -1 1 1 -1 1

12 96 6 6 -2 0 5 -8

13 96 6 -9 -2 0 5 13

14 192 -6 -3 -4 6 -3 8

Feasible Decompositions (L2(64))

(i) 121 +12 +43 +24 +05 +06 +07 +28 +09 +110 +011 +012 +013 +014 (3A 3C, 5AB 5B, 7AC 7A, 9AC 9A, 13A 13B, 21AF 21D, 63AI ! ! ! ! ! ! ! 63D, 63JR 63E, 65AX 65AD) ! !

(ii) 81 +22 +03 +24 +35 +06 +17 +28 +09 +010 +111 +012 +013 +014 (3A 3C, 5AB 5A, 7AC 7B, 9AC 9D, 13A 13B, 21AF 21F, 63AI ! ! ! ! ! ! ! 63FH, 63JR 63FH, 65AX 65EF) ! ! CHAPTER 6. BRAUER CHARACTER TABLES 108

(iii) 121 +42 +13 +04 +15 +16 +07 +08 +09 +010 +211 +012 +013 +014 (3A 3C, 5AB 5B, 7AC 7B, 9AC 9B, 13A 13B, 21AF 21F, 63AI ! ! ! ! ! ! ! 63AC, 63JR 63AC, 65AX 65AD) ! !

Cohomological Dimensions (L2(64))

2 =6,3 =0,4 =0,5 =0,6 =0,7 =0,8 =0,9 =0,10 =0,11 =0,

12 =0,13 =0,14 =0.

Table 6.0.39

L (2) 1A 3A 3B 5A 7A 7B 15A 15B 21A 21B 5 ⇤⇤ ⇤⇤ ⇤⇤ 1 1111 1 1 1 1 1 1 52-10b7+2 2+b15 b7-1 2 ⇤⇤ ⇤⇤ ⇤⇤ 52-10 b7+2 2+b15 b7-1 3 ⇤⇤ ⇤⇤ ⇤⇤ 10 1 1 0 b7 b15-1 2+2b7 4 ⇤⇤ ⇤⇤ ⇤⇤ 10 1 1 0 0 b7 b15-1 2+2b7 5 ⇤⇤ ⇤⇤ ⇤⇤ 6 24 3 0 -1 3 3 5 5 3 3 40 -2 1 0 -2 -2 b15-1 -2 -2 7 ⇤⇤ 40 -2 1 0 -2 -2 b15-1 -2 -2 8 ⇤⇤ 40 1 -2 0 2b7-1 b15-4 b7-1 9 ⇤⇤ ⇤⇤ ⇤⇤ 40 1 -2 0 2b7-1 b15-4 b7-1 10 ⇤⇤ ⇤⇤ ⇤⇤ 11 74 -4 -1 -1 -3 -3 -1 -1 3 3 160 -5 1 0 -1 -1 b15-1 22 12 ⇤⇤ 160 -5 1 0 -1 -1 b15-1 2 2 13 ⇤⇤ 280 -5 -2 0 2b7+1 4+2b15 b7-1 14 ⇤⇤ ⇤⇤ ⇤⇤ 280 -5 -2 0 2b7+1 4+2b15 b7-1 15 ⇤⇤ ⇤⇤ ⇤⇤ 16 1024 -8 4 -1 2 2 -1 -1 -1 -1

Feasible Decompositions (L5(2))

(i) 241 +102 +103 +54 +55 +16 +07 +08 +09 +010 +011 +012 +013 (3A 3A, 3B 3B, 5A 5A, 7A 7A, 7B 7A, 15A 15A, 15B ! ! ! ! ⇤⇤ ! ! ⇤⇤ ! 15A, 21A 21A, 21B 21A, 31AF 31AC) ! ⇤⇤ ! ! CHAPTER 6. BRAUER CHARACTER TABLES 109

(ii) 01 +22 +23 +14 +15 +26 +17 +18 +19 +110 +011 +012 +013 (3A 3B, 3B 3D, 5A 5B, 7A 7B, 7B 7B, 15A 15G, 15B ! ! ! ! ⇤⇤ ! ! ⇤⇤ ! 15G, 21A 21G, 21B 21G, 31AF 31D) ! ⇤⇤ ! !

Cohomological Dimensions (L5(2))

2 =0,3 =0,4 =0,5 =0,6 =0,7 =1,8 =1,9 =0,10 =0,11 =0,

12 =0,13 =0. CHAPTER 6. BRAUER CHARACTER TABLES 110 Table 6.0.40 5441322211 1 1 0 1 1 1 0 1-1-12 1 11111111111111 1 85-4-4-123-2-212-1-10 8-45-4-12-23-21-12-11 8-4-45-12-2-23 2648 848 6 8 -12 -1248 8 -12 -12 6 -1 3 -12 -12 -1 0 3 6 1 -2 0 3 1 -2 -2 0 -2 1 -2 -2 -1 -2 -2 -2 -3 -1 -1 -2 -1 0 0 -1 -1 0 -3 0 -2 0 1 0 -2 -3 -2 -2 -2 -2 1 -2 -2 -2 1 1A 3A 3B 3C 3D 3E 5A 5B 5C 7A 9A 9B 9C 15A 15B 15C 160 34160 -20 -20 -20160 34 -20 -2 -20246 -20 -2 -2 12 34784 5 -2 12 -2 10784 12 0 -44 0 -2 -44 -44784 3 0 5 10 0 -44 1 -44 -6 -1 -44 0 0 -8 -4 1 10 1 -1 5 -6 -4 -8 1 1 1 -1 -4 4 4 -8 1 1 1 1 4 -6 4 1 -1 1 0 0 4 4 1 0 0 0 1 0 -6 0 0 1 -1 1 0 0 1 1 1 2 0 0 1 1 0 -1 2 1 1 1 2 1 0 1 1 1 0 4096 64 64 64 -8 -8 -4 -4 -4 1 1 1 1 -1 -1 -1 ) 2 1 2 3 4 5 6 7 8 9 ( 10 11 12 13 14 15 16 + 8 ⌦ CHAPTER 6. BRAUER CHARACTER TABLES 111

+ Feasible Decompositions (⌦8 (2))

(i) 21 +02 +03 +04 +05 +06 +07 +08 +09 +010 +011 +112 + 0 +0 +0 +0 (3A 3B, 3B 3B, 3C 3B, 3D 3C, 3E 3D, 5A 5B, 13 14 15 16 ! ! ! ! ! ! 5B 5B, 5C 5B, 7A 7B, 9A 9C, 9B 9C, 9C 9C, 15A 15F, 15B 15F, ! ! ! ! ! ! ! ! 15C 15F) !

(ii) 41 +22 +23 +24 +25 +16 +17 +18 +09 +010 +011 +012 + 0 +0 +0 +0 (3A 3D, 3B 3D, 3C 3D, 3D 3C, 3E 3B, 5A 5B, 13 14 15 16 ! ! ! ! ! ! 5B 5B, 5C 5B, 7A 7B, 9A 9D, 9B 9D, 9C 9D, 15A 15G, 15B 15G, ! ! ! ! ! ! ! ! 15C 15G) !

(iii) 81 +52 +03 +04 +45 +26 +07 +08 +09 +010 +011 +012 + 0 +0 +0 +0 (3A 3A, 3B 3D, 3C 3D, 3D 3C, 3E 3B, 5A 5B, 13 14 15 16 ! ! ! ! ! ! 5B 5B, 5C 5A, 7A 7B, 9A 9B, 9B 9D, 9C 9D, 15A 15G, 15B 15G, ! ! ! ! ! ! ! ! 15C 15B) !

(iv) 81 +02 +53 +04 +45 +06 +07 +28 +09 +010 +011 +012 + 0 +0 +0 +0 (3A 3D, 3B 3A, 3C 3D, 3D 3C, 3E 3B, 5A 5A, 13 14 15 16 ! ! ! ! ! ! 5B 5B, 5C 5B, 7A 7B, 9A 9D, 9B 9B, 9C 9D, 15A 15A, 15B 15G, ! ! ! ! ! ! ! ! 15C 15G) !

(v) 81 +02 +03 +54 +45 +06 +27 +08 +09 +010 +011 +012 + 0 +0 +0 +0 (3A 3D, 3B 3D, 3C 3A, 3D 3C, 3E 3B, 5A 5B, 13 14 15 16 ! ! ! ! ! ! 5B 5A, 5C 5B, 7A 7B, 9A 9D, 9B 9D, 9C 9B, 15A 15G, 15B 15B, ! ! ! ! ! ! ! ! 15C 15G) !

(vi) 161 +12 +13 +14 +85 +06 +07 +08 +09 +010 +011 +012 + 0 +0 +0 +0 (3A 3A, 3B 3A, 3C 3A, 3D 3C, 3E 3B, 5A 5A, 13 14 15 16 ! ! ! ! ! ! 5B 5A, 5C 5A, 7A 7B, 9A 9B, 9B 9B, 9C 9B, 15A 15B, 15B 15B, ! ! ! ! ! ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 112

15C 15B) !

(vii) 301 +82 +83 +84 +15 +06 +07 +08 +09 +010 +011 +012 + 0 +0 +0 +0 (3A 3B, 3B 3B, 3C 3B, 3D 3C, 3E 3A, 5A 5A, 13 14 15 16 ! ! ! ! ! ! 5B 5A, 5C 5A, 7A 7A, 9A 9A, 9B 9A, 9C 9A, 15A 15A, 15B 15A, ! ! ! ! ! ! ! ! 15C 15A) !

+ Cohomological Dimensions (⌦8 (2))

2 =0,3 =0,4 =0,5 =2,6 =1,7 =1,8 =1,9 =0,10 =0,11 =0,

12 =1,13 =0,14 =0,15 =0,16 =0.

Feasible Decompositions (Sp4(8))

121 +12 +43 +04 +05 +06 +07 +18 +29 +010 +011 +012 +013 + 0 +0 +0 (3A 3C, 3B 3C, 5A 5B, 7AC 7B, 7DF 7A, 7GI 7B, 9AC 14 15 16 ! ! ! ! ! ! 9A, 9DF 9B, 9GI 9B, 9JL 9C, 13AC 13B) ! ! ! ! ! 121 +42 +13 +14 +05 +06 +07 +08 +09 +210 +011 +012 +013 + 0 +0 +0 (3A 3C, 3B 3C, 5A 5B, 7AC 7A, 7DF 7B, 7GI 7B, 9A 14 15 16 ! ! ! ! ! ! 9B, 9DF 9A, 9GI 9C, 9JL 9B, 13AC 13B) ! ! ! ! !

Cohomological Dimensions (Sp4(8))

2 =3,3 =3,4 =0,5 =0,6 =0,7 =0,8 =0,9 =0,10 =0,11 =0. CHAPTER 6. BRAUER CHARACTER TABLES 113 Table 6.0.41 1111 1 1 1 1 1 1 1 1 1 1 12 312 -6 -648 -3 3 348 -3 12 -6 548 -6 3 -2 -6 -248 3 -6 -6 6 -2 548 3 -6 -8 12 -264 -8 0 3 3 6 6 164 -1 6 3 6 -8 -8 -8 -12 -1 -8 -1 -3 0 1 -8 -8 -1 12 9 -1 0 0 1 6 6 -6 -6 0 -3 8 -1 -6 8 12 -1 3 -3 -6 1 -1 -6 -6 1 9 1 -4 -12 3 1 3 -8 -4 -4 -4 -3 -2 3 1 -4 1 -6 1 0 -8 3 1 9 1 1 -4 1 1 -6 1 1 3 -1 1 -1 -2 -1 1 1 -1 1A 3A 3B 5A 7AC 7DF 7GI 9AC 9DF 9GI 9JL 13AC 21AC 21DF 192 12192 -6 -6192 -3 12 -6192 -3 -4 12 12192 -3 -18 -4 -6 12192 -18 -3 3 -6 -4 -6 -3 -4 -30 -4 12 -4 -32 -3 -36 3 -4 0 10 10 -4 6 0 9 -32 3 -30 -3 6 6 3 24 -3 -36 0 10 -36 -36 9 0 24 0 -3 -6 6 10 -3 -3 5 5 0 -3 5 -3 8 -3 8 -6 1 -2 5 -2 1 ) 8 ( 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 4 Sp CHAPTER 6. BRAUER CHARACTER TABLES 114 -2 -1 -2 21A ⇤ ⇤ ⇤ ⇤ -1-2 1 1 1+b17 1 1+b17 2 ⇤ ⇤ ⇤ ⇤ b17 1 -2 b17+1 1 -1 ⇤ ⇤ Table 6.0.42 Table 6.0.43 54-3221-1b17 11111111111 1 185-42-13-212-10-31 1 1 1 111111111 1 1 1 1 1 1 1 16 -826 148 8 4 6 8 -2 -12 -1 -4 0 -1 1 3 1 2 -2 1 -2 -2 -2 -1 1 -1 -3 -1 2 0 -2 -1 1 4 1 -5 -2 -2 -1 -3 -1 -1 -3 -1 26 826 -1 -1 -1 8 1 -1 -2 1 5 5 2 -2 -1 -1 2 0 0 4 -2 -2 4 b17+1 1A 3A 3B 3C 3D 5A 5B 7A 9A 9B 15A 15B 15C 17A 17B 1A 3A 3B 3C 5A 7A 7B 9A 9B 13A 15A 15B 17A 17B 21A 21B 128 -40160 -4 34246 -20 8 12 -2 2 12 -2 -12 -6 -2 5 3 2 0 -4 -4 -1 -4 -1 1 1 0 1 0 -1 3 0 -7 1 2 0 -1 -1+b17 2 b17 246 12246 -6 -6 3 12 -4 3 1 -4 1 1 -3 1 0 -3 0 -1 -1 -1 2 2 -1 b17 ) ) 2 2 ( 1 2 3 4 5 1 2 3 4 5 6 7 8 ( 8 4 F Sp CHAPTER 6. BRAUER CHARACTER TABLES 115

Feasible Decompositions (F4(2))

(i) 2 +0 +0 +0 +1 (3A 3D, 3B 3B, 3C 3C, 5A 5B, 7A 7B, 1 2 3 4 5 ! ! ! ! ! 7B 7B, 9A 9D, 9B 9C, 13A 13B, 15A 15F, 15B 15G, 17A 17CD, 17B 17CD, ! ! ! ! ! ! ! ! 21A 21H, 21B 21E) ! !

(ii) 2 +0 +0 +1 +0 (3A 3D, 3B 3B, 3C 3C, 5A 5B, 7A 7B, 1 2 3 4 5 ! ! ! ! ! 7B 7B, 9A 9D, 9B 9C, 13A 13B, 15A 15G, 15B 15F, 17A 17CD, 17B 17CD, ! ! ! ! ! ! ! ! 21A 21E, 21B 21H) ! !

(iii) 14 +1 +8 +0 +0 (3A 3B, 3B 3A, 3C 3C, 5A 5A, 7A 7A, 1 2 3 4 5 ! ! ! ! ! 7B 7B, 9A 9B, 9B 9A, 13A 13A, 15A 15B, 15B 15A, 17A 17AB, 17B 17AB, ! ! ! ! ! ! ! ! 21A 21C, 21B 21B) ! !

(iv) 14 +8 +1 +0 +0 (3A 3A, 3B 3B, 3C 3C, 5A 5A, 7A 7B, 1 2 3 4 5 ! ! ! ! ! 7B 7A, 9A 9A, 9B 9B, 13A 13A, 15A 15A, 15B 15B, 17A 17AB, 17B 17AB, ! ! ! ! ! ! ! ! 21A 21B, 21B 21C) ! !

Cohomological Dimensions (F4(2))

2 =0,3 =0,4 =1,5 =1.

Feasible Decompositions (Sp8(2))

(i) 30 +8 +8 +1 +0 +0 +0 +0 (3A 3B, 3B 3B, 3C 3A, 1 2 3 4 5 6 7 8 ! ! ! 3D 3C, 5A 5A, 5B 5A, 7A 7A, 9A 9A, 9B 9A, 15A 15A, 15B ! ! ! ! ! ! ! ! 15B, 15C 15A, 17A 17AB, B 17AB, 21A 21C,) ! ! ⇤! !

(ii) 16 +1 +1 +8 +0 +0 +0 +0 (3A 3A, 3B 3A, 3C 3B, 1 2 3 4 5 6 7 8 ! ! ! 3D 3C, 5A 5A, 5B 5A, 7A 7B, 9A 9B, 9B 9B, 15A 15B, 15B ! ! ! ! ! ! ! ! 15A, 15C 15B, 17A 17AB, B 17AB, 21A 21B,) ! ! ⇤! ! CHAPTER 6. BRAUER CHARACTER TABLES 116

(iii) 8 +5 +0 +4 +2 +0 +0 +0 (3A 3A, 3B 3D, 3C 3B, 1 2 3 4 5 6 7 8 ! ! ! 3D 3C, 5A 5A, 5B 5B, 7A 7B, 9A 9B, 9B 9D, 15A 15B, 15B ! ! ! ! ! ! ! ! 15E, 15C 15G, 17A 17CD, B 17CD, 21A 21E,) ! ! ⇤! !

(iv) 4 +2 +0 +2 +1 +1 +0 +0 (3A 3D, 3B 3D, 3C 3B, 1 2 3 4 5 6 7 8 ! ! ! 3D 3C, 5A 5B, 5B 5B, 7A 7B, 9A 9D, 9B 9D, 15A 15G, 15B ! ! ! ! ! ! ! ! 15F, 15C 15G, 17A 17CD, B 17CD, 21A 21H,) ! ! ⇤! !

(v) 2 +0 +0 +0 +0 +0 +0 +2 (3A 3B, 3B 3B, 3C 3D, 1 2 3 4 5 6 7 8 ! ! ! 3D 3C, 5A 5B, 5B 5B, 7A 7B, 9A 9C, 9B 9C, 15A 15F, 15B ! ! ! ! ! ! ! ! 15G, 15C 15F, 17A 17CD, B 17CD, 21A 21G,) ! ! ⇤! !

Cohomological Dimensions (Sp8(2))

2 =1,3 =0,4 =1,5 =1,6 =0,7 =0,8 =1.

Feasible Decompositions (L4(4))

(i) 81 +02 +03 +44 +25 +26 +17 +28 +19 +010 +011 +012 +013 + 0 +0 +0 +0 +0 +0 +0 +0 +0 +0 +0 (3AB 14 15 16 17 18 19 20 21 22 23 24 ! 3C, 3C 3A, 3D 3B, 5AB 5A, 5CD 5A, 5E 5A, 7A 7B, 7B 7B, ! ! ! ! ! ! ! 9AB 9B, 15AB 15B, 15CD 15B, 15EF 15B, 15G 15B, 15H 15B, ! ! ! ! ! ! 15IJ 15D, 15KL 15D, 15MN 15A, 17AB 17AB, 17CD 17AB, 21AB ! ! ! ! ! ! 21F, 21CD 21F) !

(ii) 41 +22 +23 +24 +15 +16 +17 +18 +09 +010 +011 +112 +113 + 0 +0 +0 +0 +0 +0 +0 +0 +0 +0 +0 (3AB 14 15 16 17 18 19 20 21 22 23 24 ! 3C, 3C 3D, 3D 3B, 5AB 5B, 5CD 5A, 5E 5B, 7A 7B, 7B 7B, ! ! ! ! ! ! ! 9AB 9D, 15AB 15C, 15CD 15C, 15EF 15G, 15G 15G, 15H 15G, ! ! ! ! ! ! 15IJ 15D, 15KL 15D, 15MN 15E, 17AB 17CD, 17CD 17CD, 21AB ! ! ! ! ! ! CHAPTER 6. BRAUER CHARACTER TABLES 117

21F, 21CD 21F) !

Cohomological Dimensions (L4(4))

2 =0,3 =0,4 =0,5 =0,6 =0,7 =2,8 =0,9 =0,10 =0,11 =0,

12 =2,13 =2,14 =0,15 =0,16 =0,17 =0,18 =0,19 =0,20 =0,

21 =2,22 =0,23 =0,24 =0.

+ Feasible Decompositions (⌦8 (4))

(i) 41 +02 +03 +04 +15 +16 +17 +18 +09 +010 +011 +012 +013 +014 (3A 3A, 3B 3A, 3C 3A, 3D 3B, 3E 3C, 5AB 5A, 5CD 5A, 5EF ! ! ! ! ! ! ! ! 5A, 5GH 5B, 5IJ 5B, 5KL 5B, 5MN 5A, 5O 5A, 5P 5A, 5Q 5A, ! ! ! ! ! ! ! 5RS 5B, 7A 7B) ! !

(ii) 41 +02 +03 +04 +15 +16 +07 +08 +09 +010 +011 +112 +013 +014 (3A 3A, 3B 3D, 3C 3D, 3D 3B, 3E 3C, 5AB 5A, 5CD 5B, 5EF ! ! ! ! ! ! ! ! 5B, 5GH 5B, 5IJ 5A, 5KL 5A, 5MN 5A, 5O 5A, 5P 5B, 5Q 5B, ! ! ! ! ! ! ! 5RS 5B, 7A 7B) ! !

(iii) 41 +02 +03 +04 +15 +06 +17 +08 +09 +010 +011 +012 +113 +014 (3A 3D, 3B 3A, 3C 3D, 3D 3B, 3E 3C, 5AB 5B, 5CD 5A, 5EF ! ! ! ! ! ! ! ! 5B, 5GH 5A, 5IJ 5B, 5KL 5A, 5MN 5A, 5O 5A, 5P 5B, 5Q 5A, ! ! ! ! ! ! ! 5RS 5B, 7A 7B) ! !

(iv) 41 +02 +03 +04 +15 +06 +07 +18 +09 +010 +011 +012 +013 +114 (3A 3D, 3B 3D, 3C 3A, 3D 3B, 3E 3C, 5AB 5B, 5CD 5B, 5EF ! ! ! ! ! ! ! ! 5A, 5GH 5A, 5IJ 5A, 5KL 5B, 5MN 5A, 5O 5B, 5P 5B, 5Q 5A, ! ! ! ! ! ! ! 5RS 5B, 7A 7B) ! ! CHAPTER 6. BRAUER CHARACTER TABLES 118

+ Cohomological Dimensions (⌦8 (4))

2 =0,3 =0,4 =0,5 =4,6 =0,7 =0,8 =0,9 =0,10 =0,11 =0,

12 =0,13 =0,14 =0.

Table 6.0.44

L (4) 1A 3AB 3C 3D 5AB 5CD 5E 7A 7B 9AB 15AB 15CD 4 ⇤⇤ 1 1111111 1 11 1 1 2 8-1-42-23-22b7+2 -1 b15-1 8-1-42-23-2 2b7+2⇤⇤ -1 b15-1⇤⇤ 3 ⇤⇤ ⇤⇤ 4 12 -6 6 0 7 2 2 -2 -2 0 -4 -4 5 16 7 4 1 -4 1 1 b7-1 1 2b15+5 16 7 4 1 -4 1 1 b7-1⇤⇤ 1 2b15+5⇤⇤ 6 ⇤⇤ ⇤⇤ 7 28 10 4 -2 8 3 -2 0 0 -2 9 9 8 32 -13 8 2 -8 2 2 4 4 -1 -7 -7 9 36 9 9 0 11 -4 1 1 1 0 -1 -1 10 40 4 -8 -2 -10 5 0 -2 -2 1 6b15+5 40 4 -8 -2 -10 5 0 -2 -2 1 6b15+5⇤⇤ 11 ⇤⇤ 12 48 3 -12 0 -2 -2 -2 2b7 0 3b15+7 48 3 -12 0 -2 -2 -2 2b7⇤⇤ 0 3b15+7⇤⇤ 13 ⇤⇤ ⇤⇤ 14 112 -5 -8 -2 12 -3 2 0 0 1 3b15-9 112 -5 -8 -2 12 -3 2 0 0 1 3b15-9⇤⇤ 15 ⇤⇤ 16 128 -16 8 -4 28 8 -2 2 2 2 -22 -22 17 160 -29 16 -2 -20 0 0 2b7 1 8b15-5 160 -29 16 -2 -20 0 0 2b7⇤⇤ 1 8b15-5⇤⇤ 18 ⇤⇤ ⇤⇤ 19 160 25 16 -2 -20 0 0 2b7 -2 6b15+9 160 25 16 -2 -20 0 0 2b7⇤⇤ -2 6b15+9⇤⇤ 20 ⇤⇤ ⇤⇤ 21 168 -30 12 0 18 -12 -2 0 0 0 -3 -3 22 196 25 4 1 -4 -9 1 0 0 1 9 9 23 240 -12 -24 0 -20 -10 0 2 2 0 2b15-3 240 -12 -24 0 -20 -10 0 2 2 0 2b15-3⇤⇤ 24 ⇤⇤ CHAPTER 6. BRAUER CHARACTER TABLES 119

L (4) 15EF 15G 15H 15IJ 15KL 15MN 17AB 17CD 21AB 21CD 4 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 1 1111111 111 1 2b15+2 b15+2 -3 b17 b7+3 2 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 12b15+2 b15+2 -3 b17 b7+3 3 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 1-4-4-1-15b17+4 11 4 ⇤⇤ -1 b15-3 b15 1 -1 -1 2b7+1 5 ⇤⇤ ⇤⇤ ⇤⇤ -1 b15-3 b15 1-1-12b7+1 6 ⇤⇤ ⇤⇤ ⇤⇤ -1 4 4 0 0 3 b17+3 33 7 ⇤⇤ 8 -2 8 8 2 2 2 -2 -2 1 1 -1 4 4 -1 -1 5 2b17+3 -5 -5 9 ⇤⇤ 2 2b15-2 -1 -1 -7 3b17-1 4 4 10 ⇤⇤ ⇤⇤ 22b15-2 -1 -1 -7 3b17-1 4 4 11 ⇤⇤ ⇤⇤ -2 4b15 -2 -2 -5 -3 -3 2b7-3 12 ⇤⇤ ⇤⇤ -2 4b15 -2 -2 -5 -3 -3 2b7-3 13 ⇤⇤ ⇤⇤ -3 4b15+4 0 0 3 3b17+3 3b7 14 ⇤⇤ ⇤⇤ ⇤⇤ -3 4b15+4 0033b17+3 3b7 15 ⇤⇤ ⇤⇤ ⇤⇤ -2 -2 -2 -1 -1 11 4b17+11 55 16 ⇤⇤ 1 4b15+8 b15-1 3b17-1 2b7 17 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 14b15+8 b15-1 3 b17-1 2b7 18 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 12b15-8 003b17-1 5b7+3 19 ⇤⇤ ⇤⇤ ⇤⇤ 1 2b15-8 0 0 3 b17-1 5b7+3 20 ⇤⇤ ⇤⇤ ⇤⇤ -3 -8 -8 0 0 0 2b17-1 -9 -9 21 ⇤⇤ -1 4 4 0 0 -9 2b17-7 -3 -3 22 ⇤⇤ 1 4b15+8 b15+1 -10 3b17-5 3b7-7 23 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 14b15+8 b15+1 -10 3b17-5 3b7-7 24 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ CHAPTER 6. BRAUER CHARACTER TABLES 120 Table 6.0.45 111111 1 1 1 11 1 1111 11 16 1016 -8 -816 -8 10 -852 4 -8 -8 1664 -2 4 10 16 2564 -2 11 16 4 16 16 -264 -2 16 -4 -4 25 -2 1696 4 16 -4 11 -4 16 12 2296 1 4 25 -24 -4 -4 -24 1 -24 2296 1 29 4 12 11 -24 -4 -4 0 -24 22 -16 -16 1 -24 -4 1 6 -4 0 12 -16 -16 29 7 -4 6 -4 26 0 -11 -16 -16 6 7 -24 -1 -24 6 1 29 -1 6 6 -24 7 -24 -11 26 -1 -4 -4 -1 6 -24 -24 16 -1 -4 -1 7 -4 6 4 26 9 -11 -4 -4 9 2 1 4 9 16 6 9 9 2 2 1 4 4 4 9 9 2 2 1 16 4 9 4 16 -4 2 -3 16 4 4 -1 -4 -4 -4 16 9 1 -1 -4 -4 -4 1 -1 -4 -4 1 1 -4 -2 1 -2 1 -2 1A 3A 3B 3C 3D 3E 5AB 5CD 5EF 5GH 5IJ 5KL 5MN 5O 5P 5Q 5RS 7A 128 32128 -40 -40 -40128 32 -40 8 -40 -40 2 8 32 -32 2 8 -12 -12 2 -12 -32 -12 -12 -12 -2 13 -32 13 -2 13 13 13 13 8 -2 8 8 -12 -12 8 -12 -12 8 -12 -12 -2 8 2 -2 2 -2 2 ) 4 1 2 3 4 5 6 7 8 9 ( 10 11 12 13 14 + 8 ⌦ CHAPTER 6. BRAUER CHARACTER TABLES 121 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ -4+2b17 -4+2b17 -4+2b17 -4+2b17 ⇤⇤ ⇤⇤ ⇤⇤ 1+b17 8+2b17 8+3b17 6+4b17 6+2b17 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 4+b17 -3+b17 8+6b17 5+2b17 6+4b17 -3+3b17 4-4+2b17 4 ⇤⇤ ⇤⇤ 7+b17 -4+b17 7+4b17 ⇤⇤ ⇤⇤⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤⇤⇤ ⇤⇤ ⇤⇤ 1+b17 11+4b17 -1+b17 -1+b17 5+2b17 -3+4b17 -5 -5 ⇤⇤ 7+b17 4+b17 -3+3b17 Table 6.0.46 ⇤⇤ ⇤⇤ ⇤⇤⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 3b17 -2+5b17 -4+b17 -8+8b17 -3+b17 -8+8b17-13+b17 15+6b17 5 5 -12+3b17 -5 -5 15+6b17 ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ ⇤⇤ 11 1 1 1 1 1 1 1 1 1 1 24 032 -472 4 072 2 10 072 -8 11 0 16+2b17 -8 10 12 10 16+7b17 0 -2+5b17 1A 3A 5AB 15AD 17AH 17IP 17QX 17Y-AF 17AG-AN 17AO-AV 17AX-17AZ 17BA-17BD 128 2192 0192 3 0216 12 -3 0216 -8 28+4b17 0 0216 -4 10 0216 -4 -10 0 -4 -10 -4 -10 -12+b17 -10 24+7b17 ) 16 1 2 3 4 5 6 7 8 9 10 11 12 13 ( 3 U CHAPTER 6. BRAUER CHARACTER TABLES 122

Feasible Decompositions (U3(16))

(i) 01 +02 +13 +04 +05 +06 +07 +08 +09 +110 +011 +012 +013 (3A 3D, 5AB 5B, 15AD 15G, 17AH 17CD, 17IP 17CD, 17QX 17AB, ! ! ! ! ! ! 17Y-AF 17AB, 17AG-AN 17CD, 17AO-AV 17CD, 17AX-AZ 17CD, 17BA- ! ! ! ! BD 17CD) !

(ii) 01 +02 +13 +04 +05 +06 +07 +08 +09 +110 +011 +012 +013 (3A 3D, 5AB 5B, 15AD 15G, 17AH 17CD, 17IP 17CD, 17QX 17CD, ! ! ! ! ! ! 17Y-AF 17CD, 17AG-AN 17AB, 17AO-AV 17AB, 17AX-AZ 17CD, 17BA- ! ! ! ! BD 17CD) !

Cohomological Dimensions (U3(16))

2 =0,3 =0,4 =0,5 =8,6 =0,7 =0,8 =0,9 =0,10 =0,11 =0,

12 =0,13 =0. Chapter 7

Further Work

As stated in Chapter 1 the results contained in this thesis form part of a larger overall project to classify the maximal subgroups of E8(2). Many of the groups from Tables 3.1.1 and 3.1.2 that are not covered in this thesis have been successfully proven not to be maximal; however, there is still much that remains to be done.

The methods in Chapter 4 take no account of the Lie algebra structure of L(G), which could potentially rule out some of the restrictions of L(G)toasubgroupH. One of the limitations of this approach is that we are currently incapable of calculating the stabilisers of subspaces in E8(2).

The methods described in Chapter 5 have the potential to analyse any group with amaximalsubgroupisomorphictothenormaliserofanelementaryabelian2-group.

Such groups include L2(8), L2(16), L2(64) and Sz(8). The biggest issue limiting the application of this method is the size of the set of inverting involutions. In this thesis the largest set of inverting involutions that was encountered contained 13888 elements, whereas in L2(8), for example, one would have to check against a set of almost 2,000,000 involutions. These large sets of involutions increase the calculation time for applying the method significantly, a problem that will have to be dealt with in one way or another for its further application in the future.

123 Bibliography

[1] J. L. Alperin: Local representation theory, Vol. 11, Cambridge University Press (1986).

[2] M. Aschbacher: On the maximal subgroups of the finite classical groups, Invent. Math. 76 (1984), no.3, 469-514.

[3] M. Aschbacher, L. L. Scott: Maximal subgroups of finite groups, J. 92 (1985), 1-22.

[4] M. Aschbacher, G. M. Seitz: Involutions in Chevalley groups over fields of even order, Nagoya Math. J. 63 (1976), 1-91.

[5] M. Aschbacher, S. Smith: The classification of quasithin groups I, II, Mathe- matical Surveys and Monographs 43-1, AMS (2004), 115-122.

[6] A. Aubad, J, Ballantyne, A, McGaw, P. Neuhaus, P. Rowley, D. Ward: The

maximal subgroups of E8(2), unpublished manuscript.

[7] A. Aubad, J, Ballantyne, A, McGaw, P. Neuhaus, J. Phillips, P. Rowley, D.

Ward: The semisimple elements of E8(2), http://eprints.ma.man.ac.uk/2457/.

[8] J. Ballantyne, C. Bates, P Rowley: The maximal subgroups of E7(2), LMS J. Comput. Math. 18 (2015), 323-371.

[9] A. V. Borovik: Linear algebraic groups, Second. Vol. 126. Graduate Texts in Mathematics. New York: Springer-Verlag, (1991).

[10] A. V. Borovik: The stucture of finite subgroups of simple algebraic groups, Al- gebra and Logic 28 (3) (1990) 163-182.

124 BIBLIOGRAPHY 125

[11] W. Bosma: Canonical bases for cyclotomic fields, Applicable Algebra in Engi- neering Communication and Computing 1(2) (1990), 125-134.

[12] N. Burgoyne, C. Williamson: On a theorem of Borel and Tits for finite Chevalley groups, Archiv der Math. Vol, 27(1) (1976), 489-491.

[13] G. Butler: The maximal subgroups of the sporadic of Held, J. Al- gebra 69 (1981), 67-81.

[14] R. W. Carter: Simple groups of Lie type, John Wiley & Sons Inc., (1972; reprinted 1989).

[15] C. Choi: On the subgroups of M24. II. The maximal subgroups of M24, Trans. Amer. Math. Soc. 167 (1972), 29-47.

[16] J. H. Conway et al.: Atlas of Finite Groups, Oxford University Press, 1985.

n [17] B. N. Cooperstein: Maximal subgroups of G2(2 ), J. Algebra 70 (1981), 23-36.

[18] D. A. Craven: Alternating subgroups of exceptional groups of Lie type, https: //arXiv.org/abs/1509.00534

[19] R. T. Curtis: A new combinatorial approach to M24, Math. Proc. Cambridge Philos. Soc. 79 (1976), 25-42.

[20] L. E. Dickson: Linear groups, with an exposition of the Galois field theory, (Dover, 1958) Reprint of the 1901 original.

[21] E. B. Dynkin: Classification of the simple Lie groups, Rec. Math. [Mat. Sbornik] N. S. 18(60) (1946), 347-352.

[22] E. B. Dynkin: Maximal subgroups of the classical groups, Trudy Moscov. Mat. Ob˘s˘c.1, (1952), 39-166.

[23] E. B. Dynkin: Semisimple subalgebras of semisimple Lie algebras, Mat. Sbornik N.S. 30(72) (1952), 349-462.

[24] L. Finkelstein: The maximal subgroups of Conway’s group Co3 and McLaughlin’s group, J. Algebra 25 (1973), 58-89. BIBLIOGRAPHY 126

[25] L. Finkelstein, A. Rudvalis: The maximal subgroups of the HallJankoWales group, J. Algebra 24 (1973), 486-493.

[26] L. Finkelstein, A. Rudvalis: The maximal subgroups of Janko’s simple group of order 50,232,960, J. Algebra 30 (1974), 122-143.

[27] D. D. Frey: Conjugacy of Alt5 and SL2(5) subgroups of E6(C), F4(C), and a

subgroup of E8(C) of type A2E6, J. Algebra 202(2) (1998), 414-454.

[28] B. C. Hall: Lie groups, Lie algebras, and representations: An elementary intro- duction, Graduate Texts in Mathematics, 222 (2nd ed.), Springer, (2015).

[29] R. W. Hartley: Determination of the ternary collineation groups whose coe- cients lie in the GF (2n), Ann. of Math. (2) 27 (1925), 140-158.

[30] J. E. Humphreys: Linear algebraic groups, Graduate Texts in Mathematics, No. 21. New York: Springer-Verlag, (1975).

[31] J. E. Humphreys: Modular representations in finite groups of Lie type, Academic Press London (1980).

[32] Z. Janko: A new finite simple group with abelian Sylow 2-subgroup, and its characterization, J. Algebra 3 (1966), 147-186.

[33] J. C. Jansen et al.: An atlas of Brauer characters, London Math. Soc. Book 11, Oxford University Press, (1995).

[34] J. C. Jansen: Representations of algebraic groups, Vol. 31 Pure and Applied Math. Academic Press (1987).

[35] P. B. Kleidman: The maximal subgroups of the Chevalley groups G2(q) with 2 q odd, the Ree groups G2(q), and their automorphism groups, J. Algebra 117 (1988), 30-71

3 [36] P. B. Kleidman: The maximal subgroups of the Steinberg triality groups D4(q) and their automorphism groups, J. Algebra 115 (1988), 182-199.

[37] P. B. Kleidman, R. A. Parker, R. A. Wilson: The maximal subgroups of the

Fischer group Fi23, J. London Math. Soc. 39 (1989), 89-101. BIBLIOGRAPHY 127

[38] P. B. Kleidman, R. A. Wilson: The maximal subgroups of J4, Proc. London Math. Soc. 56 (1988), 484-510.

[39] P. B. Kleidman, R. A. Wilson: The maximal subgroups of E6(2) and Aut(E6(2)), Proc. London Math. Soc. (3) 60 (1990), no. 2, 266-294.

[40] M. W. Liebeck, C. E. Praeger, J. Saxl: A classification of the maximal subgroups of the finite alternating and symmetric groups, J. Algebra, 111 (1987), 365-383.

[41] M. W. Liebeck, J. Saxl, G. M. Seitz: Subgroups of maximal rank in finite excep- tional groups of Lie type, Proc. London Math. Soc. 65 (1992), 297-325.

[42] M. W. Liebeck, G. M. Seitz: Maximal subgroups of exceptional groups of Lie type, finite and algebraic, Geom. Dedicata 36 (1990) 353-387.

[43] M. W. Liebeck, G. M. Seitz: The maximal subgroups of positive dimension in exceptional algebraic groups, Mem. Amer. Math. Soc. 169(802) (2004).

[44] M. W. Liebeck, G. M. Seitz: A survey of maximal subgroups of excep- tional groups of Lie type, Groups Comb. Geom. World Scientific (2003), doi:10.1142/9789812564481 0008, (2003).

[45] M. W. Liebeck, G. M. Seitz: On finite subgroups of exceptional algebraic groups, J. Reine Angew. Math. 515 (1999), 25-72.

[46] S. A. Linton: The maximal subgroups of the Thompson group, J. London Math. Soc. 39 (1989), 79-88. Corrections, ibid. 43 (1991), 253-254.

[47] S. A. Linton, R. A. Wilson: The maximal subgroups of the Fischer groups Fi24

and Fi240 , Proc. London Math. Soc. 63 (1991), 113-164.

[48] A. Litterick: Finite simple subgroups of exceptional algebraic groups, Ph.D. the- sis, Imperial College, London, 2013.

[49] F. L¨ubeck: Small degree representations of finite Chevalley groups in defining characteristic, LMS J. Comput. Math., 4 (2001) 135-169.

[50] F. L¨ubeck: Conjugacy classes and character degrees of E8(2), http://www.math.

rwth-aachen.de/⇠Frank.Luebeck/chev/E82.html. BIBLIOGRAPHY 128

[51] K. Magaard: The maximal subgroups of the Chevalley groups F4(F ) where F is a finite or algebraically closed field of characteristic =2, 3, Ph.D. thesis, Calif. 6 Inst. Tech. (1990).

[52] S. S. Magliveras: The subgroup structure of the Higman-Sims simple group, Bull. Amer. Math. Soc. 77 (1971), 535-539.

[53] H. H. Mitchell: Determination of the ordinary and modular ternary linear groups, Trans. Amer. Math. Soc. 12 (1911), 207-242.

[54] S. P. Norton, R. A. Wilson: Maximal subgroups of the Harada-Norton group, J. Algebra 103 (1986), 362-376.

[55] S. P. Norton, R. A. Wilson: The maximal subgroups of F4(2) and its automor- phism group, Comm. Algebra 17 (1989), 2809-2824.

[56] G. M. Seitz: Maximal subgroups of exceptional algebraic groups, Mem. Amer. Math. Soc. 90 (1991), 441.

[57] R. Steinberg: Endomorphisms of linear algebraic groups, Mem. Amer. Math. Soc. 80 (1968), 137.

[58] R. A. Wilson: The Finite Simple Groups, Graduate Texts in Mathematics, 251. Springer-Verlag London, Ltd., London, 2009.

[59] R. A. Wilson: The maximal subgroups of Conway’s group Co1, J. Algebra 85 (1983), 144-165.

[60] R. A. Wilson: The maximal subgroups of Conway’s group 2, J. Algebra 84 · (1983), 107-114.

[61] R. A. Wilson: On maximal subgroups of the Fischer groups Fi22, Math. Proc. Cambridge Philos. Soc. 95 (1984) 197-222.

[62] R. A. Wilson: The geometry and maximal subgroups of the simple groups of A. Rudvalis and J. Tits, Proc. London Math. Soc. 48 (1984), 533-563.

[63] R. A. Wilson: The complex and maximal subgroups of the Suzuki group, J. Algebra 84 (1983), 151-188. BIBLIOGRAPHY 129

[64] R. A. Wilson: The maximal subgroups of the O’Nan group, J. Algebra 97 (1985), 467-473.

[65] R. A. Wilson: The maximal subgroups of the Lyons group, Math. Proc. Cam- bridge Philos. Soc. 97 (1985), 433-436.

[66] R. A. Wilson: The maximal subgroups of the Baby Monster, I, J. Algebra 211 (1999), 1-14.

[67] R. A. Wilson: Maximal subgroups of sporadic groups, https://arXiv.org/abs/ 1701.02095.

2 [68] R. A. Wilson: Maximal subgroups of E6(2) and its , https: //arXiv.org/abs/1801.08374. Appendix A

Programs

A.1 Feasible Character Code

The Feasible Character Code takes a potential subgroup, its Irreducible GF(2)-

Modules and the Brauer character information for L(E8(2)) found in Section 3.2 to produce a list of feasible decompositions. These will be given in the form of a sequence

[x1,x2,...,xn] with each xi being the multiplicity of the module i from the character table of G.

Definition A.1. The decomposition order is a total order on the set of feasible decom- positions of a group H. It is defined as for x0 =[x1,x2,...,xn]andy0 =[y1,y2,...,yn] where x0 and y0 are the feasible decomposition sequences of x and y respectively, then x y if and only if either x = y or x >y where i is the highest such that i i x = y . i 6 i The code works by finding every feasible decomposition sequence of H and checking if the corresponding feasible decomposition is a feasible decomposition. It does this by building the feasible decomposition sequences in reverse decomposition order starting at [248, 0,...,0].

F:= function(G,I,S); // G is the group, I is the set of all irreducible modules over GF(2) // normally found using IrreducibleModules command in MAGMA, and S is // the set of pairs of orders and Brauer character values of conjugacy // class representatives of the necessary classes in E_8(2).

130 APPENDIX A. PROGRAMS 131

B:= [BrauerCharacter(i): i in I];

S1:= {@@}; for s in S do Include(~S1,()!s[1]); end for;

C:= ConjugacyClasses(G); C1:= {@@}; for i in [1..#C] do Include(~C1,{@-i,C[i][1]@}); end for; C2:= {@@}; for i in [1..#C] do if C[i][1] in S1 then Include(~C2,{@-i,C[i][1]@}); end if; end for;

// C1 is the set of all conjugacy class orders of G as {@-i, order@} // and C2 is the set of conjugacy class orders of G which we know // Brauer character values of the E8(2) conjugacy classes of that order.

IS:= {@@}; for i in [1..#I] do if Dimension(I[i]) lt 249 then Include(~IS,{@-i,Dimension(I[i])@}); end if; end for;

//IS is the set of dimensions of modules in I as {@-i,dimension@}.

Combs:= {@@}; APPENDIX A. PROGRAMS 132

// Combs is the set that will collect the feasible decompositions. t:= [1..#IS]; for i in [1..#IS] do t[i]:= 0; end for; t[1]:= 248;

//This sets up the base test case of 248 trivial modules. vis:= 0;

// This is a counter to give a visual indication of the progress // of the code every 500 steps repeat t1:= t; vis:= vis+1; for i in [2..#IS] do check:= 0; for j in [1..i-1] do check:= check + (t[j]*IS[j][2]); end for;

// check is now the total dimension of modules smaller than I[i] in the // previous possible decomposition if check gt IS[i][2]-1 then t[i]:= t[i]+1;

// the first time this condition is satisfied a new feasible // decomposition is found and replaces t, it will then be // tested as to whether it is a feasible decomposition APPENDIX A. PROGRAMS 133

// before the whole process repeats. for j in [1..i-1] do t[j]:= 0; end for; count:= 0; for j in [1..#IS] do count:= count + (t[j]*IS[j][2]); end for; t[1]:= 248-count;

// t is now the new possible decomposition to be tested.

In:= 0;

// In is a indicator of whether t is a feasible decomposition, if any // test shows it can’t be the In will be set to 1. for c in C2 do b:=0; j:= -c[1]; for i in [1..#IS] do b:= b + (t[i]*B[i][j]); end for; x:= [c[2],b]; Alt:= 0; for s in S do if x eq s then Alt:= 1; end if; end for; if Alt eq 0 then In:=1; end if; APPENDIX A. PROGRAMS 134 end for;

// for each conjugacy class in C2 this checks that the feasible // decomposition’s character values match with some conjugacy class of // E8(2) using data from S. if In eq 0 then Include(~Combs,t); end if; break i;

// this ensures that once a new feasible decomposition has been // found and tested the entire loop is started from the beginning // rather than moving on to the next module in I. end if; end for; if vis mod 500 eq 0 then vis,t; end if; until t eq t1; return #Combs,Combs; end function;

Lemma A.1. The Feasible Character Code checks every feasible decomposition se- quence of H.

Proof. We proceed by induction on the length of a feasible decomposition sequence. As abasecaseassumethatthelengthofafeasibledecompositionsequenceis2.Thenfor each integer j between 0 and 248/ dim(I ) there is exactly 1 feasible decomposition, b i c each of the form [n ,j] for n =248 j dim(I ). The code finds each of these in turn as j j i n > dim(I ) for all j< 248/ dim(I ) . Note that this works for any value replacing j i b i c 248 so long as the line of code t[1]:= 248-count; likewise has the 248 replaced. We then may assume that the code works for any length APPENDIX A. PROGRAMS 135 of sequence n and any replacement of 248 of the form above. To find all sequences  of length n +1wesplitthembasedoftheirfinalterm,whichcanbeanyintegerk between 0 and 248/ dim(I ) . For each k the question is the reduced to finding all b n+1 c sequences of length n with 248 replaced by 248 k dim(I )andthenappendingkto n+1 them. We have assumed that the code can find all such sequences so long as the code above also has 248 replaced, which it e↵ectively does as 248 k dim(I ) count = n+1 n 248 count where count and count are what the variable count would be for the n+1 n n+1 n and n+1 length sequences. Compiling all of the sequences found for each k we now have all of the n+1 length sequences. Hence by induction the lemma is proven.

A.2 Indecomposable Module Code

The Indecomposable Module Code takes a direct sum of projective indecompos- able modules, DM, for a group H and a feasible decomposition of H on L(E8(2)) and returns all indecomposable submodules of DM that are compatible with the fea- sible decomposition and have no trivial quotients or submodules. What follows is an example of the code being used with the data for L3(3).

DM:= DirectSum([P[2],P[3],P[3],P[3],P[3]]); // DM is any direct sum of projective covers of irreducible modules

// IncF is a subroutine that takes a set of modules and a module to // be included and returns the set with the module included if // the module is isomorphic to none of the elements of the set and // just returns the original set otherwise

IncF:= function(A,b); checkf:=0; for a in A do if Dimension(a) eq Dimension(b) then if IsIsomorphic(a,b) then checkf:=1; break a;end if; end if; end for; APPENDIX A. PROGRAMS 136 if checkf eq 0 then Include(~A,b); end if; return A; end function;

// QuoSet will be the set of the indecomposable modules we are // interested in // TempSet is the set of submodules we build up from to find all // possible submodules that need to be checked

QuoSet:={@@}; TempSet1:=MinimalSubmodules(DM); for m in TempSet1 do QuoSet:=IncF(QuoSet,m); end for; count:=0; repeat TempSet:= TempSet1; count:=count+1; TempSet1:={@@}; for q in [1..#TempSet] do A,map:= quo; Min:= MinimalSubmodules(A); for m in [1..#Min] do n:= Min[m]@@map; cn:= CompositionFactors(n); count1:=0; count2:=0; count3:=0; for c in cn do if Dimension(c) eq 1 then count1:=count1+1; end if; if Dimension(c) eq 12 then count2:=count2+1; end if; if Dimension(c) eq 26 then count3:=count3+1; end if; APPENDIX A. PROGRAMS 137

// The number and dimensions of these checks depend // on the group in question end for; check1:=0; check2:=0; check3:=0; check4:=1; if count1 lt 5 then check1:=1; end if; if count2 lt 4 then check2:=1; end if; if count3 lt 9 then check3:=1; end if;

// All checks that start at 0 check that the count for that // irreducible module doesn’t exceed that of the // feasible decomposition // The final check looks for whether the module has trivial quotients

DS:= Socle(Dual(n)); CDS:= CompositionFactors(DS); for c in CDS do if IsIsomorphic(I[1],c) then check4:=0; end if; end for; if check1*check2*check3 eq 1 then TempSet1:=IncF(TempSet1,n); end if; if check1*check2*check3*check4 eq 1 then QuoSet:= IncF(QuoSet,n); end if;

// All modules whose composition factors do not exceed those of the APPENDIX A. PROGRAMS 138

// feasible decomposition are kept for the next run in TempSet1 // Any of those modules which also have no trivial quotients are kept // in QuoSet as they are what we are looking for count,#TempSet,q,#Min,m,#TempSet1,#QuoSet; end for; end for; until #TempSet eq 0;

As described in Section 4.16 this can be extended to search for more specific mod- ules by adding extra conditions to the final checks.

N A.3 L2(2 ) code

In Chapter 5 we used a variety of methods to find subgroups of O2(P )forsome parabolic subgroup P which were irreducible under the action of an element x P of 2 order 2N 1. We shall now describe these using the data for L (32) as an example. 2

The first of these takes O2(P ), denoted OP, and our chosen element x, x31, and returns a set of irreducible subgroups, FinSub, along with a set of bad cases, BadSub.

FinSub:={@@}; BadSub:={@@}; SetSub2:={@OP@}; countt:=0; repeat SetSub:=SetSub2; SetSub2:={@@}; count:=0; countt:=countt+1; for x in SetSub do count:= count+1; Sub31:= sub; FX31:= FrattiniSubgroup(x); APPENDIX A. PROGRAMS 139

MNt5aa,phit5aa:= GModule(Sub31,x,FX31); Com:= DirectSumDecomposition(MNt5aa); CheckSet:= {@ 1 @}; ModSet:= {@ Com[1] @}; for i in [2..#Com] do check:=0; for j in CheckSet do if IsIsomorphic(Com[i],Com[j]) then check:=1; end if; end for; if check eq 0 then Include(~CheckSet,i); Include(~ModSet,Com[i]); end if; end for;

// This creates ModSet as a set of representatives of // isomorphism classes of the irreducible submodules

// The following splits into 3 cases, if Order(FX31) is 1 then // Sub31 is elementary abelian and so the subgroups are // included into FinSub. If FX31 is non-trivial and all the // direct summands are isomorphic then Sub31 is included // into BadSub, otherwise it is split up and included into // SetSub2 to continue to the next run through. if Order(FX31) eq 1 then for m in ModSet do if Dimension(m) eq 5 then GenSet:= {@@}; for n in Com do if IsIsomorphic(n,m) then Include(~GenSet,n); end if; APPENDIX A. PROGRAMS 140 end for; IncMod:= sub; IncGrp:= IncMod@@phit5aa; Include(~FinSub,IncGrp); end if; end for; else if #ModSet eq 1 then Include(~BadSub,x); else for m in ModSet do if Dimension(m) eq 5 then GenSet:= {@@}; for n in Com do if IsIsomorphic(n,m) then Include(~GenSet,n); end if; end for; IncMod:= sub; IncGrp:= IncMod@@phit5aa; Include(~SetSub2,IncGrp); end if; end for; end if; end if; countt,#SetSub,count,#SetSub2,#BadSub; end for; until #SetSub2 eq 0;

We now need the code for dealing with the bad cases, which takes a set of bad cases, denoted BadSub, and our chosen element x, x31, and returns a set of irreducible sub- groups, FinSubBad, and a set of subgroups to use the first method on again, SetSub2.

FinSubBad:={@@}; SetSub2:={@@}; APPENDIX A. PROGRAMS 141

BadSetNew:={@@}; for k in [1..#BadSub] do b:= BadSub[k]; Fb:= FrattiniSubgroup(b); FFb:= FrattiniSubgroup(Fb); Pb,pmap:= PCGroup(b); Fpb:= pmap(Fb); FFpb:= pmap(FFb); Qpb,qmap:= quo; QFpb:= qmap(Fpb); CPb:= CommutatorSubgroup(Qpb,QFpb); QQpb,qqmap:= quo; QQFpb:= qqmap(QFpb); FQQFpb:= FrattiniSubgroup(QQFpb); A:= ((FQQFpb@@qqmap)@@qmap)@@pmap;

// Here we have found our chosen subgroup A by the method in Chapter 5

MNt,phit:= GModule(sub,b,Fb); Com:= DirectSumDecomposition(MNt); SetKeep:= {@@}; for i in [1..#Com-1] do repeat xm:= Random(Com[i]); until xm ne Zero(Com[i]); x:= xm@@phit; setym:={@@}; for j in [i+1..#Com] do Include(~setym,Com[j]); end for; YM:= sub; countym:=0; for ym in YM do APPENDIX A. PROGRAMS 142 countym:= countym+1; y:= ym@@phit; t:= x*y; if t*t in A then Include(~SetKeep,t); end if; if countym mod 250 eq 0 then #BadSub,k,#Com,i,#YM,countym, #SetKeep; end if; end for; end for; repeat x:= Random(Com[#Com]); until x ne Zero(Com[#Com]); t:=x@@phit; if t*t in A then Include(~SetKeep,t); end if;

// We have now found an element from all the irreducible subgroups // in the quotient Sub31/FX31 that we care about and we now proceed // to continue as in the normal case with A as our next kernel count:= 0; for r in [1..#SetKeep] do x:= SetKeep[r]; count:= count+1; set31:= {@@}; for i in [1..31] do Include(~set31,x^(x31^i)); end for; Sub31:= sub; Sub4aa:= sub; MNt4aa,phit4aa:= GModule(Sub31,Sub4aa,A); Com:= DirectSumDecomposition(MNt4aa); CheckSet:= {@ 1 @}; APPENDIX A. PROGRAMS 143

ModSet:= {@ Com[1] @}; for i in [2..#Com] do check:=0; for j in CheckSet do if IsIsomorphic(Com[i],Com[j]) then check:=1; end if; end for; if check eq 0 then Include(~CheckSet,i); Include(~ModSet,Com[i]); end if; end for; if Order(A) eq 1 then for m in ModSet do if Dimension(m) eq 5 then GenSet:= {@@}; for n in Com do if IsIsomorphic(n,m) then Include(~GenSet,n); end if; end for; IncMod:= sub; IncGrp:= IncMod@@phit4aa; Include(~FinSubBad,IncGrp); end if; end for; else if #ModSet eq 1 then Include(~BadSetNew,x); else for m in ModSet do if Dimension(m) eq 5 then GenSet:= {@@}; for n in Com do if IsIsomorphic(n,m) then Include(~GenSet,n); APPENDIX A. PROGRAMS 144 end if; end for; IncMod:= sub; IncGrp:= IncMod@@phit4aa; Include(~SetSub2,IncGrp); end if; end for; end if; end if; if r mod 10 eq 1 then k,#SetKeep,r,#SetSub2; end if; end for; end for;

N Lastly we need the code for finding all L2(2 )fromourirreduciblesubgroups.This code take a set of irreducible subgroups, denoted FinSub, our chosen element x, x31,a set of all inverting involutions of x saved as elements of a permutation representation of C (x), Tset, and a map from this permutation representation back to E (2), E⇤ 8(2) 8 N Tmap. It returns a set of subgroups probably isomorphic to L2(2 ), CSetNew,along with three sets containing checks which determine if all the groups in the previous

N set are indeed L2(2 )andwhethertheyfixanon-zerovectoronL(G), CSetONew, settrue and setnonfix.

CSeq:=[]; TSeq:=[]; for f in [1..#FinSub] do

// Here we split into whether we already have the irreducible // subgroups of need to break an elementary up // into irreducible subgroups. Once we have an irreducible // subgroup we apply our first and second sieves. if LMGOrder(FinSub[f]) eq 32 then APPENDIX A. PROGRAMS 145 checkd:=0; xd:=Element(FinSub[f],2); if Dimension(Eigenspace(xd,1)) eq 128 then checkd:=1; end if; if checkd eq 1 then for t in [1..#Tset] do tm:= Tset[t]@@Tmap; countx:=0; checkt:=0; for x in FinSub[f] do if Order(x) eq 2 then checke:=0; o:=Order(x*tm); if o eq 3 then checke:=1; end if; if o eq 11 then checke:=1; end if; if o eq 31 then checke:=1; end if; if o eq 33 then checke:=1; end if; if checke eq 0 then checkt:= 1; break x; end if; end if; end for; if checkt eq 0 then Append(~CSeq,FinSub[f]); Append(~TSeq,t); end if; end for; end if; else MNt,phit:=GModule(sub,FinSub[f]); Subs:= MinimalSubmodules(MNt); for s in [1..#Subs] do sg:= Subs[s]@@phit; checkd:=0; xd:=Element(sg,2); if Dimension(Eigenspace(xd,1)) eq 128 then checkd:=1; APPENDIX A. PROGRAMS 146 end if; if checkd eq 1 then for t in [1..#Tset] do tm:= Tset[t]@@Tmap; checkt:=0; for x in sg do if Order(x) eq 2 then checke:=0; o:=Order(x*tm); if o eq 3 then checke:=1; end if; if o eq 11 then checke:=1; end if; if o eq 31 then checke:=1; end if; if o eq 33 then checke:=1; end if; if checke eq 0 then checkt:= 1; break x; end if; end if; end for; if checkt eq 0 then Append(~CSeq,sg); Append(~TSeq,t); end if; end for; end if; #FinSub,f,#Subs,s; end for; end if; #FinSub,f; end for;

// We now have two sequences, CSeq is of irreducible subgroups, // and TSeq is the position in Tset that an element which generates // an L2(2^N) with that irreducible subgroup lies.

CSetNew:={@@}; for i in [1..#TSeq] do APPENDIX A. PROGRAMS 147

Gt:= sub; Mt:= GModule(Gt); Ct:= CompositionFactors(Mt); if #Ct eq 32 then Include(~CSetNew,Gt); end if; if i mod 50 eq 1 then #CSeq,i; end if; end for;

CSetONew:={@@}; for i in [1..#CSetNew] do if (LMGOrder(CSetNew[i]) eq 32736) eq false then Include(~CSetONew,CSetNew[i]); end if; #CSetNew,i; end for;

// CSetONew collects all groups whose order proves they are not L2(2^N) // In all cases run this set remains empty

LMGChiefFactors(CSetNew[1]); CheckFac:=LMGChiefFactors(CSetNew[1]); settrue:={@@}; for i in [1..#CSetNew] do a:= (LMGChiefFactors(CSetNew[i]) eq CheckFac); Include(~settrue,a); #CSetNew,i; end for;

// We first check that CSetNew[1] is L2(2^N) and us it as a reference // settrue returns just {true} when all subgroups are L2(2^N) APPENDIX A. PROGRAMS 148 setnonfix:={@@}; for c in [1..#CSetNew] do Mt:= GModule(CSetNew[c]); Ct:= CompositionFactors(Socle(Mt)); checkct:=0; for d in Ct do if Dimension(d) eq 1 then checkct:=1; end if; end for; if checkct eq 0 then Include(~setnonfix,CSetNew[c]); end if; #CSetNew,c; end for;

// setnonfix collects all groups for which the restriction of L(G) // to them does not contain a trivial quotient or submodule Appendix B

Supplementary Code

We now include some useful supplimentary code, however the code here was not written by the author.

B.1 E8(2) setup

// Here we construct E_8(2) as a subgroup of GL(248,2), using standard // MAGMA commands. We also give generators for // a Sylow 3-subgroup of E_8(2), here given the label S3.

// First we have MAGMA produce E_8(2) as an object // in the "GrpLie" category.

H:=GroupOfLieType("E8",GF(2));

// However, when working with E_8(2) we will likely require the natural // matrix representation, the adjoint representation. f:=AdjointRepresentation(H); Q:=Codomain(f); // In this case Q will be GL(248,2);

// Let’s get generators for H by taking elements corresponding to

149 APPENDIX B. SUPPLEMENTARY CODE 150

// the fundamental roots.

Hgens:=[]; for i:=1 to 8 do Append(~Hgens,elt>); end for; for i:=1 to 8 do Append(~Hgens,elt>); end for;

//Now we map them into the matrix group.

Ggens:=[]; for h in Hgens do Append(~Ggens,f(h)); end for;

//And now we can construct E_8(2) as a subgroup of Q.

G:=sub;

We also have a collection of useful procedures

// This function computes the Brauer character of a given element // of GL(n,K), where K is a finite field of characteristic 2. function BrauerCharacter(g) p:=CharacteristicPolynomial(g); R, S:=RootsInSplittingField(p);

// Here we find the roots of the polynomial p // in its minimal splitting field S. APPENDIX B. SUPPLEMENTARY CODE 151

k:=#R; o:=Order(w);

// We now need to map elements of the finite field K to // suitable roots of unity in the complex field. // We deal with the case where S has prime order separately to // avoid the situation where w equals 1 and so does // not generate the multiplicative group of S. if IsPrime(#S) then Q:=CyclotomicField(#S-1); f:=pmap< S -> Q | [2^i -> x^i : i in [1..#S-1]]>;

// Using 2 here since S* will have odd order (S has char 2).

else Q:=CyclotomicField(o); f:=pmap< S -> Q | [w^i -> x^i : i in [1..o]]>;

//When S is not of prime order w will generate S*. end if;

//Now we sum the relevant powers of roots of unity. c:=0; for j:=1 to k do v:=R[j,2]*f(R[j,1]); c:=c+v; end for; APPENDIX B. SUPPLEMENTARY CODE 152

return [c,#S]; end function;

// This function returns an element of order l in a given // G (if such an element exists). // Note that there is also a predefined command named // "Element" in MAGMA. Be aware that if no element of // order l exists in G then this will run indefinitely. function Element(G,l); x:=Id(G); repeat r:=Random(G);o:=Order(r); if o mod l eq 0 then k:=IntegerRing()!(o/l); x:=r^k; end if; until Order(x) eq l; return x; end function;

Finally we give the code for FindCentProc

// load ElementGivenOrder function first procedure FindCent(G,g,k,H)

// Here G is the group you’re working in (so usually E_8(2)) // g is the element whose centraliser you’re looking for, and H is APPENDIX B. SUPPLEMENTARY CODE 153

// a subgroup of G which is isomorphic to the centraliser in G of g. // The parameter k will typically be a small positive integer; however // it needs to be at least as large as the dimension of the smallest // non-trivial irreducible -module over GF(2).

// First decompose the module under H.

Q:=GL(248,2); V:=GModule(H); CompsV:=CompositionFactors(V); dimsV:={}; for c in CompsV do Include(~dimsV,Dimension(c)); end for;

Cg:=sub; count:=0; repeat

// Search randomly for an involution which generates // a ‘not too big’ subgroup along with g. repeat t:=Element(G,2); Y:=sub; U:=GModule(Y); CF:=CompositionFactors(U); until #CF ge 10; print "Found a suitable involution t"; APPENDIX B. SUPPLEMENTARY CODE 154

// Try to find small enough subgroups of Y in which we can // construct the centraliser of g. for i:=1 to 5 do thing:=0; counter:=0; repeat a:=Element(Y,2); L:=sub; W:=GModule(L); CFW:=CompositionFactors(W); dims:={}; for c in CFW do Include(~dims,Dimension(c)); end for; counter:=counter+1; if Max(dims) le k then thing:=1; end if; until Max(dims) le k or counter eq 20; if thing eq 1 then l:=LMGOrder(L); Factorisation(l);

if l le 2^20 then CL:=Centraliser(L,g); // Could adjust to look for normalisers at this point. Cg:=sub; else print "Couldn’t find small enough subgroup to use, trying again"; end if; end if; APPENDIX B. SUPPLEMENTARY CODE 155 end for;

VCg:=GModule(Cg); count:=count+1; count; CFVCg:=CompositionFactors(VCg); dimsVCg:={}; for c in CFVCg do Include(~dimsVCg,Dimension(c)); end for; if #CFVCg le 20 then print "Composition factors of GModule of centraliser subgroup are"; CFVCg; else print "GModule of centraliser subgroup has > 20 composition factors"; end if; until dimsV eq dimsVCg;

// We stop when the subgroup of C_G(g) we have produced acts // in the same way as H on the 248 dimensional module. // This does not guarantee that this subgroup is isomorphic to H, // but usually gives a good indication of whether you have the whole thing. // Further checks can be carried out if necessary to confirm // that the whole centraliser has been produced.

// The subgroup Cg is now written to file. // The destination can be specified below.

PrintFileMagma("~/MAGMA/Output/Cg",Cg); end procedure;