Symmetric group

Symmetric group
original: Fool (talk) derivative: WatchduckYou can name the author as "T. Pi · Public domain · source
Name	Symmetric group
Notation	S_n
Type	Group
Operation	Composition of permutations
Order	n!
Properties	Finite, non-abelian for n≥3, generated by transpositions

Symmetric group is the group of all bijections of a finite set of n elements under composition, fundamental in algebra, combinatorics, and geometry. It connects classical figures and institutions such as Évariste Galois, Niels Henrik Abel, Augustin-Louis Cauchy, Arthur Cayley, and Cambridge University through results used in Galois theory, group theory, representation theory, and combinatorial enumeration. The symmetric group on n letters serves as a universal example in theorems attributed to Cayley, Camille Jordan, and influences work by Emmy Noether, William Rowan Hamilton, and Felix Klein.

Definition and basic properties

The symmetric group S_n is defined as the set of all permutations of an n-element set with composition as the group operation, a construction central to results by Arthur Cayley, Camille Jordan, Évariste Galois, Niels Henrik Abel, and Karl Weierstrass. Basic properties include finite order n!, non-abelian structure for n≥3, generation by adjacent transpositions related to presentations studied by Arthur Cayley and Wilhelm Killing, and embedding behaviors used in proofs by Cayley and elaborated in texts from Cambridge University and École Normale Supérieure authors. Subgroup lattice properties echo investigations by Camille Jordan and later by researchers affiliated with Institute for Advanced Study and University of Göttingen.

Permutation notation and cycle structure

Permutations in S_n admit two-line notation, one-line notation, and cycle notation; cycle structure classification appears in work by Augustin-Louis Cauchy, Camille Jordan, Arthur Cayley, Évariste Galois, and Ferdinand Georg Frobenius. Cycles decompose permutations into disjoint cycles, with transpositions and k-cycles playing key roles in proofs used by Joseph Fourier contemporaries and later by Emmy Noether and William Burnside in counting arguments. Conjugacy relations by cycle type were exploited by F.G. Frobenius, Frobenius Schur theory, and contributors at University of Cambridge.

Subgroups and cosets (including alternating group)

Important subgroups include the alternating group A_n, point stabilizers isomorphic to S_{n-1}, Young subgroups, and wreath product constructions studied by Camille Jordan, Hermann Wielandt, Emmy Noether, Issai Schur, and George Pólya. Coset decompositions underpin orbit-stabilizer arguments appearing in expositions by Arthur Cayley, Évariste Galois, F.G. Frobenius, and later treatments at Princeton University and University of Münster. The alternating group A_n is simple for n≥5, a landmark proven via techniques refined by Camille Jordan, Émile Picard, and modernized in work associated with École Polytechnique researchers.

Representations and character theory

Representation theory of S_n, developed by Ferdinand Georg Frobenius, Issai Schur, Alfred Young, George D. James, and others at University of Cambridge and University of Göttingen, classifies irreducible representations by partitions and Young diagrams. Character tables, Specht modules, and the Frobenius characteristic map connect to symmetric functions explored by Alfred Young, I. Schur, Richard Stanley, I.G. Macdonald, and institutions like Harvard University and Princeton University. Applications span algebraic combinatorics, links to the representation theory of GL_n groups considered by Hermann Weyl, and to enumerative formulas credited to George Pólya and Ramanujan-era researchers.

Conjugacy classes and cycle type

Conjugacy classes in S_n correspond bijectively to integer partitions of n, a viewpoint established by Ferdinand Georg Frobenius, Camille Jordan, and presented in classical texts from École Normale Supérieure and University of Göttingen. Cycle type determines centralizer sizes, class equations, and is essential in counting orbit sizes as used in results by Cauchy, William Burnside, Pólya, and modern combinatorialists associated with MIT and Stanford University.

Actions, combinatorial applications, and Cayley’s theorem

S_n acts naturally on n points, k-subsets, and combinatorial structures; these actions drive theorems by Arthur Cayley, Camille Jordan, George Pólya, W. Burnside, and researchers at École Polytechnique and University of Cambridge. Cayley’s theorem embeds any finite group into a symmetric group, a foundational result linked historically to Arthur Cayley, Évariste Galois correspondences, and developed further in curricula at Harvard University and Princeton University. Combinatorial enumeration, orbit counting, and the Polya enumeration theorem connect S_n to work by George Pólya, Harold Hotelling, and later computational studies at Bell Labs.

Automorphisms and structural results (including simplicity)

Automorphism group of S_n is inner for n≠6, while S_6 admits outer automorphisms tied to exceptional isomorphisms studied by Camille Jordan, Émile Mathieu, Évariste Galois, and later by researchers at École Normale Supérieure and University of Cambridge. Simplicity of A_n for n≥5 is a central structural result proved by Camille Jordan with refinements by Émile Picard and modern expositions from Princeton University and Institute for Advanced Study. Further structural theorems involve generation by transpositions, presentation via Coxeter relations linked to H.S.M. Coxeter, and connections to exceptional groups investigated by Élie Cartan and researchers at École Normale Supérieure.

Category:Group theory