Chapter 19
Rigorous

Splitting Fields & Algebraic Closures

00 · Symbol Glossary

$\mathrm{Split}_F(f)$Splitting field of f over F (informal notation)

The smallest extension of FF in which ff factors completely into linear pieces. This chapter's central construction.

$\overline{F}$Algebraic closure of F

An algebraic extension of FF in which every polynomial splits completely — the "largest algebraic extension," in a precise sense, and unique up to isomorphism.

$f'$Formal derivative of f

For f=∑aixif=\sum a_ix^i, f′:=∑iaixi−1f' := \sum ia_ix^{i-1} — defined by the power-rule formula alone, with no limits, so it makes sense over any field, including finite ones.

$\omega$Primitive cube root of unity

A complex number with ω3=1\omega^3=1, ω≠1\omega\neq1: concretely ω=e2πi/3=−12+32i\omega = e^{2\pi i/3} = -\tfrac12+\tfrac{\sqrt3}{2}i. Appears constantly in splitting fields of cubics.


01 · Splitting Fields

Definition — Splitting Field

Let f∈F[x]f\in F[x]. A field K⊇FK\supseteq F is a splitting field of ff over FF if: (a) ff factors into linear factors in K[x]K[x]; (b) K=F(α1,…,αn)K = F(\alpha_1,\ldots,\alpha_n), where α1,…,αn\alpha_1,\ldots,\alpha_n are the roots of ff in KK (no smaller field works).

Example — Splitting field of x²-2 over Q

x2−2=(x−2)(x+2)x^2-2 = (x-\sqrt2)(x+\sqrt2) over Q(2)\mathbb{Q}(\sqrt2), and both roots ±2\pm\sqrt2 generate exactly Q(2)\mathbb{Q}(\sqrt2). Q(2)\mathbb{Q}(\sqrt2) is the splitting field of x2−2x^2-2 over Q\mathbb{Q}.


02 · Existence of Splitting Fields

Theorem 19.1 — Splitting Fields Always Exist

For every field FF and every f∈F[x]f\in F[x] with deg⁡f≥1\deg f\geq1, a splitting field of ff over FF exists.

Proof

By strong induction on deg⁡f\deg f. If ff already factors into linear pieces over FF, then K=FK=F (generated over itself by the roots, which already lie in FF) is a splitting field.

Otherwise, ff has an irreducible factor pp of degree ≥2\geq2. By Theorem 18.4, F1:=F[x]/(p)F_1 := F[x]/(p) is a field extension of FF containing a root α\alpha of pp (hence of ff, since p∣fp\mid f). In F1[x]F_1[x], the Factor Theorem gives f=(x−α)gf=(x-\alpha)g for some g∈F1[x]g\in F_1[x] with deg⁡g=deg⁡f−1\deg g = \deg f-1.

By the induction hypothesis (applied to gg over the field F1F_1), gg has a splitting field KK over F1F_1: gg factors into linear pieces over KK, and K=F1(β1,…,βn−1)K=F_1(\beta_1,\ldots,\beta_{n-1}) where βi\beta_i are gg's roots. Then f=(x−α)gf=(x-\alpha)g also factors into linear pieces over KK, and K=F1(β1,…,βn−1)=F(α)(β1,…,βn−1)=F(α,β1,…,βn−1)K = F_1(\beta_1,\ldots,\beta_{n-1}) = F(\alpha)(\beta_1,\ldots,\beta_{n-1}) = F(\alpha,\beta_1,\ldots,\beta_{n-1}) — exactly FF adjoined with all of ff's roots. So KK is a splitting field of ff over FF.


03 · Uniqueness of Splitting Fields

Existence alone would be unsatisfying if different constructions gave genuinely different fields. They don't — up to relabeling.

Theorem 19.2 — Isomorphism Extension Theorem

Let σ:F→F′\sigma: F\to F' be a field isomorphism, extend it to σ:F[x]→F′[x]\sigma: F[x]\to F'[x] by applying σ\sigma to each coefficient (a ring isomorphism, since σ\sigma preserves +,×+,\times coefficientwise), and let f′=σ(f)f'=\sigma(f). If KK is a splitting field of ff over FF and K′K' is a splitting field of f′f' over F′F', then σ\sigma extends to an isomorphism K≅K′K\cong K'.

Proof

By induction on [K:F][K:F]. If [K:F]=1[K:F]=1, K=FK=F, so ff already splits over FF; applying σ\sigma termwise to the linear factorization shows f′f' splits over F′F' too, so K′=F′K'=F' (generated by roots already present) and σ\sigma itself is the required isomorphism.

Otherwise pick a root α∈K\alpha\in K of ff with α∉F\alpha\notin F, and let p=mαp=m_\alpha (an irreducible factor of ff over FF, by Theorem 18.2). Applying σ\sigma to pp's coefficients gives an irreducible factor p′=σ(p)p'=\sigma(p) of f′f' over F′F' (irreducibility is preserved: any nontrivial factorization p′=ghp'=gh would pull back via σ−1\sigma^{-1} to a nontrivial factorization of pp, contradiction). Since K′K' splits f′f' completely, p′p' has a root α′∈K′\alpha'\in K'.

By Theorem 18.4 applied on both sides, F(α)≅F[x]/(p)F(\alpha)\cong F[x]/(p) and F′(α′)≅F′[x]/(p′)F'(\alpha')\cong F'[x]/(p'); since σ\sigma identifies F[x]/(p)F[x]/(p) with F′[x]/(p′)F'[x]/(p') (it's an isomorphism sending the ideal (p)(p) to (p′)(p')), composing gives an isomorphism τ:F(α)→F′(α′)\tau: F(\alpha)\to F'(\alpha') extending σ\sigma, with τ(α)=α′\tau(\alpha)=\alpha'.

Now KK is a splitting field of ff over the larger base field F(α)F(\alpha) (same field KK, same roots, just a bigger base), and K′K' is a splitting field of f′=τ(f)f'=\tau(f) over F′(α′)F'(\alpha'). Since [K:F(α)]=[K:F]/[F(α):F]<[K:F][K:F(\alpha)] = [K:F]/[F(\alpha):F] < [K:F] (as [F(α):F]=deg⁡p>1[F(\alpha):F]=\deg p>1, Theorem 18.4), the induction hypothesis applies to τ\tau in place of σ\sigma: τ\tau (hence σ\sigma) extends to an isomorphism K≅K′K\cong K'.

Corollary 19.3 — Splitting Fields Are Unique

Any two splitting fields of f∈F[x]f\in F[x] over FF are isomorphic via a map fixing FF pointwise.

Proof

Apply Theorem 19.2 with F′=FF'=F, σ=idF\sigma=\mathrm{id}_F.

Why uniqueness matters for what's coming

Corollary 19.3 licenses the phrase "the splitting field of ff," treated as a single well-defined object up to relabeling — exactly the setting Chapter 20 needs to define the Galois group of ff as "the automorphisms of the splitting field fixing FF," without ambiguity about which splitting field was chosen.


04 · Algebraic Closures

Definition — Algebraically Closed, Algebraic Closure

A field KK is algebraically closed if every nonconstant f∈K[x]f\in K[x] has a root in KK (equivalently, splits completely into linear factors over KK). An algebraic closure of FF, written F‾\overline{F}, is an algebraic extension of FF that is algebraically closed.

Existence and uniqueness, taken as given

Every field has an algebraic closure, unique up to isomorphism — a genuine theorem, but its general proof requires Zorn's Lemma (to handle possibly infinite towers of extensions) rather than the finite inductive techniques of this chapter. We take existence and uniqueness as given, the same deferral used for free-group associativity (Chapter 10) and the field of fractions (Chapter 17): the construction is real, but its technical machinery is a detour from this course's algebraic focus.

Example — C is algebraically closed

The Fundamental Theorem of Algebra (an analysis result, proved via complex analysis or topology rather than pure algebra, and not reproved here) states every nonconstant polynomial in C[x]\mathbb{C}[x] has a root in C\mathbb{C}. So C\mathbb{C} is algebraically closed, and since C/R\mathbb{C}/\mathbb{R} is algebraic ([C:R]=2[\mathbb{C}:\mathbb{R}]=2 is finite, so Theorem 18.5 applies), C=R‾\mathbb{C} = \overline{\mathbb{R}}.

Example — The algebraic closure of Q is smaller than C

Q‾\overline{\mathbb{Q}} (the algebraic numbers: all complex numbers that are roots of some polynomial in Q[x]\mathbb{Q}[x]) is a proper subfield of C\mathbb{C} — it's countable (each polynomial has finitely many roots, and there are only countably many polynomials with rational coefficients), while C\mathbb{C} is uncountable. So Q‾⊊C\overline{\mathbb{Q}} \subsetneq \mathbb{C}, even though both are algebraically closed: algebraic closures are only unique relative to the base field, not universally.


05 · Multiple Roots and Separability

Definition — Formal Derivative

For f=∑i=0naixi∈F[x]f=\sum_{i=0}^n a_ix^i \in F[x], define f′:=∑i=1niaixi−1f' := \sum_{i=1}^n ia_ix^{i-1} (where iaiia_i means ai+ai+⋯+aia_i+a_i+\cdots+a_i, ii times — makes sense in any field, no limits needed). The product rule (fg)′=f′g+fg′(fg)'=f'g+fg' holds by direct expansion, exactly as in calculus.

Theorem 19.4 — Detecting Multiple Roots

Let KK be a splitting field of f∈F[x]f\in F[x] and α∈K\alpha\in K a root of ff. Then α\alpha is a multiple root (i.e. (x−α)2∣f(x-\alpha)^2 \mid f in K[x]K[x]) if and only if f′(α)=0f'(\alpha)=0.

Proof

By the Factor Theorem, f=(x−α)gf=(x-\alpha)g for some g∈K[x]g\in K[x]. By the product rule, f′=(x−α)′g+(x−α)g′=g+(x−α)g′f' = (x-\alpha)'g + (x-\alpha)g' = g + (x-\alpha)g'. Evaluating at α\alpha: f′(α)=g(α)f'(\alpha) = g(\alpha).

(x−α)2∣f  ⟺  (x−α)∣g  ⟺  g(α)=0(x-\alpha)^2\mid f \iff (x-\alpha)\mid g \iff g(\alpha)=0 (Factor Theorem again)   ⟺  f′(α)=0\iff f'(\alpha)=0.

Definition — Separable Polynomial

f∈F[x]f\in F[x] is separable if it has no multiple roots in its splitting field.

Example — Irreducible polynomials are separable in characteristic 0

Suppose FF has characteristic 00 and f∈F[x]f\in F[x] is irreducible with deg⁡f=n≥1\deg f=n\geq1. Its leading term anxna_nx^n has derivative nanxn−1na_nx^{n-1}, and nan≠0na_n\neq0 in FF (since char(F)=0\mathrm{char}(F)=0 means no positive integer multiple of a nonzero element vanishes). So f′≠0f'\neq0 and deg⁡f′=n−1<n=deg⁡f\deg f' = n-1 < n = \deg f. Any common root α\alpha of ff and f′f' would make gcd⁡(f,f′)\gcd(f,f') (computable via the Euclidean algorithm in F[x]F[x], Chapter 15) a nonconstant common divisor — but ff is irreducible, so its only divisors are units and associates of itself; since deg⁡f′<deg⁡f\deg f' < \deg f, f′f' cannot be an associate of ff, forcing gcd⁡(f,f′)\gcd(f,f') to be a unit (constant), meaning no shared root exists. By Theorem 19.4, ff has no multiple roots: every irreducible polynomial over a characteristic-0 field is separable.

Why this matters going forward

Chapters 20–21 work with extensions of Q\mathbb{Q} (characteristic 0) throughout, so separability is automatic there by the Example above — every irreducible polynomial behaves as "nicely" as possible, with no repeated roots to complicate the Galois correspondence. (Characteristic-pp fields can have genuinely inseparable irreducible polynomials, but that phenomenon is outside this course's scope.)


06 · A Worked Splitting Field

Step-by-step — The splitting field of $x^3-2$ over $\mathbb{Q}$
1
Find the roots in C\mathbb{C}: x3=2x^3=2 has solutions 23, 23 ω, 23 ω2\sqrt[3]2,\ \sqrt[3]2\,\omega,\ \sqrt[3]2\,\omega^2, where ω=e2πi/3\omega=e^{2\pi i/3} is a primitive cube root of unity (satisfying ω3=1\omega^3=1, ω≠1\omega\neq1).
2
Adjoin the real root first: Q(23)\mathbb{Q}(\sqrt[3]2) has degree 3 over Q\mathbb{Q} (Exercise 18.2), but contains only one of the three roots — the other two, 23 ω\sqrt[3]2\,\omega and 23 ω2\sqrt[3]2\,\omega^2, are not real, while Q(23)⊂R\mathbb{Q}(\sqrt[3]2)\subset\mathbb{R} entirely. So Q(23)\mathbb{Q}(\sqrt[3]2) is not yet a splitting field.
3
Adjoin ω\omega as well: K=Q(23,ω)K=\mathbb{Q}(\sqrt[3]2,\omega) now contains all three roots (23\sqrt[3]2, 23 ω\sqrt[3]2\,\omega, and 23 ω2=23 ω⋅ω\sqrt[3]2\,\omega^2 = \sqrt[3]2\,\omega\cdot\omega, both products of elements already present).
4
Compute the degree: ω\omega satisfies x2+x+1x^2+x+1 (dividing x3−1=(x−1)(x2+x+1)x^3-1=(x-1)(x^2+x+1), and ω≠1\omega\neq1), irreducible over Q(23)\mathbb{Q}(\sqrt[3]2) (a degree-2 polynomial with no root in Q(23)⊂R\mathbb{Q}(\sqrt[3]2) \subset \mathbb{R}, since ω\omega is nonreal). So [Q(23,ω):Q(23)]=2[\mathbb{Q}(\sqrt[3]2,\omega):\mathbb{Q}(\sqrt[3]2)]=2, and by the Tower Law, [K:Q]=3×2=6[K:\mathbb{Q}] = 3\times2=6.
5
Conclusion: K=Q(23,ω)K=\mathbb{Q}(\sqrt[3]2,\omega), with [K:Q]=6[K:\mathbb{Q}]=6, is the splitting field of x3−2x^3-2 over Q\mathbb{Q} — the exact example Chapter 20 revisits to compute a Galois group of order 6.

07 · Exercises

EXERCISE 19.1

Find all roots of x4−1x^4-1 in C\mathbb{C} first, then determine the smallest field over Q\mathbb{Q} containing all of them.

Roots of x4−1x^4-1: 1,−1,i,−i1,-1,i,-i. The smallest field over Q\mathbb{Q} containing all four is Q(i)\mathbb{Q}(i) (since 1,−1∈Q1,-1\in\mathbb{Q} already, and −i=−1⋅i∈Q(i)-i=-1\cdot i\in\mathbb{Q}(i) once ii is adjoined). x4−1=(x−1)(x+1)(x−i)(x+i)x^4-1=(x-1)(x+1)(x-i)(x+i) splits completely over Q(i)\mathbb{Q}(i).

The splitting field of x4−1x^4-1 over Q\mathbb{Q} is Q(i)\mathbb{Q}(i), with degree 2.

Find the splitting field of x4−1x^4-1 over Q\mathbb{Q}, and its degree.

EXERCISE 19.2

Apply Theorem 19.4: compute f′f' and check for a common root with ff.

f=x3−3x+2f=x^3-3x+2, f′=3x2−3f'=3x^2-3. Check x=1x=1: f(1)=1−3+2=0f(1)=1-3+2=0 ✓; f′(1)=3−3=0f'(1)=3-3=0 ✓. By Theorem 19.4, x=1x=1 is a multiple root. (Confirmed: x3−3x+2=(x−1)2(x+2)x^3-3x+2 = (x-1)^2(x+2).)

Using Theorem 19.4, determine whether x=1x=1 is a multiple root of f=x3−3x+2f=x^3-3x+2.

EXERCISE 19.3

Recall that Q\mathbb{Q} has characteristic 0, and apply the Example from Section 05.

Q\mathbb{Q} has characteristic 0. By the Example in Section 05, every irreducible polynomial over Q\mathbb{Q} is automatically separable — including x2−2x^2-2 (irreducible, Section 04's earlier chapters) with no need to check gcd⁡(f,f′)\gcd(f,f') by hand.

Is x2−2x^2-2 separable over Q\mathbb{Q}? Justify using the characteristic-0 fact from Section 05, without computing a gcd directly.


08 · Chapter Summary

ConceptStatement
Splitting fieldSmallest extension where ff factors into linear pieces
ExistenceEvery f∈F[x]f\in F[x] has a splitting field (Thm 19.1)
Isomorphism Extension TheoremField isomorphisms extend across matching splitting fields (Thm 19.2)
UniquenessSplitting fields of ff over FF are unique up to FF-isomorphism (Cor 19.3)
Algebraic closure F‾\overline{F}Algebraic + algebraically closed; exists, unique up to isomorphism
R‾=C\overline{\mathbb{R}}=\mathbb{C}Fundamental Theorem of Algebra
Formal derivativef′=∑iaixi−1f'=\sum ia_ix^{i-1}; product rule holds in any field
Multiple root testα\alpha multiple root   ⟺  f(α)=f′(α)=0\iff f(\alpha)=f'(\alpha)=0 (Thm 19.4)
SeparableNo multiple roots; automatic for irreducibles in characteristic 0

Next: Chapter 20 — Galois Theory: Fundamentals defines the Galois group of a splitting field and proves the Fundamental Theorem of Galois Theory, translating field-theoretic questions about a polynomial into purely group-theoretic ones.