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.
Positive left derived functors vanish on projective objects
Statement
Assume the Axiom of Dependent Choice.
Let be a supplied projective resolution datum on a class and an additive functor between abelian categories. If is a projective object, then for every ,
Facts & Assumptions
Given: A projective object and an integer .
Every projective object admits a length-zero projective resolution (A projective object has a length-zero projective resolution).
Changing the supplied projective resolution datum changes the derived objects only by natural isomorphism (Two supplied projective resolution data define naturally isomorphic left derived functors).
The left derived object is the homology of the deleted chosen resolution (Left derived objects relative to supplied projective resolution data).
Proof
By [L1], the object has a projective resolution concentrated in degree . Its deleted complex therefore has only one nonzero term, namely in degree .
Let be the supplied projective resolution datum on the same domain as that agrees with away from and assigns the length-zero resolution from step 1.1 to . By [L2], the derived object computed from is isomorphic to the one computed from . By [L3], the deleted resolution in is the one-term complex from step 1.1, whose homology is zero in every positive degree. Hence for .
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
- Romyar Sharifi, Homological Algebra (standard reference, not scraped)