Classical group Created 2026-10-14 Updated 2026-11-05
A classical group is a standard family of linear groups, principally the general/special linear groups and groups preserving nondegenerate alternating, symmetric, Hermitian or quadratic forms. Finite-field versions yield many finite simple groups after imposing the appropriate determinant or derived-subgroup condition and quotienting the scalar center of a group. Small dimensions and small fields have exceptional isomorphisms and nonsimple cases.
Classification of finite simple groups 2026-11-05
The classification of finite simple groups states that every finite simple group is isomorphic to a cyclic group of prime order, an alternating group with , a finite simple group of Lie type, or one of twenty-six sporadic simple groups. In the Lie-type families one takes the appropriate simple groups, respecting the exceptional small parameters and quotient constructions.[ref]
For example, is a simple abelian group, while is a simple nonabelian group of order sixty. The symmetric group is not simple: its subgroup is a proper nontrivial normal subgroup. The theorem lists the simple building blocks that occur as composition factors. It does not classify all finite groups: different group extensions can assemble the same factors into nonisomorphic groups.
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 byThese 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]
Sporadic simple groups by Robert A. Wilson. Lecture 5, Mathieu groups and the Golay-code realization