Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-27
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.

Valuative uniqueness diagram

Definition

Let f:X→S be a morphism of schemes. A valuative diagram for f consists of a valuation ring R⊆K with fraction field K (Valuation rings, The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain) together with a morphism Spec⁡K→X and a morphism Spec⁡R→S whose composite with Spec⁡K→Spec⁡R is f∘(Spec⁡K→X); that is, the square Spec⁡K⟶X↓↓fSpec⁡R⟶S commutes. Call Spec⁡K→X the generic map of the diagram. A lift of the diagram is a morphism Spec⁡R→X making both triangles commute.

The morphism f satisfies the uniqueness part of the valuative criterion if every valuative diagram for f has at most one lift, and the existence part if every valuative diagram for f has at least one lift. The two quantifiers are separate: uniqueness asserts nothing when no lift exists, and existence asserts nothing about the number of lifts.

The criterion is stated for all valuation rings, all fraction fields, all specializations of the closed point, and all prescribed extensions of residue fields implicit in the choice of the generic map; nothing restricts R to discrete valuation rings, to Noetherian rings or to finite-type situations. Separatedness of f is a property of the morphism alone, whereas a valuative diagram involves chosen maps from the spectra of R and K; the two are compared by the lemmas and the theorem following on this page.

Depends on

Used by

Dependency tree · two levels

9 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