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.
Formally unramified morphism
Definition
Let be a morphism of schemes (Morphisms of schemes, Schemes and morphisms over a base).
Square-zero thickenings. A square-zero thickening of a scheme is a closed immersion (Closed immersions of schemes) whose ideal sheaf (Ideal sheaves) satisfies , meaning that the product of any two local sections of over a common open set is zero. Such a thickening is an -thickening when is an -scheme and is an -morphism.
Formally unramified. The morphism is formally unramified if for every commutative diagram of schemes
in which is a square-zero thickening and the square is over — that is, and are compatible with — there is at most one -morphism whose restriction to is . In other words, two -morphisms agreeing on a square-zero closed subscheme agree everywhere.
The condition is a uniqueness condition only: no existence is required, no finite-type, finite-presentation, flatness or separatedness hypothesis is imposed on , and the test thickenings are required to be square-zero but are otherwise arbitrary, in particular not assumed to be affine or of finite type over . For the affine case , with induced by , the condition is the algebraic one: for every -algebra with an ideal satisfying , two -algebra maps that agree modulo are equal.
Depends on
Used by
- Formally etale morphism Definition
- Unramified morphism Definition
- Formal unramifiedness iff Omega vanishes Theorem
Dependency tree · two levels
7 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
- Stacks Algebra, Definition 10.148.1 (tag 00UM) and Stacks More on Morphisms, Section 37.6 (tag 02G3) (standard reference, not scraped)