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.
Two supplied projective resolution data define naturally isomorphic left derived functors
Statement
Assume the Axiom of Dependent Choice.
Let and be supplied projective resolution data on the same domain, and let be an additive functor. For every , the additive functors and are naturally isomorphic.
Facts & Assumptions
Given: An integer .
Both constructions define additive functors (Left derived functors relative to supplied data are additive functors).
For each object, objectwise comparison of the two chosen resolutions induces an isomorphism on derived objects (Objectwise comparison of two projective resolution data induces an isomorphism on derived objects).
Those isomorphisms are natural in the object (The change-of-projective-resolution isomorphisms are natural).
Proof
By [L2], each object carries an isomorphism .
By [L3], the family from step 1.1 is natural. Together with [L1], this is exactly a natural isomorphism of additive functors .
Depends on
Used by
- An acyclic object for a right exact functor Definition
- Two resolution data and their change isomorphism Example
- Change-of-projective-resolution isomorphisms satisfy identity and cocycle laws Proposition
- Positive left derived functors vanish on projective objects Proposition
- Derived functors are well defined relative to supplied resolution data Remark
- The acyclic-resolution theorem for left derived functors Theorem
Dependency tree · two levels
17 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)