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.
FALSE: every additive functor has L_0 naturally isomorphic to itself
Statement
Every additive functor has naturally isomorphic to .
Facts & Assumptions
Given: The additive functor on abelian groups, and supplied projective resolution data on a class containing that assigns it the standard resolution below.
If is right exact, the zero-th left derived functor recovers naturally (The zero-th left derived functor of a right exact functor recovers the functor).
Left derived objects are computed from the homology of an applied deleted projective resolution (Left derived objects relative to supplied projective resolution data).
Additivity means preservation of sums on hom-groups (Additive functor).
Refutation
The functor is additive by [L3], but it is enough to compute its value on the standard projective resolution Applying to the deleted resolution gives and both displayed Hom groups are .
Therefore , while . So is not naturally isomorphic to for this supplied datum and additive functor. Thus additivity alone does not guarantee recovery; [L1] records right exactness as a sufficient hypothesis, and the displayed claim is false.
Depends on
Used by
- L₀ of a non-right-exact functor need not recover the functor Counterexample
Dependency tree · two levels
12 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)