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 · 23 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 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Yoneda Extensions and Homological Dimension

1 · Prerequisites

2 · Summary

This draft develops extensions, Baer addition, the Yoneda product, and homological dimensions. It retains the convention that an extension of M by N has quotient M and subobject N.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

An extension of an object by an object in an abelian category

Definition

An extension of M by N is a short exact sequence 0⟶N→iE→pM⟶0. Thus N is the subobject and M the quotient. This order is fixed throughout: such an extension will represent a class in Ext⁡1(M,N), not in Ext⁡1(N,M).

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

Equivalence of extensions

Definition

For extensions ξ:0→N→E→M→0 and ξ′:0→N→E′→M→0, an equivalence is a morphism u:E→E′ making the diagram of short exact sequences commute with identity maps on N and M. Equivalence is deliberately stronger data than merely an isomorphism E≅E′: the maps to the fixed endpoints must be respected.

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

A morphism of extensions is an isomorphism

Statement

Every morphism of extensions which is the identity on the subobject and quotient is an isomorphism of the middle objects.

Facts & Assumptions

Given: A commutative diagram of short exact sequences with identity outer vertical maps.

Proof

technique · direct
1.1given

The two outer vertical maps are isomorphisms, and both rows are exact.

2.1step 1.1∎

The short five lemma applied to this diagram makes the middle vertical map an isomorphism.

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

Equivalence of extensions is an equivalence relation

Statement

Equivalence of extensions with fixed endpoints is an equivalence relation.

Facts & Assumptions

Given: Extensions with the same subobject and quotient.

Proof

technique · direct
1.1givenconstruct

Identity maps give reflexivity, and composing endpoint-identity maps of short exact sequences gives transitivity.

2.1step 1.1algebra∎

Such a map is an isomorphism on the middle term; its inverse commutes with the endpoint maps, so it witnesses symmetry.

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

The split extension class

Definition

The split extension class of (M,N) is the equivalence class of 0⟶N→n↦(n,0)N⊕M→(n,m)↦mM⟶0. An extension is called split precisely when it is equivalent to this displayed extension; it is the distinguished class later used as the additive zero.

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

Pullback and pushout of an extension

Definition

Let

ξ:0⟶N→iE→pM⟶0

be an extension in an abelian category.

For a morphism f:M′→M, the pullback extension f∗ξ is 0⟶N→i′E×MM′→q2M′⟶0, where q1:E×MM′→E and q2:E×MM′→M′ are the pullback projections of p and f, and i′ is the unique map satisfying q1i′=i and q2i′=0. Thus pullback is contravariant in the quotient variable.

For a morphism g:N→N′, the pushout extension g∗ξ is 0⟶N′→jN′N′⨿NE→p′M⟶0, where jE:E→N′⨿NE and jN′:N′→N′⨿NE are the pushout maps of i and g, and p′ is the unique map satisfying p′jE=p and p′jN′=0. For modules the pushout is (N′⊕E)/⟨(g(n),−i(n)):n∈N⟩. Thus pushout is covariant in the subobject variable. The two displayed sequences are exact because pullbacks preserve kernels of epimorphisms and pushouts preserve cokernels of monomorphisms in an abelian category.

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

Pullback and pushout descend to extension classes

Statement

Pullback along a morphism of quotient objects and pushout along a morphism of subobjects send equivalent short extensions to equivalent short extensions.

Facts & Assumptions

Given: Equivalent extensions of M by N, and a morphism into M or out of N.

Proof

technique · direct
1.1givenconstruct

Apply the pullback or pushout universal property from Pullback and pushout of an extension to the middle-object map of the equivalence. It produces a morphism between the induced short exact sequences that is the identity on their new endpoints.

2.1step 1.1algebra∎

This induced morphism is an isomorphism by A morphism of extensions is an isomorphism, hence it is an equivalence of the induced extensions.

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

The Baer sum of extension classes

Definition

Let ξ and η be extensions of M by N. Form their direct sum, pull it back along the diagonal Δ:M→M⊕M, and then push that extension out along the codiagonal ∇:N⊕N→N. The resulting extension of M by N is the Baer sum [ξ]+[η]. The direct sum alone has endpoints N⊕N and M⊕M, so it is only an intermediate construction.

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

The Baer sum is independent of representatives

Statement

The Baer sum defined by direct sum, diagonal pullback, and codiagonal pushout depends only on the two extension classes.

Facts & Assumptions

Given: Two pairs of equivalent extensions of the same quotient object by the same subobject.

Proof

technique · direct
1.1givenconstruct

Taking the direct sum of the two equivalence diagrams gives an equivalence between the direct-sum extensions.

2.1step 1.1algebra∎

Apply Pullback and pushout descend to extension classes first to the diagonal and then to the codiagonal prescribed by The Baer sum of extension classes. The resulting Baer extensions are equivalent.

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

Baer sum makes extension classes an abelian group

Statement

For fixed M,N in an abelian category, assume that the equivalence classes of extensions of M by N form a set. With Baer sum, that set is an abelian group. Its zero is the split extension and the inverse of a class is its pushout along −1N.

Facts & Assumptions

Given: The set of extension classes of M by N.

Proof

technique · direct
1.1givenconstruct

The Baer sum is independent of representatives makes the operation well-defined. The associativity and symmetry maps of finite biproducts transport the two iterated diagonal-pullback/codiagonal-pushout constructions into equivalent extensions; the required additive identities are those in On a biproduct, the injections and projections satisfy the identity-sum relation.

2.1step 1.1algebra∎

The split extension is neutral because its diagonal pullback and codiagonal pushout recover the original extension. Pushing out an extension along −1N gives the inverse: the codiagonal of 1N and −1N is zero, hence the resulting Baer sum is split.

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

Extension classes are contravariant in the quotient and covariant in the subobject

Statement

For fixed extension classes, pullback in the quotient object and pushout in the subobject define additive maps; thus YExt⁡1(−,−) is contravariant in its first and covariant in its second variable.

Facts & Assumptions

Given: Morphisms a:M′→M and b:N→N′.

Proof

technique · direct
1.1givenconstruct

Pullback along a and pushout along b are well-defined on equivalence classes by Pullback and pushout descend to extension classes. Their universal properties make their composites agree with pullback and pushout along composite maps.

2.1step 1.1algebra∎

Both constructions commute with the direct-sum, diagonal, and codiagonal steps defining Baer addition. Hence they are homomorphisms for the group structure of Baer sum makes extension classes an abelian group, with the stated variance.

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

The derived Ext-one class of an extension

Definition

Apply the second-variable long exact Ext sequence to the extension and define its class as the connecting image of the identity of M.

This definition is used only with the hypotheses and conventions specified in its cited prerequisites.

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

Equivalent extensions have the same Ext class

Statement

Equivalent extensions of M by N determine the same class in Ext⁡1(M,N).

Facts & Assumptions

Given: An endpoint-identity morphism between two short exact sequences 0→N→E→M→0.

Proof

technique · direct
1.1givenconstruct

Naturality of the long exact Ext sequence gives a commutative square between the two connecting maps Hom⁡(M,M)→Ext⁡1(M,N).

2.1step 1.1algebra∎

The endpoint maps are identities, so the square sends 1M to the same element on both sides. These two images are the two extension classes.

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

Every Ext-one class is represented by an extension

Statement

Assume the Axiom of Dependent Choice and the balanced-Ext hypotheses of The balanced Ext bifunctor. Given a projective presentation 0→ΩM→P→M→0, every element of Ext⁡1(M,N) is the class of an extension of M by N.

Facts & Assumptions

Given: An object N, an object M with the stated projective presentation, and ξ∈Ext⁡1(M,N).

Proof

technique · direct
1.1givenconstruct

The low-degree dimension-shifting sequence from Ext dimension shifting in the first variable represents ξ by a morphism f:ΩM→N, modulo morphisms extending across P. Push out 0→ΩM→P→M→0 along f, as defined in Pullback and pushout of an extension.

2.1step 1.1algebra∎

The resulting bottom row is an extension of M by N. Naturality of its connecting homomorphism sends 1M to the class represented by f, which is ξ by the definition in The derived Ext-one class of an extension.

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

Two extensions with the same Ext class are equivalent

Statement

Assume the Axiom of Dependent Choice and the balanced-Ext hypotheses of The balanced Ext bifunctor. Two extensions of M by N with the same derived Ext⁡1(M,N) class are equivalent.

Facts & Assumptions

Given: Extensions e,e′ of M by N whose connecting classes agree.

Proof

technique · direct
1.1givenconstruct

Choose a projective presentation 0→ΩM→iP↠M→0. Projectivity lifts P→M through the middle epimorphism of each extension. Restricting those lifts to ΩM gives maps f,f′:ΩM→N. In the cokernel description of Ext⁡1(M,N), equality of the two classes says f−f′=ti for some t:P→N.

2.1step 1.1algebra∎

Each original extension is equivalent to the pushout of the projective presentation along its map f or f′. The relation f−f′=ti induces an isomorphism between these two pushouts, represented on P⊕N by (p,n)↦(p,n−t(p)); it fixes both endpoint maps. Composing the endpoint- identity equivalences proves that e and e′ are equivalent.

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

Yoneda Ext one is naturally isomorphic to derived Ext one

Statement

Assume the Axiom of Dependent Choice, the balanced-Ext hypotheses of The balanced Ext bifunctor, and that the extension classes in question form a set. Sending an extension of M by N to the connecting image of 1M gives a natural isomorphism of abelian groups YExt⁡1(M,N)≅Ext⁡1(M,N).

Facts & Assumptions

Given: Objects M,N under the stated resolution hypotheses.

Proof

technique · direct
2.1step 1.1algebra∎

For a:M′→M, the pullback extension and the original extension form a morphism of short exact sequences; naturality of the connecting morphism sends 1M to the pullback of its class along a. For b:N→N′, the analogous pushout square sends the class forward along b. These are exactly the two maps in Extension classes are contravariant in the quotient and covariant in the subobject, so the bijection is natural in both variables. The diagonal-pullback and codiagonal-pushout defining Baer sum correspond, by the same two naturality squares, to addition in Ext; hence the bijection is additive.

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

Extension classes form a set whenever derived Ext one does

Statement

Assume the Axiom of Dependent Choice and the hypotheses of The balanced Ext bifunctor. If Ext⁡1(M,N) is a set, then extensions of M by N have a set of equivalence classes: explicitly, there is a set S and an assignment c from extensions to S, every element of S occurs, and c(e)=c(e′) exactly when e and e′ are equivalent. This is a set realization of the classes; it does not assert that each literal class of isomorphic extension diagrams is itself a set.

Facts & Assumptions

Given: Dependent Choice, the balanced-Ext resolution hypotheses, and the set S=Ext⁡1(M,N).

[F1]

Equivalent extensions have identical connecting classes: Equivalent extensions have the same Ext class.

[F2]

Every derived Ext-one element is represented by an extension: Every Ext-one class is represented by an extension.

[F3]

Extensions with the same connecting class are equivalent: Two extensions with the same Ext class are equivalent.

Proof

technique · direct
1.1givenF1F3construct

For an extension e:0→N→E→M→0, assign its connecting class c(e)=δe(1M)∈S. By [F1] and [F3], c(e)=c(e′) if and only if e and e′ are equivalent. These lemmas concern individual extensions and do not assume a set of all extension classes.

2.1givenF2step 1.1algebra∎

The supplied projective resolution gives the presentation 0→ker⁡(P0(M)→M)→P0(M)→M→0 required by [F2]. Hence every s∈S equals c(e) for some extension e. Together with step 1.1 this makes the already given set S a set realization of precisely the extension equivalence classes. No quotient of a proper class or simultaneous choice of representatives is used.

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

An n-fold Yoneda extension

Definition

For n≥1, an n-fold extension of M by N is an exact sequence 0⟶N⟶En−1⟶⋯⟶E0⟶M⟶0. For n=1 this is the preceding notion of a short extension. The left endpoint is always the second Ext variable.

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

Equivalence of n-fold extensions

Definition

For two n-fold extensions with the same endpoints, begin with chain maps between their displayed exact sequences that are the identity on N and M. Their reflexive, symmetric, and transitive closure is called equivalence of n-fold extensions. For n>1, this generated relation does not require one isomorphism of all middle terms.

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

The Yoneda splice product

Definition

If ξ is a p-fold extension of L by N and η is a q-fold extension of M by L, concatenate their exact sequences at L. This produces a (p+q)-fold extension of M by N. Its class is the Yoneda splice product [ξ]⌣[η]∈YExt⁡p+q(M,N). The displayed endpoint order fixes the order of the product.

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

Yoneda splicing is well-defined on equivalence classes

Statement

Splicing p- and q-fold extensions induces a well-defined map on their generated equivalence classes.

Facts & Assumptions

Given: Equivalent representatives of two composable higher extensions.

Proof

technique · direct
1.1givenconstruct

A generating chain map between one pair of representatives can be concatenated with the identity chain map on the other factor; the result is a chain map of the spliced exact sequences that is the identity at both ends.

2.1step 1.1algebra∎

Such maps generate the equivalence relation of Equivalence of n-fold extensions, so repeated generating replacements do not change the class of the splice defined in The Yoneda splice product.

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

The Yoneda product is associative and unital

Statement

In an abelian category, define YExt⁡0(M,N)=Hom⁡(M,N). The product of two degree-zero classes is ordinary composition of their morphisms, in the displayed splice order. Splicing a positive-degree extension with a degree-zero morphism means the corresponding pullback at its quotient endpoint or pushout at its subobject endpoint. With this convention, Yoneda splicing is associative on equivalence classes and identity morphisms are two-sided units.

Facts & Assumptions

Given: Three composable classes of nonnegative degrees, with the product convention in the statement and positive-degree splicing as in The Yoneda splice product.

[F1]

Positive-degree splicing descends to generated equivalence classes (Yoneda splicing is well-defined on equivalence classes, Equivalence of n-fold extensions).

[F2]

Pullbacks preserve epimorphisms and pushouts preserve monomorphisms in an abelian category (The pullback of an epimorphism is an epimorphism, The pushout of a monomorphism is a monomorphism).

[F3]

A morphism of short exact sequences that is the identity on the endpoints is an isomorphism on the middle object (Short five lemma in an abelian category).

Proof

technique · direct
1.1F1F2givenconstruct

Endpoint pullback and pushout preserve exact extensions by [F2] and the universal properties of kernels and cokernels. An endpoint-preserving chain map induces a chain map of their pullbacks or pushouts, again fixing the new endpoints. Thus these operations respect every generating map and hence the generated equivalence relation. Together with [F1] and ordinary composition, the product is defined on classes in every pair of degrees.

1.2givenalgebra

If all three degrees are positive, both parenthesizations concatenate the same list of middle objects with the same junction maps, so their extensions agree. If all are zero, associativity is the category's associativity of morphism composition.

2.1step 1.1construct

For two consecutive degree-zero factors, iterated pullback is canonically the pullback along the composite map, and iterated pushout is canonically the pushout along the composite map, by their universal properties. This treats degree patterns (+,0,0) and (0,0,+). For patterns (0,+,+) and (+,+,0), the outer endpoint pushout or pullback affects only the outer endpoint of the concatenation, giving the same extension before or after concatenating.

2.2F3step 1.1construct

For the pattern (0,+,0), endpoint pushout and endpoint pullback commute up to canonical equivalence. For extension length at least two, they modify distinct outer middle objects and their universal maps commute. For a short extension 0→B→E→A→0, a quotient map f:A′→A and a subobject map g:B→B′ give a canonical map g∗(f∗E)→f∗(g∗E): the maps to g∗E and to A′ agree over A, and the map from B′ is supplied by the pushout. It fixes B′ and A′, so [F3] makes it an isomorphism of short extensions. This proves the remaining pattern with two zero degrees.

2.3F1step 1.1construct

For the pattern (+,0,+), let ξ extend L by N, let f:K→L, and let η extend M by K. The two products are (f∗ξ)⌣η and ξ⌣(f∗η). There is a chain map from the first spliced extension to the second: use the pullback projection on the last middle object of ξ, the pushout map on the first middle object of η, and identities elsewhere and at N,M. At the junction its square commutes by the defining equations of that pullback and pushout; all other squares are their endpoint squares or identity squares. Hence these two extensions are equivalent by the generated relation, which needs no isomorphism of all middle objects.

3.1step 1.1step 1.2step 2.1step 2.2step 2.3algebra∎

Steps 1.2 and 2.1–2.3 exhaust the eight patterns of zero and positive degrees, proving associativity. Pullback along an identity and pushout along an identity are canonically isomorphic to the original extension by their universal properties. In degree zero the same assertion is the identity law for composition. Thus identity morphisms give both units in every degree.

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

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 n≥1 there is a natural isomorphism YExt⁡n(M,N)≅HnHom⁡(P∙(M),N)=Ext⁡Pn(M,N). Dually, with enough injectives and supplied injective data I, there is a natural isomorphism YExt⁡n(M,N)≅Ext⁡In(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, n≥1, 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.1F1F2givenconstruct

Fix P∙→M and an extension E with inclusion i:N→En−1. By [F2], successively lift the augmentation to uk:Pk→Ek for 0≤k<n, respecting differentials. Exactness makes un−1dn factor uniquely as ic for c:Pn→N. Since i is monic and dndn+1=0, cdn+1=0, so c is a cocycle.

1.2F1F2givenconstruct

A cocycle c:Pn→N factors uniquely as c=fdˉn, where dˉn:Pn↠ΩnM=im⁡dn; its kernel is im⁡dn+1. Push out 0→ΩnM→jPn−1→⋯→P0→M→0 along f. The new first middle object is E(f)=coker⁡((f,−j):ΩnM→N⊕Pn−1). Its inclusion of N is monic by [F2], and its cokernel is the unchanged cokernel of j, so this is an exact n-extension.

2.1F1F2step 1.1construct

Two lift systems u,v in step 1.1 have the same terminal cocycle class. Indeed, projectivity and exactness construct homotopy components hk:Pk→Ek+1 through k=n−2 satisfying uk−vk=dEhk+hk−1dP, with h−1=0. At k=n−1 the remaining difference factors uniquely through i as it, with t:Pn−1→N. Applying dn then gives c−c′=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.

2.2step 1.2algebra

If c′=c+tdn, then f′=f+tj. The automorphism (a,p)↦(a−tp,p) of N⊕Pn−1 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.

3.1F1step 2.1step 2.2algebra

For an extension and lifts from step 1.1, the map (i,un−1):N⊕Pn−1→En−1 kills (f,−j), since if=un−1j 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 Pn−1→E(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.

4.1F3step 3.1algebra

A map N→N′ sends c to its postcomposition and sends E(f) to its endpoint pushout. A map M′→M 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(ϕ)=ϕhk−1, 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.

5.1F4step 4.1algebra∎

By [F4], the target just proved is exactly Ext⁡Pn(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 Ext⁡In(M,N) and its addition.

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

The Yoneda product agrees with derived Ext composition

Statement

Under the higher-Yoneda/derived-Ext identification, the splice of α∈YExt⁡p(L,N) and γ∈YExt⁡q(M,L) corresponds to the derived Ext composition α∘γ∈Ext⁡p+q(M,N).

Facts & Assumptions

Given: Composable Yoneda extension classes satisfying the hypotheses for the higher comparison.

Proof

technique · direct
1.1givenconstruct

Use the projective-resolution comparison in Higher Yoneda Ext agrees with derived Ext. A p-extension and a q-extension are represented by their lifted cocycles on the corresponding projective syzygies. Splicing the extensions concatenates their exact tails; lifting through that concatenated tail is the composite of the two lifted comparison maps.

2.1step 1.1algebra∎

Therefore the cocycle assigned to the splice is the chain-level composite representing the derived Ext composition. Passing to cohomology identifies the splice with α∘γ. Degree zero agrees as well because both products use ordinary morphism composition, with the units fixed in The Yoneda product is associative and unital.

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

The graded Ext algebra of an object

Definition

Assume the resolution, choice, and smallness hypotheses of Higher Yoneda Ext agrees with derived Ext. For an object M under those hypotheses, set Ext⁡∗(M,M)=⨁n≥0Ext⁡n(M,M). Give it the product induced by Yoneda splicing, equivalently by derived Ext composition under the cited comparison. This is an associative unital graded ring, hence a graded Z-algebra, with degree-zero unit 1M∈Hom⁡(M,M). If the category and its compositions are k-linear, it is a graded k-algebra. No graded-commutativity is included in this definition.

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

Projective dimension of an object

Definition

Assume projective resolutions are supplied or exist in the relevant class. The projective dimension of M is pd⁡(M)=inf⁡{d≥0:M has a projective resolution of length d}, with value ∞ if this set is empty. A length-zero projective resolution exists exactly when M is projective.

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

Injective dimension of an object

Definition

Assume injective resolutions are supplied or exist in the relevant class. The injective dimension of N is id⁡(N)=inf⁡{d≥0:N has an injective resolution of length d}, with value ∞ if there is no finite such resolution. A length-zero injective resolution exists exactly when N is injective.

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

Projective dimension at most n iff the nth syzygy is projective

Statement

Let A be an abelian category with enough projectives, fix a projective resolution P∙→M, and let n≥1. Then pd⁡(M)≤n⟺ΩPn(M) is projective. In particular, the condition is independent of the chosen projective resolution.

Facts & Assumptions

Given: The displayed hypotheses and a fixed projective resolution of M.

[L1]

The nth syzygy relative to a resolution is the kernel at its nth stage (Syzygies and cosyzygies relative to a chosen resolution).

[L2]

Projective dimension at most n means the existence of a projective resolution of length at most n (Projective dimension of an object).

[L3]

Schanuel's lemma compares kernels of two projective presentations (Schanuel's lemma in an abelian category).

Proof

technique · direct
1.1L1L2givenconstruct

If ΩPn(M) is projective, truncate the fixed resolution after that object. The resulting length-n projective resolution proves pd⁡(M)≤n.

2.1L2L3givenalgebra∎

Conversely, compare the fixed resolution with a projective resolution of length at most n. Iterating [L3] through their first n projective presentations shows that ΩPn(M) plus a finite direct sum of projectives is isomorphic to the terminal projective of the short resolution plus another finite direct sum of projectives. Hence ΩPn(M) is a direct summand of a projective object and is projective. This also proves independence of the chosen resolution.

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

Projective dimension at most n iff higher Ext vanishes

Statement

Assume the Axiom of Dependent Choice. In an abelian category with enough projectives and enough injectives, fix supplied projective and injective resolution data on all objects. Let M be an object and n≥0. The following are equivalent:

  1. pd⁡(M)≤n;
  2. Ext⁡k(M,N)=0 for every object N and every k>n;
  3. Ext⁡n+1(M,N)=0 for every object N.

Facts & Assumptions

Given: The stated category and resolution data, an object M, and n∈N0.

[L1]

For r≥1, projective dimension at most r is equivalent to projectivity of the rth syzygy (Projective dimension at most n iff the nth syzygy is projective).

[L2]

First-variable dimension shifting identifies the positive-degree Ext of a syzygy with the corresponding higher Ext of the original object (Ext dimension shifting in the first variable).

[L3]

Positive Ext out of a projective object vanishes (Positive projective-resolution Ext vanishes on a projective first variable).

[L4]

Direct summands of projective objects are projective (Projective object characterisations).

[L5]

Projective-resolution Ext is the cohomology of the associated Hom complex (Ext via a projective resolution of the first variable).

Proof

technique · direct
1.1L1L2L3givenalgebra

Assume pd⁡(M)≤n. If n=0, then M is projective and positive Ext vanishes by [L3]. If n≥1, [L1] makes the nth syzygy projective, and repeated [L2] identifies every Ext⁡k(M,N) with k>n with a positive-degree Ext group out of that syzygy, which vanishes by [L3]. Thus (1) implies (2), and (2) implies (3) by taking k=n+1.

2.1L1L2L4L5givenstep 1.1algebra∎

Conversely, assume (3). For n≥1, [L2] gives Ext⁡1(ΩnM,N)=0 for every N; for n=0, read Ω0M here as M. To see directly that an object X with Ext⁡1(X,−)=0 is projective, take the first stage 0→K→iP0→X→0 of a projective resolution and factor d1:P1→P0 as P1→πK→iP0. The map π is a cocycle representing the identity of K in the usual cokernel description of Ext⁡1(X,K). By [L5] and the assumed vanishing, π=rd1=riπ for some r:P0→K. Since π is epic, ri=1K, so the sequence splits and [L4] makes X projective. Apply this to X=ΩnM (or X=M when n=0), and use [L1] when n≥1, to prove pd⁡(M)≤n.

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

Injective dimension at most n iff higher Ext vanishes

Statement

Assume enough injectives. For an object N and n≥0, id⁡(N)≤n if and only if Ext⁡k(M,N)=0 for every object M and every k>n.

Facts & Assumptions

Given: An object N, an integer n≥0, and enough injectives.

Proof

technique · direct
1.1givenconstruct

If id⁡(N)≤n, the nth cosyzygy is injective. Repeated second-variable shifting from Ext dimension shifting in the second variable reduces every Ext⁡k(M,N) with k>n to positive Ext into that injective cosyzygy, which vanishes by Positive injective-resolution Ext vanishes on an injective second variable.

2.1step 1.1algebra∎

Conversely, repeated shifting makes Ext⁡1(M,ΣnN) vanish for every M. The defining injective-dimension convention in Injective dimension of an object and the splitting criterion for the final cosyzygy show it is injective, so the chosen resolution has length at most n.

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

Finite projective dimension is the largest nonzero Ext degree

Statement

If M≠0 has finite projective dimension d, then d=max⁡{k≥0:Ext⁡k(M,X)≠0 for some X}.

Facts & Assumptions

Given: A nonzero object M of finite projective dimension d under the stated enough-projectives and smallness hypotheses.

Proof

technique · direct
1.1givenconstruct

Projective dimension at most n iff higher Ext vanishes gives Ext⁡k(M,−)=0 for k>d.

2.1step 1.1algebra∎

If d=0, take X=M: then Ext⁡0(M,M)=Hom⁡(M,M) contains the nonzero identity of M. If d≥1 and every Ext⁡d(M,X) vanished, the same theorem with n=d−1 would give pd⁡(M)≤d−1, contradicting minimality of d. Hence in either case some X witnesses nonvanishing in degree d.

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

Left and right global dimension of a ring

Definition

For a ring R, define l.gl.dim⁡R=sup⁡{pd⁡RM:M is a left R-module}, and r.gl.dim⁡R=sup⁡{pd⁡RopM:M is a right R-module}. They are separately defined extended natural numbers; their equality is not part of the notation.

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

Global dimension of an abelian category

Definition

If A has enough projectives (or the required projective resolutions are supplied), define gl.dim⁡A=sup⁡M∈Apd⁡(M)∈N∪{∞}. This is the projective formulation. An injective formulation is a theorem only under its separately stated existence hypotheses.

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

Global dimension is the supremum of nonzero Ext degrees

Statement

For an abelian category with enough projectives, gldim⁡A=sup⁡{n:Ext⁡n(M,N)≠0 for some M,N}; the supremum is taken in N0∪{∞}, with sup⁡∅=0. If A also has enough injectives, the dual supremum of injective dimensions has the same value.

Facts & Assumptions

Given: The stated enough-projectives or enough-injectives hypothesis.

Proof

technique · direct
1.1givenconstruct

By Global dimension of an abelian category, global dimension is the supremum of projective dimensions. Projective dimension at most n iff higher Ext vanishes says that each individual projective dimension is exactly the least uniform Ext-vanishing bound.

2.1step 1.1algebra∎

Taking suprema over objects gives the displayed equality. If there is no nonzero object, both sides are 0 by the stated convention; otherwise Ext⁡0(M,M) contains 1M≠0 for every nonzero M, so the degree-zero endpoint is present. When there are also enough injectives, Injective dimension at most n iff higher Ext vanishes gives the same uniform Ext bounds and hence the dual formulation.

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

Global dimension zero characterises semisimple module categories

Statement

Assume the Axiom of Choice. For a ring R, left global dimension zero is equivalent to every left R-module being semisimple; the corresponding statement holds on the right.

Facts & Assumptions

Given: A ring R and the left-module convention; the right statement is obtained by replacing R with Rop.

Proof

technique · direct
1.1givenconstruct

If left global dimension is zero, every left module has projective dimension zero and hence is projective. By Equivalent module-theoretic characterizations of semisimple rings, a ring for which every left module is projective is precisely a semisimple ring, equivalently every left module is semisimple.

2.1step 1.1algebra∎

Conversely, if every left module is semisimple, the same ring characterization makes every left module projective. Its projective dimension is therefore zero, so the supremum in Left and right global dimension of a ring is zero. Replacing R by Rop proves the right-module statement.

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

Hereditary rings have global dimension at most one

Statement

If every submodule of a projective left R-module is projective, then the left global dimension of R is at most one. The right-handed statement holds with right modules throughout.

Facts & Assumptions

Given: The stated left hereditary hypothesis and a left R-module M.

Proof

technique · direct
1.1givenconstruct

Choose a surjection P→M from a free, hence projective, left module P. Its kernel K is a submodule of P and is projective by hypothesis.

2.1step 1.1algebra∎

Thus 0→K→P→M→0 is a projective resolution of length at most one. The definitions Projective dimension of an object and Left and right global dimension of a ring yield the claimed bound; the right proof is identical with sides reversed.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)Open item page →

Subgroups of free abelian groups are free

Statement

Assume the Axiom of Choice. Every subgroup of a free abelian group is free abelian.

Facts & Assumptions

Given: A free abelian group F with basis (eb)b∈B, a subgroup H≤F, and the Axiom of Choice.

[L1]

Every element of F has a unique finite integer-coordinate expansion in this basis (The free module on a set and its standard basis).

[L2]

Every subgroup of Z is dZ for a unique integer d≥0 (Every subgroup of (Z,+) is ⟨n⟩=nZ for exactly one natural number n).

[L3]

AC chooses an element from each member of a set-indexed family of nonempty sets (The Axiom of Choice), and implies that B admits a well-order (The well-ordering theorem).

[L4]

Induction over any supplied well-order is valid in ZF (Transfinite induction).

Proof

technique · direct
1.1givenL1L2L3construct

Well-order B. For b∈B, let F≤b be the span of the ec with c≤b, and put H≤b=H∩F≤b. The b-coordinate homomorphism πb:F≤b→Z has image πb(H≤b)=dbZ for a uniquely determined db≥0. Put D={b∈B:db>0}.

2.1step 1.1L3choose

For each b∈D the set Xb={x∈H≤b:πb(x)=db} is nonempty. Apply AC to this set-indexed family and fix xb∈Xb simultaneously for all b∈D. These are the only choices of lifts in the argument; they do not depend recursively on previously chosen bases.

3.1step 1.1step 2.1L1L4induction

We prove by well-ordered induction on b that H≤b is spanned by xc with c∈D and c≤b. Suppose this is proved below b, and take h∈H≤b. If db>0, write πb(h)=qdb and set h′=h−qxb; if db=0, set h′=h. In both cases h′∈H has finite support strictly below b. If that support is empty, h′=0. Otherwise it has a greatest element c<b, and h′∈H≤c is in the required span by the induction hypothesis. Thus so is h. Conversely all the indicated xc belong to H≤b. This verifies the inductive implication, including the least-element and limit cases, and [L4] proves the assertion for every b.

4.1step 2.1step 3.1L1algebra∎

The family (xb)b∈D is linearly independent. Indeed, in a nonzero finite relation choose the greatest index b with nonzero coefficient nb. Its b-coordinate is nbdb, since all smaller-indexed vectors have zero b-coordinate. This is nonzero in Z, contradicting the relation. Every nonzero h∈H has a greatest basis-support index b and belongs to H≤b, so step 3.1 also proves spanning of all H. Hence (xb)b∈D is a basis. If B or D is empty the same reasoning says H=0 with empty basis.

Remarks

AC is used to well-order the supplied basis and to select the family of coordinate lifts. Given a well-ordered basis and that family of lifts, the remaining proof is choice-free. No arbitrary-rank PID theorem, projective splitting, or transfinite recursion is being imported implicitly.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)Open item page →

The integers have global dimension one

Statement

Assume the Axiom of Choice. Both left and right global dimension of Z equal 1.

Facts & Assumptions

Given: An arbitrary abelian group A and an integer n>1, under Choice.

[L1]

The canonical free module on the underlying set of A surjects onto A by ea↦a, without Choice (Every module is a quotient of a free module).

[L2]

Under AC, subgroups of free abelian groups are free (Subgroups of free abelian groups are free) and free modules are projective (Free modules are projective, with the exact choice boundary). The hypothesis is The Axiom of Choice; the former theorem uses well-ordering and simultaneous coordinate lifts, and the latter uses choices of basis preimages.

[L3]

A projective module lifts every map through every surjection (Projective modules and the lifting property).

[L4]

Projective dimension is the least possible length of a projective resolution, and is zero exactly for projective objects (Projective dimension of an object). Left and right global dimensions are the separate suprema of these dimensions (Left and right global dimension of a ring).

Proof

technique · direct
1.1givenL1L2L4construct

Take the canonical surjection ε:Z(A)→A and put F=Z(A), K=ker⁡ε. The sequence 0→K→F→A→0 is exact. Under the stated AC hypothesis, [L2] makes K free and both K and F projective. Hence this is a projective resolution of length at most one, and pd⁡ZA≤1. No family of resolutions of all groups is selected: this construction applies separately to each A.

2.1givenstep 1.1L3L4algebra

The group Z/nZ is not projective. Otherwise its identity map would lift through the quotient surjection π:Z→Z/nZ to a homomorphism s with πs=id. But ns([1])=s(n[1])=s(0)=0, and an integer annihilated by the positive integer n is zero. Thus s([1])=0, contradicting πs([1])=[1]≠0 for n>1. Consequently [L4] and step 1.1 give pd⁡Z(Z/nZ)=1, while step 1.1 bounds every projective dimension by one. Therefore the left global dimension is exactly one.

3.1step 2.1L3L4algebra∎

Left and right Z-modules are both precisely abelian groups with the integer action given by repeated addition and additive inverses. Passing from ma to am=ma preserves the underlying homomorphisms, exact sequences, and lifting diagrams; thus it preserves projectivity and lengths of projective resolutions in both directions. Their two suprema are therefore equal, so the right global dimension is also one.

Remarks

The nonprojectivity argument for Z/nZ is choice-free. AC enters the upper bound through the two explicit suppliers in [L2]. No comparison of unbounded resolutions, Ext calculation, or implication from AC to DC is needed for this proof.

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: an extension of M by N represents Ext one of N by M

Statement

FALSE: an extension of M by N represents Ext one of N by M

Facts & Assumptions

Given: M=Z/nZ, N=Z, and n≥2 in the category of abelian groups.

Refutation

technique · direct
1.1givenalgebra

An extension of M by N has the typed form 0→N→E→M→0; its connecting homomorphism starts at 1M∈Hom⁡(M,M) and lands in Ext⁡1(M,N).

2.1step 1.1algebra∎

Here Ext⁡1(Z/nZ,Z)≅Z/nZ, whereas Ext⁡1(Z,Z/nZ)=0 because Z is projective. Interchanging the endpoints therefore changes the group and disproves the asserted order.

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

FALSE: Baer sum only takes the direct sum of middle objects

Statement

FALSE: Baer sum only takes the direct sum of middle objects

Facts & Assumptions

Given: Two extensions 0→N→Ei→M→0 for i=1,2.

Refutation

technique · direct
1.1givenalgebra

Taking their direct sum gives 0→N⊕N→E1⊕E2→M⊕M→0, whose endpoints are N⊕N and M⊕M, not the required N and M.

2.1step 1.1algebra∎

Pulling this sequence back along Δ:M→M⊕M restores the quotient M, and pushing out along ∇:N⊕N→N restores the subobject N. These two operations, not merely the direct sum of middle terms, define the Baer sum.

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

FALSE: extension classes automatically form a set

Statement

FALSE: for fixed objects in an arbitrary abelian category, merely defining equivalence of extensions proves that the extension classes form a set.

Facts & Assumptions

Given: An arbitrary abelian category and fixed objects M,N, with no local-smallness, essential-smallness, or enough-resolution hypothesis imposed.

Refutation

technique · direct
1.1givenalgebra

The axioms stated here do not bound the possible middle objects E by a set. Thus the definition initially supplies only a class of extensions and an equivalence relation on it. Taking a quotient of a class by an equivalence relation does not, by itself, prove that the quotient is a set.

2.1step 1.1algebra∎

The cited corollary obtains a set only after a resolution-based classification identifies the classes with a set-sized Ext⁡1(M,N). That extra smallness discharge is not a consequence of the equivalence-relation definition alone, which refutes the claim as now stated.

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

FALSE: the Yoneda product is graded commutative for every abelian category

Statement

FALSE: the Yoneda product is graded commutative for every abelian category

Facts & Assumptions

Given: A field k, the algebra R=k⟨x,y⟩/(x,y)2, and its simple left module S=R/(x,y).

Refutation

technique · direct
1.1givenconstruct

Put V=kx⊕ky, so R=k⊕V and V2=0. A free resolution of S is Pn=R⊗kV⊗n with dn(r⊗v1⊗⋯⊗vn)=rv1⊗v2⊗⋯⊗vn. Its kernel in degree n is V⊗kV⊗n, exactly the image of dn+1, so it is exact. Applying Hom⁡R(−,S) gives zero differentials and identifies Ext⁡Rn(S,S) with (V∗)⊗n.

2.1step 1.1algebra∎

Under Yoneda splicing, the two degree-one dual basis classes u,v∈V∗ multiply by tensor concatenation. Thus uv and vu are the two distinct basis tensors of (V∗)⊗2. In particular the self-Ext algebra is the free associative algebra Tk(V∗), which is not graded commutative. This is a typed counterexample inside one self-Ext algebra.

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

FALSE: projective dimension is the length of any projective resolution

Statement

FALSE: projective dimension is the length of any projective resolution

Facts & Assumptions

Given: M=Z/nZ with n≥2 as a Z-module.

Refutation

technique · direct
1.1givenalgebra

The two-term resolution 0→Z→nZ→M→0 has length one, and Ext⁡1(M,Z)≅Z/nZ≠0, so the projective dimension of M is exactly one.

2.1step 1.1algebra∎

Yet 0→Z→c↦(0,c)Z2→(a,b)↦naZ→M→0 is also exact and consists of projectives, but has length two. Hence projective dimension is the least possible length, not the length of every resolution.

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

FALSE: left and right global dimensions are equal by definition

Statement

FALSE: left and right global dimensions are equal by definition

Facts & Assumptions

Given: An arbitrary ring R and the definitions of left and right global dimension.

Refutation

technique · direct
1.1givenalgebra

Left global dimension is sup⁡{pd⁡RM:M a left R-module}, while right global dimension is the corresponding supremum over right R-modules, equivalently left Rop-modules.

2.1step 1.1algebra∎

These are distinct definitions on distinct module categories; no equality is built into either one. Any theorem equating them must add hypotheses or prove a comparison, so equality cannot hold “by definition.”

Sources