Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

K-flat complexes of abelian sheaves in the bounded-above setting

Definition

Let X be a topological space. A bounded-above cochain complex K∙ of abelian sheaves on X (Cochain complex in an abelian category, Bounded, bounded below, and bounded above complexes) is K-flat in the bounded-above sense used on this page when for every acyclic bounded-above complex F∙ of abelian sheaves, acyclicity being exactness in every degree (Exactness of a complex at a degree and acyclic complexes, Cohomology object of a cochain complex), the tensor-product total complex Tot⁡(F∙⊗ZK∙) of Tensor product of abelian sheaves and its total complex is acyclic.

This is the bounded-above variant of the K-flat complexes of the Stacks Project (Definition 26.2), restricted to the complexes between which the tensor-product total complex of Tensor product of abelian sheaves and its total complex is defined; no unbounded total complex is used on this page. The two facts that make the notion useful are proved on this page: a bounded-above complex of flat sheaves (Flat abelian sheaves) is K-flat (Flat resolutions of abelian sheaves and K-flatness of bounded-above flat complexes), and tensoring with a K-flat complex preserves quasi-isomorphisms (Quasi-isomorphism, K-flat sheaf complexes preserve quasi-isomorphisms).

Depends on

Used by

Dependency tree · two levels

29 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