Groups — Axioms, Examples, and Basic Theorems

A group is a set $G$ equipped with a single associative binary operation that has an identity element and in which every element has an inverse. Groups formalize the abstract notion of symmetry and invertible transformation. They appear throughout mathematics (number theory, geometry, topology) and physics (conservation laws, quantum mechanics). The modern axiomatic definition crystallized in the late 19th and early 20th centuries from work of Galois, Cayley, and Weber.

A group is the most fundamental algebraic structure built from a single operation. Formally, it is a pair $(G,\cdot )$ where $G$ is a nonempty set and $\cdot :G\times G\to G$ satisfies closure, associativity, existence of an identity, and existence of inverses. Groups matter because they encode reversible processes and symmetries: every symmetry of any object forms a group, and conversely Cayley's theorem shows every group is a group of symmetries (permutations). A surprising fact: from these four spare axioms one can prove that the identity is unique, inverses are unique, and the "cancellation laws" hold — yet groups can be wildly varied, from the integers under addition to the rotations of a sphere to the 808-billion-element Monster's tiny cousins.

The Core Insight

A group abstracts the single property all systems of invertible operations share: you can undo any operation, and the order in which you compose operations may matter but never the grouping. Strip away everything except associativity, identity, and inverses, and what remains still has astonishing rigidity — almost everything else (uniqueness, cancellation, solving equations) follows automatically.

Formal Statement

Group

A group is an ordered pair $(G,\cdot )$ consisting of a set $G$ and a binary operation $\cdot :G\times G\to G$, written $(a,b)\mapsto a\cdot b$ (often abbreviated $ab$), satisfying the following axioms:

Here $G$ is the underlying set, $\cdot$ the group operation, $e$ (also written $1$ or $0$) the identity element, $a^{-1}$ the inverse of $a$, and $|G|$ the order of the group. If additionally

Subgroup

A subset $H\subseteq G$ is a subgroup, written $H\le G$, if $H$ is itself a group under the restriction of $\cdot$. Equivalently (the subgroup criterion), $H\le G$ iff $H\ne \varnothing$ and

Elementary Consequences of the Axioms

Let $(G,\cdot )$ be a group. Then:

1. The identity $e$ is unique.
2. Each $a\in G$ has a unique inverse $a^{-1}$.
3. Cancellation: $ab=ac⟹b=c$ and $ba=ca⟹b=c$.
4. Socks–shoes: $(ab{)}^{-1}=b^{-1}{a}^{-1}$, and $(a^{-1}{)}^{-1}=a$.
5. For all $a,b\in G$ the equations $ax=b$ and $ya=b$ have unique solutions $x=a^{-1}b$, $y=b{a}^{-1}$.

Why It Holds / Derivation

We prove each elementary consequence using only (G0)–(G3).

Axioms (G2) and (G3) are stated with two-sided identity and inverse. One can weaken them to a left identity and left inverses and still recover a group — but mixing a left identity with right inverses (or vice versa) does not in general give a group. The careful undergraduate proves the equivalence rather than assuming it.

Évariste Galois | 1811–1832

Though the abstract axioms came later, Galois (who died in a duel at twenty) was the first to wield groups as a tool, attaching to each polynomial equation a finite group of permutations of its roots — the Galois group — and showing that the solvability of the equation by radicals is governed entirely by the structure of this group. His insight that a structure, not a formula, holds the key to a classical problem inaugurated abstract algebra. The word "group" (groupe) is his.

Building Intuition

Think of a group as the collection of all the ways you can reversibly transform something while staying inside the same world. Pick up a square: the symmetries that map it onto itself (rotations by $0°,90°,180°,270°$ and four reflections) form a group of order 8. Composition is "do one, then the other"; the identity is "do nothing"; the inverse undoes a move. Associativity is automatic because composing functions is associative. The single most important mental model is: group element = invertible action, group operation = composition of actions. Cayley's theorem makes this exact — every group is, up to relabeling, a group of permutations.

The dihedral group $D_4$: symmetries of the square. Rotations (gold) and reflection axes (gray) generate a group of order 8.

Worked Examples

Common Misconceptions

• Closure is part of the definition. "$\cdot$ is a binary operation on $G$" already means $a\cdot b\in G$; listing (G0) separately is a teaching emphasis, not a fifth law to forget.
• Groups need not be commutative. $ab=ba$ is false in general (see $G{L}_2$). Beginners routinely "cancel" or reorder illegally.
• The identity belongs to every subgroup. A subgroup must contain $e$ and be closed under inverses; the empty set is not a subgroup.
• One operation only. A group has a single operation. Rings and fields have two; conflating them is a common error.

Connections

Groups sit at the root of algebra and branch outward. Quotienting a group by a Normal Subgroups and Quotient Groups yields new groups; structure-preserving maps are studied in Group Homomorphisms and Isomorphism Theorems; the action of a group on a set, formalized in Group Actions and the Orbit-Stabilizer Theorem, makes precise the slogan "groups are symmetries." Finite groups decompose via Lagrange's Theorem and Cosets and the Sylow Theorems. Adding a second operation produces Rings and Fields, and equipping a group with a compatible topology or smooth structure leads to Lie Groups. The classification of finite simple groups is the deepest descendant of the basic axioms here.

Real-World Applications

1. Cryptography (RSA, Diffie–Hellman). Security rests on the group $(\mathbb{Z}/n\mathbb{Z}{)}^{\times }$ of units and the difficulty of the discrete-logarithm problem in cyclic groups; elliptic-curve cryptography uses the group law on points of an elliptic curve.
2. Crystallography. The 230 space groups and 32 point groups classify all possible crystal symmetries, governing diffraction patterns used in X-ray analysis (Bragg, Bravais).
3. Particle physics — the Standard Model. The gauge group $SU(3)\times SU(2)\times U(1)$ organizes the strong, weak, and electromagnetic interactions; conserved charges arise from group symmetries via Noether's theorem.
4. Error-correcting codes. Linear codes (Hamming, Reed–Muller) are subgroups of $({\mathbb{F}}_2{)}^n$; the group structure enables efficient encoding and syndrome decoding in CDs, QR codes, and deep-space telemetry.
5. Rubik's Cube. Its $4.3\times 10^{19}$ configurations form a group; "God's number" 20 (max moves to solve) was computed using group-theoretic search.
6. Chemistry — molecular spectroscopy. Character tables of finite point groups predict which vibrational/electronic transitions are infrared- or Raman-active.
7. Quantum computing. The Pauli group and Clifford group underpin quantum error correction and stabilizer codes.

Historical Development

• 1770 — Lagrange. Studies permutations of polynomial roots, implicitly using what becomes Lagrange's theorem; first stirrings of group thinking.
• 1799 — Ruffini. Attempts (incompletely) to prove the quintic is unsolvable, manipulating permutations.
• 1824–1826 — Abel. Proves the general quintic is unsolvable by radicals; commutative groups later named "abelian" in his honor.
• 1831–1832 — Galois. Introduces the term groupe and the decisive idea that a finite group governs solvability of equations; writes his foundational ideas the night before a fatal duel.
• 1854 — Cayley. Gives the first abstract definition of a finite group via a multiplication table, divorced from permutations.
• 1872 — Klein (Erlangen Program). Reorganizes geometry around its symmetry groups, making group theory central to all geometry.
• 1882 — von Dyck. Introduces generators and relations (presentations), and clarifies the abstract axioms.
• 1893–1896 — Weber & Frobenius. Weber gives essentially the modern axiomatic definition of an abstract (including infinite) group; Frobenius develops representation theory.
• 1980–2004 — Classification of Finite Simple Groups. A collaborative effort spanning tens of thousands of journal pages completes the periodic table of finite simple groups.

Subtleties & Limits

The basic axioms are settled, but their consequences run deep and partly unresolved. The inverse Galois problem — is every finite group the Galois group of some extension of $\mathbb{Q}$? — remains open in general. In infinite group theory, decision problems are subtle: the word problem (does a given product of generators equal the identity?) is undecidable for general finitely presented groups (Novikov–Boone, 1955). The classification of finite simple groups, though declared complete, is so vast that its verification and simplification (the "second-generation proof") is an ongoing decades-long program. Even the count of groups of a given order grows mysteriously: there are $49,487,365,422$ groups of order $1024=2^{10}$, and exact growth laws for $p$-groups remain only partially understood.

See Also