Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

The principal-divisor exact sequence for a Dedekind domain

Statement

Assume the Axiom of Choice.

Let R be a Dedekind domain with fraction field K. Then the valuation maps fit into an exact sequence

0R×K×divDiv(R)clCl(R)0,

where

div(x)=pvp((x))[p]

and

cl ⁣(pnp[p])=[ppnp].

Facts & Assumptions

Given: The Axiom of Choice and a Dedekind domain R with fraction field K.

[F1]

The divisor group is the free abelian group on the nonzero prime ideals (The divisor group of a Dedekind domain).

[F2]

The class group is the quotient of nonzero fractional ideals by principal fractional ideals (The ideal class group).

[F3]

The integer vp(I) is defined by the equality Ip=pvp(I)Rp (Prime-ideal valuations on fractional ideals).

[L1]

Nonzero fractional ideals factor uniquely into finite products of prime powers (Unique factorization of nonzero fractional ideals into prime powers).

[L2]

The class-group quotient is well defined (The ideal class group quotient is well defined).

Proof

technique · direct
1.1

The map cl is well defined and surjective: by [L1], every divisor is a finite sum and therefore determines a unique fractional ideal pnp, and every ideal class has such a representative.

F1F2L1L2
1.2

If xK×, then [L1] applied to the principal fractional ideal (x) gives

(x)=ppvp((x)).

Therefore cl(div(x))=[(x)]=0 in Cl(R). So im(div)ker(cl).

F2F3L1
1.3

Conversely, if D=np[p] satisfies cl(D)=0, then the ideal pnp is principal, say equal to (x) with xK×. Uniqueness in [L1] then forces D=div(x). Thus ker(cl)=im(div).

F2F3L1L2
2.1

If xR×, then (x)=R, so all valuations of (x) are zero and div(x)=0. Conversely, if div(x)=0, then [L1] gives (x)=R, which is exactly the statement that x is a unit of R. Hence ker(div)=R×.

F3L1step 1.2
3.1

Steps 1.1, 1.2, 1.3, and 2.1 prove exactness of the displayed sequence.

step 1.1step 1.2step 1.3step 2.1

Depends on

Used by

Dependency tree · two levels

13 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