Splitting Field
Statement
Given a field and a non-constant polynomial , the splitting field of over is the smallest extension in which factors completely:
In Mathlib: Polynomial.SplittingField p is a concrete field, and Polynomial.IsSplittingField F (SplittingField p) p records the universal property. The key predicate is Polynomial.Splits (algebraMap F K) p.
The splitting field is unique up to -isomorphism and has degree where .
Visualization
The splitting field of over :
Roots: , , , where .
Q(cbrt4(2), i) [degree 8 over Q]
/ \
Q(cbrt4(2)) Q(i)
[deg 4] [deg 2]
\ /
Q
The four roots lie in but not all in (missing ) or (missing ). The Galois group .
Simpler example — splitting field of over :
| Root | Field needed |
|---|---|
| already in |
So the splitting field is , degree 2.
Proof Sketch
- Root adjunction. If is irreducible over , adjoin one root to get . Over , factors off .
- Induction on degree. Factor off each root in turn. After at most adjunctions the polynomial is completely split. The result is .
- Minimality. Any -extension containing all roots of contains , so the splitting field is minimal.
- Uniqueness. Any two splitting fields are isomorphic over by induction on the number of roots adjoined.
Connections
Splitting fields are always normal extensionsNormal ExtensionA field extension where every irreducible polynomial with one root in the extension splits completelyRead more → — the defining property of normality is exactly that every irreducible polynomial with one root in splits completely in . The splitting field construction also appears in the Fundamental Theorem of Galois TheoryFundamental Theorem of Galois TheoryBijection between intermediate fields and subgroups of the Galois groupRead more →.
Lean4 Proof
/-- The canonical splitting field of `p` over `F` satisfies the splitting predicate. -/
theorem splittingField_splits (F : Type*) [Field F]
(p : Polynomial F) :
p.Splits (algebraMap F (p.SplittingField)) :=
Polynomial.SplittingField.splits pReferenced by
- Algebraic ClosureField Theory