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.
Separated morphism of schemes
Definition
Let be a morphism of schemes and let be its diagonal morphism (The diagonal morphism).
- is separated if is a closed immersion (Closed immersions of schemes).
- is quasi-separated if is a quasi-compact morphism (Quasi-compact and quasi-separated morphisms).
A scheme is called separated, respectively quasi-separated, when the structure morphism is separated, respectively quasi-separated. The affine-intersection condition recorded under Quasi-compact and quasi-separated morphisms is the earlier definition; its equivalence to quasi-compactness of is proved in Quasi-separatedness and the diagonal on this page. Both properties are properties of the morphism and of its diagonal, and neither is a condition on the point-set topology of alone.
Depends on
Used by
- Separated S-scheme Definition
- Valuative uniqueness diagram Definition
- Affine morphisms are separated Lemma
- Closed graphs over separated targets Lemma
- Monomorphisms and diagonals Lemma
- Open and closed immersions are separated Lemma
- Separated morphisms compose Lemma
- Separatedness implies valuative uniqueness Lemma
- Separatedness is local on the base Lemma
- Separatedness survives base change Lemma
- The relative projective-space diagonal is closed Lemma
- Separated is not Zariski Hausdorff Remark
- Affine-overlap criterion for separatedness Theorem
- Equalizers into separated schemes are closed Theorem
- Valuative uniqueness detects separatedness Theorem
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
- The Stacks Project, Schemes, Definition 26.21.3 (tag 01KK), printed p.40 (standard reference, not scraped)