Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-07
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.

Integral ideal factorisation in a number field, in ZF

Statement

Every nonzero integral ideal a of OK has a unique finite factorisation a=i=1rpiei into distinct nonzero prime ideals, with ei>0. The finite choices in this construction are least-coded finite choices, so the assertion uses no Choice.

Proof

Given: a nonzero integral ideal a.

1.1

The quotient R=OK/a is finite, so its finite ideal lattice supplies the finite list of maximal ideals; their inverse images are exactly the primes p containing a. The finite free integral lattice makes OK noetherian, its definition as an integral closure makes it integrally closed, and every nonzero prime is maximal because its quotient is a finite domain. Thus (OK)p is a DVR. Consequently a(OK)p=pep(OK)p for a unique least ep>0.

givenconstruct
2.1

Put b=pep. At every maximal ideal in the finite list, step 1.1 gives ap=bp; at any other maximal ideal both localisations are the unit ideal. Hence a=b (otherwise a maximal ideal containing the appropriate colon ideal gives a contradictory localisation). Distinct prime powers are comaximal, so the Chinese remainder theorem reassembles this finite product. Localising a second factorisation at the same finite primes forces the same exponents. The list is finite and each exponent is the least natural number with its property, so no Choice is used.

step 1.1discharge-construct

Depends on

Used by

Dependency tree · two levels

10 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