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 horseshoe construction stays short exact after applying a right exact functor
Statement
Assume the Axiom of Dependent Choice.
Let be a right exact functor between abelian categories, and let be a short exact sequence in . If is a horseshoe short exact sequence of projective resolutions of , then is a short exact sequence of complexes in .
Facts & Assumptions
Given: A horseshoe short exact sequence of projective resolutions over .
A right exact functor is additive (A left or right exact functor between abelian categories is automatically additive).
The horseshoe lemma produces a degreewise split short exact sequence of projective resolutions (The horseshoe lemma for projective resolutions).
Additive functors apply degreewise to complexes and chain maps (An additive functor applies degreewise to complexes and chain maps).
Exactness of a sequence of complexes is equivalent to exactness in each degree, and that is the definition of a short exact sequence of complexes (A sequence of chain maps is exact exactly when it is exact degreewise, Short exact sequence of complexes).
Proof
By [L2], each degree of the horseshoe row is a split short exact sequence Because is additive by [L1], it preserves the biproduct decomposition carried by that split sequence, so each degree remains exact after applying .
By [L3], the degreewise images from step 1.1 assemble into a sequence of chain maps Since it is exact in every degree, [L4] identifies it as a short exact sequence of complexes.
Depends on
- Left exact and right exact functors
- A left or right exact functor between abelian categories is automatically additive
- Short exact sequence of complexes
- The horseshoe lemma for projective resolutions
- An additive functor applies degreewise to complexes and chain maps
- A sequence of chain maps is exact exactly when it is exact degreewise
Used by
- The connecting map for left derived functors Definition
Dependency tree · two levels
23 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)
- Romyar Sharifi, Homological Algebra (standard reference, not scraped)