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.
One-step extension of a partial injective resolution
Statement
Let be a coaugmented cochain complex that is exact at every displayed term except possibly at . Let be the cokernel of the previous displayed map, so and for .
If is a monomorphism into an injective object , then composing the quotient map with extends the complex by one term and makes it exact at .
Facts & Assumptions
Given: The displayed partial coaugmented complex and a chosen monomorphism with injective.
Exactness at a degree means that the image of the incoming map equals the kernel of the outgoing map (Exactness of a complex at a degree and acyclic complexes).
A coaugmented cochain complex records the extra map from the resolved object (Coaugmented cochain complexes under an object).
Injective objects are the allowable terms in an injective resolution (Injective object).
Proof
Let be the cokernel map and define the new differential by Since kills the image of the previous displayed map, the composite of that previous map with is zero, so the extended row is again a coaugmented cochain complex in the sense of [L2].
Because is monic, the kernel of is the kernel of , namely the image of the previous displayed map. By [L1], this is exactly the required exactness at . The new term is injective by the given hypothesis and [L3].
Depends on
Used by
Dependency tree · two levels
9 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 (standard reference, not scraped)
- Romyar Sharifi, Homological Algebra (standard reference, not scraped)