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.
The zero-th left derived functor of a right exact functor recovers the functor
Statement
Assume the Axiom of Dependent Choice.
Let be a supplied projective resolution datum on a class , and let be an additive right exact functor between abelian categories. Then for every there is a canonical isomorphism natural in .
Facts & Assumptions
Given: An object .
The chosen projective resolution of is an exact augmented complex (Projective resolutions in an abelian category).
The zeroth homology of the deleted complex is the cokernel of the boundary map into degree (Homology object of a chain complex).
Right exactness means that preserves the cokernel appearing at the end of the displayed augmented resolution (Left exact and right exact functors).
The assignments are already functorial (Left derived functors relative to supplied data are additive functors).
Proof
By [L1], the morphism is exact. Applying and using [L3] gives an exact sequence Hence is the cokernel of .
By [L2], that same cokernel is exactly . Therefore there is a canonical isomorphism .
The construction in steps 1.1 and 2.1 is functorial in , and [L4] already supplies the functoriality of . Thus the isomorphism is natural in .
Depends on
Used by
- L₀ of a non-right-exact functor need not recover the functor Counterexample
- A balanced derived bifunctor Definition
- The left derived functors of an exact functor Example
- FALSE: every additive functor has L₀ naturally isomorphic to itself False statement
- The acyclic-resolution theorem for left derived functors Theorem
Dependency tree · two levels
21 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
- Joseph J. Rotman, An Introduction to Homological Algebra, 2nd ed. (standard reference, not scraped)