Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

Assuming Choice, every field has an algebraic extension containing roots of all nonconstant base polynomials

Statement

Assume the Axiom of Choice. For every field F there is an algebraic extension L/F such that every nonconstant polynomial in F[x] has a root in L. The construction uses Zorn's lemma to place Artin's proper ideal inside a maximal ideal.

Facts & Assumptions

Given: A field F, the set S of its monic nonconstant polynomials, A=F[xf:f∈S], and I=(f(xf):f∈S).

[L2]

Assuming Choice, every proper ideal of a nonzero commutative ring is contained in a maximal ideal (In a nonzero commutative ring, every proper ideal is contained in a maximal ideal).

[L3]

The quotient of a commutative ring by a maximal ideal is a field (R/M is a field if and only if M is a maximal ideal).

[L4]

If a1,…,ar are algebraic over F, then F(a1,…,ar)/F is finite (An extension generated by finitely many algebraic elements is finite).

[L5]

Assuming Choice, a nonempty poset whose chains have upper bounds has a maximal element (Zorn's lemma).

[L6]

Every finite field extension K/F is algebraic: each a∈K is a root of a nonzero polynomial in F[t] (Every finite field extension is algebraic).

Proof

technique · constructive
1.1L1L2L5choose

By [L1] and the maximal-ideal theorem [L2], whose choice step is Zorn's lemma [L5], choose a maximal ideal M of A containing I.

2.1step 1.1L3construct

Put L=A/M. By [L3] this is a field. The composite F→A→L is injective, since a nonzero scalar in M would be a unit and force 1∈M, so it identifies F with a subfield of L.

3.1step 1.1step 2.1algebra

For each f∈S, the residue xf‾∈L satisfies f(xf‾)=0 because f(xf)∈I⊆M. Multiplying an arbitrary nonconstant polynomial by the inverse of its leading coefficient makes it monic without changing its roots, so every nonconstant polynomial over F has a root in L.

4.1step 2.1step 3.1L4L6

Every element of L is represented by a polynomial involving finitely many variables xf1,…,xfr, hence lies in F(xf1‾,…,xfr‾). Each residue is algebraic over F, so [L4] makes this subextension finite and [L6] makes it algebraic. Thus L/F is algebraic.

5.1step 1.1step 3.1step 4.1discharge-construct∎

The field L constructed above is the required algebraic root extension, and the only choice principle used is the maximal-ideal application in step 1.1.

Depends on

Used by

Dependency tree · two levels

28 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