A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Splitting Fields

Graduate Depth 94 in the knowledge graph ☐ I know this ☆ Set as goal
41topics build on this
401prerequisites beneath it
See this on the map →
Algebraic and Transcendental ElementsAlgebraic and Transcendental Elements+1 more→→Finite Fields
splitting-field root complete-factorization

Core Idea

A splitting field of a polynomial f(x) ∈ F[x] is the smallest field extension of F in which f splits into linear factors. Splitting fields exist and are unique up to isomorphism.

Explainer

You've already worked with algebraic and transcendental elements, so you know that adjoining a root α of an irreducible polynomial p(x) to a field F produces the extension F(α). A splitting field is the result of doing this repeatedly — adjoining every root until the polynomial completely factors into linear pieces.

Start with a concrete case. Over ℚ, the polynomial f(x) = x² − 2 doesn't split: it has no rational roots. But ℚ(√2) = {a + b√2 : a, b ∈ ℚ} is the smallest extension where f factors as (x − √2)(x + √2). Notice that adjoining one root automatically provided the other, because −√2 = −(√2) is already in ℚ(√2). That's the splitting field: ℚ(√2). For x² + 1 over ℝ, the splitting field is ℂ = ℝ(i), since x² + 1 = (x − i)(x + i) and both roots land in ℂ.

For a degree-n polynomial, you might need to adjoin up to n roots. Each adjunction creates a tower of extensions: F ⊆ F(α₁) ⊆ F(α₁, α₂) ⊆ · · · ⊆ F(α₁, …, αₙ). The degree of the splitting field over F divides n! — the factorial bound arises because the first root creates an extension of degree at most n, the second of degree at most n−1, and so on. In practice the degree is often much smaller if roots are algebraically related, as in the x² − 2 example above.

The uniqueness up to isomorphism is what makes splitting fields a well-defined concept rather than an artifact of construction order. Two different towers of root adjunctions may look different, but they produce fields that are structurally identical — any two splitting fields of f over F are isomorphic by a map fixing F. This uniqueness is the foundation for defining Galois groups: once you know the splitting field is a canonical object, you can meaningfully ask how many automorphisms it has, and that count gives you the Galois group.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic and Transcendental Elements → Splitting Fields

Longest path: 95 steps · 401 total prerequisite topics

Prerequisites (3)

Leads To (1)