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 coverings and the fppf site

Definition

Fix a base scheme S (Schemes, Schemes and morphisms over a base). An fppf covering of an S-scheme T is a family {Ti→T}i∈I of morphisms of S-schemes (Morphisms of schemes) such that each Ti→T is flat (Flat morphism of schemes) and locally of finite presentation (Locally finite presentation morphisms), and the images of the underlying maps ∣Ti∣→∣T∣ cover T. The fppf site (Sch/S)fppf is the category of S-schemes with the pretopology whose coverings of T are the fppf coverings of T, with the identity refinements and the usual composition of coverings of an fppf topology.

The covering condition is a topological surjectivity condition on the index family together with the two morphism properties; the index set I need not be finite. The images may overlap. The maps need not be open immersions. We work inside one fixed big fppf site of S-schemes; nothing below uses size questions beyond those conventions.

Three standard properties are used constantly and are recorded here with their proofs. First, a Zariski open cover is an fppf covering (Open immersions of schemes): an open immersion is flat and locally of finite presentation, and its underlying map is an open topological embedding, so the images of the members of an open cover of T cover T. Second, fppf coverings are stable under base change: for a morphism T′→T the base-changed family {Ti×TT′→T′} is fppf, because flatness and local finite presentation are stable under base change and images of the base-changed maps still cover T′ (Fibre product of schemes). Third, fppf coverings are stable under composition: if {Ti→T}i∈I is fppf and {Tij→Ti}j∈Ji is fppf for every i, then the composites {Tij→T} form an fppf covering of T, because a composite of flat morphisms is flat, a composite of locally finitely presented morphisms is locally of finite presentation, and the images of the composites cover T by the covering property of the two families together.

No choice principle is used to state the definition or its consequences: a covering is a single family of morphisms, and the stability assertions are element-wise. A covering may be indexed by an empty set only when the target T is empty, in which case the covering condition is vacuous.

Depends on

Used by

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