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.
Fppf sheaves of sets and sheafification
Definition
Throughout, is a fixed base scheme and is the fppf site of Fppf coverings and the fppf site.
A presheaf of sets on is a contravariant functor from the category of -schemes to the category of sets (Presheaves, covariantly and contravariantly representable functors, and representations, Covariant functor, identity functor, composite functor, and contravariant functor); the associated representable presheaf of a scheme is the contravariant functor it represents. It is an fppf sheaf when for every fppf covering the diagram is an equalizer of sets (Fibre product of schemes), the two maps being the pullbacks along the two projections . Equivalently, restriction identifies with the set of families , , whose two pullbacks to every agree (Equivalence relation, equivalence class, and the quotient set for the underlying set-theoretic relation); the two descriptions agree because an equalizer in sets consists of the elements on which the two maps coincide.
A morphism of presheaves is a natural transformation (Natural transformation and its components); the presheaves on thus form a category. The sheafification of a presheaf is an fppf sheaf together with a morphism such that every morphism with an fppf sheaf factors uniquely through . When it exists it is unique up to unique isomorphism, by the usual universal property; in this library its existence is established separately for the presheaves used below. A representable presheaf is an fppf sheaf (Scheme morphisms satisfy fppf descent), under the Axiom of Choice recorded there, since fppf descent for morphisms of schemes is effective.
All sheaves below are set-valued unless stated otherwise. The empty family is an fppf covering of the empty scheme, so for a sheaf the sheaf condition on that covering forces to be a one-point set; this holds in particular for every representable presheaf, since is a one-point set for every -scheme , because the empty scheme is initial in the category of -schemes.
Depends on
- Fppf coverings and the fppf site
- Presheaves, covariantly and contravariantly representable functors, and representations
- Covariant functor, identity functor, composite functor, and contravariant functor
- Natural transformation and its components
- Equivalence relation, equivalence class, and the quotient set $A/{\sim}$
- Fibre product of schemes
- Scheme morphisms satisfy fppf descent
Used by
- Algebraic spaces over a scheme, defined as fppf sheaves Definition
- Descent data, prestacks and stacks in groupoids over the fppf site Definition
- Morphisms representable by algebraic spaces Definition
- Representable morphisms of presheaves and fibrewise properties Definition
- The fppf quotient sheaf of a pre-relation Definition
- The rigidified relative Picard functor and the dual abelian variety Definition
- Every representable functor is an algebraic space Lemma
- Flat locally finitely presented restrictions give open subquotients Lemma
- Gluing algebraic spaces along open subfunctors Lemma
- Hilbert divisor charts and the Picard diagonal Lemma
- Sheafification exists for the fppf site Lemma
- Surjective etale maps from schemes give presentations Lemma
Dependency tree · two levels
30 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, Chapter 34 (Topologies on Schemes), Section 34.7 and Chapter 35 (Descent) (standard reference, not scraped)
- Angelo Vistoli, Notes on Grothendieck topologies, fibered categories and descent theory (arXiv:math/0412512) (standard reference, not scraped)