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.
A zero Yoneda splice factors through the middle object
Statement
Let be and let be in an abelian category. If their splice is zero in , then there is an extension of by whose pushout along is equivalent to . Conversely every such pushout has zero splice with .
Facts & Assumptions
Given: The two displayed short exact sequences in an arbitrary abelian category. Write their maps as , , , and .
Two-fold equivalence is generated by finite zigzags of endpoint-fixed chain maps (An n-fold Yoneda extension, Equivalence of n-fold extensions). Its zero representative is .
Pullback and pushout short extensions are exact (Pullback and pushout of an extension). An endpoint-fixed map between short exact sequences is an isomorphism: its kernel is zero by first factoring through the left kernel, and its cokernel is zero by first factoring through the right cokernel; the coimage-image axiom then makes it invertible (Abelian category).
Proof
Call a filling of the displayed two-extension an object with an exact sequence and a map such that and , for which is exact. A lift in the statement is exactly such a filling: its pushout along is , and an endpoint-fixed equivalence to is an isomorphism by [F2]. Conversely the quotient map identifies that pushout with . Thus it suffices to prove that existence of a filling is invariant under each direction of an endpoint-fixed chain map of two-extensions.
Consider any such chain map with middle maps and . Factoring the differentials through their images gives satisfying , , , and . The natural maps and induce identities on the endpoints of the respective short exact sequences. They are isomorphisms by [F2]. In particular and , up to these specified isomorphisms.
If the unprimed two-extension has a filling , push out along to obtain . The maps and agree on , so induce . Quotienting the pushout by the common copy of gives . These isomorphisms follow directly from the universal property of a cokernel and a pushout: a map out of either side is precisely a compatible pair of maps annihilating . Consequently and is epic. This is a filling of the primed extension.
If instead the primed extension has a filling , form using its quotient and . The projection is epic with kernel by pullback exactness. Set , which is epic. Its kernel is , where is . Since the inverse image of in is , this kernel is by step 1.2. The induced satisfies and identifies its copy of with . Thus is a filling of the unprimed extension. Every object and morphism used here is a finite pullback or pushout; the argument uses neither resolutions nor a choice principle.
The zero representative has filling , with its two evident split short exact sequences. If the given splice is zero, [F1] supplies an actual finite zigzag from it to . Traverse this zigzag backwards starting with that filling, applying step 2.1 when the traversal follows a chain map and step 2.2 when it opposes one. Finite induction produces a filling of the given splice, hence the required . This explicitly supplies the factorization data through every switch, including switches whose intermediate kernels change.
Conversely let a filling be given. Form , with first projection and second projection . The sequence is split by the diagonal and has a retraction specified by . Splice this split extension with to obtain . There is an endpoint-fixed chain map , with middle maps and , since . There is also an endpoint-fixed chain map , with middle maps and ; the differential square commutes because . Hence is a concrete finite zigzag, proving the splice is zero.
Source notes
The proof supplies directly, for degree two, the finite-switch data underlying Mitchell VII, Lemma 4.1. It uses the endpoint-fixed chain-map formulation of equivalence rather than assuming an isomorphism of the middle terms. It does not invoke the general higher-degree switch lemma.
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
- Barry Mitchell, Theory of Categories, Chapter VII, §§4–5 (standard reference, not scraped)
- Charles A. Weibel, An Introduction to Homological Algebra, §3.4, Yoneda Ext (standard reference, not scraped)