Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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.

Ideals in a DVR are powers of the maximal ideal

Statement

Let V be a discrete valuation ring with maximal ideal m=(π), where π is a uniformiser. Then every nonzero ideal I⊆V is of the form I=(πn)=mn for a unique integer n≥0.

Facts & Assumptions

Given: A discrete valuation ring V with maximal ideal m=(π), where π is a uniformiser.

[L1]

Every nonzero element of the fraction field of V is uniquely uπn with u a unit and n∈Z (Every nonzero fraction is a unit times a power of a uniformiser).

[F1]

A uniformiser generates the maximal ideal of a DVR (Uniformising parameters).

Proof

technique · direct
1.1L1givenchoose

Let I≠0 be an ideal of V. Because I⊆V, every nonzero element of I has valuation in Z≥0. Choose x∈I∖{0} with minimal valuation n. By [L1], x=uπn for a unit u, so πn=u−1x∈I.

2.1L1F1step 1.1

If y∈I is nonzero, then [L1] gives y=u′πm for some unit u′ and m≥0. Minimality of n yields m≥n, so y=u′πm−nπn∈(πn). Thus I⊆(πn), while step 1.1 gave (πn)⊆I. Hence I=(πn). Since [F1] gives m=(π), this is also mn.

3.1step 2.1algebra∎

If (πn)=(πm), then πn∈(πm) and πm∈(πn), so n≥m and m≥n. Therefore n=m, and the exponent is unique.

Depends on

Used by

Dependency tree · two levels

4 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