S_n

S_n
Name	S_n
Type	Finite group
Order	n!
Generators	Transpositions
Presentation	⟨ s_i (1≤i≤n−1)
S i^2	1, s_is_j=s_js_i (
>1), s is {i+1}s i	s_{i+1}s_is_{i+1} ⟩

S_n is the symmetric group on n letters, the group of all permutations of an n-element set. It is a central object in algebra and appears across combinatorics, geometry, number theory, and mathematical physics. For each integer n≥1, S_n is finite of order n!, generated by adjacent transpositions with relations that encode braid and Coxeter structures. The family S_n connects to many famous people, institutions, and results including Évariste Galois, Arthur Cayley, Augustin-Louis Cauchy, Frobenius, Noether, Weyl, Young tableau, Schur and institutions like the Royal Society, École Normale Supérieure, Cambridge University, and École Polytechnique.

Definition and notation

S_n is defined as the set of bijections from a fixed n-element set, often {1,…,n}, to itself under composition. Standard notation includes cycle decomposition, e.g., a k-cycle (i_1 i_2 … i_k) and disjoint cycle products; any permutation decomposes into disjoint cycles and transpositions. Common elements and constructions are the identity e, simple transpositions s_i=(i i+1), and the sign homomorphism sgn: S_n→{±1} with kernel the alternating group A_n. Notation and conventions trace through works by Cayley, Galois, Cauchy, and modern texts from Herstein and Lang.

Algebraic structure and properties

As a finite non-abelian group for n≥3, S_n has order n!. It is generated by the set of transpositions, and minimal generating sets include adjacent transpositions s_1,…,s_{n-1} obeying Coxeter relations of type A_{n-1}. The presentation gives reflection group properties aligned with Weyl group theory and the Coxeter group framework studied by Vinberg and Humphreys. The center is trivial for n≥3; S_2 and S_1 are abelian. S_n has elements of various orders determined by cycle types; the order of a permutation equals the least common multiple of its cycle lengths. Famous theorems by Jordan and Burnside concern primitivity and solvability: A_n is simple for n≥5, so S_n has a unique nontrivial normal subgroup A_n for n≥3. The lattice of subgroups, Sylow structure, and solvable cases connect to results by Sylow, Hall (group theorist), and Feit–Thompson.

Representations and characters

Representation theory of S_n over the complex numbers is governed by the classification of irreducible representations by partitions of n via Young diagrams and Young symmetrizers developed by Frobenius and Young. Specht modules give all irreducible complex representations; character values are computed using the Murnaghan–Nakayama rule and Frobenius character formula linking to symmetric functions of Schur polynomials and Hall–Littlewood functions. Branching rules describe restriction from S_n to S_{n-1} via the Littlewood–Richardson rule and the Pieri rule. Connections to algebraic combinatorics involve Macdonald polynomials, Hook length formula, and applications in the representation theory of GL_n(F_q) and Hecke algebras studied by Iwahori and Hecke.

Subgroups and conjugacy classes

Conjugacy classes in S_n correspond to cycle type, hence partitions of n; centralizers are products of wreath products of cyclic groups and symmetric groups. Notable subgroups include Young subgroups isomorphic to products S_{λ1}×S_{λ2}×… for a partition λ, intransitive and imprimitive wreath products, and primitive groups classified by O'Nan–Scott type theorems. Transitive subgroups range from cyclic and dihedral groups to classical groups realized as permutation groups on cosets studied by Cameron and Wielandt. Maximal subgroups include stabilizers of k-sets, point stabilizers isomorphic to S_{n-1}, and imprimitive wreath products associated with block systems; classification uses results by Aschbacher and Magaard.

Applications and examples

S_n appears in enumerative combinatorics, algebraic geometry, number theory, and physics. Counting permutations, derangements, and Eulerian numbers involve S_n actions studied by Euler and Rencontres problems. Monodromy groups of polynomial maps and covering spaces in algebraic geometry give realizations of S_n connected to Riemann–Hurwitz and Hilbert’s irreducibility theorem from Hilbert and Hilbert (David); Galois groups of generic polynomials often equal S_n as in classical results by Hilbert and Cohn. In mathematical physics, permutation symmetry underlies boson/fermion statistics and appears in models studied by Feynman and Dirac. Computational group theory implementations in systems like GAP, Magma, and SageMath enumerate subgroup lattices and character tables.

Generalizations and related groups

Generalizations include alternating groups A_n, wreath products S_k ≀ S_m, and Coxeter/Weyl groups of type A. Infinite symmetric groups such as Sym(ℕ) studied by Hodges and Macpherson and profinite symmetric groups arise in model theory and algebraic topology. Related algebraic objects include Hecke algebras, Iwahori–Hecke algebras, and symmetric groups over finite fields appearing in Deligne–Lusztig theory with links to Kazhdan–Lusztig polynomials. Extensions and analogues connect to braid groups studied by Artin, mapping class groups studied by Thurston, and groups arising in geometric group theory explored by Gromov.

Category:Finite groups