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.
A valuation overring has a center
PDF p. 4: Finite valuative dimension
Statement
Let be a domain and a valuation overring in . Then is local, meaning it has a unique maximal ideal , and if , the inclusion extends to a local inclusion . Here local means that the inverse image of the maximal ideal of is the maximal ideal of .
Facts & Assumptions
Given: A domain and a valuation overring in its fraction field.
Goal: Construct its center and the stated local inclusion.
For each nonzero , either or lies in . Valuative dimension and degreewise bounded towers
Proof
Let be the set of nonunits of . If is a nonunit and , then cannot be a unit, since an inverse of would give an inverse of . If nonunits have nonzero sum, [F1] gives either or when both are nonzero; in the first case is a nonunit, and similarly in the second. The zero cases are immediate. Thus is a proper ideal, and every element outside it is a unit. It is consequently the unique maximal ideal; it is prime because a product that is a unit has unit factors.
Its inverse image in is prime. Every element of maps to a unit of , so the inclusion extends by fractions to . It is injective because both rings embed in . A fraction with maps into exactly when , proving locality.
Depends on
Dependency tree · 3 levels
Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.