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.
Descent data for schemes over an fppf covering
Definition
Let be an fppf covering of an -scheme (Fppf coverings and the fppf site, Schemes and morphisms over a base), and put (Fibre product of schemes). Write and for the projections, and for the projection of any of these fibre products to .
A descent datum for schemes relative to this covering is a family of -schemes (Morphisms of schemes) together with isomorphisms over , one for each ordered pair , satisfying the cocycle condition over , where the pullbacks are taken along the displayed projections of and the composites are computed in the category of schemes over . The condition is stated for all ordered triples and includes the case ; the identity structure of the fibre products identifies the pullbacks unambiguously.
A morphism of descent data is a family of -morphisms compatible with the isomorphisms, i.e. over every .
The descent datum is effective when there is an -scheme together with isomorphisms over for all whose pullbacks to every agree with the through the canonical identifications . Equivalently, the datum is effective precisely when it lies in the essential image of the base-change functor . Descent data and their morphisms form a category in the evident way, with composition componentwise.
Depends on
Used by
Dependency tree · two levels
10 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 35 (Descent), Section 35.34 (standard reference, not scraped)
- Angelo Vistoli, Notes on Grothendieck topologies, fibered categories and descent theory (arXiv:math/0412512) (standard reference, not scraped)