Alternating group A_n

Alternating group A_n
Name	Alternating group A_n
Order	n!/2
Notation	A_n
Properties	simple for n≥5

Alternating group A_n The alternating group A_n is the subgroup of the symmetric group on n letters consisting of even permutations; it is a central object in finite group theory, algebraic combinatorics, and the theory of polynomial equations. Historically A_n appears in the work of Évariste Galois, Niels Henrik Abel, Arthur Cayley, and Camille Jordan and features in classification contexts studied by William Burnside, Emil Artin, and Richard Brauer. It connects to topics such as the Galois group of generic polynomials, the icosahedron symmetry, and applications in problems related to Rubik's Cube and puzzles studied by Sam Loyd.

Definition and basic properties

A_n is defined as the index-two subgroup of the symmetric group S_n consisting of even permutations; its order is n!/2, and it is generated by 3-cycles and by products of disjoint transpositions. Early structural results appear in works by Augustin-Louis Cauchy and Arthur Cayley; foundational theorems were refined by Camille Jordan and later by Émile Picard and Issai Schur. For small n the group is solvable, while for larger n it exhibits nonabelian simple behavior central to the Classification of Finite Simple Groups and considerations by Émile Mathieu. Many classical theorems about permutation groups, including the Orbit–stabilizer theorem, Cauchy's theorem, and concepts from Sylow theorems are routinely applied to A_n.

Examples and low-degree cases

For n=1 and n=2 the group is trivial; for n=3, A_3 is cyclic of order 3 isomorphic to groups studied by Niels Henrik Abel; for n=4, A_4 is a group of order 12 with a normal Klein four subgroup often presented in texts by G. A. Miller and Otto Hölder. The case n=5 yields A_5 of order 60, the smallest nonabelian simple group, historically linked to the symmetry group of the icosahedron and analyzed by Évariste Galois and Arthur Cayley; A_6, A_7, and A_8 feature in classical constructions by Camille Jordan and later in the work of W. Burnside and Frobenius on permutation representations. Exceptional isomorphisms such as those between small alternating groups and rotation groups of polyhedra are treated in expositions by H. S. M. Coxeter and Felix Klein.

Group structure and subgroups

The subgroup lattice of A_n includes point stabilizers isomorphic to A_{n-1}, intransitive subgroups isomorphic to direct products of alternating groups, and imprimitive wreath-product constructions studied by Otto Schreier and Issai Schur. Maximal subgroups are classified via the O'Nan–Scott theorem in settings treated by Michael Aschbacher and Peter Neumann; primitive subgroups include Mathieu groups for special degrees discussed by Émile Mathieu and later by John Conway. Young subgroup embeddings and the role of Young diagrams appear in work by Alfred Young and are fundamental in branching rules and subgroup inclusions used by Frobenius and Richard Brauer.

Simplicity and normal subgroups

A_n is simple for n ≥ 5, a theorem proved in classical sources by Camille Jordan and later streamlined in texts by W. Burnside and Huppert. The absence of nontrivial proper normal subgroups for n ≥ 5 places A_n as a building block in the Jordan–Hölder theorem and in analyses leading to the Classification of Finite Simple Groups by researchers such as Daniel Gorenstein and Robert Griess. For n ≤ 4 the normal subgroup structure is nontrivial, with A_4 containing a normal Klein four subgroup that features in early group-theoretic counterexamples noted by Otto Hölder.

Representations and characters

The complex irreducible representations of A_n are obtained from those of S_n by restriction and by considering extensions or splitting determined by Specht modules and the combinatorics of Young tableaux introduced by Alfred Young. Character theory of A_n was advanced by Frobenius and Issai Schur and plays a role in modern approaches by Graham James and Adriano Garsia. Modular representations over fields of prime characteristic were studied by Richard Brauer, G. de B. Robinson, and later by James Humphreys, with decomposition matrices and blocks tied to James' conjecture-style problems and to contemporary work in the representation theory of symmetric and alternating groups.

Actions and applications in geometry and combinatorics

Alternating groups act naturally on sets, on combinatorial designs, and on polyhedra; A_5 famously acts as the rotation group of the icosahedron, treated by Felix Klein in relation to icosahedral symmetries and to solutions of quintic equations in texts by Évariste Galois and George B. Airy. Actions of A_n underpin constructions in combinatorial design theory by R. C. Bose, are used in block design and Steiner system studies including the Steiner system S(5,8,24) context of Mathieu groups described by Émile Mathieu and John Conway, and appear in enumeration problems considered by Pólya and Harary.

Automorphisms and covering groups

Automorphism groups of A_n are mostly inner for n ≥ 7, with outer automorphisms appearing in special low-degree cases tied to exceptional isomorphisms explored by W. van der Waerden and G. A. Miller; the full automorphism group of A_n is S_n for n ≠ 6, while A_6 admits an exceptional outer automorphism related to constructions studied by H. S. M. Coxeter and John Conway. Double covers and Schur multipliers of alternating groups were computed by Issai Schur and later by R. Steinberg, and covering groups play a role in the theory of spin representations used in work by Curtis T.·J.·S. and G. K. Francis.

Category:Permutation groups