The symmetric group Sₙ consists of all possible ways of rearranging (permuting) n distinct objects, with composition of rearrangements as the group operation. Every finite group can be found as a subgroup of some symmetric group (Cayley's theorem), making Sₙ a kind of universal building block for all of finite group theory — and its structure for n≥5 is exactly why no algebraic formula exists for solving general degree-5 polynomial equations.
Take three numbered cards: 1, 2, 3. How many different orders can you arrange them in? 1-2-3, 1-3-2, 2-1-3, 2-3-1, 3-1-2, 3-2-1 — exactly 6 arrangements. The symmetric group S₃ is the mathematical structure formed by these 6 rearrangements, together with the rule for combining two rearrangements in sequence (do one shuffle, then another).
The symmetric group isn't just one example of a group among many — it's foundational. Cayley's theorem proves that every possible finite group, no matter how it's originally defined or where it comes from, can always be found lurking inside some symmetric group Sₙ, as a specific subset of its rearrangements. In this precise sense, symmetric groups are "universal": studying them thoroughly enough would, in principle, reveal every possible finite group's underlying structure.
The symmetric group S₅ (all 120 rearrangements of 5 objects) is at the very heart of one of the most celebrated results in the history of algebra: Galois's proof (see the Galois Theory entry) that there is no general algebraic formula — like the quadratic formula, but for degree-5 equations — for solving a generic degree-5 polynomial. The specific internal structure of S₅ makes this fundamentally, provably impossible.
A convenient and standard way to write a specific permutation is cycle notation. The permutation sending 1→2, 2→3, 3→1 (leaving other elements fixed) is written (1 2 3) — a "3-cycle." Any permutation can be written as a product of disjoint cycles, and this decomposition is essentially unique (up to the order the cycles are written in).
A transposition is a 2-cycle — swapping exactly two elements and leaving everything else fixed, like (1 2). Remarkably, every permutation in Sₙ can be written as a product of transpositions — meaning transpositions alone are enough to generate the entire symmetric group.
Although a given permutation can be written as a product of transpositions in more than one way, the parity (even or odd number of transpositions used) is always the same, regardless of which specific decomposition you choose. This lets every permutation be classified as strictly even or odd — a well-defined and consistent property, not an artifact of a particular choice of decomposition.
The set of all even permutations in Sₙ forms a subgroup called the alternating group Aₙ, with exactly half of Sₙ's total elements (n!/2). Aₙ is a normal subgroup of Sₙ, and for n≥5, Aₙ is simple — it has no proper non-trivial normal subgroups of its own, a crucial and highly consequential structural fact.
Every group G of order n is isomorphic to a subgroup of Sₙ (via the specific map sending each element g∈G to the permutation it induces by left-multiplication on G's own elements). This landmark theorem, due to Arthur Cayley (1854), shows that symmetric groups are genuinely universal — abstract group theory can always be equivalently studied, at least in principle, as concrete permutation groups.
A group is solvable if it has a chain of subgroups, each normal in the next, with all successive quotient groups abelian. For n≤4, Sₙ is solvable — which is exactly why the quadratic, cubic, and quartic formulas exist. But since A₅ (and hence S₅) is simple and non-abelian for n≥5, Sₙ fails to be solvable for n≥5. By Galois's theorem (linking solvability of the Galois group to solvability of a polynomial equation by radicals — see the Galois Theory entry), this proves rigorously that no general algebraic formula, built from the coefficients using only arithmetic operations and roots, can exist for solving a generic degree-5 (or higher) polynomial equation. This is the Abel-Ruffini theorem, first proven by Ruffini (1799, with a gap) and completed rigorously by Abel (1824), with Galois later providing the full conceptual explanation of exactly why.
The proof that Aₙ is simple for n≥5 (meaning it has no proper non-trivial normal subgroups) relies on showing that Aₙ is generated by 3-cycles, and that any non-trivial normal subgroup of Aₙ must contain all 3-cycles, and therefore must be the whole group. This is a genuinely delicate combinatorial argument, and the fact that it specifically fails for n≤4 (where A₄ does have a proper normal subgroup) is precisely why the boundary between "solvable by radicals" and "not solvable by radicals" falls exactly at degree 5.
The representation theory of symmetric groups — studying how Sₙ can act on vector spaces via matrices — is an exceptionally rich and well-developed area of algebra, intimately connected to combinatorics via objects called Young tableaux (introduced by Alfred Young, 1900). The irreducible representations of Sₙ are in exact bijective correspondence with the partitions of n, linking abstract group representation theory directly to elementary combinatorial counting (see the Combinatorics entry) in a remarkably clean and well-understood way.
Symmetric groups describe the fundamental symmetry of identical particles in quantum mechanics — the Pauli exclusion principle for fermions is directly connected to how quantum wavefunctions transform under the action of the symmetric group when identical particles are exchanged. This makes Sₙ not merely an abstract algebraic curiosity, but a structure with direct, essential physical consequences for the fundamental behaviour of matter.