Abstract Algebra — The Algebra of Symmetry

🔬 Scientist Pure mathematics — no exam syllabus

Abstract Algebra — The Algebra of Symmetry

Abstract algebra studies algebraic structures — sets with operations that obey certain rules. A group captures symmetry. A ring captures addition and multiplication together. A field captures the arithmetic of numbers. And Galois theory uses all three to answer one of the oldest questions in mathematics: which equations can be solved by radicals? The answer — discovered by a 20-year-old Frenchman the night before he died in a duel — is one of the most beautiful and tragic stories in all of science.

"Algebra is the intellectual instrument which has been created for rendering clear the quantitative aspects of the world."

— Alfred North Whitehead

Part 1

🔷 Groups — The Mathematics of Symmetry

What Is a Group?

Four Rules That Capture Every Kind of Symmetry

A group is a set G with an operation • satisfying four axioms: closure (a•b is in G), associativity ((a•b)•c = a•(b•c)), identity (an element e such that e•a = a•e = a), and inverses (for every a, there exists a⁻¹ such that a•a⁻¹ = e). That's it — four rules. Yet from these four rules flows an entire theory that describes the symmetries of snowflakes, the structure of crystals, the possible elementary particles, and the rotations of a Rubik's cube. A group is a universe of symmetry, defined by its multiplication table.

A group is a set with a single operation that satisfies four simple axioms — yet it captures the essence of symmetry everywhere.

Examples of Groups

Integers under +

(ℤ, +): identity 0, inverse −a

Non-zero reals under ×

(ℝ\{0}, ×): identity 1, inverse 1/a

Clock arithmetic

ℤₙ: integers mod n under +

Permutations

Sₙ: all bijections of {1,...,n}

Cyclic Groups — The Simplest Kind

A group is cyclic if it's generated by a single element: every element is gⁿ for some n. The integers ℤ are infinite cyclic (generated by 1). The clock group ℤₙ is finite cyclic (generated by 1 mod n). Cyclic groups are the building blocks of all finite abelian groups — the Fundamental Theorem of Finite Abelian Groups says every such group is a product of cyclic groups.

Permutation Groups — Symmetry in Action

The symmetric group Sₙ consists of all permutations of n objects. It has n! elements. Cayley's theorem says every finite group is isomorphic to a subgroup of some Sₙ — meaning every group can be understood as permutations of something. The alternating group Aₙ (even permutations) is the key to the unsolvability of the quintic.

Cayley's Theorem

Every finite group is isomorphic to a subgroup of Sₙ

Every group can be represented as permutations of its own elements.

✨

Lagrange's Theorem — The Size of Subgroups ▶

If H is a subgroup of a finite group G, then |H| divides |G|. This simple counting argument is one of the most powerful in group theory.

Example: A group of order 6 can have subgroups of order 1, 2, 3, or 6 — never 4 or 5. This is why a pentagon's rotational symmetry group (order 5) can't be a subgroup of a hexagon's (order 6) — 5 doesn't divide 6.

The converse is false: not every divisor has a subgroup. The smallest counterexample is A₄ (order 12), which has no subgroup of order 6.

Part 2

⭕ Rings & Fields — Two Operations Are Better Than One

Adding Multiplication

Rings: Where Addition and Multiplication Live Together

A ring is a set with two operations: addition (forming an abelian group) and multiplication (associative, distributive over addition). The integers ℤ are a ring. Polynomials ℤ[x] form a ring. Matrices form a ring. A field is a ring where multiplication also forms an abelian group (except 0) — meaning every non-zero element has a multiplicative inverse. ℚ, ℝ, ℂ are fields. ℤ is not a field (2 has no multiplicative inverse in ℤ). The distinction between rings and fields is the distinction between integer arithmetic and fraction arithmetic — polynomials vs. rational functions.

Rings are like ℤ; fields are like ℚ. The difference is whether you can divide.

Ideals — The Substructures of Rings

An ideal I in a ring R is a subset closed under addition and under multiplication by any element of R. Think of it as a "module of zero" — if you multiply an element of I by anything in R, you stay in I. Ideals are to rings what normal subgroups are to groups: they allow you to form quotient rings R/I.

Example: ℤ/nℤ

The set nℤ = {..., −2n, −n, 0, n, 2n, ...} is an ideal of ℤ. The quotient ℤ/nℤ is the ring of integers mod n. If n is prime, this is actually a field — the finite field 𝔽ₚ. This is why modular arithmetic works especially well modulo a prime: every non-zero residue has a multiplicative inverse.

Polynomial Rings

The ring R[x] of polynomials with coefficients in R is one of the most important constructions in algebra. Over a field, polynomial division works, and every ideal of F[x] is principal (generated by a single polynomial). The irreducible polynomials are like prime numbers — they generate the prime ideals. The study of polynomial roots leads directly to field theory and Galois theory.

Integer Ring

ℤ (not a field)

Rationals

ℚ (field)

Polynomials

F[x] (ring)

Finite Field

𝔽ₚ = ℤ/pℤ

Part 3

🌿 Galois Theory — The Tragedy of the Quintic

A Genius Lost at 20

Évariste Galois and the Unsolvable Equation

For 2000 years, mathematicians sought a formula for the roots of a quintic (5th-degree) polynomial — akin to the quadratic formula for ax² + bx + c = 0. In the 1820s, Niels Henrik Abel proved it was impossible. But Évariste Galois went further: he developed an entire theory to determine exactly which polynomials are solvable by radicals. The night before his fatal duel at age 20, he wrote down his theory in a letter — "I have no time" — founding modern algebra. The key insight: the symmetries of a polynomial's roots form a group, and the polynomial is solvable by radicals iff this group is solvable.

The solvability of an equation is not about the coefficients — it's about the symmetry group of its roots.

Field Extensions — Adjoining Roots

To solve x² − 2 = 0, we need √2. The rationals ℚ don't contain √2, so we create a field extension ℚ(√2) = {a + b√2 : a,b ∈ ℚ}. The degree of the extension — the dimension as a vector space over ℚ — is 2. The degree tells you how many new numbers you need to adjoin.

Degree of an Extension

[ℚ(√d) : ℚ] = 2

The extension degree is the dimension as a vector space over the base field.

Galois Groups — The Symmetries of Roots

The Galois group Gal(L/K) is the group of field automorphisms of L that fix K. Each automorphism permutes the roots of a polynomial. For x² − 2 = 0, the Galois group has two elements: one that sends √2 to itself (identity) and one that sends √2 to −√2. This group is ℤ₂ — cyclic of order 2.

✨

The Fundamental Theorem of Galois Theory ▶

There is a one-to-one correspondence between:
— Intermediate fields K ⊆ M ⊆ L
— Subgroups of the Galois group Gal(L/K)

Larger subfields correspond to smaller subgroups, and vice versa. This correspondence turns problems about fields (hard) into problems about groups (easier).

A polynomial is solvable by radicals iff its Galois group is a solvable group — a group that can be broken down into a chain of abelian subgroups. The symmetric group S₅ is not solvable. Therefore, the general quintic is not solvable by radicals.

This is why there's a quadratic formula, a cubic formula, a quartic formula — but no general quintic formula.

The Unsolvable Quintic

The Galois group of the general quintic is S₅ (all permutations of 5 roots). S₅ is not solvable — its only normal subgroups are {e}, A₅ (alternating), and S₅ itself, and A₅ is simple (no normal subgroups at all). Therefore no radical formula exists. Specific quintics like x⁵ − x − 1 = 0 have Galois group S₅ and cannot be solved by radicals — their roots exist but cannot be expressed using +, −, ×, ÷, and √.

Part 4

🌍 Abstract Algebra in the Real World

Algebra Everywhere

From Rubik's Cube to Particle Physics

Abstract algebra seemed like the purest of pure mathematics — studying groups and fields for their own sake. Yet it turned out to be the language of modern physics. The Standard Model of particle physics is built on Lie groups (SU(3) × SU(2) × U(1)). Crystallography uses space groups. Cryptography uses finite fields and elliptic curve groups. Coding theory uses polynomial rings over finite fields. The Rubik's Cube is a group of 43 quintillion elements. And the classification of finite simple groups — one of the greatest mathematical achievements of the 20th century — lists all the "atoms" of finite symmetry.

Group theory is the grammar of symmetry, and nature speaks in symmetry.

The Rubik's Cube Group

The Rubik's Cube has 43,252,003,274,489,856,000 possible states. The set of all moves forms a group. The structure of this group — its generators (the six face turns), its relations (the sequences that return to solved), and its subgroups (like the "square subgroup" of moves that only use half-turns) — is a beautiful application of group theory. God's number (the maximum number of moves needed to solve any state) was proven to be 20 using group-theoretic reasoning and computer search.

Elliptic Curve Cryptography

Elliptic curves over finite fields form groups. The security of ECC relies on the difficulty of the elliptic curve discrete logarithm problem: given points P and nP on the curve, find n. This is believed to be much harder than factoring — so ECC achieves the same security as RSA with much smaller keys. Bitcoin, HTTPS, and modern messaging all use elliptic curve groups.

Elliptic Curve Group Law

Points on y² = x³ + ax + b form a group. The "addition" of two points is defined geometrically: draw the line through P and Q; its third intersection with the curve is −(P+Q); reflect across the x-axis to get P+Q. This turns the curve into an abelian group — the foundation of ECC.

Burnside's Lemma — Counting with Symmetry

How many distinct necklaces can you make with 6 beads, each bead either black or white, if rotations are considered the same? Burnside's lemma uses group actions to count: number of orbits = (1/|G|) Σ |Fix(g)|. For this problem: G = the 6 rotations. Fix(identity) = 2⁶ = 64. A 90° rotation only fixes monochromatic necklaces: 2. Summing over all rotations: (64 + 2 + 4 + 2 + 4 + 2)/6 = 78/6 = 13 distinct necklaces.

Burnside's Lemma

# Orbits = (1/|G|) Σ_{g∈G} |Fix(g)|

The number of distinct objects under a group action equals the average number of objects fixed by each group element.

The Classification of Finite Simple Groups

Finite simple groups are the "prime numbers" of group theory — they have no non-trivial normal subgroups. The classification theorem, completed in 2004 (after tens of thousands of pages across hundreds of papers), lists all finite simple groups. They fall into families: cyclic groups of prime order, alternating groups Aₙ (n ≥ 5), groups of Lie type (like PSLₙ(𝔽ₐ)), and 26 sporadic groups — the largest of which is the Monster group, with about 8×10⁵³ elements. The Monster has deep connections to number theory through monstrous moonshine.

"The mathematician does not study pure mathematics because it is useful; he studies it because he delights in it, and he delights in it because it is beautiful."

— Henri Poincaré

🎯 Practice — Check Your Algebraic Intuition

These puzzles build intuition about groups, rings, and fields.

← Back to Math Map