Symmetric group S_n

Symmetric group S_n
Name	Symmetric group S_n
Notation	S_n
Order	n!
Type	Finite group
Properties	Nonabelian for n≥3, generated by transpositions

Symmetric group S_n

The symmetric group S_n is the group of all bijections of an n-element set under composition, central to the work of Évariste Galois, Niels Henrik Abel, Augustin-Louis Cauchy, and Arthur Cayley. Its elements, called permutations, appear throughout the studies of Camille Jordan, Felix Klein, Hermann Weyl, Emmy Noether, and William Burnside and underpin developments in Alfred Young's combinatorics, Richard Brauer's representation theory, and applications considered by Paul Erdős, G. H. Hardy, and Srinivasa Ramanujan.

Definition and basic properties

S_n consists of all permutations of {1,...,n} with composition as operation; this definition links to classical results by Cauchy and the permutation enumeration in work by Leonhard Euler and Thomas Harriot. It has order n! and for n≥3 is nonabelian, with center trivial for n≥3 as in the analyses of Sophus Lie and Émile Picard. S_n contains the alternating group as an index‑2 normal subgroup; this relationship was exploited by Galois in his criterion connecting polynomial solvability to group structure and by Camille Jordan in his monumental treatise. Important subgroups and homomorphisms appear in the studies of Ferdinand Frobenius, Issai Schur, and Otto Hölder.

Cycle structure and conjugacy classes

Elements of S_n decompose uniquely into disjoint cycles, a perspective developed by Cauchy and formalized by Arthur Cayley; cycle type corresponds to integer partitions studied by Srinivasa Ramanujan, George Pólya, and Percy MacMahon. Conjugacy classes are determined by cycle type, a fact used by Frobenius and Burnside to compute class functions and to enumerate structures in combinatorics treated by Harold Davenport and Paul Erdős. Cycle notation links to problems considered by Ada Lovelace in early algorithmic thinking and to counting formulae of James Joseph Sylvester and J. J. Sylvester.

Generators, relations, and presentation

S_n is generated by adjacent transpositions (i i+1); presentations such as the Coxeter presentation connect S_n to the Coxeter group framework developed by H. S. M. Coxeter and to braid groups studied by Emil Artin and Artin, with relations treated by William Rowan Hamilton and J. H. Conway. The standard presentation ⟨s_i | s_i^2=1, s_i s_j = s_j s_i (|i−j|>1), s_i s_{i+1} s_i = s_{i+1} s_i s_{i+1}⟩ appears in works by James E. Humphreys, Jean-Pierre Serre, and Nicholas Bourbaki and underlies connections to Hecke algebras studied by G. Lusztig and I. G. Macdonald.

Representation theory and character table

Representation theory of S_n was initiated by Frobenius and developed by Issai Schur, Alfred Young, Weyl, and Richard Brauer; irreducible representations correspond to partitions via Young diagrams and Specht modules introduced by William Specht and furthered by G. de B. Robinson and James A. Green. The character table, computed using the Murnaghan–Nakayama rule and Frobenius character formula, plays a role in the work of William Fulton, Joe Harris, I. G. Macdonald, and Paul Halmos. Connections to symmetric functions, Schur functions, and the representation theory of GL_n are central in the writings of Cauchy, Alexandre Grothendieck, and Jean-Louis Loday.

Actions, permutation representations, and wreath products

S_n acts naturally on n points and on combinatorial structures studied by George Pólya and Frank Harary; permutation representations induce permutation modules considered by Frobenius and Burnside. Imprimitive actions lead to wreath products S_k ≀ S_m appearing in applications treated by Claude Shannon and John Conway; wreath products and induced representations are analyzed by George Mackey, Serre, and Bertram Kostant. These actions connect to algebraic geometry via symmetric products used by André Weil, Grothendieck, and Oscar Zariski.

Subgroups: alternating group, Young subgroups, and Sylow subgroups

The alternating group A_n is a simple normal subgroup for n≥5, a theorem proved by Évariste Galois and strengthened by Camille Jordan and William Burnside; A_n features in classification considerations of Bertrand Russell's contemporaries and later in the CFSG program involving Michael Aschbacher, Daniel Gorenstein, and Robert Griess. Young subgroups, built from block stabilizers, are used in combinatorial representation theory by Alfred Young and Richard Stanley, while Sylow p-subgroups and their normalizers are studied using techniques of Ludwig Sylow and Claude Chevalley and appear in applications by G. A. Miller and H. F. Blichfeldt.

Applications and connections in combinatorics and algebraic topology

S_n permeates enumerative combinatorics in results by George Pólya, Richard Stanley, Miklós Bóna, and Donald Knuth; it underlies the theory of Young tableaux used by G. de B. Robinson, Donald Knuth, and André Joyal. In algebraic topology, symmetric groups act on configuration spaces studied by René Thom, Raoul Bott, Edwin Spanier, and M. F. Atiyah; Steenrod operations and homology of symmetric products were developed by Norman Steenrod and I. M. James. Applications extend to statistical mechanics in models examined by Ludwig Boltzmann, Josiah Willard Gibbs, and Rudolf Peierls, and to theoretical computer science in permutation group algorithms advanced by László Babai, Sergey Brin, and John McCarthy.

Category:Finite groups