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: an acyclic resolution is the same thing as an injective resolution
Statement
An acyclic resolution is the same thing as an injective resolution.
Facts & Assumptions
Given: The identity functor on abelian groups, a supplied projective resolution datum on a class containing the free abelian groups, and the standard free resolution
An -acyclic resolution only requires a correctly oriented exact resolution by -acyclic objects (An F-acyclic resolution).
Exact functors have vanishing positive derived functors on every object, so every object is acyclic for the identity functor (An exact functor has vanishing positive derived functors).
Injective objects are characterized by an extension property across monomorphisms (Injective object).
Refutation
The identity functor is exact, so [L2] makes every object in the domain of Id-acyclic. The terms of the displayed free resolution are free abelian groups, hence lie in that domain. Therefore [L1] identifies the displayed free resolution of as an Id-acyclic resolution relative to .
The term in that resolution is not injective: the inclusion and the map into admit no extension . Thus [L3] fails. So an -acyclic resolution need not be an injective resolution, and the displayed claim is false.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Charles A. Weibel, An Introduction to Homological Algebra, Chapter 2 `Derived Functors` (standard reference, not scraped)