Monster group

In the area of abstract algebra known as group theory, the monster group M (also known as the Fischer–Griess monster, or the friendly giant) is the largest sporadic simple group, having order

   246 · 320 · 59 · 76 · 112 · 133 · 17 · 19 · 23 · 29 · 31 · 41 · 47 · 59 · 71
= 808,017,424,794,512,875,886,459,904,961,710,757,005,754,368,000,000,000
≈ 8×1053.
This article is about the largest of the sporadic simple finite groups. For the kind of infinite group known as a Tarski monster group, see Tarski monster group.
Algebraic structure → Group theory
Group theory
Basic notions
Group homomorphisms
Finite groups
Classification of finite simple groups
Modular groups
  • PSL(2,Z)
  • SL(2,Z)
Topological and Lie groups
Infinite dimensional Lie group
  • O(∞)
  • SU(∞)
  • Sp(∞)
Algebraic groups

The finite simple groups have been completely classified. Every such group belongs to one of 18 countably infinite families, or is one of 26 sporadic groups that do not follow such a systematic pattern. The monster group contains 20 sporadic groups (including itself) as subquotients. Robert Griess, who proved the existence of the monster in 1982, has called those 20 groups the happy family, and the remaining six exceptions pariahs.

It is difficult to give a good constructive definition of the monster because of its complexity. Martin Gardner wrote a popular account of the monster group in his June 1980 Mathematical Games column in Scientific American.[1]

History

The monster was predicted by Bernd Fischer (unpublished, about 1973) and Robert Griess (1976) as a simple group containing a double cover of Fischer's baby monster group as a centralizer of an involution. Within a few months, the order of M was found by Griess using the Thompson order formula, and Fischer, Conway, Norton and Thompson discovered other groups as subquotients, including many of the known sporadic groups, and two new ones: the Thompson group and the Harada–Norton group. The character table of the monster, a 194-by-194 array, was calculated in 1979 by Fischer and Donald Livingstone using computer programs written by Michael Thorne. It was not clear in the 1970s whether the monster actually existed. Griess (1982) constructed M as the automorphism group of the Griess algebra, a 196,884-dimensional commutative nonassociative algebra over the real numbers; he first announced his construction in Ann Arbor on January 14, 1980. In his 1982 paper, he referred to the monster as the Friendly Giant, but this name has not been generally adopted. John Conway (1985) and Jacques Tits (1983, 1984) subsequently simplified this construction.

Griess's construction showed that the monster exists. Thompson (1979) showed that its uniqueness (as a simple group satisfying certain conditions coming from the classification of finite simple groups) would follow from the existence of a 196,883-dimensional faithful representation. A proof of the existence of such a representation was announced by Norton (1985), though he has never published the details. Griess, Meierfrankenfeld & Segev (1989) gave the first complete published proof of the uniqueness of the monster (more precisely, they showed that a group with the same centralizers of involutions as the monster is isomorphic to the monster).

The monster was a culmination of the development of sporadic simple groups and can be built from any two of three subquotients: the Fischer group Fi24, the baby monster, and the Conway group Co1.

The Schur multiplier and the outer automorphism group of the monster are both trivial.

Representations

The minimal degree of a faithful complex representation is 196,883, which is the product of the three largest prime divisors of the order of M. The smallest faithful linear representation over any field has dimension 196,882 over the field with two elements, only one less than the dimension of the smallest faithful complex representation.

The smallest faithful permutation representation of the monster is on 24 · 37 · 53 · 74 · 11 · 132 · 29 · 41 · 59 · 71 (about 1020) points.

The monster can be realized as a Galois group over the rational numbers (Thompson 1984, p. 443), and as a Hurwitz group.[2]

The monster is unusual among simple groups in that there is no known easy way to represent its elements. This is not due so much to its size as to the absence of "small" representations. For example, the simple groups A100 and SL20(2) are far larger, but easy to calculate with as they have "small" permutation or linear representations. The alternating groups have permutation representations that are "small" compared to the size of the group, and all finite simple groups of Lie type have linear representations that are "small" compared to the size of the group. All sporadic groups other than the monster also have linear representations small enough that they are easy to work with on a computer (the next hardest case after the monster is the baby monster, with a representation of dimension 4370).

A computer construction

Robert A. Wilson has found explicitly (with the aid of a computer) two invertible 196,882 by 196,882 matrices (with elements in the field of order 2) which together generate the monster group by matrix multiplication; this is one dimension lower than the 196,883-dimensional representation in characteristic 0. Performing calculations with these matrices is possible but is too expensive in terms of time and storage space to be useful, as each such matrix occupies over four and a half gigabytes.

Wilson asserts that the best description of the monster is to say, "It is the automorphism group of the monster vertex algebra". This is not much help however, because nobody has found a "really simple and natural construction of the monster vertex algebra".[3]

Wilson with collaborators has found a method of performing calculations with the monster that is considerably faster. Let V be a 196,882 dimensional vector space over the field with 2 elements. A large subgroup H (preferably a maximal subgroup) of the Monster is selected in which it is easy to perform calculations. The subgroup H chosen is 31+12.2.Suz.2, where Suz is the Suzuki group. Elements of the monster are stored as words in the elements of H and an extra generator T. It is reasonably quick to calculate the action of one of these words on a vector in V. Using this action, it is possible to perform calculations (such as the order of an element of the monster). Wilson has exhibited vectors u and v whose joint stabilizer is the trivial group. Thus (for example) one can calculate the order of an element g of the monster by finding the smallest i > 0 such that giu = u and giv = v.

This and similar constructions (in different characteristics) have been used to find some of its non-local maximal subgroups.

Moonshine
Main article: Monstrous moonshine

The monster group is one of two principal constituents in the monstrous moonshine conjecture by Conway and Norton (1979), which relates discrete and non-discrete mathematics and was finally proved by Richard Borcherds in 1992.

In this setting, the monster group is visible as the automorphism group of the monster module, a vertex operator algebra, an infinite dimensional algebra containing the Griess algebra, and acts on the monster Lie algebra, a generalized Kac–Moody algebra.

Many mathematicians, including Conway, have seen the monster as a beautiful and still mysterious object.[4] Conway said of the monster group: "There's never been any kind of explanation of why it's there, and it's obviously not there just by coincidence. It's got too many intriguing properties for it all to be just an accident."[5] Simon P. Norton, an expert on the properties of the monster group, is quoted as saying, "I can explain what Monstrous Moonshine is in one sentence, it is the voice of God."[6]

McKay's E8 observation

There are also connections between the monster and the extended Dynkin diagrams specifically between the nodes of the diagram and certain conjugacy classes in the monster, known as McKay's E8 observation.[7][8][9] This is then extended to a relation between the extended diagrams and the groups 3.Fi24′, 2.B, and M, where these are (3/2/1-fold central extensions) of the Fischer group, baby monster group, and monster. These are the sporadic groups associated with centralizers of elements of type 1A, 2A, and 3A in the monster, and the order of the extension corresponds to the symmetries of the diagram. See ADE classification: trinities for further connections (of McKay correspondence type), including (for the monster) with the rather small simple group PSL(2,11) and with the 120 tritangent planes of a canonic sextic curve of genus 4 known as Bring's curve.

Maximal subgroups
Diagram of the 26 sporadic simple groups, showing subquotient relationships.

The monster has at least 44 conjugacy classes of maximal subgroups. Non-abelian simple groups of some 60 isomorphism types are found as subgroups or as quotients of subgroups. The largest alternating group represented is A12. The monster contains 20 of the 26 sporadic groups as subquotients. This diagram, based on one in the book Symmetry and the Monster by Mark Ronan, shows how they fit together. The lines signify inclusion, as a subquotient, of the lower group by the upper one. The circled symbols denote groups not involved in larger sporadic groups. For the sake of clarity redundant inclusions are not shown.

Forty-four of the classes of maximal subgroups of the monster are given by the following list, which is (as of 2016) believed to be complete except possibly for almost simple subgroups with non-abelian simple socles of the form L2(13), U3(4), or U3(8).[10][11][12] However, tables of maximal subgroups have often been found to contain subtle errors, and in particular at least two of the subgroups on the list below were incorrectly omitted from some previous lists.

  • 2.B   centralizer of an involution; contains the normalizer (47:23) × 2 of a Sylow 47-subgroup
  • 21+24.Co1   centralizer of an involution
  • 3.Fi24   normalizer of a subgroup of order 3; contains the normalizer ((29:14) × 3).2 of a Sylow 29-subgroup
  • 22.2E6(22):S3   normalizer of a Klein 4-group
  • 210+16.O10+(2)
  • 22+11+22.(M24 × S3)   normalizer of a Klein 4-group; contains the normalizer (23:11) × S4 of a Sylow 23-subgroup
  • 31+12.2Suz.2   normalizer of a subgroup of order 3
  • 25+10+20.(S3 × L5(2))
  • S3 × Th   normalizer of a subgroup of order 3; contains the normalizer (31:15) × S3 of a Sylow 31-subgroup
  • 23+6+12+18.(L3(2) × 3S6)
  • 38.O8− (3).23
  • (D10 × HN).2   normalizer of a subgroup of order 5
  • (32:2 × O8+(3)).S4
  • 32+5+10.(M11 × 2S4)
  • 33+2+6+6:(L3(3) × SD16)
  • 51+6:2J2:4   normalizer of a subgroup of order 5
  • (7:3 × He):2   normalizer of a subgroup of order 7
  • (A5 × A12):2
  • 53+3.(2 × L3(5))
  • (A6 × A6 × A6).(2 × S4)
  • (A5 × U3(8):31):2   contains the normalizer ((19:9) × A5):2 of a Sylow 19-subgroup
  • 52+2+4:(S3 × GL2(5))
  • (L3(2) × S4(4):2).2   contains the normalizer ((17:8) × L3(2)).2 of a Sylow 17-subgroup
  • 71+4:(3 × 2S7)   normalizer of a subgroup of order 7
  • (52:4.22 × U3(5)).S3
  • (L2(11) × M12):2   contains the normalizer (11:5 × M12):2 of a subgroup of order 11
  • (A7 × (A5 × A5):22):2
  • 54:(3 × 2L2(25)):22
  • 72+1+2:GL2(7)
  • M11 × A6.22
  • (S5 × S5 × S5):S3
  • (L2(11) × L2(11)):4
  • 132:2L2(13).4
  • (72:(3 × 2A4) × L2(7)):2
  • (13:6 × L3(3)).2   normalizer of a subgroup of order 13
  • 131+2:(3 × 4S4)   normalizer of a subgroup of order 13; normalizer of a Sylow 13-subgroup
  • L2(71)   Holmes & Wilson (2008) contains the normalizer 71:35 of a Sylow 71-subgroup
  • L2(59)   Holmes & Wilson (2004) contains the normalizer 59:29 of a Sylow 59-subgroup
  • 112:(5 × 2A5)   normalizer of a Sylow 11-subgroup.
  • L2(41)   Norton & Wilson (2013) found a maximal subgroup of this form; due to a subtle error pointed out by Zavarnitsine some previous lists and papers stated that no such maximal subgroup existed
  • L2(29):2   Holmes & Wilson (2002)
  • 72:SL2(7)   this was accidentally omitted from some previous lists of 7-local subgroups
  • L2(19):2   Holmes & Wilson (2008)
  • 41:40   normalizer of a Sylow 41-subgroup

See also

References
  1. Gardner, Martin (1980). "MATHEMATICAL GAMES". Scientific American. 242 (6): 20–33. ISSN 0036-8733.
  2. Wilson 2001.
  3. Borcherds 2002, p. 1077.
  4. Roberts 2013.
  5. Haran 2014, 7:57.
  6. Masters 2019.
  7. Duncan 2008.
  8. le Bruyn 2009.
  9. He & McKay 2015.
  10. Wilson 2010.
  11. Norton & Wilson 2013.
  12. Wilson 2016.

Sources
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.