Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-06 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Higher Yoneda Ext agrees with derived Ext

Statement

Assume Dependent Choice. Let A be an abelian category with enough projectives and supplied projective resolution data P on all its objects. Assume the relevant classes of extensions form sets. For every n1 there is a natural isomorphism YExtn(M,N)HnHom(P(M),N)=ExtPn(M,N). Dually, with enough injectives and supplied injective data I, there is a natural isomorphism YExtn(M,N)ExtIn(M,N). Here derived Ext means the indicated one-sided construction; the projective assertion does not require enough injectives, nor the injective assertion enough projectives. The isomorphisms respect Baer addition, defined in every positive degree by direct sum followed by diagonal pullback and codiagonal pushout.

Facts & Assumptions

Given: Objects M,N, n1, and the stated supplied resolutions and smallness assumptions.

[F1]

Extensions and their generated equivalence relation are as in An n-fold Yoneda extension and Equivalence of n-fold extensions.

[F2]

Projective objects lift through epimorphisms (Projective object characterisations); pushouts preserve monomorphisms in an abelian category (The pushout of a monomorphism is a monomorphism).

[F3]

Comparison maps between projective resolutions exist and are homotopy-unique under DC (Projective comparison maps exist, Projective comparison maps are unique up to chain homotopy).

[F4]

The two one-sided Ext constructions are the indicated Hom cohomologies (Ext via a projective resolution of the first variable, Ext via an injective resolution of the second variable).

Proof

technique · direct
1.1

Fix PM and an extension E with inclusion i:NEn1. By [F2], successively lift the augmentation to uk:PkEk for 0k<n, respecting differentials. Exactness makes un1dn factor uniquely as ic for c:PnN. Since i is monic and dndn+1=0, cdn+1=0, so c is a cocycle.

F1F2givenconstruct
1.2

A cocycle c:PnN factors uniquely as c=fdˉn, where dˉn:PnΩnM=imdn; its kernel is imdn+1. Push out 0ΩnMjPn1P0M0 along f. The new first middle object is E(f)=coker((f,j):ΩnMNPn1). Its inclusion of N is monic by [F2], and its cokernel is the unchanged cokernel of j, so this is an exact n-extension.

F1F2givenconstruct
2.1

Two lift systems u,v in step 1.1 have the same terminal cocycle class. Indeed, projectivity and exactness construct homotopy components hk:PkEk+1 through k=n2 satisfying ukvk=dEhk+hk1dP, with h1=0. At k=n1 the remaining difference factors uniquely through i as it, with t:Pn1N. Applying dn then gives cc=tdn. For n=1 this last factorization is the entire argument. A chain map of extensions fixing endpoints carries one lift system to another with the same cocycle, so the class is constant on the generated equivalence relation.

F1F2step 1.1construct
2.2

If c=c+tdn, then f=f+tj. The automorphism (a,p)(atp,p) of NPn1 carries the relation (f,j) to (f,j), so it induces an isomorphism E(f)E(f), identity on both endpoints and on the unchanged tail. This notation denotes a biproduct matrix, and requires no element description of the abelian category. Thus step 1.2 descends from cocycles to cohomology classes.

step 1.2algebra
3.1

For an extension and lifts from step 1.1, the map (i,un1):NPn1En1 kills (f,j), since if=un1j after canceling the epimorphism dˉn. It induces a chain map from the pushout extension back to the original, with identity endpoints. Conversely the canonical map Pn1E(f), together with the identity maps on the remaining Pk, is a lift system for the pushout extension and has terminal cocycle fdˉn=c. The two constructions are therefore inverse on classes.

F1step 2.1step 2.2algebra
4.1

A map NN sends c to its postcomposition and sends E(f) to its endpoint pushout. A map MM has a comparison lift P(M)P(M) by [F3]; composing the lift system in step 1.1 with it computes the endpoint pullback, with cocycle obtained by precomposition. Homotopic comparison maps induce cochain-homotopic Hom maps by sk(ϕ)=ϕhk1, so these cohomology maps are independent of the comparison. In particular comparisons over identity give resolution independence. This proves both-variable naturality. Direct sums of lift systems give direct sums of cocycles; diagonal pullback followed by codiagonal pushout sends (c,c) to c+c. Hence the bijection respects Baer addition and transports the abelian group laws to extension classes.

F3step 3.1algebra
5.1

By [F4], the target just proved is exactly ExtPn(M,N), without using balanced Ext. Apply the same argument in Aop: injective coresolutions become projective resolutions, extensions reverse endpoints, and pushouts become pullbacks. Translating back yields the asserted natural identification with ExtIn(M,N) and its addition.

F4step 4.1algebra

Depends on

Used by

Dependency tree · two levels

21 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