How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Splitting Fields: Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The base field is the splitting field of the empty family and of every nonzero constant polynomial
Example
For every field , the splitting field over of the empty family is . The same is true for every nonzero constant polynomial .
Facts & Assumptions
Given: A field .
A nonzero degree-zero polynomial splits as its leading coefficient times an empty product, and a splitting field is generated by the roots of the polynomial or family (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
Verification
The empty family has no roots, and a nonzero constant also has no roots. In either case the subfield generated over by the empty root set is itself.
The empty family is vacuously split over , while is the required empty linear factorisation. Thus both cases satisfy the splitting-field definition.
The splitting field of over is , with roots
Example
The splitting field of over is , and its roots are and . Moreover, is a -basis.
Facts & Assumptions
Given: The polynomial and the positive real square root .
The rationals form a field (The rationals form a field).
The nonnegative real number has a unique nonnegative square root with (Square roots exist: a unique with ; the positives are ).
Eisenstein's criterion proves a primitive integer polynomial irreducible when a prime divides every nonleading coefficient, its square does not divide the constant coefficient, and it does not divide the leading coefficient (Eisenstein criterion over the integers).
A simple extension by an algebraic element whose minimal polynomial has degree has power basis through degree (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
A splitting field is generated by all roots of the polynomial (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
The minimal polynomial of an algebraic element is the unique monic irreducible polynomial that vanishes at it (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Verification
By [F2], over . Its two roots are , and both lie in .
Eisenstein's criterion [F3] with the prime makes irreducible over . It is monic and vanishes at , so [F6] identifies it as the minimal polynomial; [F4] then gives the basis .
The field generated by both roots is , so [F5] identifies it as the splitting field.
The splitting field of over is with
Example
Let and . The roots of are , and its splitting field over is . It is spanned over by at most root monomials.
Facts & Assumptions
Given: The polynomial , the positive real root , and .
Positive real cube roots and square roots exist with the defining power equations (Existence and uniqueness of -th roots: a unique with , Square roots exist: a unique with ; the positives are ).
The complex numbers form a field with and the usual coordinate arithmetic ( is a field, every element is uniquely , and every nonzero element has inverse ).
Once one nonzero root of is fixed, all roots are for the th roots of unity (After adjoining one nonzero root of , all roots are with ).
A degree- polynomial has a splitting field spanned by at most root monomials (A degree- polynomial has a splitting field spanned over by at most explicit root monomials).
Eisenstein's criterion applies over to the stated integer divisibility hypotheses (Eisenstein criterion over the integers).
Any two splitting fields of a nonzero polynomial are isomorphic by an isomorphism fixing the base field (Any two splitting fields of a polynomial are isomorphic over the base field).
Verification
By [F1], and . Using [F2], direct calculation gives , , and . Hence the cube roots of unity are exactly .
By [F3], the roots of are exactly . They generate because is a root and , with . Hence this field is the splitting field.
Eisenstein at makes irreducible over . Independently, [F4] gives a splitting field spanned by at most root monomials; an isomorphism from it to supplied by [F6] fixes and carries roots to roots by direct evaluation, so it transports that spanning family to one of the stated kind here.
The splitting field of over is
Example
The polynomial has roots and , so its splitting field over is .
Facts & Assumptions
Given: The polynomial .
The real number has a square root with square (Square roots exist: a unique with ; the positives are ).
The complex numbers form a field containing with ( is a field, every element is uniquely , and every nonzero element has inverse ).
A splitting field is the field generated over the base by all roots of the polynomial (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
Verification
Over , direct multiplication gives . By [F1] and [F2], the first factor has roots and the second has roots .
All four roots lie in . Conversely, the field generated by them contains and , so it is exactly . The claim follows from [F3].
The splitting field of over is
Example
The splitting field over of the family is .
Facts & Assumptions
Given: The family .
The nonnegative real numbers and have square roots with the defining square equations (Square roots exist: a unique with ; the positives are ).
The splitting field of a product inside a common extension is the composite of the splitting fields of its two factors (Inside a common extension, the splitting field of is the composite of the splitting fields of and ).
A finite family has the same splitting field as the product of its nonzero members (Every finite family of nonzero polynomials has a splitting field, obtained from their product).
A splitting field is the field generated over the base by all roots of a polynomial that splits there (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
Verification
By [F1], the roots of are , so [F4] makes its splitting field . Similarly the splitting field of is .
Their composite is the smallest field containing both, namely . By [F2] it splits the product, and by [F3] it is the splitting field of the stated family.
Over , has two distinct roots, each repeated, in its four-element splitting field
Example
Over , The polynomial is irreducible. If is one of its roots, the four-element field is the splitting field, and the two distinct roots and each occur with multiplicity two in , meaning that their linear factors have exponent two in its factorisation.
Facts & Assumptions
Given: The polynomial .
The ring is the field (For every prime , the two operations on make it a field).
A quadratic over a field is irreducible exactly when it has no root in the field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).
For monic irreducible of degree , the quotient is a field whose elements have unique form , and is a root of ( for monic irreducible is a field extension containing the root with unique reduced representatives).
A root is repeated when divides the polynomial (Repeated roots in extension fields and separable polynomials).
A splitting field is generated by the roots of a polynomial that splits there (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
For every field , the polynomial ring is a unique factorisation domain (For every field , is a unique factorisation domain).
Verification
In characteristic , . The polynomial takes the value at both and , so [F2] makes it irreducible.
By [F3], adjoining gives a field with the four distinct elements and relation . Substituting into in characteristic also gives zero, so .
Squaring the factorisation yields . The two roots are distinct by step 1.2, and any root of the displayed product equals one of them because a field has no zero divisors. Uniqueness of factorisation in [F6] makes both displayed exponents exactly two; in particular [F4] makes both roots repeated. Finally [F5] identifies as their splitting field.
Adjoining one root need not split the polynomial: does not split
Statement refuted
If a field is obtained by adjoining one root of a polynomial, then the polynomial splits over that field.
Facts & Assumptions
Given: The real root of and the field .
For and , the roots of are (The splitting field of over is with ).
The real numbers form an ordered field, and the complex numbers have unique coordinates over (The reals form a totally ordered field, is a field, every element is uniquely , and every nonzero element has inverse ).
Counterexample
The positive real number is a root of , and every element of is real because it is obtained from rational numbers and by field operations inside .
In [F1], the imaginary part of is , while direct multiplication gives the imaginary part of as . Since , the roots and are both nonreal and hence neither lies in .
Therefore contains one root but not all roots of , so the polynomial does not split there.
FALSE: the isomorphism between two splitting fields that fixes the base field is unique
Statement
False statement. If and are splitting fields of the same polynomial over , there is exactly one isomorphism that fixes pointwise.
Facts & Assumptions
Given: The splitting field of over .
Any two splitting fields of the same nonzero polynomial are isomorphic over the base field (Any two splitting fields of a polynomial are isomorphic over the base field).
The splitting field of over is , with roots and (The splitting field of over is , with roots ).
An isomorphism of base fields extends across simple adjunctions when a chosen root is sent to a corresponding root of the transported irreducible polynomial (A base-field isomorphism extends across simple adjunctions of corresponding roots of an irreducible polynomial).
Eisenstein's criterion proves a primitive integer polynomial irreducible under its prime-divisibility hypotheses (Eisenstein criterion over the integers).
Refutation
Take both splitting fields to be for . The identity map is one -isomorphism .
The polynomial satisfies [F4] with the prime , so it is irreducible. Apply [F3] to the identity on and the corresponding roots and . It gives a -automorphism satisfying .
The roots are distinct: if , then , and multiplication by would give , contradicting . Hence is not the identity. Thus there are at least two base-fixing isomorphisms, refuting uniqueness while leaving the existence result [F1] intact.
Sources
Standard references
Recommended treatments; not extraction sources.
- T. Judson, Abstract Algebra: Theory and Applications, Section 21.2
- T. Judson, Abstract Algebra: Theory and Applications, Example 21.10
- T. Judson, Abstract Algebra: Theory and Applications, Example 21.15
- J. S. Milne, Fields and Galois Theory, Chapter 2
- T. Judson, Abstract Algebra: Theory and Applications, Corollary 21.14