Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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, S is a fixed base scheme and (Sch/S)fppf is the fppf site of Fppf coverings and the fppf site.

A presheaf of sets on (Sch/S)fppf is a contravariant functor from the category of S-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 {Ti→T}i∈I the diagram F(T)⟶∏iF(Ti)⇉∏i,jF(Ti×TTj) is an equalizer of sets (Fibre product of schemes), the two maps being the pullbacks along the two projections Ti×TTj→Ti,Tj. Equivalently, restriction identifies F(T) with the set of families (si)i∈I, si∈F(Ti), whose two pullbacks to every Ti×TTj agree (Equivalence relation, equivalence class, and the quotient set A/∼ 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 (Sch/S)fppf thus form a category. The sheafification of a presheaf F is an fppf sheaf Fa together with a morphism F→Fa such that every morphism F→G with G an fppf sheaf factors uniquely through F→Fa. 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 F(∅) to be a one-point set; this holds in particular for every representable presheaf, since Hom⁡S(∅,X) is a one-point set for every S-scheme X, because the empty scheme is initial in the category of S-schemes.

Depends on

Used by

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