Mathieu group 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]
A Steiner system consists of 12 points and a collection of six-element blocks such that every five-element subset lies in exactly one block. The blocks are often called hexads. Necessarily their number is . We give the synthematic construction of the small Witt design explicitly and prove this defining property.
Write and . For an unordered pair , let denote the unique syntheme shared by its two synthematic totals. A duad belongs to three synthemes. The corresponding three pairs partition : every synthematic total contains in exactly one of its synthemes, and each syntheme lies in exactly two synthematic totals. Thus the incidence gives a perfect matching of the six synthematic totals for each duad.
To describe the blocks with three points in each half, take an unordered partition into triples. A syntheme is cross if each of its three duads joins to . Form a graph on by declaring an edge exactly when is cross. This graph is the union of two disjoint triangles. Indeed a synthematic total partitions the nine cross duads; every syntheme has either one or three cross duads, so if of its five synthemes are cross, then , giving . Each vertex therefore has degree two. The stronger assertion about its components follows directly for , when the two triangles are
any other triple partition is obtained by relabelling , which also permutes the synthematic totals. Denote the two components by .
The complete block collection is given by the following three rules:
  • Include and .
  • For each of size two and each duad , include and its complement .
  • For each unordered triple partition and its two components , include , , , and .
There are distinct blocks. The first two rules have different intersection sizes with from the third; within the third, a block determines its triple and its component. We next verify the Steiner system property, rather than relying solely on this count.
We need one further consequence of the triangle construction. The three synthemes attached to the three pairs within are pairwise disjoint, since any two belong to their common synthematic total, and together they are all nine cross duads of the complete bipartite graph between and . Thus determines the unordered partition uniquely: it is the bipartition of this connected graph. There are 10 such partitions, each giving two different components, hence 20 different triples in . Since , each triple in corresponds to exactly one triple partition of . The same reasoning applies to .
Let be any five-point set and put . If , only can contain it; if , only can contain it, because no other block has five points in either half.
If , set and write . The three pairs attached to partition , so exactly one contains ; its block is the unique block through . If , put and write . The three duads of partition , so exactly one contains ; this gives the unique block .
If , write and . A syntheme has either one or three duads crossing . In the one-cross case, has exactly one duad internal to , and the unique block is . No block with three points in each half is possible, since is then not an edge of either triangle. In the three-cross case, is an edge of exactly one triangle , giving the unique block ; no duad of is internal to , so a block with four points in is impossible.
Finally let , write and , and use the uniquely associated partition just proved. If crosses this partition, the three synthemes belonging to the pairs inside contain each cross duad exactly once. Thus the matching of attached to has exactly one pair internal to . It has exactly one pair internal to as well, since a matching must leave equal numbers of vertices in the two halves for cross pairs. The unique block containing is then ; is not contained in either or , so no block of the third rule applies. If is internal to or , none of its attached pairs lies inside or , since the synthemes attached to these internal pairs are cross. Thus the second rule gives no block. The third rule gives exactly one, namely or , according to which part contains .
All possibilities have now been exhausted, proving
This is the small Witt design; the construction uses only duads, synthemes, their synthematic totals, and the induced action on those synthematic totals.
The complete graph on six points has fifteen edges and fifteen perfect matchings. Its six one-factorizations organize a dual incidence geometry exchanging points with factorizations and edges with matchings. The classical names are duads, synthemes and totals of synthemes. This geometry supports duad-syntheme duality on six points and a construction of the small Witt design.
Steiner system Created 2026-10-07 Updated 2026-10-14
A Steiner system is a -point set with -point blocks such that every -point subset is contained in exactly one block. Necessarily the number of blocks is . This count is a necessary consistency check, not a substitute for proving exact containment. The small Witt design is .
On a six-point set and its six totals of synthemes , each duad determines a partition of into three pairs according to their shared synthemes. Include both whole halves, the 45 blocks for these duad-pair incidences, and their complements. For each partition into triples, cross synthemes give two triangular components on ; include the four unions of a part of with a component. These 132 blocks form the small Witt design.