Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-30
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.

Faithfully flat scheme morphism

Definition

Let f:X→S be a morphism of schemes (Schemes and morphisms over a base). Its underlying map of topological spaces is ∣f∣:X→S, and f is flat when it is flat at every point of X (Flat morphism of schemes).

The morphism f is faithfully flat if it is flat and the underlying map ∣f∣ is surjective. It is an fpqc morphism if it is faithfully flat and quasi-compact; this is the single-morphism form of the fpqc covering convention of Fpqc covering morphisms, and the two descriptions agree there.

Faithful flatness is therefore flatness plus a single topological condition. It is local on the target: a morphism is faithfully flat exactly when its restriction to the members of an open cover of the target is, since flatness is stalkwise and surjectivity is local on the target. A faithfully flat morphism is surjective by definition, so a morphism to a nonempty target has nonempty source; dually, the empty morphism ∅→S is faithfully flat exactly when S=∅. The identity and every open covering morphism with surjective underlying map are faithfully flat, and the empty-source case imposes no pointwise flatness condition, exactly as for flatness.

Depends on

Used by

Dependency tree · two levels

5 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