Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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.

Flat abelian sheaves

Definition

Let X be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). A sheaf F of abelian groups on X is flat when its stalk Fx is a flat Z-module for every x∈X (Left and right flat modules over an arbitrary ring with R=Z and additive notation, so that −⊗ZFx is exact).

Equivalently, by Stalks, coproducts and right exactness of the abelian sheaf tensor product and Tensor product of abelian sheaves and its total complex, flatness of F means that the functor −⊗ZF on abelian sheaves is exact; the equivalence with exactness of F⊗Z− is proved in Flatness criteria and canonical epimorphisms from flat abelian sheaves.

A bounded-above complex F∙ of abelian sheaves (Bounded, bounded below, and bounded above complexes) is a complex of flat sheaves when each term Fn is flat; the bounded-above complexes of flat sheaves are exactly the source of the flat resolutions constructed on this page. Since a stalk is a filtered colimit (The stalk of a presheaf at a point), flatness is a stalk-local condition, and the zero sheaf is flat because its stalks are the zero modules.

Depends on

Used by

Dependency tree · two levels

34 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