DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04
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.
An F-acyclic resolution
Definition
Let be an additive functor between abelian categories.
- If is left exact and is a supplied injective resolution datum on a class , an -acyclic resolution of relative to is a coaugmented exact complex such that every lies in and is -acyclic in the sense of An acyclic object for a left exact functor.
- If is right exact and is a supplied projective resolution datum on a class , an -acyclic resolution of relative to is an augmented exact complex such that every lies in and is -acyclic in the sense of An acyclic object for a right exact functor.
Thus the phrase keeps both the resolution orientation and the chosen supplied datum visible.
Depends on
Used by
- Adapted classes compute derived functors Corollary
- An acyclic resolution that is not an injective resolution Example
- FALSE: an acyclic resolution is the same thing as an injective resolution False statement
- Compact-support calculus along open and closed embeddings Lemma
- Global sections on module sheaves have ordinary sheaf cohomology as derived functors Lemma
- Injective modules are flasque and Ext from the structure sheaf is cohomology Lemma
- Tor with the trivial module is computed by the weak BGG resolution Lemma
- Sheaves of smooth-function modules are cohomologically acyclic Theorem
- The acyclic-resolution theorem for left derived functors Theorem
- The acyclic-resolution theorem for right derived functors Theorem
Dependency tree · two levels
14 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
- Charles A. Weibel, An Introduction to Homological Algebra, Chapter 2 `Derived Functors` (standard reference, not scraped)