A_n

A_n
Name	A_n
Type	Group series
Notation	A_n

A_n

A_n denotes the alternating group on n letters, the subgroup of the symmetric group consisting of even permutations. It is a finite simple group for n ≥ 5 and plays a central role across algebra, combinatorics, geometry, and mathematical physics. A_n connects to many classical figures and institutions in group theory, representation theory, and topology.

Definition and notation

The alternating group on n letters is the index-2 subgroup of the symmetric group on n letters generated by all 3-cycles, realized as the even permutations within Symmetric group S_n. For n ≥ 2 one writes the order as n!/2. Standard notation uses cycle structure and parity concepts introduced by Augustin-Louis Cauchy, Évariste Galois, and refined in the work of Camille Jordan. The subgroup structure often references Sylow theorems, Cauchy's theorem, and techniques developed by William Burnside and Marshall Hall Jr..

Algebraic properties

For n ≥ 5 the group is non-abelian and simple, a landmark result in the classification of finite simple groups related to work by Émile Mathieu and consolidated by William Burnside and later by the CFSG project involving Daniel Gorenstein, John G. Thompson, and Richard Parker. The center is trivial for n ≥ 3; conjugacy classes correspond to cycle type within S_n except that cycle types splitting into two classes in the symmetric group can remain separate in A_n, a phenomenon analyzed by Frobenius. Automorphism groups are inner for n ≠ 6, while A_6 admits outer automorphisms connected to work by Émile Mathieu and W. Burnside. Maximal subgroups include intransitive, imprimitive, and primitive families classified via results of Jordan, Wielandt, and modern contributions by Aschbacher and Peter Kleidman.

Representations and character theory

Irreducible representations of A_n over C are obtained by restricting those of S_n and resolving cases where S_n representations split on restriction; this was developed through the combinatorial framework of Frobenius character theory, Young tableau, and the Schur–Weyl duality linking to Hermann Weyl and Issai Schur. Character tables for small n were computed by Frobenius and extended by later tables in atlases such as the one by Conway and Atlas of Finite Groups. Modular representation theory for A_n over fields of positive characteristic connects to work by Richard Brauer and to modern research by James, Kleshchev, and G. James on decomposition numbers, Specht modules, and branching rules. Connections to symmetric functions, via Macdonald polynomials and the Hall–Littlewood polynomials, provide algebraic combinatorics tools for character computations attributed to I. G. Macdonald.

Geometry and combinatorics

A_n acts naturally on n points and on combinatorial structures such as k-subsets, block designs, and Steiner systems studied by Katherine Johnson-era combinatorialists and by Richard Dedekind’s successors. Geometric realizations include actions on simplicial complexes, configuration spaces studied by Arnold and Bott, and on projective systems related to Galois geometries and constructions of the Leech lattice via sporadic group connections investigated by John Conway. The action on pairs and triples links to incidence geometries and to classical objects like the Fano plane when n relates to small parameters, while permutation group properties inform graph symmetry studied by Cayley, Harary, and Godsil.

Applications and examples

Alternating groups appear in Galois theory as Galois groups of irreducible polynomials, a theme central to Évariste Galois and later explicit constructions by Hilbert in his irreducibility results and by Shafarevich in inverse Galois theory. In algebraic topology, A_n-symmetries occur in mapping class group actions and configuration space monodromy explored by Arnold and Fadell. In mathematical physics and chemistry, A_n-type permutation symmetry constrains selection rules in molecular spectroscopy and particle statistics discussed by Eugene Wigner and Lev Landau. Concrete examples include A_5 realized as icosahedral rotation symmetry linked to Leonhard Euler’s polyhedral studies and to icosahedral groups in the work of Klein and Felix Klein; A_4 models tetrahedral symmetry used in crystallography catalogues by IUCr.

Historical development and significance

The concept traces from permutation studies by Lagrange and structural advances by Cauchy and Galois, with systematic classification and use by Camille Jordan in the 19th century. The simplicity theorem for A_n (n ≥ 5) was recognized in the 19th century and applied in early 20th-century algebra by Burnside and Frobenius, influencing the development of modern group theory and representation theory including contributions collected in resources such as the Atlas of Finite Groups by Conway and colleagues. Alternating groups serve as primary examples and building blocks in the CFSG, influencing research by Gorenstein, Thompson, Aschbacher, and modern computational group theory efforts housed at institutions like University of Warwick and University of Leeds.

Category:Finite groups