# Group theory Group theory is the branch of [[Abstract_algebra|abstract algebra]] that studies groups — sets closed under one associative operation, with an identity element and an inverse for every member. Those four spare axioms turn out to be the grammar of symmetry: any collection of transformations that preserves some structure, from the rotations of a cube to the gauge transformations of particle [[Physics|physics]], composes into a group. The subject therefore runs through nearly all of [[Mathematics|mathematics]] — [[Geometry|geometry]], [[Topology|topology]], [[Combinatorics|combinatorics]], [[Algebraic_geometry|algebraic geometry]] — and supplies working machinery to [[Quantum_mechanics|quantum mechanics]], [[Chemistry|chemistry]], [[Crystal_structure|crystallography]], and [[Cryptography|cryptography]]. Where [[Systems_thinking|systems thinking]] asks what stays invariant while a system changes state, group theory is the exact calculus of those invariances. ## Four axioms, one idea: composition A group (G, ∘) satisfies closure, associativity, existence of an identity e, and existence of inverses. Nothing requires commutativity: the integers under addition commute, but the 8-element symmetry group of a square does not — rotate-then-reflect differs from reflect-then-rotate. Invertible n×n matrices under multiplication form the general linear group GL(n), the gateway from [[Linear_algebra|linear algebra]] into representation theory. Permutations of n objects form the symmetric group Sₙ with n! elements, and Cayley's theorem (1854) says every finite group sits inside some Sₙ — abstract symmetry is always realizable as shuffling. In the language of [[Category_theory|category theory]], a group is a one-object category whose every arrow is invertible; in the language of [[Set_theory|set theory]], it is the minimal structure making "undo" a total operation. Subgroups, homomorphisms, and quotients let large symmetry [[Structure|structures]] be factored into smaller ones. ## From unsolvable quintics to abstract structure The subject began as a tool for a concrete failure. Lagrange (1770–71) studied how rational functions of a polynomial's roots behave under permutation; Abel proved (1824) that the general quintic admits no solution in radicals; and Évariste Galois, in work written before his death in 1832, attached to each equation a permutation group whose internal architecture — today, its solvability — decides whether radical formulas exist. Cayley abstracted the axioms in 1854, cutting groups loose from equations. Felix Klein's Erlangen program (1872) then inverted the relationship between algebra and [[Geometry|geometry]]: a geometry *is* the study of properties invariant under a chosen group, so Euclidean, [[Affine_geometry|affine]], and [[Projective_geometry|projective]] geometry differ only in how much symmetry they admit. [[Henri_Poincaré|Poincaré]] pushed the idea into [[Topology|topology]] with the fundamental group, which counts the inequivalent loops in a space and helps distinguish a sphere from a [[Torus|torus]]. ## Actions, orbits, and counting Groups earn their keep by *acting* on things. An action partitions the target set into orbits, and the orbit–stabilizer theorem converts geometric questions into arithmetic: |orbit| × |stabilizer| = |G|. Lagrange's theorem — a subgroup's order divides the group's order — is the oldest such constraint, and it alone forces every group of prime order to be cyclic. Burnside-style orbit counting answers practical [[Combinatorics|combinatorial]] questions such as how many chemically distinct necklaces or substituted molecules exist once rotations are identified. In [[Graph_theory|graph theory]], the automorphism group of a graph — relabelings that fix the [[Adjacency_matrix|adjacency matrix]] — measures its internal symmetry, and exploiting it is central to practical graph-isomorphism [[Algorithm|algorithms]] and to spotting structurally equivalent nodes in [[Network_science|network science]] and [[Social_network_analysis|social network analysis]]. ## Continuous symmetry: Lie groups and physics Sophus Lie (1870s) extended the theory to continuous families: a [[Lie_group|Lie group]] is simultaneously a group and a smooth [[Manifold|manifold]], like the rotation group SO(3). Emmy Noether's theorem (1918) made continuous symmetry the deepest bookkeeping device in physics: every one-parameter symmetry of the action yields a conserved quantity — time-translation invariance gives energy conservation, spatial rotation gives angular momentum — a statement most cleanly seen in [[Hamiltonian_mechanics|Hamiltonian mechanics]] and inherited by [[General_relativity|general relativity]]. In quantum theory, states transform under group representations: [[Atomic_orbital|atomic orbitals]] are labeled s, p, d, f by representations of SO(3), selection rules for spectra follow from which products of representations contain the identity, and [[Spin_(physics)|spin-½]] arises because SU(2) double-covers SO(3). Exchange symmetry splits all particles into [[Boson|bosons]] and [[Fermion|fermions]], while the Standard Model's interactions are fixed by the gauge group SU(3)×SU(2)×U(1). Symmetry arguments routinely solve what the [[Schrödinger_equation|Schrödinger equation]] cannot be solved for directly, and [[Molecular_orbital|molecular orbital]] diagrams in chemistry lean on point-group tables the same way. ## Crystals, codes, and a 4.3×10¹⁹-state puzzle Discrete groups classify ornament and matter. Lattice translations restrict rotations to 2-, 3-, 4-, and 6-fold, giving exactly 17 wallpaper groups for plane [[Tessellation|tessellations]] (compare the 6-fold symmetry of a [[Hexagonal_tiling|hexagonal tiling]]) and 230 space groups for three-dimensional [[Crystal_structure|crystal structures]] (Fedorov and Schoenflies, 1891), organized into families such as the [[Cubic_crystal_system|cubic system]]. [[Quasicrystal|Quasicrystals]] with "forbidden" 5-fold diffraction symmetry, related to [[Penrose_tiling|Penrose tilings]], showed in 1982 that nature also uses order outside the 230. Applied group theory secures and corrects digital systems: [[Cryptography|cryptographic]] schemes rest on the hardness of discrete logarithms in cyclic and elliptic-curve groups, and the algebra of [[Error_detection_and_correction|error-correcting codes]] is written in group-theoretic terms — the Golay code's symmetries form the sporadic Mathieu group M₂₄. Even the Rubik's Cube group, with about 4.33×10¹⁹ elements, yields to the theory: every position is solvable in at most 20 face turns. ## The classification of finite simple groups Simple groups — those with no nontrivial normal subgroups — are the primes of the subject: every finite group is assembled from them. Their complete classification is among the largest verified results in [[Science|science]]: roughly 10,000 journal pages by about 100 authors, essentially complete by 1983, with the final quasithin gap closed in 2004. The answer: several infinite families (cyclic groups of prime order, alternating groups, groups of Lie type) plus exactly 26 sporadic exceptions. The largest sporadic group, the Monster, has order ≈ 8.08×10⁵³, and its unexpected link to modular functions ("monstrous moonshine," proved by Borcherds in 1992) connects finite symmetry to [[Complex_analysis|complex analysis]] and string theory — a reminder that classifying the atoms of symmetry keeps paying dividends far from where the ledger was opened. **On the spine:** [[Abstract_algebra]] · [[Lie_group]] · [[Quantum_mechanics]] · [[Crystal_structure]] · [[Graph_theory]]. ## Wikipedia : Wikitube **Strict pair:** [Wikipedia](https://en.wikipedia.org/wiki/Group_theory) : [Wikitube](https://en.wikitube.io/wiki/Group_theory) ## Previous hub tags Hubs: `Systems`. Portals: [[PORTAL_Graph_theory]], [[PORTAL_Information_theory]], [[PORTAL_Control_theory]], [[PORTAL_Operations_research]], [[PORTAL_Game_theory]]. --- *Repopulated 2026-08-12 · redlink fill · 0 deletions.*