Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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 principal ideal domain is a unique factorisation domain

Statement

Every principal ideal domain is a unique factorisation domain.

Facts & Assumptions

Given: A PID R and the UFD definition of Unique factorisation domain, which excludes zero from the factorization clause and treats a unit as an empty product of irreducibles.

[L1]

Every principal ideal domain is Noetherian (Every principal ideal domain is Noetherian).

[L2]

In a Noetherian module, every nonempty family of submodules has a maximal member; the route from ACC to this maximal condition carries the published dependent-choice cost (Finite generation, ACC, and maximal-condition characterizations of Noetherian modules).

[L3]

Every irreducible element of a principal ideal domain is prime (Every irreducible element of a principal ideal domain is prime).

Proof

technique · contradiction
1.1

Suppose, for contradiction, that some nonzero nonunit is not a product of irreducibles. The principal ideals generated by such bad elements form a nonempty family; by [L1] and [L2], choose a maximal member (a). The element a is not irreducible, so a=bc with nonunit nonzero b,c. Then (a) is strictly contained in both (b) and (c), so maximality makes b and c products of irreducibles, and their product is a factorization of a, a contradiction. Thus every nonzero nonunit factors into irreducibles.

assume-contraL1L2choosealgebra
1.2

For uniqueness, if p1pr=q1qs are irreducible factorizations, primality of p1 from [L3] makes it divide some qj, hence the two factors are associates. Cancel them in the domain and repeat on the remaining finite product. This induction pairs every factor and shows r=s up to order and associates; the empty product is the unit case.

L3algebra
2.1

Step 1.1 gives factorization existence and step 1.2 gives the uniqueness required in the UFD definition. Therefore every PID is a UFD; the contradictory assumption in step 1.1 is discharged.

step 1.1step 1.2givendischarge-contradiction

Depends on

Used by

Dependency tree · two levels

11 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