Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-07
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.

Yoneda product is composition in the derived category

Statement

Assume DC, set-sized extension classes, and enough projectives with supplied resolutions, or dually enough injectives with supplied resolutions. Normalize the image of a short extension to be its connecting arrow in the cone convention of this page, and the image of a higher extension to be the shifted composite of the connecting arrows of its short exact pieces. With this normalization the Yoneda-class bijection is YExt⁡n(M,N)≅Hom⁡D(M,N[n]) for n≥1. If α∈YExt⁡p(M,L) and β∈YExt⁡q(L,N), their splice corresponds to β[p]α:M→N[p+q]; degree-zero maps act by pullback and pushout, with identity units.

In particular, for e:0→A→Z→B→0 and e′:0→B→uZ′→C→0, the splice is zero in Ext⁡2(C,A) if and only if there is an extension 0→A→W→Z′→0 whose pullback along u is e. Equivalently there is a commutative diagram of these two rows, with vertical maps 1A,Z→W,u, whose middle and right columns are 0→Z→W→C→0 and 0→B→Z′→C→0.

Facts & Assumptions

Given: The Axiom of Dependent Choice, set-sized extension classes, and either enough projectives with supplied resolutions or enough injectives with supplied resolutions; objects and extension classes as in the statement.

[F1]

Classical Ext identifies naturally with derived-category Hom via the chosen one-sided resolutions (Ext is hom in the derived category).

[F2]

A short exact sequence of complexes gives a distinguished triangle via its cone-to-quotient map (Canonical truncations fit a distinguished triangle).

[F4]

Under DC, set-sized extension classes, and the stated one-sided resolution data, higher Yoneda Ext agrees with that classical Ext (Higher Yoneda Ext agrees with derived Ext).

[F5]

Both representable Hom sequences of a distinguished triangle are exact (Long exact Hom sequences of a distinguished triangle).

Proof

1.1F2F4algebra

For an extension 0→N→En−1→⋯→E0→M→0, let K0=M, Kn=N, and use its successive images to form short exact sequences ej:0→Kj+1→Ej→Kj→0 for 0≤j<n. Let bj:Kj→Kj+1[1] be the connecting arrow from [F2]. Define Θ(E)=bn−1[n−1]⋯b1[1]b0. Naturality of [F2] gives a commuting diagram of these arrows for any map of extensions fixing the endpoints, so Θ is constant on the generated Yoneda equivalence relation. The same naturality gives endpoint pullback and pushout compatibility. Direct sums of the short exact pieces give direct sums of their arrows; diagonal pullback and codiagonal pushout therefore make Θ additive for Baer addition.

1.2F1F2F4algebra

Here is the degree-one comparison explicitly in the projective lane. For 0→N→iE→M→0, lift P0→M to v:P0→E and write vd1=ic with c:P1→N. The cone of i has N in degree −1, E in degree zero, and differential i. The map P→Cone⁡(i) with components c,v in degrees −1,0 is a complex map over M. Projection to N[1] gives the cocycle c. Thus the connecting arrow is the roof of c, and in particular is exactly the degree-one map used to define Θ, without an unproved appeal to the abstract Ext/Hom isomorphism. In the injective lane extend N→I0 to w:E→I0 and factor dw=tq through q:E→M. The identity p≃tq after mapping N[1]→I[1] is witnessed on the cone by the homotopy with component w:E→I0; hence the connecting arrow is represented by t:M→I[1]. This explicit sign is part of our normalization.

2.1F1F4F5step 1.1step 1.2algebra

We verify bijectivity without assuming that an arbitrary natural Ext/Hom identification preserves products. In the projective lane let Kj=ΩjM in the supplied resolution. Exactness of [F5] for K1→P0→M→K1[1] gives Hom⁡D(M,N[1]) as the quotient of Hom⁡(K1,N) by restrictions from P0, because positive Ext from the projective P0 vanishes by [F1]. The quotient map sends h to h[1]b0. By the pushout construction in [F4], this is Θ of the pushout extension. In degree n, that same construction identifies Yoneda classes with Hom⁡(Kn,N) modulo restrictions from Pn−1: a resolution cocycle factors through Kn, and a coboundary is precisely such a restriction. The degree-one quotient for 0→Kn→Pn−1→Kn−1→0, followed by the connecting isomorphisms Hom⁡D(Kj,N[r])≅Hom⁡D(Kj−1,N[r+1]) for r>0, identifies this quotient bijectively with Hom⁡D(M,N[n]). Each isomorphism follows from [F5] and the vanishing of both adjacent positive Hom groups from Pj−1 by [F1]. The composite is Θ of the corresponding pushout extension because its connecting arrows are the short exact pieces of that extension, as in step 1.1. This establishes bijectivity directly. The normalization is not asserted to equal [F1]'s classical-projective comparison: in degree one, step 1.2 represents Θ by the positive cocycle c, while [F1] sends the positive classical Ext cocycle c to −c. The sign is an invertible scalar and does not affect this bijectivity argument; product compatibility follows from the connecting-arrow construction of step 1.1 rather than from an identification of the two normalizations.

2.2F1F2F4F5step 1.1algebra

In the injective lane put C0=N and Cj+1=coker⁡(Cj→Ij) in the supplied coresolution. The dual construction in [F4] identifies degree-n Yoneda classes with Hom⁡(M,Cn) modulo maps factoring through In−1→Cn. Apply [F5] to Cn−1→In−1→Cn→Cn−1[1] to identify this quotient with Hom⁡D(M,Cn−1[1]). The subsequent connecting isomorphisms identify it with Hom⁡D(M,N[n]), since both neighboring positive Hom groups into each injective vanish by [F1]. On the pullback extension supplied by [F4], naturality of [F2] makes the composite exactly Θ. Thus the same intrinsic Θ is bijective in either lane, including when both are available.

3.1step 1.1step 2.1step 2.2algebra

The short exact pieces of a splice are the pieces of its two factors in order. The definition in step 1.1 therefore gives Θ(β∗α)=Θ(β)[p]Θ(α), using associativity of composition and [p][q]=[p+q]. This also shows that the bijection is independent of the resolution used to prove its bijectivity. Degree-zero endpoint maps act by pullback and pushout by step 1.1, and identities act as units.

4.1F2F5step 1.2step 2.1step 2.2step 3.1algebra∎

Apply Hom⁡D(−,A[1]) to the triangle B→Z′→C→B[1] of e′. Its connecting arrow is Θ(e′) by definition and step 1.2. By [F5] the kernel of the map from Hom⁡D(B,A[1]) to Hom⁡D(C,A[2]) is the image of restriction from Z′; the map is shifted composition with Θ(e′), up to an irrelevant overall rotation sign. By step 3.1 its kernel is precisely the zero-splice condition. Bijectivity and pullback naturality of Θ give the asserted extension over Z′, in both directions. Its pullback middle object is isomorphic to Z by equivalence of short extensions. The kernel of W→Z′→C is that pullback and the composite is epic, yielding 0→Z→W→C→0. Conversely exactness of the stated diagram identifies Z with this kernel and hence with the pullback.

Depends on

Used by

Dependency tree · two levels

24 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