Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-13
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 F and every nonzero polynomial fF[x], there exists a splitting field of f over F.

Facts & Assumptions

Given: A field F and a nonzero polynomial fF[x].

[F1]

Strong induction permits proving a property at degree n from all smaller degrees (Strong (complete) induction).

[F2]

A positive-degree polynomial has a root α in an extension such that, for K=F(α), it factors in K[x] as (xα)g with degg=degf1 (Kronecker's one-root step: adjoining a root removes a linear factor and lowers the remaining degree).

[F3]

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

technique · strong induction on degree
1.1

Let P(n) assert the theorem for every field and every nonzero polynomial of degree n. We prove P(n) for all n by [F1].

F1
1.2

If n=0, the polynomial is a nonzero constant. It splits over F, and its empty root set generates F, so F itself is a splitting field.

F3base
1.3

Let n1 and assume P(m) for every m<n. By [F2], choose a root α, put K=F(α), and choose gK[x] with f=(xα)g and degg=n1<n.

F2ih
2.1

The induction hypothesis over the field K gives a splitting field L/K of g. Then f splits over L by [F2], and L=K(roots of g)=F(α,roots of g) is generated over F by roots of f. Thus L/F is a splitting field of f.

F2F3step 1.3ih
3.1

Steps 1.2, 1.3, and 2.1 verify the strong-induction hypothesis at every n, so [F1] proves the theorem.

F1step 1.1step 1.2step 1.3step 2.1discharge-induction

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 60 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources