Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-03
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 Euclidean domain is a principal ideal domain

Statement

Every Euclidean domain is a principal ideal domain.

Facts & Assumptions

Given: A Euclidean domain R with Euclidean function δ, and an ideal I⊴R.

[L1]

Euclidean division gives a=bq+r with r=0 or δ(r)<δ(b) whenever b≠0 (Euclidean domain and Euclidean function).

[L2]

An ideal is an additive subgroup closed under multiplication by arbitrary ring elements (Left, right and two-sided ideals).

[L3]

The principal ideal (d) is the ideal generated by d (The ideal generated by a subset and principal ideals).

[L4]

Every nonempty subset of N has a least element (The well-ordering principle).

[L5]

A PID is an integral domain whose every ideal is principal (Principal ideal domain).

Proof

technique · direct
1.1

If I={0}, then I=(0) and is principal.

L3
1.2

Suppose I≠{0}. The set {δ(x):x∈I∖{0}} is nonempty, so choose d∈I∖{0} whose δ-value is least.

L4givenchoose
2.1

For a∈I, divide by d: a=dq+r with r=0 or δ(r)<δ(d). Since r=a−dq∈I, minimality in step 1.2 excludes a nonzero r; hence r=0.

step 1.2L1L2given
3.1

Step 2.1 gives a=dq∈(d) for every a∈I, so I⊆(d). Conversely d∈I and ideal closure give dq∈I for every q∈R, so (d)⊆I. Thus I=(d).

step 2.1L2L3given
4.1

Every ideal is principal by step 1.1 or step 3.1; therefore R is a PID.

step 1.1step 3.1L5∎

Depends on

Used by

Dependency tree · two levels

17 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