Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 E be 0→A→B→pC→0 and let F be 0→C→D→X→0 in an abelian category. If their splice is zero in YExt⁡2(X,A), then there is an extension G of X by B whose pushout along p:B→C is equivalent to F. Conversely every such pushout has zero splice with E.

Facts & Assumptions

Given: The two displayed short exact sequences in an arbitrary abelian category. Write their maps as i:A→B, p:B→C, j:C→D, and q:D→X.

[F1]

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 Z:0→A→1A→0X→1X→0.

[F2]

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

technique · direct
1.1F2construct

Call a filling of the displayed two-extension an object T with an exact sequence 0→B→bT→tX→0 and a map r:T→D such that rb=jp and qr=t, for which 0→A→biT→rD→0 is exact. A lift G in the statement is exactly such a filling: its pushout along p is T/A, and an endpoint-fixed equivalence to F is an isomorphism by [F2]. Conversely the quotient map r identifies that pushout with F. Thus it suffices to prove that existence of a filling is invariant under each direction of an endpoint-fixed chain map of two-extensions.

1.2F1F2construct

Consider any such chain map with middle maps u:B→B′ and v:D→D′. Factoring the differentials through their images gives c:C→C′ satisfying ui=i′, p′u=cp, vj=j′c, and q′v=q. The natural maps B→B′×C′C and C′⨿CD→D′ induce identities on the endpoints of the respective short exact sequences. They are isomorphisms by [F2]. In particular B=B′×C′C and F′=c∗F, up to these specified isomorphisms.

2.1F2step 1.1step 1.2construct

If the unprimed two-extension has a filling T, push 0→B→T→X→0 out along u to obtain 0→B′→T′→X→0. The maps T→rD→vD′ and B′→p′C′→j′D′ agree on B, so induce r′:T′→D′. Quotienting the pushout by the common copy of A gives T′/A≅C′⨿C(T/A)≅C′⨿CD≅D′. 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 A. Consequently ker⁡r′=A and r′ is epic. This is a filling of the primed extension.

2.2F2step 1.1step 1.2construct

If instead the primed extension has a filling T′, form T=T′×D′D using its quotient r′:T′↠D′ and v. The projection r:T→D is epic with kernel A by pullback exactness. Set t=qr, which is epic. Its kernel is T′×D′C, where C→D′ is j′c. Since the inverse image of C′⊂D′ in T′ is B′, this kernel is B′×C′C≅B by step 1.2. The induced B→T satisfies rb=jp and identifies its copy of A with ker⁡r. Thus T 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.

3.1F1step 1.1step 2.1step 2.2construct

The zero representative Z has filling A⊕X, with its two evident split short exact sequences. If the given splice is zero, [F1] supplies an actual finite zigzag from it to Z. 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 G. This explicitly supplies the factorization data through every switch, including switches whose intermediate kernels change.

4.1F1F2step 1.1construct∎

Conversely let a filling T be given. Form H=B×CB, with first projection h:H→B and second projection s:H→B. The sequence 0→A→(i,0)H→sB→0 is split by the diagonal and has a retraction ρ:H→A specified by iρ=h−s. Splice this split extension with 0→B→bT→X→0 to obtain L:0→A→H→bsT→X→0. There is an endpoint-fixed chain map L→EF, with middle maps h and r, since jph=jps=rbs. There is also an endpoint-fixed chain map L→Z, with middle maps ρ and t; the differential square commutes because tbs=0. Hence EF←L→Z 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