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.
Negative derived degrees vanish for one-sided resolutions
Statement
Let and be supplied projective and injective resolution data, and let be an additive functor.
If , then for every object in the common domain,
Facts & Assumptions
Given: An object and an integer .
The object is the homology of the deleted projective resolution in degree (Left derived objects relative to supplied projective resolution data).
The object is the cohomology of the deleted injective resolution in degree (Right derived objects relative to supplied injective resolution data).
Proof
By [L1], the complex computing is zero in every negative degree, because a deleted projective resolution is supported only in nonnegative homological degrees. Therefore both its degree- cycle object and its degree- boundary object are zero, so .
By [L2], the cochain complex computing is zero in every negative cohomological degree, because a deleted injective resolution begins in degree . Hence its degree- cocycle and coboundary objects are zero, so .
Steps 1.1 and 1.2 prove the claimed vanishing for both one-sided derived constructions.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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)