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 moreFinite 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic and Transcendental ElementsSplitting Fields

Longest path: 95 steps · 401 total prerequisite topics

Prerequisites (3)

Leads To (1)