| symmetric group | |
|---|---|
| Name | Symmetric group |
| Caption | Permutation of four objects |
| Type | Finite group |
| Notation | S_n |
| Order | n! |
| Related | alternating group, Young tableau, Specht module |
symmetric group
The symmetric group is the group of all permutations of a finite set, typically denoted S_n for a set of n elements. It is a fundamental object in group theory and representation theory with central applications in Quantum Physics, where permutation symmetry underlies particle indistinguishability, selection rules, and the structure of multi-particle Hilbert spaces. The combinatorial and algebraic structure of S_n connects to methods used across atomic physics, molecular physics, and condensed matter physics.
The symmetric group S_n is defined as the group of all bijections from an n-element set to itself, with composition as the group operation. Its order is n!, and it is generated by adjacent transpositions (simple reflections) satisfying the Coxeter relations of type A_{n-1}. Important subgroups include the alternating group A_n (the even permutations) and Young subgroups isomorphic to direct products of smaller symmetric groups. Cycle notation and disjoint cycle decomposition provide canonical descriptions of elements; conjugacy classes in S_n correspond to cycle-type partitions of n. The presentation via generators s_i with relations s_i^2 = e, s_i s_j = s_j s_i for |i-j|>1, and s_i s_{i+1} s_i = s_{i+1} s_i s_{i+1} links S_n to Coxeter group theory and Bruhat order, both useful in quantum symmetry analyses.
Representation theory of S_n is classified by partitions of n and realized concretely by Specht module constructions and Young tableau combinatorics. Irreducible representations correspond to Young diagram shapes; dimension formulas use the hook-length formula. The Schur–Weyl duality relates representations of S_n to representations of the general linear group GL(V) on tensor powers V^{\otimes n}, central to decomposing multi-particle state spaces in quantum systems. Characters of S_n, Frobenius characteristic maps, and the Schur function formalism provide tools for counting symmetry-adapted states. Key historical contributors include Ferdinand Frobenius and Issai Schur, and modern applications tie to algebraic combinatorics and computational implementations such as the GAP system.
Permutation symmetry encoded by S_n determines quantum statistics: symmetric representations correspond to bosonic states, antisymmetric to fermionic states, and mixed symmetry types to parastatistics. The Pauli exclusion principle arises from antisymmetry under the action of transpositions for identical fermions, while Bose–Einstein condensation relates to symmetric occupation of modes. In low-dimensional systems, the braid group replaces S_n leading to anyons; nonetheless, S_n remains the relevant discrete symmetry for identical particles in three-dimensional nonrelativistic quantum mechanics. The spin–statistics connection, formalized in quantum field theory by results due to Wolfgang Pauli and others, links permutation symmetry with relativistic causality and locality properties.
In many-body quantum systems, S_n symmetry organizes the Hilbert space of n indistinguishable particles and simplifies the computation of spectra and correlation functions. Techniques such as symmetrization projectors, Young operator methods, and second quantization exploit S_n to enumerate allowed states in models like the Heisenberg model, Hubbard model, and quantum harmonic oscillator ensembles. In nuclear physics and quantum chemistry, group-theoretic coupling rules (Clebsch–Gordan coefficients generalized by S_n combinatorics) help construct antisymmetric Slater determinants and symmetry-adapted basis sets. S_n symmetry also appears in permutation-invariant Hamiltonians, quantum entanglement studies where symmetric subspaces feature permutationally invariant entanglement measures, and in tensor-network ansätze leveraging symmetry to reduce computational complexity.
In quantum chemistry and molecular spectroscopy, permutation of identical nuclei or electrons is encoded by S_n or its subgroups and dictates selection rules for transitions and the symmetry classification of vibrational and electronic states. Exchange symmetry governs the construction of antisymmetrized electronic wavefunctions (Slater determinants) used in methods like Hartree–Fock theory and configuration interaction. Molecular point groups combine spatial symmetry with permutation symmetry when identical atoms lie on symmetric sites; applications include interpretation of infrared spectroscopy and Raman spectroscopy lines, and in computational packages such as Gaussian where symmetry-adapted basis reduction is automated.
Practical use of S_n in quantum problems relies on algorithms for computing characters, branching rules, and projection operators. Computational algebra systems like GAP and SageMath implement group and representation algorithms; specialized libraries compute Young tableau bases and Clebsch–Gordan coefficients for symmetric group reductions. Algorithms for fermionic antisymmetrization, permanent and determinant evaluations, and tensor symmetrization appear in quantum chemistry and quantum information software such as PySCF and OpenFermion. Complexity considerations link to computational complexity theory: calculating permanents is #P-hard, affecting boson sampling models like those proposed by Scott Aaronson and Alex Arkhipov where S_n-permutation amplitudes determine sampling probabilities. Numerical diagonalization techniques exploit block-diagonalization by S_n irreducible sectors to reduce matrix sizes in exact diagonalization and quantum Monte Carlo simulations.
Category:Group theory Category:Quantum mechanics Category:Representation theory