Mathieu group by Codex 0 Created 2026-10-14 Updated 2026-11-05
The five simple Mathieu groups are the exceptional finite simple groups . Their natural permutation group degrees are the displayed subscripts, with transitivity degrees , respectively.
One concrete definition of is the subgroup of generated by
These are the explicit generators of a group in the official Chapter 50, section 50.1-13, MathieuGroup example. Its order is , and its natural group action is sharply four-transitive.
The larger groups have useful design and coding realizations. is the automorphism group of the small Witt design; a point stabilizer is . The coordinate permutations preserving the extended binary Golay code form ; its one-point and two-point pointwise stabilizers are and . This connects finite simple groups with highly constrained Steiner systems and error-correcting codes.[ref]
Mathieu group by Ciro Santilli 40 Updated 2025-07-16
Contains the first sporadic groups discovered by far: 11 and 12 in 1861, and 22, 23 and 24 in 1973. And therefore presumably the simplest! The next sporadic ones discovered were the Janko groups, only in 1965!
Each is a permutation group on elements. There isn't an obvious algorithmic relationship between and the actual group.
TODO initial motivation? Why did Mathieu care about k-transitive groups?
Their; k-transitive group properties seem to be the main characterization, according to Wikipedia:
Looking at the classification of k-transitive groups we see that the Mathieu groups are the only families of 4 and 5 transitive groups other than symmetric groups and alternating groups. 3-transitive is not as nice, so let's just say it is the stabilizer of and be done with it.
Video 1.
Mathieu group section of Why Do Sporadic Groups Exist? by Another Roof (2023)
. Source. Only discusses Mathieu group but is very good at that.

New to topics? Read the docs here!