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.
Quasi-separatedness and the diagonal
Statement
For a morphism of schemes the following are equivalent: the diagonal is quasi-compact; the morphism is quasi-separated; and for any affine opens lying over a common affine open of the intersection is quasi-compact. In that case each such intersection is covered by finitely many affine opens.
Facts & Assumptions
Given: A morphism and its diagonal .
A morphism is quasi-compact if is quasi-compact for every quasi-compact open of its target. A morphism is quasi-separated if for affine opens lying over a common affine open of the intersection is quasi-compact; this affine criterion is the definition used here. (Quasi-compact and quasi-separated morphisms)
A scheme is quasi-compact if its underlying space is, that is, if every open cover of has a finite subcover. (Quasi-compact and quasi-separated schemes)
Every point of a scheme has an open neighbourhood that is an affine scheme; hence the affine open subschemes form a basis of the topology. (Schemes)
Every affine scheme is quasi-compact. (Every affine scheme is quasi-compact)
For ring maps , with affine opens over an affine , . (Affine fibre products are spectra of tensor products)
If open subschemes of map into an open , then is an open subscheme of representing . (Restricting fibre products to open subschemes)
The diagonal is the unique morphism with . (The diagonal morphism)
Proof
Let be affine opens mapping into a common affine open . By [F6] the subscheme is open in and represents , an affine scheme by [F5]; and by [F7] a point satisfies exactly when , so .
The subschemes cover : given a point , let be the common image of , choose an affine open , and use [F3] to choose affine opens containing and containing ; then .
Assume quasi-compact. For affine over a common affine , the scheme is affine by step 1.1 hence quasi-compact by [F4], so is quasi-compact by [F1]. Thus is quasi-separated by [F1].
Each is the intersection of the two affine opens defining by step 1.1, hence quasi-compact by hypothesis.
Assume conversely that the stated intersection condition holds, and let be affine open. By steps 1.1 and 2.1, the affine opens cover the target. For each point of , choose such a containing it; since is affine, its distinguished opens contained in form a neighbourhood basis there. These distinguished opens cover , so [F4] gives a finite subcover with for corresponding members . By step 2.3, is quasi-compact. The inverse image of is the distinguished open defined by the pulled-back section on this quasi-compact scheme; it is quasi-compact because a quasi-compact scheme has a finite affine open cover and the distinguished open restricts to an affine distinguished open on each member of that cover.
The finite distinguished-open cover in step 3.1 pulls back to a finite open cover of by quasi-compact opens, hence is quasi-compact. Since was any affine open of , every such affine open has quasi-compact inverse image under .
Let be any quasi-compact open subscheme. Since affine opens form a basis by [F3], is covered by affine opens contained in , and quasi-compactness of extracts a finite subcover ; hence is a finite union of quasi-compact sets by step 4.1, therefore quasi-compact.
Step 5.1 shows that of every quasi-compact open is quasi-compact, so is quasi-compact by [F1]; together with step 2.2 this proves the equivalence, and the final clause follows because a quasi-compact open subscheme of a scheme is a finite union of affine opens, as used in step 5.1.
Depends on
Used by
Dependency tree · two levels
19 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, Lemma 26.21.6, printed p.40 (standard reference, not scraped)
- Vakil, The Rising Sea, Section 11.2.4, printed p.306 (standard reference, not scraped)