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 exact functor has vanishing positive derived functors
Statement
Let be a supplied projective resolution datum on a class , let be a supplied injective resolution datum on a class , and let be an exact functor between abelian categories. Then for every and every , and for every and every ,
Facts & Assumptions
Given: An integer , an object , and an object .
The left and right derived objects are the homology or cohomology of the deleted chosen resolutions after applying (Left derived objects relative to supplied projective resolution data, Right derived objects relative to supplied injective resolution data).
Exact functors commute with homology of chain complexes (An exact functor commutes with homology).
Exactness means that is exact on both the projective and injective resolution complexes (Exact functor between abelian categories).
Proof
The deleted projective resolution of is exact in every positive degree. By [L3], applying preserves that exactness, so the resulting chain complex has zero homology in every positive degree. Using [L1], this says for .
Read the deleted injective resolution of as a reindexed chain complex. It is exact in every positive cohomological degree, and [L3] preserves that exactness after applying . By [L2], the resulting homology, hence cohomology, is zero in every positive degree. Therefore for .
Steps 1.1 and 1.2 prove the claimed vanishing on both sides.
Depends on
Used by
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)