Alternating group

Alternating group
Original: Jakob.scholbach Vector: Pbroks13 · CC BY-SA 3.0 · source
Name	Alternating group
Type	Finite simple group (for n ≥ 5)
Order	n!/2
Notable	Even permutations

Alternating group

The alternating group is the subgroup of even permutations of the symmetric group on n letters, with order n!/2, historically central in the development of modern algebra and group theory. It connects to many figures and institutions such as Évariste Galois, Niels Henrik Abel, Augustin-Louis Cauchy, Arthur Cayley, Camille Jordan, and Emmy Noether and to centers of research like Université Paris-Sud, University of Göttingen, École Normale Supérieure, and University of Cambridge. Its study influenced milestones including the Galois theory revolution, the Classification of finite simple groups, and the work of William Burnside, Issai Schur, Félix Klein, and Élie Cartan.

Definition and basic properties

For a finite set of n symbols, the alternating group consists of all even permutations inside the symmetric group studied by Joseph-Louis Lagrange and later formalized by Camille Jordan; it is an index-two subgroup of the symmetric group whose order equals n!/2, linking to factorial computations traced to Blaise Pascal and Srinivasa Ramanujan in combinatorial contexts. As a normal subgroup of the symmetric group, it is central to results of Augustus De Morgan and Arthur Cayley on permutation representations and appears in early tables compiled by John Sylvester and George Boole. For small n the groups correspond to classical objects: A1 and A2 are trivial or cyclic, A3 is cyclic of order 3 related to Carl Friedrich Gauss's work on cyclotomic fields, A4 contains a Klein four subgroup studied by Felix Klein, and A5 is the smallest non-abelian simple group linked to the icosahedral symmetry explored by Leonhard Euler and William Rowan Hamilton.

Historical background and development

Interest in alternating groups emerged from questions about solvability of polynomial equations pursued by Évariste Galois, whose manuscripts connected permutation groups to roots of polynomials and inspired later exposition by Joseph-Louis Lagrange and Niels Henrik Abel. In the nineteenth century, Augustin-Louis Cauchy and Camille Jordan developed permutation group theory, while Arthur Cayley introduced abstract group notation that clarified alternating subgroups; this lineage continued through Isaac Newton-era combinatorics to nineteenth-century algebraists. Twentieth-century advances by Emmy Noether, William Burnside, and Issai Schur placed alternating groups within representation theory and module theory, influencing institutions like Institute for Advanced Study and projects culminating in the Classification of finite simple groups with contributions from figures connected to John G. Thompson and Walter Feit.

Structure and classification

Alternating groups are characterized by cycle structure inherited from permutations, with conjugacy classes determined by cycle types as in the work of Camille Jordan and Arthur Cayley. For n ≥ 5, alternating groups are non-abelian simple groups, forming an infinite family among the families cataloged during the Classification of finite simple groups that also includes groups of Lie type such as Chevalley groups and sporadic groups like the Monster group. Subgroup structure features point stabilizers isomorphic to A_{n-1}, intransitive and imprimitive subgroups studied by G. A. Miller and Harold Davenport, and exceptional embeddings like the isomorphism between A5 and the icosahedral rotation group analyzed by Felix Klein and Henri Poincaré. Outer automorphisms occur sporadically in related symmetric groups, with classic results by W. Burnside and Franz Neukirch on automorphism groups.

Representations and characters

Representation theory of alternating groups was advanced by Issai Schur, Ferdinand Frobenius, and Richard Brauer using character theory associated to conjugacy classes classified by cycle type. Ordinary irreducible characters can be constructed via restriction from symmetric group representations classified by Young diagrams developed by Alfred Young and furthered by William Henry Young and S. Ramanujan-connected combinatorial work; modular representation theory was shaped by Richard Brauer and Alperin at institutions like University of Chicago and University of Oxford. The character tables for A_n for moderate n are tabulated in atlases used by researchers at Max Planck Institute and in computations aided by software originating in projects at Massachusetts Institute of Technology and University of Warwick.

Applications and occurrences in mathematics

Alternating groups appear across algebra, geometry, and number theory: A5 appears in classical geometry through the icosahedron studied by Leonardo da Vinci-era artists and by Felix Klein in his lectures; connections to Galois groups arise in inverse Galois problems pursued by Hilbert and Shafarevich; occurrences in combinatorics relate to work by Paul Erdős and George Pólya; and applications in topology tie to mapping class group studies by William Thurston and Max Dehn. They feature in algebraic geometry contexts addressed by Alexander Grothendieck and in arithmetic progression problems explored by G. H. Hardy and John Littlewood. Alternating groups are used as building blocks in constructing permutation representations for cryptographic protocols studied at Bell Laboratories and in coding theory linked to Claude Shannon's information theory legacy.

Proofs of simplicity for n ≥ 5

Multiple classical proofs show that A_n is simple for n ≥ 5, drawing on ideas of transpositions and cycle structures used by Camille Jordan and refinements by William Burnside and Issai Schur. One approach uses 3-cycles to generate A_n and analyzes normal subgroups by conjugacy arguments nominally present in textbooks influenced by Emmy Noether; another uses action on k-subsets and primitive group results related to work by Émile Picard and later refinements by Wielandt and Frobenius in character-theoretic proofs. The simplicity result underpins applications in the Classification of finite simple groups and was instrumental in Hilbert's and Galois's programs on solvability.

Category:Finite groups