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.
Every nonzero polynomial over a field has a splitting field
Statement
For every field and every nonzero polynomial , there exists a splitting field of over .
Facts & Assumptions
Given: A field and a nonzero polynomial .
Strong induction permits proving a property at degree from all smaller degrees (Strong (complete) induction).
A positive-degree polynomial has a root in an extension such that, for , it factors in as with (Kronecker's one-root step: adjoining a root removes a linear factor and lowers the remaining degree).
A splitting field is an extension over which the polynomial splits and which is generated by all its roots; a nonzero constant splits over the base field (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
Proof
Let assert the theorem for every field and every nonzero polynomial of degree . We prove for all by [F1].
If , the polynomial is a nonzero constant. It splits over , and its empty root set generates , so itself is a splitting field.
Let and assume for every . By [F2], choose a root , put , and choose with and .
The induction hypothesis over the field gives a splitting field of . Then splits over by [F2], and is generated over by roots of . Thus is a splitting field of .
Steps 1.2, 1.3, and 2.1 verify the strong-induction hypothesis at every , so [F1] proves the theorem.
Depends on
- Kronecker's one-root step: adjoining a root removes a linear factor and lowers the remaining degree
- Strong (complete) induction
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- $F[x]/(p)$ for monic irreducible $p$ is a field extension containing the root $x+(p)$ with unique reduced representatives
Used by
- Every finite family of nonzero polynomials has a splitting field, obtained from their product Corollary
- For monic f,g of degrees n,m, Res(f,g)=(-1)ᵐⁿRes(g,f) Corollary
- The cyclotomic extension K(μₙ) as a splitting field of tⁿ-1 Definition
- If a is not a pth power in a characteristic-p field, then x^pⁿ-a is irreducible for every n≥1 Lemma
- If p is a prime not dividing n, a rational minimal polynomial of a primitive n-th root of unity also kills its p-th power Lemma
- Minimal polynomials of integral elements over an integrally closed domain have coefficients in the domain Lemma
- The one-step root condition makes an algebraic extension of a perfect field algebraically closed Lemma
- An algebraic extension that is a splitting field of a polynomial is normal Proposition
- For every n≥1 there are infinitely many primes p with p≡1 (mod n) Theorem
- For every prime p and n≥1, a field with pⁿ elements exists Theorem
- For monic f, Res(f,g)=∏ᵢ g(αᵢ) and it vanishes exactly when f and g have a common root Theorem
- K(μₘ)K(μₙ)=K(μ_lcm(m,n)) Theorem
- ℚ(μₘ)∩ℚ(μₙ)=ℚ(μ_gcd(m,n)) Theorem
- The recursion defines a unique monic Φₙ∈ℤ[t], of degree φ(n) Theorem
- tⁿ-1 is separable over K exactly when the characteristic does not divide n, and then a splitting field carries n distinct n-th roots of unity Theorem
- Φₙ is irreducible in ℚ[t] for every n≥1 Theorem
Dependency tree · two levels
18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- T. Judson, Abstract Algebra: Theory and Applications, Theorem 21.11 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, Chapter 2 (standard reference, not scraped)