Mathieu group
In group theory, a topic in abstract algebra, the Mathieu groups are the five sporadic simple groups "M", "M", "M", "M" and "M" introduced by . They are multiply transitive permutation groups on 11, 12, 22, 23 or 24 objects. They were the first sporadic groups to be discovered. Sometimes the notation "M", "M", "M" and "M" is used for related groups (which act on sets of 9, 10, 20, and 21 points, respectively), namely the stabilizers of points in the larger groups. While these are not sporadic simple groups, they are subgroups of the larger groups and can  be used to construct the larger ones. John Conway has shown that one can also extend this sequence up, obtaining the Mathieu groupoid "M" acting on 13 points. "M" is simple, but is not a sporadic group, being isomorphic to PSL(3,4). History. introduced the group "M" as part of an investigation of multiply transitive permutation groups, and briefly mentioned (on page 274) the group "M", giving its order. In he gave further details, including explicit generating sets for his groups, but it was not easy to see from his arguments that the groups generated are not just alternating groups, and  for several years the existence of his groups was controversial. even published a paper mistakenly claiming to prove that "M" does not exist, though shortly afterwards in he pointed out that his proof was wrong, and gave a proof that the Mathieu groups are simple. finally removed the doubts about the existence of these groups, by constructing them as successive transitive extensions of permutation groups, as well as automorphism groups of Steiner systems. After the Mathieu groups no new sporadic groups were found until 1965, when the group J was discovered. Multiply transitive groups. Mathieu was interested in finding multiply  transitive permutation groups, which will now be defined. For a natural number "k", a permutation group "G" acting on "n" points is "k"-transitive if, given two sets of points "a", ... "a" and "b", ... "b" with the property that all the "a" are distinct and all the "b" are distinct, there is a group element "g" in "G" which maps "a" to "b" for each "i" between 1 and "k". Such a group is called sharply "k"-transitive if the element "g" is unique (i.e. the action on "k"-tuples is regular, rather than just transitive). "M" is 5-transitive, and "M" is  sharply 5-transitive, with the other Mathieu groups (simple or not) being the subgroups corresponding to stabilizers of "m" points, and accordingly of lower transitivity ("M" is 4-transitive, etc.). These are the only two 5-transitive groups that are neither symmetric groups nor alternating groups. The only 4-transitive groups are the symmetric groups "S" for "k" at least 4, the alternating groups "A" for "k" at least 6, and the Mathieu groups "M", "M", "M" and "M". The full proof requires the classification of finite simple groups, but some special cases have been known for much longer. It  is a classical result of Jordan that the symmetric and alternating groups (of degree "k" and "k" + 2 respectively), and "M" and "M" are the only "sharply" "k"-transitive permutation groups for "k" at least 4. Important examples of multiply transitive groups are the 2-transitive groups and the Zassenhaus groups. The Zassenhaus groups notably include the projective general linear group of a projective line over a finite field, PGL(2,F), which is sharply 3-transitive (see cross ratio) on formula_1 elements. Constructions of the Mathieu groups. The Mathieu groups can be constructed in various ways. Permutation groups. "M" has a  simple subgroup of order 660, a maximal subgroup. That subgroup is isomorphic to the projective special linear group PSL(F) over the field of 11 elements. With −1 written as a and infinity as b, two standard generators are (0123456789a) and (0b)(1a)(25)(37)(48)(69). A third generator giving "M" sends an element "x" of F to 4"x" − 3"x"; as a permutation that is (26a7)(3945). This group turns out not to be isomorphic to any member of the infinite families of finite simple groups and is called sporadic. "M" is the stabilizer of a point in "M", and turns out also to be  a sporadic simple group. "M", the stabilizer of two points, is not sporadic, but is an almost simple group whose commutator subgroup is the alternating group A. It is thus related to the exceptional outer automorphism of A. The stabilizer of 3 points is the projective special unitary group PSU(3,2), which is solvable. The stabilizer of 4 points is the quaternion group. Likewise, "M" has a maximal simple subgroup of order 6072 isomorphic to PSL(F). One generator adds 1 to each element of the field (leaving the point "N" at infinity fixed), i. e. (0123456789ABCDEFGHIJKLM)("N"), and the other is the  order reversing permutation, (0N)(1M)(2B)(3F)(4H)(59)(6J)(7D)(8K)(AG)(CL)(EI). A third generator giving "M" sends an element "x" of F to 4"x" − 3"x" (which sends perfect squares via formula_2 and non-perfect squares via formula_3); computation shows that as a permutation this is (2G968)(3CDI4)(7HABM)(EJLKF). The stabilizers of 1 and 2 points, "M" and "M" also turn out to be sporadic simple groups. The stabilizer of 3 points is simple and isomorphic to the projective special linear group PSL(4). These constructions were cited by . ascribe the permutations to Mathieu. Automorphism groups of Steiner systems. There exists up to equivalence a unique "S"(5,8,24) Steiner system W  (the Witt design). The group "M" is the automorphism group of this Steiner system; that is, the set of permutations which map every block to some other block. The subgroups "M" and "M" are defined to be the stabilizers of a single point and two points respectively. Similarly, there exists up to equivalence a unique S(5,6,12) Steiner system W, and the group "M" is its automorphism group. The subgroup "M" is the stabilizer of a point. "W" can be constructed from the affine geometry on the vector space "F"×"F", an "S"(2,3,9) system. An alternative construction of "W" is the 'Kitten ' of . An introduction to a construction of "W" via the Miracle Octad Generator of R. T. Curtis and Conway's analog for "W", the miniMOG, can be found in the book by Conway and Sloane. Automorphism groups on the Golay code. The group "M" is the permutation automorphism group of the extended binary Golay code "W", i.e., the group of permutations on the 24 coordinates that map "W" to itself. All the Mathieu groups can be constructed as groups of permutations on the binary Golay code. "M" has index 2 in its automorphism group, and "M":2 happens to be isomorphic  to a subgroup of "M". "M" is the stabilizer of a dodecad, a codeword of 12 1's; "M":2 stabilizes a partition into 2 complementary dodecads. There is a natural connection between the Mathieu groups and the larger Conway groups, because the Leech lattice was constructed on the binary Golay code and in fact both lie in spaces of dimension 24. The Conway groups in turn are found in the Monster group. Robert Griess refers to the 20 sporadic groups found in the Monster as the Happy Family, and to the Mathieu groups as the first generation. Dessins d'enfants. The  Mathieu groups can be constructed via dessins d'enfants, with the dessin associated to "M" suggestively called "Monsieur Mathieu" by .