Introduction to Abstract Algebra: Groups and Symmetry

⚡ Key Takeaways

A group is a set equipped with an associative binary operation that has an identity element and inverses; groups are the mathematics of symmetry. The central result is that every symmetry of an object forms a group, and conversely every (finite) group can be realized as a group of permutations (Cayley's theorem). Groups appear wherever structure-preserving transformations occur: geometry, crystallography, particle physics, cryptography, and Rubik's cube. Foundational work by Galois (1830s), Cayley (1854), and Cayley/Klein/Lie in the late 19th century.

💡 The Core Insight

A symmetry is anything you can do to an object that leaves it looking the same — and the crucial fact is that symmetries compose. Do one symmetry, then another, and the result is again a symmetry; every symmetry can be undone; and "doing nothing" is always a symmetry. These three facts — composition, inverses, identity — together with associativity are the group axioms. The abstract group is therefore the distilled essence of symmetry, stripped of any reference to the particular object being symmetric.

DefinitionGroup

A group is an ordered pair $(G, \ast)$ where $G$ is a set and $\ast : G \times G \to G$ is a binary operation, satisfying:

1

\quad \forall a,b \in G: \; a \ast b \in G

Derivation hint: This is the closure axiom — often folded into " $\ast$ is a binary operation $G\times G \to G$ "; it guarantees the output stays in $G$ .

2

\quad \forall a,b,c \in G: \; (a \ast b) \ast c = a \ast (b \ast c)

Derivation hint: Associativity; allows unambiguous writing of $a\ast b\ast c$ without parentheses.

3

\quad \exists e \in G \;\; \forall a \in G: \; e \ast a = a \ast e = a

Derivation hint: Identity element. The two-sided condition is required; later we prove $e$ is unique.

4

\quad \forall a \in G \;\; \exists a^{-1} \in G: \; a \ast a^{-1} = a^{-1} \ast a = e

Derivation hint: Inverses. Each element has a two-sided inverse relative to the identity $e$ from [3]. Symbols: $G$ is the underlying set; $\ast$ is the group operation (often written multiplicatively as $ab$ or additively as $a+b$ ); $e$ (sometimes $1$ or $0$ ) is the identity; $a^{-1}$ (or $-a$ ) is the inverse of $a$ . The number of elements $|G|$ is the order of the group. If additionally $a\ast b = b\ast a$ for all $a,b$ , the group is abelian (commutative).

DefinitionSubgroup

A subset $H \subseteq G$ is a subgroup, written $H \le G$ , if $H$ is itself a group under the restricted operation. Equivalently (the subgroup test):

5

\quad H \neq \varnothing \;\wedge\; \big(\forall a,b \in H: \; a \ast b^{-1} \in H\big) \implies H \le G

Derivation hint: Nonemptiness gives some $a\in H$ , so $a\ast a^{-1}=e\in H$ ; then $e\ast b^{-1}=b^{-1}\in H$ ; then $a\ast(b^{-1})^{-1}=a\ast b\in H$ gives closure; associativity is inherited.

TheoremLagrange's Theorem

If $G$ is a finite group and $H \le G$ , then the order of $H$ divides the order of $G$ :

6

\quad |G| = [G:H]\cdot |H|

Derivation hint: $G$ is partitioned into disjoint left cosets $gH$ , each of the same cardinality $|H|$ ; the number of cosets is the index $[G:H]$ .

Corollary. For any $a \in G$ , the order of $a$ (smallest $n>0$ with $a^n = e$ ) divides $|G|$ , and hence $a^{|G|} = e$ .

TheoremCayley's Theorem

Every group $G$ is isomorphic to a subgroup of the symmetric group $\mathrm{Sym}(G)$ of permutations of its underlying set. In particular, every finite group of order $n$ embeds in $S_n$ .

ProofProof of Lagrange's Theorem

Step 1 — Define cosets. For $g \in G$ , the left coset is $gH = \{ g \ast h : h \in H\}$ .

Step 2 — Cosets partition $G$ . Define $a \sim b \iff a^{-1}b \in H$ . Reflexivity: $a^{-1}a = e \in H$ . Symmetry: if $a^{-1}b \in H$ then $(a^{-1}b)^{-1} = b^{-1}a \in H$ . Transitivity: if $a^{-1}b, b^{-1}c \in H$ then $(a^{-1}b)(b^{-1}c) = a^{-1}c \in H$ . Thus $\sim$ is an equivalence relation, and its classes are exactly the cosets $gH$ . Equivalence classes partition $G$ .

Step 3 — All cosets have size $|H|$ . The map $\varphi : H \to gH$ , $\varphi(h) = g\ast h$ , is a bijection: it is surjective by definition of $gH$ , and injective because $g h_1 = g h_2 \Rightarrow h_1 = h_2$ by cancellation (left-multiply by $g^{-1}$ ). Hence $|gH| = |H|$ .

Step 4 — Count. Since the $[G:H]$ disjoint cosets each have $|H|$ elements and together exhaust $G$ ,

7

\quad |G| = \sum_{\text{cosets}} |gH| = [G:H]\cdot |H|.

Derivation hint: Sum the equal-sized blocks of a partition; the number of blocks is by definition the index. Therefore $|H|$ divides $|G|$ . $\blacksquare$

∎

ProofProof of Cayley's Theorem

Step 1 — Left-multiplication maps. For each $g \in G$ define $L_g : G \to G$ by $L_g(x) = g \ast x$ . Each $L_g$ is a bijection with inverse $L_{g^{-1}}$ , hence $L_g \in \mathrm{Sym}(G)$ .

Step 2 — Homomorphism. Define $\Phi : G \to \mathrm{Sym}(G)$ by $\Phi(g) = L_g$ . Then

8

\quad L_{g}\circ L_{h}(x) = g\ast(h\ast x) = (g\ast h)\ast x = L_{g\ast h}(x),

Derivation hint: Apply associativity [2]; this shows $\Phi(g)\Phi(h)=\Phi(gh)$ , so $\Phi$ respects the operation. so $\Phi(g \ast h) = \Phi(g)\circ\Phi(h)$ .

Step 3 — Injectivity. If $\Phi(g) = \mathrm{id}$ , then $g \ast x = x$ for all $x$ ; taking $x = e$ gives $g = e$ . So $\ker\Phi = \{e\}$ and $\Phi$ is injective.

Step 4 — Conclude. $\Phi$ is an injective homomorphism, so $G \cong \Phi(G) \le \mathrm{Sym}(G)$ . $\blacksquare$

∎

mathematician · Évariste Galois | 1811–1832

A French mathematician who, before dying in a duel at age 20, founded what we now call Galois theory — the use of groups (he coined the term groupe) to determine when a polynomial equation is solvable by radicals. His night-before-the-duel manuscript introduced normal subgroups, the solvability of groups, and the idea that the symmetries of the roots govern the algebra of equations. Galois's work, ignored at first and only published in 1846 by Liouville, is the historical seed from which all of abstract group theory grew. The non-solvability of $S_5$ explains why there is no quintic formula.

🧠 Intuition

Think of a square sitting on a table. Pick it up, rotate or flip it, and set it back down so it covers the same outline — you have performed a symmetry. There are exactly eight such moves: four rotations (by $0°, 90°, 180°, 270°$ ) and four reflections (across two diagonals and two midlines). These eight form the dihedral group $D_4$ . The "operation" is do one move, then another. Rotate $90°$ then reflect — the net effect is some other single symmetry from the list of eight (closure). Doing nothing is the identity. Every move can be undone (inverses). And it doesn't matter how you group a sequence of three moves (associativity) — though notice it does matter what order you do them in: rotate-then-flip $\neq$ flip-then-rotate. That failure of commutativity is why $D_4$ is non-abelian, and it is the source of all the interesting complexity. A group is precisely this bookkeeping of "moves that preserve structure," abstracted away from squares to anything at all.

Figure

The dihedral group

D_4

: the eight symmetries of a square, organized into rotations and reflections

ExampleIntegers mod 6 under addition

Given. Let $G = \mathbb{Z}_6 = \{0,1,2,3,4,5\}$ with operation $a \ast b = (a+b)\bmod 6$ . Verify it is a group and find the order of the element $4$ .

Steps. 1. Closure: any sum mod 6 lands in $\{0,\dots,5\}$ . ✓ 2. Associativity: inherited from integer addition. ✓ 3. Identity: $0$ , since $0+a \equiv a$ . ✓ 4. Inverses: $-a \bmod 6$ , e.g. $4^{-1} = 2$ since $4+2=6\equiv 0$ . ✓ 5. Order of 4: compute multiples $\quad 4,\; 4{+}4{=}8\equiv 2,\; 2{+}4{=}6\equiv 0$ . So $3\cdot 4 \equiv 0$ , smallest such positive multiple is $3$ . Check with Lagrange's corollary: order of element $= 3$ divides $|G| = 6$ . ✓

Answer.

\boxed{(\mathbb{Z}_6,+) \text{ is an abelian group of order } 6; \quad \mathrm{ord}(4) = 3}

ExampleComposing symmetries in

D_3

(equilateral triangle)

Given. The symmetry group of an equilateral triangle, $D_3$ , has order 6: rotations $\{e, r, r^2\}$ by $0°,120°,240°$ and three reflections $\{s, rs, r^2s\}$ , with relations $r^3 = e$ , $s^2 = e$ , $sr = r^{-1}s = r^2 s$ . Compute the product $(rs)(r^2 s)$ and identify it.

Steps. 1. Write out: $(rs)(r^2 s) = r\,(s r^2)\, s$ . 2. Push $s$ past $r^2$ using $s r = r^{-1} s$ , so $s r^2 = (s r) r = (r^{-1}s) r = r^{-1}(s r) = r^{-1} r^{-1} s = r^{-2} s = r s$ (since $r^{-2} = r$ ). 3. Substitute: $r\,(s r^2)\,s = r\,(r s)\, s = r^2 s^2 = r^2 \cdot e = r^2$ . 4. Identify: $r^2$ is the rotation by $240°$ .

Answer.

\boxed{(rs)(r^2 s) = r^2 \quad(\text{rotation by } 240^\circ)}

Note this is a rotation: reflection $\times$ reflection $=$ rotation, mirroring the determinant rule $(-1)\cdot(-1)=+1$ .

⚠️ Common mistake

"All groups are commutative." False — only abelian groups are. The smallest non-abelian group is $S_3 = D_3$ of order 6. In general $ab \neq ba$ , and you may not rearrange factors. A related error: writing $(ab)^{-1} = a^{-1}b^{-1}$ . The correct socks-and-shoes rule reverses order:

9

\quad (a\ast b)^{-1} = b^{-1} \ast a^{-1}.

Derivation hint: Check $(a b)(b^{-1}a^{-1}) = a(bb^{-1})a^{-1} = a e a^{-1} = e$ using associativity and inverses. Also beware: closure is not automatic. The odd integers under addition are not a group — $3+5=8$ is even, leaving the set.

Counterexample

A subset closed under the operation need not be a subgroup. Consider $G = \mathbb{Z}$ under addition and the subset $H = \{0,1,2,3,\dots\}$ , the non-negative integers. $H$ is closed ( $a+b \ge 0$ ), contains the identity $0$ , and inherits associativity — yet $H$ is not a subgroup, because it lacks inverses: $3 \in H$ but $-3 \notin H$ . This shows closure $+$ identity is insufficient; the subgroup test [5] (using $a\ast b^{-1}$ ) correctly catches this, since $0 - 3 = -3 \notin H$ .

connection

Groups sit at the crossroads of nearly all of mathematics. A group with a second compatible operation (multiplication distributing over addition) is a Ring Theory object; further structure gives Field Theory. The symmetries of the roots of a polynomial form a Galois Group, linking groups to solving equations. Continuous symmetry groups — circles, rotation groups $SO(3)$ , the matrices $GL_n$ — are Lie Groups, where group theory meets Differential Geometry. The way a group can act on a set is formalized in Group Actions, generalizing Cayley's theorem and powering counting tools like Burnside's Lemma. The quotient construction $G/N$ by a normal subgroup connects to the Isomorphism Theorems and to Homological Algebra.

🔬 Where this appears

⏳ History

- 1770 — Lagrange studies permutations of polynomial roots to analyze solvability, anticipating Lagrange's theorem and the role of symmetry in equations.

- 1799 — Ruffini gives an (incomplete) argument that the general quintic is not solvable by radicals.

- 1824 — Abel proves rigorously that no general formula in radicals exists for degree

\ge 5

(Abel–Ruffini theorem).

- 1830–1832 — Galois introduces groups, normal subgroups, and solvability, definitively explaining the quintic; his ideas lie unpublished until 1846.

- 1854 — Cayley gives the first abstract definition of a (finite) group via a multiplication table, decoupling groups from permutations.

- 1872 — Klein's Erlangen Program recasts all of geometry as the study of invariants under transformation groups.

- 1870s–1890s — Sophus Lie develops continuous transformation groups (Lie groups) to study differential equations.

- 1897 — Burnside's Theory of Groups of Finite Order, the first comprehensive English treatise; later his lemma and

p^aq^b

theorem.

- 1980–2004 — The classification of finite simple groups is completed, a collaborative proof spanning tens of thousands of journal pages.

open-problem

Although the classification of finite simple groups is announced as complete, the proof is so vast (~ $10{,}000+$ pages by hundreds of authors) that an ongoing "second-generation" project led by Gorenstein, Lyons, Solomon, and Aschbacher aims to consolidate it into a self-contained, verifiable ~ $5{,}000$ -page treatment — and gaps (e.g. the 2008 patch to the quasithin case) remind us that human-checked proofs of this scale carry genuine epistemic risk. For infinite groups the picture is wilder: the word problem (deciding whether a product of generators equals the identity) is undecidable in general (Novikov–Boone, 1955), so no algorithm can resolve equality in an arbitrary finitely-presented group. Open questions abound, such as the precise growth rates achievable by finitely generated groups and the structure of the Monster group's representations (the resolved moonshine conjectures connect it astonishingly to modular forms and string theory).

Introduction to Abstract Algebra: Groups and Symmetry

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also