Alphabeta Math
Pipeline-generated
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.

✓ 30 results · all verified · 21 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 9 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Ext and Balanced Resolutions

1 · Prerequisites

2 · Summary

This draft compares the projective and injective resolution constructions of Ext. The comparison uses a first-quadrant Hom double complex with direct-sum totalisation on finite diagonals.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Ext via an injective resolution of the second variable

Definition

Let A be abelian and let I be supplied injective-resolution data. For M and N in its domain, set CIq(M,N)=Hom⁡A(M,Iq(N)),dIq(f)=dI(N)q∘f. Thus CI∙(M,N) is a cochain complex. Define Ext⁡In(M,N):=Hn(CI∙(M,N))(n≥0). The subscript I remains part of the notation: this is a construction relative to the supplied data, not yet an intrinsic Ext bifunctor.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Ext via a projective resolution of the first variable

Definition

Let A be abelian and let P be supplied projective-resolution data, written homologically with dP:Pq+1(M)→Pq(M). For M,N in its domain, set CPq(M,N)=Hom⁡A(Pq(M),N),dPq(f)=f∘dPq+1. Then dPq+1dPq=0 because consecutive differentials of P(M) compose to zero. Define Ext⁡Pn(M,N):=Hn(CP∙(M,N))(n≥0). The subscript P records the supplied choice; no equality with the injective construction is being made here.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The degree-zero injective construction of Ext is Hom

Statement

Assume the Axiom of Dependent Choice, and let I be supplied injective resolution data on the objects under consideration. For 0→N→ιI0→d0I1→⋯, f↦ιf gives a natural isomorphism Hom⁡(M,N)≅Ext⁡I0(M,N).

Facts & Assumptions

Given: The displayed injective resolution and an object M.

Proof

technique · direct
1.1givenconstruct

Exactness gives ker⁡d0=im⁡ι; thus ιf is a degree-zero cocycle, and f↦ιf is injective because ι is monic.

2.1step 1.1algebra∎

If d0g=0, then g factors uniquely through ι. Since there are no negative-degree coboundaries, this is the required H0 identification. Precomposition makes it natural in M. For b:N→N′, choose a comparison extension between the supplied resolutions; its degree-zero square with the coaugmentations commutes, so the identification is natural in N, and the independence lemma makes this map independent of the chosen extension.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The degree-zero projective construction of Ext is Hom

Statement

For ⋯→P1→d1P0→εM→0, precomposition with ε gives a natural isomorphism Hom⁡(M,N)≅Ext⁡P0(M,N).

Facts & Assumptions

Given: The displayed projective resolution and an object N.

Proof

technique · direct
1.1givenconstruct

A map h:P0→N is a zero-cocycle exactly if hd1=0, equivalently if it vanishes on ker⁡ε=im⁡d1.

2.1step 1.1algebra∎

Thus h factors uniquely as fε; there are no negative-degree coboundaries. This is the asserted isomorphism and is natural under pre- and postcomposition.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Injective-resolution Ext has the stated bifunctor variance

Statement

Assume the Axiom of Dependent Choice. Let I be supplied injective resolution data on a class D in an abelian category. For every q, injective-resolution Ext is contravariant in M and covariant in N: a:M′→M and b:N→N′ induce Ext⁡Iq(M,N)→Ext⁡Iq(M′,N) and Ext⁡Iq(M,N)→Ext⁡Iq(M,N′).

Facts & Assumptions

Given: Objects N,N′∈D, objects M,M′, and maps a,b as stated.

Proof

technique · direct
1.1givenconstruct

Precomposition by a is a cochain map Hom⁡(M,I∙)→Hom⁡(M′,I∙). A comparison extension of b is a cochain map I∙→I′∙, hence postcomposition gives the second cochain map.

2.1step 1.1algebra∎

Homotopic comparison extensions induce the same cohomology map, so the second map is choice-independent. Identity and composition of the comparison maps give the functor laws, with a reversing arrows.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Projective-resolution Ext has the stated bifunctor variance

Statement

Assume the Axiom of Dependent Choice. Let A be an abelian category and let P∙(−) be supplied projective resolution data on every object of A. For every n≥0, Ext⁡Pn(−,−):Aop×A→Ab is contravariant in its first variable and covariant in its second variable.

Facts & Assumptions

Given: Morphisms u:M′→M and v:N→N′ in A.

Proof

technique · direct
1.1givenconstruct

Postcomposition with v is a cochain map Hom⁡(P∙(M),N)→Hom⁡(P∙(M),N′). A comparison lift u~:P∙(M′)→P∙(M) from A morphism has a comparison lift between the supplied projective resolutions gives precomposition u~∗ in the opposite direction.

2.1step 1.1algebra∎

These maps commute because pre- and postcomposition commute. Two lifts of u are chain-homotopic by Projective comparison maps are unique up to chain homotopy. Precomposing with the homotopy gives a cochain homotopy between the two induced maps on Hom⁡(−,N), so they induce the same map on Hn. The comparison identity and composition laws hold up to such homotopy, while postcomposition is strictly functorial. Hence the maps on Hn define the asserted bifunctor.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Positive injective-resolution Ext vanishes on an injective second variable

Statement

Assume the Axiom of Dependent Choice. Let A be an abelian category and let I be a supplied injective-resolution datum on a class D of its objects. If J∈D is injective, then Ext⁡In(M,J)=0 for every M∈D and every integer n>0.

Facts & Assumptions

Given: The supplied datum I on D, an object M∈D, an injective object J∈D, and an integer n>0.

Proof

technique · direct
1.1givenconstruct

Apply Positive right derived functors vanish on injective objects to the supplied injective-resolution datum and the additive left exact functor Hom⁡(M,−). It compares the supplied resolution of J with the length-zero injective resolution and gives vanishing in every positive degree.

2.1step 1.1algebra∎

By Ext via an injective resolution of the second variable, that right-derived group is precisely Ext⁡In(M,J), so it is zero for n>0.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Positive projective-resolution Ext vanishes on a projective first variable

Statement

Assume the Axiom of Dependent Choice. Let A be an abelian category with the supplied projective-resolution construction. If P is projective, then for every object N and every q>0, Ext⁡Pq(P,N)=0.

Facts & Assumptions

Given: A projective object P and an object N.

[L1]

Projective-resolution Ext is the cohomology of Hom⁡(P∙,−) (Ext via a projective resolution of the first variable).

[L2]

Positive right derived functors computed from arbitrary supplied injective-resolution data vanish on injective objects, assuming Dependent Choice (Positive right derived functors vanish on injective objects).

Proof

technique · direct
1.1L1L2givenconstruct

For the additive functor F=Hom⁡A(−,N) on Aop, the supplied projective resolution of P in A is an injective resolution in Aop, and P is injective there. Thus the cohomology in [L1] is the corresponding right-derived construction, and [L2] compares it with the length-zero resolution of P.

2.1step 1.1algebra∎

The Hom cochain complex of that length-zero resolution is concentrated in degree zero, so its cohomology is zero for q>0. The comparison in step 1.1 therefore gives Ext⁡Pq(P,N)=0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The Hom double complex of projective and injective resolutions

Definition

For supplied resolutions P∙(M)→M and N→I∙(N), define the first-quadrant bigraded object Kp,q=Hom⁡A(Pp(M),Iq(N))(p,q≥0). Its horizontal and vertical maps are hp,q(f)=f∘dP,p+1,vp,q(f)=dIq∘f. They have bidegrees (1,0) and (0,1) respectively. The first-quadrant restriction is part of the definition used below.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The two Hom double-complex differentials commute before signing

Statement

For the Hom double complex Kp,q=Hom⁡A(Pp,Iq), the unsigned horizontal and vertical maps commute:

hp,q+1vp,q=vp+1,qhp,q:Kp,q⟶Kp+1,q+1.

Moreover, h2=0=v2. Consequently the signed total differential D∣Kp,q=h+(−1)pv satisfies D2=0.

Facts & Assumptions

Given: Projective and injective resolutions P∙→M and N→I∙, with the maps h(f)=f∘dP and v(f)=dI∘f.

Proof

technique · direct
1.1givenalgebra

For f∈Kp,q, both mixed composites equal dIq∘f∘dP,p+1, so hv(f)=vh(f). The resolution identities also give h2(f)=f∘dP,p+1dP,p+2=0 and v2(f)=dIq+1dIq∘f=0.

2.1step 1.1algebra∎

Since the horizontal degree increases from p to p+1 after applying h, D2f=h2f+(−1)p+1vhf+(−1)phvf+v2f=0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The direct-sum total complex on finite diagonals

Definition

For the first-quadrant Hom bicomplex K, put Tot⁡nK=⨁p+q=nKp,q,D∣Kp,q=hp,q+(−1)pvp,q. Each diagonal has precisely n+1 possible bidegrees, so this direct sum is finite. Consequently there is no choice here between direct-sum and product totalisations.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Acyclic assembly by exact columns

Statement

Let Kp,q be a first-quadrant double cochain complex whose signed total complex uses finite direct sums on every diagonal. Suppose a cochain complex C∙ maps to the bottom edge so that, for every p, the augmented column 0⟶Cp⟶Kp,0→vKp,1→vKp,2⟶⋯ is exact and the augmentations commute with the horizontal maps. Then the induced cochain map C∙→Tot⁡K is a quasi-isomorphism.

Facts & Assumptions

Given: The first-quadrant double complex, compatible column augmentations, and exact augmented columns stated above.

Proof

technique · direct
1.1givenalgebra

Adjoin Cp in vertical degree −1. Compatibility makes this an augmented double complex, and the cone of C∙→Tot⁡K is its signed total complex up to shift. In total degree n, only the finitely many columns 0≤p≤n+1 occur; filtering by the largest horizontal degree has successive quotients equal to shifts of the exact augmented columns.

2.1step 1.1algebra∎

Starting with one column and adjoining the others, the short exact sequences of successive filtered complexes show inductively that every finite truncation is acyclic. These truncations stabilize degreewise, so the full cone is acyclic. Hence C∙→Tot⁡K is a quasi-isomorphism.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Acyclic assembly by exact rows

Statement

Let Kp,q be a first-quadrant double cochain complex whose signed total complex uses finite direct sums on every diagonal. Suppose a cochain complex E∙ maps to the left edge so that, for every q, the augmented row 0⟶Eq⟶K0,q→hK1,q→hK2,q⟶⋯ is exact and the augmentations commute with the vertical maps. Then the induced cochain map E∙→Tot⁡K is a quasi-isomorphism.

Facts & Assumptions

Given: The first-quadrant double complex, compatible row augmentations, and exact augmented rows stated above.

Proof

technique · direct
1.1givenalgebra

Interchange the two indices of K. Multiplying the component in bidegree (p,q) by (−1)pq identifies its signed total complex with the total complex after the interchange; the augmented rows become exact augmented columns with compatible edge maps.

2.1step 1.1algebra∎

Apply the exact-column assembly lemma to the interchanged double complex. Transporting its quasi-isomorphism back through the sign identification gives E∙→Tot⁡K.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Hom from a projective makes injective-resolution columns exact

Statement

Let P∙→M be a projective resolution and 0→N→I0→I1→⋯ an injective resolution. For every p≥0, the augmented column 0⟶Hom⁡(Pp,N)⟶Hom⁡(Pp,I0)⟶Hom⁡(Pp,I1)⟶⋯ is exact. These augmentations commute with precomposition by dP, so their edge complex is Hom⁡(P∙,N) and maps naturally to the total Hom complex.

Facts & Assumptions

Given: The two resolutions in the statement and the Hom double complex Kp,q=Hom⁡(Pp,Iq).

Proof

technique · direct
1.1givenalgebra

Each Pp is projective, so Hom⁡(Pp,−) is exact. Applying it to the augmented injective resolution gives the displayed exact column. Naturality of Hom shows that these augmentations commute with precomposition by dP.

2.1step 1.1algebra∎

The objects in vertical degree −1 are Hom⁡(Pp,N), with horizontal differential given by precomposition by dP. They therefore form Hom⁡(P∙,N) and give the asserted natural edge map to the total complex.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Hom into an injective makes projective-resolution rows exact

Statement

Let ⋯→P1→P0→M→0 be a projective resolution and N→I∙ an injective resolution. For every q≥0, the augmented row 0⟶Hom⁡(M,Iq)⟶Hom⁡(P0,Iq)⟶Hom⁡(P1,Iq)⟶⋯ is exact. These augmentations commute with postcomposition by dI, so their edge complex is Hom⁡(M,I∙) and maps naturally to the total Hom complex.

Facts & Assumptions

Given: The two resolutions in the statement and the Hom double complex Kp,q=Hom⁡(Pp,Iq).

Proof

technique · direct
1.1givenalgebra

Each Iq is injective, so Hom⁡(−,Iq) is exact. Applying it to the augmented projective resolution gives the displayed exact row. Naturality of Hom shows that these augmentations commute with postcomposition by dI.

2.1step 1.1algebra∎

The objects in horizontal degree −1 are Hom⁡(M,Iq), with vertical differential given by postcomposition by dI. They therefore form Hom⁡(M,I∙) and give the asserted natural edge map to the total complex.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Projective and injective constructions of Ext agree for supplied resolutions

Statement

For supplied resolutions of M,N, the canonical maps from Hom⁡(P∙,N) and Hom⁡(M,I∙) to Tot⁡Hom⁡(P∙,I∙) are quasi-isomorphisms. Consequently Ext⁡Pq(M,N)≅Ext⁡Iq(M,N) for all q≥0.

Facts & Assumptions

Given: A projective resolution P∙→M and an injective resolution N→I∙.

Proof

technique · direct
1.1given

The augmented columns are exact after applying Hom⁡(Pp,−), and the augmented rows are exact after applying Hom⁡(−,Iq). Both augmentations commute with the other differential.

2.1step 1.1∎

Finite-diagonal acyclic assembly applied first to columns and then to rows makes both edge-to-total maps quasi-isomorphisms. Taking cohomology yields the displayed isomorphism; the maps themselves are retained for the later naturality proof.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The Ext balance isomorphism is independent of resolution comparison data

Statement

Assume the Axiom of Dependent Choice. Under the enough-projectives and enough-injectives hypotheses used for the two supplied derived constructions, the balance isomorphism Ext⁡Pn(M,N)≅Ext⁡In(M,N) is independent of the comparison lifts used after changing either supplied resolution.

Facts & Assumptions

Given: The supplied projective and injective resolution constructions of Ext⁡.

Proof

technique · direct
1.1givenconstruct

For fixed resolutions, the two edge maps defining the balance zigzag are induced by the augmentations P∙→M and N→I∙, so they involve no comparison lift. After replacing a projective or injective resolution, choose a comparison map over or under the resolved object. These maps give a morphism between the two Hom double complexes and commute with both edge augmentations.

2.1step 1.1algebra∎

Any two projective comparison maps are chain-homotopic, and any two injective comparison maps are cochain-homotopic, by the two comparison uniqueness theorems. Applying Hom⁡ turns either homotopy into a homotopy of the corresponding total-complex maps. Hence the induced maps on all three cohomologies in the edge-to-total zigzag are independent of the chosen lifts, and the balance isomorphism is independent of those choices.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The Ext balance isomorphism is natural in both variables

Statement

Assume the Axiom of Dependent Choice and the supplied resolution hypotheses of the balance theorem. For every n≥0, the balance maps βM,Nn:Ext⁡Pn(M,N)→Ext⁡In(M,N) are natural in both M and N.

Facts & Assumptions

Given: Morphisms u:M′→M and v:N→N′ in the resolved class.

Proof

technique · direct
1.1givenconstruct

Choose the projective and injective comparison maps for u and v. Projective-resolution Ext has the stated bifunctor variance and Injective-resolution Ext has the stated bifunctor variance give the two routes around the naturality square.

2.1step 1.1algebra∎

The chosen comparison maps induce a morphism of Hom double complexes. Because its squares with the projective augmentation P∙→M and the injective coaugmentation N→I∙ commute, both edge-to-total quasi-isomorphisms commute with it. Taking cohomology makes the balance square commute. The independence lemma removes the chosen comparison maps, proving naturality in both variables.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)Open item page →

Ext balance isomorphisms satisfy change-of-resolution cocycle laws

Statement

Assume Dependent Choice (DC) in an abelian category with enough projectives and injectives, and supply the projective and injective resolutions used below. For fixed objects M,N and n≥0, write EP=Ext⁡Pn(M,N) and EI=Ext⁡In(M,N). Let cP,P′:EP→EP′ and cI,I′:EI→EI′ be the maps induced by resolution comparisons over or under the identity objects. Then cP,P=1,cP′,P′′cP,P′=cP,P′′,cI,I=1,cI′,I′′cI,I′=cI,I′′. These maps are isomorphisms. For the balance maps βP,I:EP→EI one has the correctly typed square cI,I′βP,I=βP′,I′cP,P′. Thus successive changes through any intermediate supplied resolutions give the same identification as direct comparison, naturally in both objects. The identity laws concern unchanged presentations; βP,I between different presentations is not asserted to be a literal identity.

Proof

technique · direct
1.1givenconstruct

By Projective comparison maps exist choose f:P′→P lifting 1M, and let cP,P′=Hn(f∗) on the Hom cochain complexes. Two such f,g differ by dh+hd by Projective comparison maps are unique up to chain homotopy. Precomposition by h, in degree n sending ϕ to ϕhn−1, is a cochain homotopy between f∗ and g∗, so their induced maps on cohomology coincide. Identity comparison gives cP,P=1. A composite P′′→P′→P lifts 1M, so comparison uniqueness proves cP′,P′′cP,P′=cP,P′′. Opposite-direction comparisons consequently induce inverse maps.

2.1givenconstruct

By Injective comparison maps exist choose g:I→I′ extending 1N and let cI,I′=Hn(g∗). The uniqueness theorem Injective comparison maps are unique up to cochain homotopy supplies a homotopy between any two such extensions; postcomposition with it is a Hom cochain homotopy. Thus this map is independent of the extension. Identity extensions and composites give the two injective comparison laws, and reverse extensions give inverses, exactly as in step 1.1.

3.1step 1.1step 2.1algebra∎

The chosen comparison maps induce the augmentation-compatible Hom double-complex squares in The Ext balance isomorphism is independent of resolution comparison data. Both edge-to-total maps commute with them. Taking cohomology and inverting the appropriate edge isomorphism proves cI,I′βP,I=βP′,I′cP,P′. The comparison laws of steps 1.1–2.1 and this square reduce successive changes, including mixed projective/injective changes, to direct comparison. Naturality in module morphisms follows from The Ext balance isomorphism is natural in both variables and comparison uniqueness: the two composite lifts in each change-of-resolution naturality square lift the same object morphism and hence induce equal cohomology maps.

Remarks

DC supplies arbitrary comparisons and their homotopies. The equations are choice-free when these data are explicitly supplied. This proof does not use a uniqueness theorem for arbitrary morphisms of delta functors merely because they agree in degree zero.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-09-09 (gpt-6-astra)Open item page →

The balanced Ext bifunctor

Definition

Assume the Axiom of Dependent Choice, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain. Let A be an abelian category with enough projectives and enough injectives, and fix supplied projective and injective resolution data on all objects of A. For each n≥0, define Ext⁡An(M,N) to mean either Ext⁡Pn(M,N) or Ext⁡In(M,N), identified by Projective and injective constructions of Ext agree for supplied resolutions. The independence and naturality statements in The Ext balance isomorphism is independent of resolution comparison data and The Ext balance isomorphism is natural in both variables apply under the stated DC assumption. This is a bifunctor contravariant in M and covariant in N, up to the canonical identifications below; it is not a definition by equality of the two complexes.

Well-definedness under changes of resolution

For projective resolutions P,P′ of the same M, use Projective comparison maps exist under DC to choose f:P′→P lifting the identity. Precomposition induces a map cP,P′:HnHom⁡(P,N)→HnHom⁡(P′,N). Any two such f are chain-homotopic by Projective comparison maps are unique up to chain homotopy. If f−g=dh+hd, precomposition by h is the cochain homotopy between the two Hom maps: in degree n it sends a cochain ϕ to ϕhn−1. Thus the induced map on cohomology is independent of f. An identity comparison induces the identity. If P′′ is a third resolution, the composite of comparisons P′′→P′→P lifts the same identity as a direct comparison; uniqueness up to homotopy gives cP′,P′′cP,P′=cP,P′′. In particular opposite-direction comparisons induce inverse isomorphisms.

For injective resolutions I,I′ of N, use Injective comparison maps exist to obtain g:I→I′ under N. Postcomposition gives cI,I′ on HnHom⁡(M,I). The cochain-homotopy uniqueness of Injective comparison maps are unique up to cochain homotopy makes this map independent of g: postcomposing with a homotopy gives a Hom cochain homotopy. Identities and composites of the comparison maps prove cI,I=1 and cI′,I′′cI,I′=cI,I′′, including invertibility.

Write βP,I for the balance isomorphism from the projective presentation to the injective presentation. The augmentation-compatible Hom double-complex squares in the cited independence and naturality results give cI,I′ βP,I=βP′,I′ cP,P′. This square, together with the two comparison composition laws, proves coherence of changing either presentation, including successive mixed changes. It is the change map cP,P or cI,I that is an identity when its resolution is unchanged. The balance map βP,I between different presentations need not be a literal identity. No uniqueness theorem for arbitrary delta-functor morphisms is used in this justification.

The specified resolution systems are hypotheses, not a global selection deduced here from DC. For fixed resolutions and explicitly supplied comparison maps and homotopies, the Hom and cohomology calculations above are choice-free; DC is used for existence of the arbitrary comparison data.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The long exact Ext sequence in the second variable

Statement

Assume the Axiom of Dependent Choice. Let A be abelian with enough projectives and enough injectives, and fix supplied projective and injective resolution data on all its objects. For 0→N′→N→N′′→0 and every M, there is a natural exact sequence 0→Hom⁡(M,N′)→Hom⁡(M,N)→Hom⁡(M,N′′)→δ0Ext⁡1(M,N′)→Ext⁡1(M,N)→⋯ , where δq:Ext⁡q(M,N′′)→Ext⁡q+1(M,N′); it is natural in the short exact sequence and contravariantly natural in M.

Facts & Assumptions

Given: A short exact sequence 0→N′→N→N′′→0 and an object M.

Proof

technique · direct
1.1givenconstruct

Apply Right derived functors form a cohomological delta functor to the left exact functor Hom⁡(M,−); it supplies the displayed long exact sequence for the injective construction.

2.1step 1.1algebra∎

Replace its terms by balanced Ext using The balanced Ext bifunctor. Delta-functor naturality gives naturality in the short exact sequence, while precomposition in M gives the stated contravariant naturality.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

The long exact Ext sequence in the first variable

Statement

Assume the Axiom of Dependent Choice. Let A be abelian with enough projectives and enough injectives, and fix supplied projective and injective resolution data on all its objects. For 0→M′→M→M′′→0 and every N, there is a natural exact sequence 0→Hom⁡(M′′,N)→Hom⁡(M,N)→Hom⁡(M′,N)→∂0Ext⁡1(M′′,N)→Ext⁡1(M,N)→⋯ , where ∂q:Ext⁡q(M′,N)→Ext⁡q+1(M′′,N); it is natural contravariantly in the short exact sequence and covariantly in N.

Facts & Assumptions

Given: A short exact sequence 0→M′→M→M′′→0 and an object N.

Proof

technique · direct
1.1givenconstruct

Regard Hom⁡A(−,N) as a left exact functor Aop→Ab. A projective resolution in A is an injective resolution in Aop, so Right derived functors form a cohomological delta functor on the opposite category gives the displayed order and connecting maps.

2.1step 1.1algebra

Translating the short exact sequence to the opposite category gives the three Hom terms in the displayed order and the maps ∂q. The balanced Ext bifunctor identifies the right-derived groups with Ext, and delta-functor naturality gives contravariant naturality in the short exact sequence.

3.1step 2.1construct∎

To check covariance in N, fix a projective horseshoe 0→P′→P→P′′→0 for the given short exact sequence, as supplied by The horseshoe lemma for projective resolutions. Its degreewise splitting makes 0→Hom⁡(P′′,N)→Hom⁡(P,N)→Hom⁡(P′,N)→0 a short exact sequence of cochain complexes. Postcomposition with v:N→N′ gives a morphism from this sequence to the analogous one with coefficients N′. By Naturality of the cohomology connecting morphism, all connecting squares commute. These are the horseshoe connecting maps used by the right-derived theorem in step 1.1. The comparison isomorphisms transporting the middle horseshoe resolution to the supplied one are induced by precomposition, which commutes with postcomposition by v. Thus the transported connecting maps, and hence the balanced Ext sequence of step 2.1, are covariantly natural in N.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

The two Ext long exact sequences agree under balance

Statement

Assume Dependent Choice. Let A be abelian with enough projectives and injectives and supplied projective and injective resolution data on all objects. The balance maps βn:Ext⁡Pn→Ext⁡In commute with the connecting maps in either variable, for every n≥0. Here the connecting maps are those obtained from the short exact Hom complexes and the horseshoe constructions, transported to the supplied resolutions by comparison maps. Thus they identify the two long exact Ext sequences, with the degree-zero identification to Hom.

Facts & Assumptions

Given: The stated resolution data and a short exact sequence in either variable.

[F1]

The two edge maps into T(P,I)=Tot⁡Hom⁡(P,I) are quasi-isomorphisms, and their cohomology ratio is balance (Projective and injective constructions of Ext agree for supplied resolutions); these maps commute with resolution comparisons (The Ext balance isomorphism is natural in both variables).

[F2]

Under DC, projective horseshoes are degreewise split short exact sequences of resolutions; dualizing gives the same assertion for injective horseshoes (The horseshoe lemma for projective resolutions, The horseshoe lemma for injective resolutions).

[F3]

Connecting maps commute with maps of short exact sequences of cochain complexes (Naturality of the cohomology connecting morphism). The derived connecting maps are formed with horseshoes and transported to the supplied data (Right derived functors form a cohomological delta functor, The long exact Ext sequence in the second variable, The long exact Ext sequence in the first variable).

Proof

technique · direct
1.1F1F2givenconstruct

For 0→N′→N→N′′→0, fix P→M and choose an injective horseshoe 0→I′→I→I′′→0. There are three short exact sequences of cochain complexes: Hom⁡(P,N∗), Hom⁡(M,I∗), and T(P,I∗), where ∗ denotes the three terms of the short exact sequence, not cochain degree. The first is exact by projectivity of each Pp; the second and third are exact because the horseshoe is split in each degree, and total diagonals are finite. The coaugmentations and augmentation give two morphisms of short exact sequences from the edge sequences to the total sequence.

1.2F1F2givenconstruct

For 0→M′→M→M′′→0, fix N→I and choose a projective horseshoe 0→P′→P→P′′→0. The three short exact sequences are Hom⁡(P∗,N), Hom⁡(M∗,I), and T(P∗,I), all ordered with double-prime first and prime last. The first and third are exact by the degreewise splitting; the second is exact by injectivity of each Iq. Again the augmentation and coaugmentation give morphisms from both edge sequences to the total sequence.

2.1F1F3step 1.1step 1.2algebra

In each case let a be the projective-edge map to the total and b the injective-edge map. By [F3], H(a) and H(b) commute with the connecting maps of their respective sequences and the total sequence. They are isomorphisms by [F1]. Hence β=H(b)−1H(a) also commutes with connecting maps. These are the actual balance maps, not merely some degreewise natural isomorphism. The total differential is h+(−1)pv; both edge maps are cochain maps with the page's unsigned Hom differentials, so these are commuting squares with no additional sign.

3.1F1F3step 2.1algebra∎

The horseshoe middle resolutions may differ from the fixed ones. Transport their cohomology to the supplied data by comparison isomorphisms. By [F3] this is exactly how the derived connecting maps are defined, and [F1] makes balance commute with these comparisons. Therefore the squares proved in step 2.1 hold for the supplied resolutions as well. In degree zero both augmentations identify the common cocycles with Hom, giving its identity identification.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Ext dimension shifting in the first variable

Statement

Assume the Axiom of Dependent Choice. Let A be abelian with enough projectives and enough injectives, fix supplied projective and injective resolution data on all its objects, and let 0⟶ΩM→iP0→εM⟶0 be the first stage of a projective resolution. For every object N there is an exact sequence 0→Hom⁡(M,N)→Hom⁡(P0,N)→Hom⁡(ΩM,N)→Ext⁡1(M,N)→0, and for every q≥1 there is a natural isomorphism Ext⁡q(ΩM,N)≅Ext⁡q+1(M,N).

Facts & Assumptions

Given: The displayed first stage and the remaining projective resolution ⋯→P2→P1→P0→M→0.

[L1]

A short exact sequence in the first variable gives the long exact Ext sequence (The long exact Ext sequence in the first variable).

Proof

technique · direct
1.1L1givenconstruct

Apply [L1] to 0→ΩM→P0→M→0. Its relevant terms are Ext⁡q(P0,N)→Ext⁡q(ΩM,N)→Ext⁡q+1(M,N)→Ext⁡q+1(P0,N).

2.1step 1.1algebra∎

Since P0 is projective, the outer groups vanish for q≥1 by Positive projective-resolution Ext vanishes on a projective first variable, giving the displayed natural isomorphism. The degree-zero end of the same long exact sequence is exactly the displayed five-term sequence.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Ext dimension shifting in the second variable

Statement

Assume the Axiom of Dependent Choice. Let A be abelian with enough projectives and enough injectives, and fix supplied projective and injective resolution data on all its objects. If 0→N→I→ΣN→0 is an injective copresentation, then for q≥1 there are natural isomorphisms Ext⁡q+1(M,N)≅Ext⁡q(M,ΣN); its low-degree part is 0→Hom⁡(M,N)→Hom⁡(M,I)→Hom⁡(M,ΣN)→Ext⁡1(M,N)→0.

Facts & Assumptions

Given: The displayed short exact sequence with I injective.

Proof

technique · direct
1.1given

The long exact sequence in the second variable contains Ext⁡q(M,I)→Ext⁡q(M,ΣN)→Ext⁡q+1(M,N)→Ext⁡q+1(M,I).

2.1step 1.1algebra∎

The outer groups vanish for q≥1 because I is injective, so the middle arrow is an isomorphism. At q=0 the same sequence gives exactly the printed low-degree segment.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Ext can be computed from any projective resolution of the first variable

Statement

Assume the Axiom of Dependent Choice and the hypotheses of The balanced Ext bifunctor. If Q is any other supplied projective resolution datum on the same class of objects, then for every M,N and n≥0, Ext⁡An(M,N)≅HnHom⁡(Q∙,N), naturally in M and N. In particular, the formula computes Ext from any individual projective resolution Q∙(M)→M; the resulting objectwise isomorphism is canonical on cohomology.

Facts & Assumptions

Given: Dependent Choice, the balanced Ext hypotheses, supplied data P,Q, objects M,N, and n≥0.

[F1]

Projective comparison maps lifting any object morphism exist: Projective comparison maps exist.

[F2]

Two comparison maps lifting the same morphism are chain-homotopic: Projective comparison maps are unique up to chain homotopy.

[F3]

Resolutions of the same object are homotopy equivalent: Projective resolutions of the same object are homotopy equivalent over that object.

Proof

technique · direct
1.1F1F2F3choose

Choose aM:Q∙(M)→P∙(M) lifting 1M. A reverse comparison is its homotopy inverse since both composites lift the identity and [F2] compares them with identity chain maps.

2.1step 1.1F2algebra

Precomposition gives aM∗:Hom⁡(P∙(M),N)→Hom⁡(Q∙(M),N). A homotopy a−b=dh+hd induces the cochain homotopy sn(f)=f∘hn−1, with s0=0. Thus Hn(aM∗) is a choice-independent isomorphism. Its source is Ext⁡Pn(M,N) by Ext via a projective resolution of the first variable, hence balanced Ext by The balanced Ext bifunctor.

3.1F1F2step 2.1construct

For u:M′→M, choose lifts P(u) and Q(u) by [F1]. Precomposition defines their cohomology actions independently of the lifts by [F2]. Identities and composition follow because composites lift the object composites. The maps P(u)aM′ and aMQ(u) both lift u, so [F2] makes them homotopic. Precomposition and cohomology therefore give the required contravariant naturality square in M.

4.1step 2.1step 3.1algebra∎

Postcomposition by v:N→N′ commutes exactly with precomposition by aM. This gives naturality in N and hence both variables. For a single supplied resolution Q∙(M), steps 1.1–2.1 already give the canonical objectwise isomorphism. No simultaneous class-wide choice of comparison maps is required.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-06Open item page →

Ext can be computed from any injective resolution of the second variable

Statement

Assume the Axiom of Dependent Choice and the hypotheses of The balanced Ext bifunctor. If J is any other supplied injective resolution datum on the same class of objects, then for every M,N and n≥0, Ext⁡An(M,N)≅HnHom⁡(M,J∙), naturally in M and N. In particular, the formula computes Ext from any individual injective resolution N→J∙(N); the resulting objectwise isomorphism is canonical on cohomology.

Facts & Assumptions

Given: Dependent Choice, the balanced Ext hypotheses, supplied data I,J, objects M,N, and n≥0.

[F1]

Comparison maps extending any object morphism exist under Dependent Choice: Injective comparison maps exist.

[F2]

Two such maps extending the same morphism are homotopic: Injective comparison maps are unique up to cochain homotopy.

[F3]

The two resolutions of N are homotopy equivalent under N: Injective resolutions of the same object are homotopy equivalent under that object.

Proof

technique · direct
1.1F1F2F3choose

Choose aN:I∙(N)→J∙(N) extending 1N. Its reverse comparison is a homotopy inverse: both composites extend the identity, so [F2] compares them to the identity cochain maps.

2.1step 1.1F2algebra

Applying Hom⁡(M,−) carries a homotopy a−b=dh+hd to the homotopy f↦h∘f. Hence HnHom⁡(M,aN) is an isomorphism independent of aN. The definition Ext via an injective resolution of the second variable identifies its source with Ext⁡In(M,N), which The balanced Ext bifunctor identifies with balanced Ext.

3.1F1F2step 2.1construct

For u:N→N′, choose comparison maps I(u) and J(u) extending u. Define their actions on cohomology by postcomposition. Independence follows from [F2]; identity and composition laws follow because comparison composites extend the corresponding object composites. Moreover J(u)aN and aN′I(u) both extend u, so [F2] makes them homotopic. Applying Hom and cohomology gives precisely the naturality square in N.

4.1step 2.1step 3.1algebra∎

For v:M′→M, precomposition by v commutes exactly with postcomposition by aN. This proves contravariant naturality in M and therefore naturality in both variables. The same construction at a single N uses only the individual resolution J∙(N), proving the final assertion without a global choice of comparison maps.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Exact functors compatible with Hom transport Ext under stated adjunction hypotheses

Statement

Let F:A→B be exact and have a right adjoint G. If F sends projectives to projectives, then the adjunction isomorphisms induce Ext⁡Bn(FM,X)≅Ext⁡An(M,GX) for every n≥0, provided the displayed projective resolutions exist. The dual assertion holds for an exact G that sends injectives to injectives.

Facts & Assumptions

Given: The stated exactness, adjunction, preservation, and resolution hypotheses.

Proof

technique · direct
1.1givenconstruct

Apply F to a projective resolution of M. Exactness preserves its augmentation exactness and the preservation hypothesis makes it a projective resolution of FM. The adjunction Under local smallness, transposition gives the natural hom-set bijection, and conversely identifies its Hom cochain complex into X with the original Hom cochain complex into GX.

2.1step 1.1algebra∎

Taking cohomology and using The balanced Ext bifunctor gives the claimed isomorphism. The dual argument applies the stated injective preservation to the adjoint construction; no assertion is made without these hypotheses.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Ext one of Z modulo n by Z is Z modulo n

Statement

Assume the Axiom of Dependent Choice and fix the supplied resolution data used for balanced Ext in Ab. For n>1, Ext⁡Z1(Z/n,Z)≅Z/n; in particular it is nonzero.

Facts & Assumptions

Given: The projective resolution 0→Z→nZ→Z/n→0.

Proof

technique · direct
1.1givenconstruct

Applying Hom⁡Z(−,Z) gives 0→Z→nZ→0, in cohomological degrees 0,1.

2.1step 1.1algebra∎

Its first cohomology is coker⁡(n:Z→Z)=Z/n. Ext can be computed from any projective resolution of the first variable identifies this cohomology with Ext⁡Z1(Z/n,Z). Since n>1, the quotient is nonzero.

5 · Examples, counterexamples and false statements

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

FALSE: Ext is defined before choosing or supplying resolutions

Statement

FALSE: Ext is defined before choosing or supplying resolutions

Facts & Assumptions

Given: An abelian category, objects M,N, and the two resolution-based Ext constructions of this page.

Refutation

technique · direct
1.1givenalgebra

The injective construction is the cohomology of Hom⁡(M,I(N)) and requires a supplied injective resolution N↪I(N); the projective construction similarly requires a supplied resolution P(M)↠M. Neither complex is specified before that datum is supplied.

2.1step 1.1algebra∎

Thus the raw resolution constructions are not definitions of a choice-free object merely from M and N. Choice-independence is a later comparison result, so it cannot make the claim “defined before supplying resolutions” true.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

FALSE: projective and injective Ext are equal by definition

Statement

FALSE: projective and injective Ext are equal by definition

Facts & Assumptions

Given: Objects M,N with a projective resolution P∙↠M and an injective resolution N↪I∙.

Refutation

technique · direct
1.1givenalgebra

By definition the two groups are HqHom⁡(P∙,N) and HqHom⁡(M,I∙). They are cohomologies of different complexes, with no equality map included in either definition.

2.1step 1.1algebra∎

The finite-diagonal double-complex argument supplies a natural isomorphism between these groups. Because that isomorphism is the conclusion of the balance theorem rather than a definitional identity, the asserted statement is false.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

FALSE: Ext is covariant in both variables

Statement

FALSE: Ext is covariant in both variables

Facts & Assumptions

Given: A morphism a:M′→M, a morphism b:N→N′, and balanced Ext.

Refutation

technique · direct
1.1givenalgebra

Precomposition sends f:M→Iq(N) to f∘a:M′→Iq(N), hence gives Ext⁡q(M,N)→Ext⁡q(M′,N); its direction is opposite to a.

2.1step 1.1algebra∎

Postcomposition by the comparison induced by b gives Ext⁡q(M,N)→Ext⁡q(M,N′). Thus only the second variable is covariant, while the first is contravariant, disproving covariance in both.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

FALSE: positive Ext vanishes whenever either variable is injective

Statement

FALSE: positive Ext vanishes whenever either variable is injective

Facts & Assumptions

Given: The category of abelian groups and 0→Z→Q→Q/Z→0.

Refutation

technique · direct
1.1givenalgebra

The group Q/Z is divisible and therefore injective, but it occurs as the quotient, hence as the first argument of the extension. If the sequence split, a retraction Q→Z would restrict to the identity on Z.

2.1step 1.1algebra∎

Every homomorphism Q→Z is zero, so the extension is nonsplit and yields 0≠Ext⁡1(Q/Z,Z). Injectivity instead forces positive Ext to vanish in the second variable, and projectivity does so in the first.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

FALSE: double-complex totalisation is unambiguous with infinite diagonals

Statement

FALSE: double-complex totalisation is unambiguous with infinite diagonals

Facts & Assumptions

Given: The zero-differential double complex Kp,q=Z when p+q=0 and Kp,q=0 otherwise, indexed over all p,q∈Z.

Refutation

technique · direct
1.1givenalgebra

Its degree-zero diagonal has one copy of Z for every p∈Z. The direct-sum totalisation has Tot⁡⊕0=⨁p∈ZZ, whose elements have finite support.

2.1step 1.1algebra∎

The product totalisation instead has Tot⁡∏0=∏p∈ZZ, which contains the all-ones family and is strictly larger. Hence infinite diagonals leave a genuine sum/product choice; first-quadrant finite diagonals are what remove it.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

FALSE: balance of Ext requires spectral-sequence pages

Statement

FALSE: balance of Ext requires spectral-sequence pages

Facts & Assumptions

Given: The first-quadrant double complex Kp,q=Hom⁡(Pp,Iq) associated with supplied projective and injective resolutions.

Refutation

technique · direct
1.1givenalgebra

For each p, Hom⁡(Pp,−) is exact because Pp is projective, so the augmented q-columns are exact; the finite-diagonal acyclic-assembly lemma gives a quasi-isomorphism from the projective edge complex to Tot⁡K.

2.1step 1.1algebra∎

Dually, each Hom⁡(−,Iq) is exact, so exact rows give a quasi-isomorphism from the injective edge complex to the same total complex. The resulting cohomology isomorphism balances Ext without constructing any spectral-sequence page.

Sources