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 right derived functors vanish on injective objects
Statement
Assume the Axiom of Dependent Choice.
Let be a supplied injective resolution datum on a class and an additive functor between abelian categories. If is an injective object, then for every ,
Facts & Assumptions
Given: An injective object and an integer .
An injective resolution is a coaugmented exact complex of injectives (Injective resolutions in an abelian category).
The object is injective (Injective object).
Changing the supplied injective resolution datum changes the derived objects only by natural isomorphism (Two supplied injective resolution data define naturally isomorphic right derived functors).
The right derived object is the cohomology of the deleted chosen resolution after applying (Right derived objects relative to supplied injective resolution data).
Proof
The coaugmented complex is exact and all its terms are injective by [L2], so [L1] makes it an injective resolution of . After applying , its deleted cochain complex has only one nonzero term, namely in degree .
Let be the supplied injective resolution datum on the same domain as that agrees with away from and assigns the trivial injective resolution from step 1.1 to . By [L3], the right derived object computed from is isomorphic to the one computed from . By [L4], the complex computing is the one-term complex from step 1.1, whose cohomology is zero in every positive degree. Hence for .
Depends on
Used by
Dependency tree · two levels
18 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)