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.
Derived category of an abelian category
Definition
Let be an abelian category. We use cochains as in Cochain complex in an abelian category, with and . Thus . The cochain category is the reindexed published homotopy category. Put
Likewise initially mean the localizations of the termwise bounded variants of Bounded, bounded below, and bounded above complexes. Roof morphisms exist by Quasi isomorphisms admit the roof calculus in the homotopy category and The calculus of fractions constructs the localization under its standing size hypothesis: a small category of complexes, or supplied small cofinal denominator families. Every assertion of Hom sets is under that hypothesis. In the bounded module models, supplied replacements will separately exhibit those Hom sets. No general local-smallness theorem for unbounded is asserted.
The cone convention is , , and its triangle ends in .
Depends on
Used by
- Localized cone triangles satisfy tr one through tr three Lemma
- Bounded derived localizations embed fully faithfully Proposition
- Cohomology factors through the derived category Proposition
- Morphisms from a homotopically projective complex need no roof Proposition
- Morphisms into a homotopically injective complex need no roof Proposition
- The localization functor sends quasi isomorphisms to isomorphisms Proposition
Dependency tree · two levels
16 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
- 13.11.1–13.11.6 (standard reference, not scraped)