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

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

Projective and Injective Resolutions

1 · Prerequisites

2 · Summary

This page introduces projective and injective resolutions as augmented or coaugmented exact complexes and then keeps the major structural results separate: existence, comparison, uniqueness up to homotopy, horseshoe constructions, Schanuel-type stable comparison, and the Grothendieck injective-embedding theorem.

The separation is deliberate. Existence never silently becomes functoriality, comparison existence never silently becomes uniqueness, higher syzygies remain relative to displayed resolutions, and the Grothendieck injective theorem keeps its generator, pushout, transfinite, and AB5 steps visible.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Augmented chain complexes over an object

Definition

Let A be an object of an abelian category. An augmented chain complex over A is a chain complex in nonnegative degrees d3P2d2P1d1P0 together with a morphism ε:P0A such that εd1=0.

Equivalently, one has an extended chain P2P1P0A0 whose consecutive composites are zero.

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

Coaugmented cochain complexes under an object

Definition

Let A be an object of an abelian category. A coaugmented cochain complex under A is a cochain complex in nonnegative degrees I0d0I1d1I2d2 together with a morphism η:AI0 such that d0η=0.

Equivalently, one has an extended cochain 0AI0I1I2 whose consecutive composites are zero.

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

Projective resolutions in an abelian category

Definition

Let A be an object of an abelian category. A projective resolution of A is an augmented chain complex P2P1P0εA0 such that every Pn is projective and the augmented complex is exact at every displayed term.

Thus a projective resolution is an exact way of recovering A from projective objects arranged in homological degrees.

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

Injective resolutions in an abelian category

Definition

Let A be an object of an abelian category. An injective resolution of A is a coaugmented cochain complex 0AηI0I1I2 such that every In is injective and the coaugmented complex is exact at every displayed term.

Thus the object A sits as the initial term of an exact cochain complex of injective objects.

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

Deleted resolutions

Definition

If P2P1P0εA0 is a projective resolution of A, its deleted projective resolution is the chain complex P2P1P00, obtained by removing the resolved object A and the augmentation.

Dually, if 0AI0I1I2 is an injective resolution, its deleted injective resolution is the cochain complex 0I0I1I2, obtained by removing the coaugmentation from A.

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

The length of a resolution

Definition

A projective resolution P2P1P0A0 has length at most n when Pi=0 for every i>n. Its length is the least such n when one exists, and is infinite otherwise.

Dually, an injective resolution 0AI0I1I2 has length at most n when Ii=0 for every i>n, with length defined in the same way.

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

Syzygies and cosyzygies relative to a chosen resolution

Definition

Fix a projective resolution P2d2P1d1P0εA0. Its first syzygy relative to this resolution is ΩP1(A):=ker(ε), and for n2 its nth syzygy relative to this resolution is ΩPn(A):=ker(dn1).

Dually, for an injective resolution 0AηI0d0I1d1I2, its first cosyzygy relative to this resolution is ΣI1(A):=coker(η), and for n2 its nth cosyzygy relative to this resolution is ΣIn(A):=coker(dn2).

These objects are attached to the displayed resolution. No canonical-object claim is made without further comparison data.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

One-step extension of a partial projective resolution

Statement

Let PnPn1P0εA0 be an augmented chain complex that is exact at every displayed term except possibly at Pn. Let Kn be the kernel of the previous displayed map, so K0=ker(ε) and Kn=ker(PnPn1) for n1.

If q:Pn+1Kn is an epimorphism from a projective object Pn+1, then composing q with the kernel inclusion KnPn extends the complex by one term and makes it exact at Pn.

Facts & Assumptions

Given: The displayed partial augmented complex and a chosen epimorphism q:Pn+1Kn with Pn+1 projective.

[L1]

Exactness at a degree means that the image of the incoming differential is the kernel subobject of the outgoing differential (Exactness of a complex at a degree and acyclic complexes).

[L2]

An augmented chain complex records the extra map to the resolved object (Augmented chain complexes over an object).

[L3]

Projective objects are the allowable terms in a projective resolution (Projective object).

Proof

technique · direct
1.1

Let in:KnPn be the kernel inclusion, and define the new differential by dn+1:=inq:Pn+1Pn. Because in lands in the kernel of the previous displayed map, the composite of the new differential with that previous map is zero, so the extended row is again an augmented chain complex in the sense of [L2].

givenL2construct
2.1

The image of dn+1 is the image of inq, which is exactly Kn because q is epic. By [L1], this is precisely the exactness condition at Pn. The new term is projective by the given hypothesis and [L3].

L1L3step 1.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

One-step extension of a partial injective resolution

Statement

Let 0AηI0I1In be a coaugmented cochain complex that is exact at every displayed term except possibly at In. Let Cn be the cokernel of the previous displayed map, so C0=coker(η) and Cn=coker(In1In) for n1.

If j:CnIn+1 is a monomorphism into an injective object In+1, then composing the quotient map InCn with j extends the complex by one term and makes it exact at In.

Facts & Assumptions

Given: The displayed partial coaugmented complex and a chosen monomorphism j:CnIn+1 with In+1 injective.

[L1]

Exactness at a degree means that the image of the incoming map equals the kernel of the outgoing map (Exactness of a complex at a degree and acyclic complexes).

[L2]

A coaugmented cochain complex records the extra map from the resolved object (Coaugmented cochain complexes under an object).

[L3]

Injective objects are the allowable terms in an injective resolution (Injective object).

Proof

technique · direct
1.1

Let πn:InCn be the cokernel map and define the new differential by dn:=jπn:InIn+1. Since πn kills the image of the previous displayed map, the composite of that previous map with dn is zero, so the extended row is again a coaugmented cochain complex in the sense of [L2].

givenL2construct
2.1

Because j is monic, the kernel of dn=jπn is the kernel of πn, namely the image of the previous displayed map. By [L1], this is exactly the required exactness at In. The new term is injective by the given hypothesis and [L3].

L1L3step 1.1
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

A chosen chain of projective epimorphisms gives a projective resolution

Statement

Let A be an object of an abelian category. Suppose one has chosen an epimorphism P0A with P0 projective and, for each n0, an epimorphism Pn+1Kn from a projective object onto the current kernel Kn of the previous displayed map. Then composing each chosen epimorphism with its kernel inclusion produces an augmented complex P2P1P0A0 that is a projective resolution of A.

Facts & Assumptions

Given: An object A of an abelian category, together with a chosen projective epimorphism onto A and a chosen projective epimorphism onto each successive kernel.

[L1]

A chosen projective epimorphism onto the current kernel extends a partial resolution by one exact step (One-step extension of a partial projective resolution).

[L2]

A projective resolution is an exact augmented complex of projective objects (Projective resolutions in an abelian category).

Proof

technique · direct
1.1

Start with the chosen epimorphism P0A. Applying [L1] to the chosen epimorphism P1K0 makes P1P0A0 exact, and repeating the same step with the chosen epimorphism onto each later kernel produces an augmented exact complex P2P1P0A0 whose terms are all projective.

L1givenconstruct
2.1

By [L2], the complex assembled in step 1.1 is a projective resolution of A, including the case A=0 when the chosen initial epimorphism may be 00.

L2step 1.1
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

A chosen chain of injective embeddings gives an injective resolution

Statement

Let A be an object of an abelian category. Suppose one has chosen a monomorphism AI0 into an injective object and, for each n0, a monomorphism CnIn+1 from the current cokernel Cn of the previous displayed map into an injective object. Then composing each quotient map with its chosen embedding produces a coaugmented complex 0AI0I1I2 that is an injective resolution of A.

Facts & Assumptions

Given: An object A of an abelian category, together with a chosen injective embedding of A and a chosen injective embedding of each successive cokernel.

[L1]

A chosen injective embedding of the current cokernel extends a partial coaugmented resolution by one exact step (One-step extension of a partial injective resolution).

[L2]

An injective resolution is an exact coaugmented complex of injective objects (Injective resolutions in an abelian category).

Proof

technique · direct
1.1

Start with the chosen monomorphism AI0. Applying [L1] to the chosen embedding C0I1 makes 0AI0I1 exact, and repeating the same step with the chosen embedding of each later cokernel produces an exact coaugmented complex 0AI0I1I2 whose terms are all injective.

L1givenconstruct
2.1

By [L2], the complex assembled in step 1.1 is an injective resolution of A, including the case A=0 when the chosen initial embedding may be 00.

L2step 1.1
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Under the Axiom of Choice, every module admits a projective resolution

Statement

Assume the Axiom of Choice. Then every left module over a unital ring admits a projective resolution.

Facts & Assumptions

Given: A unital ring R and a left R-module M.

[L1]

The canonical iterated free-cover construction gives an exact augmented free resolution in ZF (The iterated free-module resolution is canonical in ZF).

[L2]

Under the Axiom of Choice, every free module is projective (Free modules are projective, with the exact choice boundary).

[L3]

A projective resolution is an exact augmented complex of projectives (Projective resolutions in an abelian category).

Proof

technique · direct
1.1

By [L1], the module M has a canonical exact augmented complex of free R-modules ending in M. Because AC is assumed, [L2] makes every term of that complex projective.

L1L2
2.1

By [L3], that exact augmented complex is a projective resolution of M, including the case M=0.

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

Every module admits an injective resolution

Statement

Assume the Axiom of Choice.

Every left module over a unital ring admits an injective resolution.

Facts & Assumptions

Given: A unital ring R and a left R-module M.

[L1]

Module categories are Grothendieck categories (Module categories are Grothendieck categories).

[L2]

In a Grothendieck category, every object admits a functorial monomorphism into an injective object (Grothendieck abelian categories have functorial injective embeddings).

[L3]

A chosen injective embedding of the current cokernel extends a partial coaugmented resolution by one exact step (One-step extension of a partial injective resolution).

[L4]

An injective resolution is an exact coaugmented complex of injectives (Injective resolutions in an abelian category).

Proof

technique · direct
1.1

By [L1] and [L2], every left R-module X admits a functorial monomorphism ηX:XE(X) into an injective module. Starting from M, set I0:=E(M) and let C0 be the cokernel of ηM; recursively set In+1:=E(Cn) and let Cn+1 be the cokernel of CnIn+1.

L1L2construct
2.1

Applying [L3] at each stage of the recursion in step 1.1 yields an exact coaugmented complex 0MI0I1I2 whose terms are injective.

L2L3step 1.1construct
3.1

By [L4], the complex from step 2.1 is an injective resolution of M, including the case M=0.

L4step 2.1
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

The iterated free-module resolution is canonical in ZF

Statement

For every left R-module M, repeatedly taking the canonical free cover of the current kernel yields a functorial exact augmented complex of free modules F2F1F0M0. This construction is available in ZF because it uses only underlying sets and canonical free-module maps. Under the previously recorded choice boundary for free modules, the same complex is a projective resolution.

Facts & Assumptions

Given: A left R-module M.

[L1]

Every module has a canonical free cover R(X)X on its underlying set (Every module is a quotient of a free module).

[L2]

Free modules are projective with the previously recorded choice boundary (Free modules are projective, with the exact choice boundary).

[L3]

A chosen surjection onto the current kernel extends an exact augmented complex by one degree (One-step extension of a partial projective resolution).

Proof

technique · constructive
1.1

Put F0:=R(M) and let ε0:F0M be the canonical map from [L1]. Having defined Kn as the current kernel, set Fn+1:=R(Kn) and let εn+1:Fn+1Kn be its canonical free cover from [L1]. These assignments are functorial because they depend only on the underlying-set construction in [L1].

L1construct
2.1

Each Fn is free, hence projective under the recorded boundary [L2]. By applying [L3] successively to the canonical surjections of step 1.1, one obtains an exact augmented complex F2F1F0M0.

L2L3step 1.1construct
3.1

Therefore the iterated free-cover construction gives a functorial exact free resolution in ZF. No basis choice or arbitrary lift is used at any stage; projectivity enters only through [L2].

L2step 2.1discharge-construct
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Augmentation-preserving maps of projective resolutions

Definition

Let P1P0εPA0 and Q1Q0εQB0 be projective resolutions, and let u:AB be a morphism.

An augmentation-preserving map of projective resolutions lifting u is a chain map f:PQ such that εQf0=uεP.

Thus the degree-zero square with the augmentations commutes, and the higher maps are compatible with the differentials because f is a chain map.

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

Lifting a map through degree zero of a projective resolution

Statement

Let u:AB be a morphism, let PA be a projective resolution, and let QB be a projective resolution. Then there exists a morphism f0:P0Q0 such that εQf0=uεP.

Facts & Assumptions

Given: The morphism u:AB and projective resolutions PA, QB.

[L1]

An augmentation-preserving comparison map is required to satisfy εQf0=uεP at degree zero (Augmentation-preserving maps of projective resolutions).

[L2]

Projective objects lift across epimorphisms (Projective object).

Proof

technique · direct
1.1

The augmentation εQ:Q0B is epic, and P0 is projective. Apply [L2] to the composite uεP:P0B to obtain a lift f0:P0Q0 with εQf0=uεP.

L2givenconstruct
2.1

By [L1], the map f0 of step 1.1 is exactly the required degree-zero part of an augmentation-preserving comparison map.

L1step 1.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Extending a partial comparison map by one degree

Statement

Let u:AB be a morphism, and let PA and QB be projective resolutions. Suppose morphisms f0,,fn have already been chosen so that the augmentation condition holds and the chain-map squares commute through degree n. Then there exists fn+1:Pn+1Qn+1 making the next square commute as well.

Facts & Assumptions

Given: Projective resolutions PA and QB, a morphism u:AB, and a partial comparison map through degree n.

[L1]

A projective resolution is exact, so at degree n its cycle object is the image of the next differential (Projective resolutions in an abelian category).

[L2]

The nth cycle object is the kernel of the degree-n differential (Cycle and boundary subobjects of a complex).

[L3]

Projective objects lift across epimorphisms (Projective object).

Proof

technique · direct
1.1

If n=0, the augmentation identity gives εQf0d1P=uεPd1P=0, so f0d1P lands in ker(εQ)=Z0(Q). If n>0, the previous squares commute and dnQfndn+1P=fn1dnPdn+1P=0, so again fndn+1P lands in Zn(Q)=ker(dnQ) by [L2]. Exactness of Q at degree n makes the canonical map Qn+1Zn(Q) epic by [L1].

L1L2givenalgebra
2.1

The object Pn+1 is projective, so [L3] lifts fndn+1P:Pn+1Zn(Q) across the epimorphism Qn+1Zn(Q). Writing the lift as fn+1 gives dn+1Qfn+1=fndn+1P, so the partial comparison map extends by one degree.

L3step 1.1construct
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Projective comparison maps exist

Statement

Assume the Axiom of Dependent Choice.

Let u:AB be a morphism, and let PA and QB be projective resolutions. Then there exists an augmentation-preserving chain map f:PQ lifting u.

Facts & Assumptions

Given: A morphism u:AB and projective resolutions PA, QB.

[L1]

Degree zero can be lifted across the target augmentation (Lifting a map through degree zero of a projective resolution).

[L2]

A partial comparison map extends one degree at a time (Extending a partial comparison map by one degree).

[L3]

The required notion is an augmentation-preserving chain map (Augmentation-preserving maps of projective resolutions).

[L4]

Dependent choice licenses the countable successor-by-successor selection of compatible lifts (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Proof

technique · direct
1.1

By [L1], choose f0:P0Q0 with εQf0=uεP.

L1construct
2.1

Starting from the degree-zero lift in step 1.1, every partial comparison map through degree n extends to one through degree n+1 by [L2]. The successive choices depend on the previously chosen partial map, so [L4] produces maps fn in every degree.

L2L4step 1.1choose
3.1

The family (fn) is a chain map by construction, and step 1.1 gives the augmentation identity. Hence [L3] is satisfied, so f is a comparison map lifting u.

L3step 1.1step 2.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

Extending a partial comparison homotopy by one degree

Statement

Let f,g:PQ be augmentation-preserving maps of projective resolutions lifting the same object morphism. Suppose h0,,hn1 have already been chosen so that fkgk=dk+1Qhk+hk1dkP holds for every k<n (with h1=0). Then there exists hn:PnQn+1 extending the homotopy identity to degree n.

Facts & Assumptions

Given: Projective resolutions PA, QB, two comparison maps f,g lifting the same object morphism, and a partial chain homotopy through degree n1.

[L1]

A chain homotopy is given by the equation fngn=dn+1Qhn+hn1dnP (A chain homotopy).

[L2]

Cycle objects are kernels of the differentials (Cycle and boundary subobjects of a complex).

[L3]

Projective objects lift across epimorphisms (Projective object).

Proof

technique · direct
1.1

Put cn:=fngnhn1dnP, with h1=0 when n=0. Using the chain-map identities for f and g and the already verified lower-degree homotopy equations, one gets dnQcn=0. Thus cn lands in Zn(Q) by [L2]; when n=0, the common augmentation condition on f0 and g0 says exactly that c0 lands in ker(εQ)=Z0(Q).

L1L2givenalgebra
2.1

Exactness of Q makes Qn+1Zn(Q) epic, and Pn is projective. By [L3], lift cn to a map hn:PnQn+1. Then dn+1Qhn=cn, which is precisely the degree-n homotopy equation from [L1].

L3step 1.1construct
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Projective comparison maps are unique up to chain homotopy

Statement

Assume the Axiom of Dependent Choice.

Any two augmentation-preserving maps between projective resolutions lifting the same object morphism are chain-homotopic.

Facts & Assumptions

Given: Two augmentation-preserving maps f,g:PQ between projective resolutions, lifting the same object morphism u:AB.

[L1]

A partial comparison homotopy extends one degree at a time (Extending a partial comparison homotopy by one degree).

[L2]

The maps f and g are comparison maps in the sense of Augmentation-preserving maps of projective resolutions.

[L3]

Dependent choice licenses the countable successor-by-successor selection of compatible homotopy components (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Proof

technique · direct
1.1

Start at degree 0. Because f and g lift the same object map, [L1] produces h0:P0Q1. Every partial homotopy through degree n1 extends one degree further by [L1], and the successive choices depend on the previously chosen components. Therefore [L3] produces a family hn:PnQn+1 in every degree.

L1L2L3construct
2.1

By construction, the family (hn) satisfies the defining chain-homotopy equation in every degree. Therefore f and g are chain-homotopic.

step 1.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Projective resolutions of the same object are homotopy equivalent over that object

Statement

Assume the Axiom of Dependent Choice.

Any two projective resolutions of the same object are homotopy equivalent over that object.

Facts & Assumptions

Given: Two projective resolutions PA and QA of the same object A.

[L1]

Comparison maps between projective resolutions exist (Projective comparison maps exist).

[L2]

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

Proof

technique · direct
1.1

Apply [L1] to 1A in each direction. This gives comparison maps f:PQ and g:QP, both lifting the identity on A.

L1construct
2.1

The composites gf and fg also lift 1A, as do the identity chain maps on P and Q. By [L2], gf1Pandfg1Q. Thus the two resolutions are homotopy equivalent over A, including when A=0.

L2step 1.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

Injective comparison maps exist

Statement

Assume the Axiom of Dependent Choice.

Let u:AB be a morphism, and let I and J be injective resolutions of A and B. Then there exists a coaugmentation-preserving cochain map IJ extending u.

Facts & Assumptions

Given: A morphism u:AB and injective resolutions I of A and J of B.

[L1]

The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).

[L2]

An injective resolution is the cochain datum to be dualized (Injective resolutions in an abelian category).

[L3]

Projective comparison maps exist (Projective comparison maps exist).

Proof

technique · direct
1.1

By [L1], pass to the opposite abelian category. Reversing arrows turns the given injective resolutions from [L2] into projective resolutions there, and u:AB becomes a morphism in the opposite direction. Apply [L3] in the opposite category to obtain the required comparison map.

L1L2L3construct
2.1

Translating that chain map back to the original category reverses arrows again and yields a cochain map IJ extending u.

step 1.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

Injective comparison maps are unique up to cochain homotopy

Statement

Assume the Axiom of Dependent Choice.

Any two coaugmentation-preserving maps between injective resolutions extending the same object morphism are cochain-homotopic.

Facts & Assumptions

Given: Two maps between injective resolutions extending the same morphism u:AB.

[L1]

Projective comparison maps are unique up to chain homotopy (Projective comparison maps are unique up to chain homotopy).

[L2]

The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).

Proof

technique · direct
1.1

By [L2], pass to the opposite abelian category. There the two given maps become comparison maps between projective resolutions lifting the same morphism, so [L1] makes them chain-homotopic.

L1L2construct
2.1

Translating the resulting chain homotopy back to the original category gives the required cochain homotopy.

step 1.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Injective resolutions of the same object are homotopy equivalent under that object

Statement

Any two injective resolutions of the same object are homotopy equivalent under that object.

Facts & Assumptions

Given: Two injective resolutions I and J of the same object A.

[L1]

Injective comparison maps exist (Injective comparison maps exist).

[L2]

Injective comparison maps are unique up to cochain homotopy (Injective comparison maps are unique up to cochain homotopy).

Proof

technique · direct
1.1

Apply [L1] to the identity on A in both directions. This yields maps IJ and JI extending 1A.

L1construct
2.1

Their composites and the identity cochain maps all extend 1A, so [L2] makes the composites homotopic to the identities. Hence the two injective resolutions are homotopy equivalent under A, including when A=0.

L2step 1.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

A projective or injective resolution is unique up to nonunique homotopy equivalence

Statement

A projective resolution or an injective resolution of a fixed object is unique up to homotopy equivalence, but the chosen comparison maps need not be unique.

Facts & Assumptions

Given: A fixed object A.

[L1]

Projective resolutions of A are homotopy equivalent over A (Projective resolutions of the same object are homotopy equivalent over that object).

[L2]

Injective resolutions of A are homotopy equivalent under A (Injective resolutions of the same object are homotopy equivalent under that object).

Proof

technique · direct
1.1

The projective statement is exactly [L1], and the injective statement is exactly [L2].

L1L2
2.1

Thus either kind of resolution is unique only up to homotopy equivalence. The preceding comparison theorems show that one may choose many actual lifts inside that homotopy class, so the equivalence is not unique on the nose.

step 1.1
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Comparison maps respect composition up to homotopy

Statement

Assume the Axiom of Dependent Choice.

Given composable morphisms AuBvC and chosen projective resolutions of the three objects, any comparison map lifting vu is chain-homotopic to the composite of a comparison map lifting u with a comparison map lifting v.

Facts & Assumptions

Given: Projective resolutions of A, B, and C, together with comparison maps lifting u and v.

[L1]

Comparison maps exist for the composite morphism (Projective comparison maps exist).

[L2]

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

Proof

technique · direct
1.1

Let F lift u and G lift v. By [L1], choose a comparison map H lifting the composite vu. The composite GF also lifts vu.

L1givenconstruct
2.1

Since H and GF lift the same morphism vu, [L2] makes them chain-homotopic. This is exactly the claimed compatibility with composition up to homotopy.

L2step 1.1
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Comparison of the identity is homotopic to the identity

Statement

Assume the Axiom of Dependent Choice.

Any comparison map lifting the identity of a resolved object is homotopic to the identity chain map on that resolution.

Facts & Assumptions

Given: A projective resolution PA and a comparison map F:PP lifting 1A.

[L1]

Comparison maps respect composition up to homotopy (Comparison maps respect composition up to homotopy).

[L2]

Comparison maps lifting the identity exist, and the literal identity chain map is one of them (Projective comparison maps exist).

Proof

technique · direct
1.1

By [L2], both F and 1P are comparison maps lifting 1A.

L2given
2.1

Apply [L1] with both factors equal to the identity morphism on A, taking the chosen lift of the composite to be F and the two factor lifts to be the literal identity chain maps. Then F is homotopic to 1P1P=1P.

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

The degree-zero horseshoe lift

Statement

Let 0AiApA0 be a short exact sequence, and let P0A,P0A be the degree-zero terms of projective resolutions of A and A. Then there exists an epimorphism λ0:P0P0A whose restrictions to the two summands are iε and a lift of ε through p. In particular P0P0 is projective.

Facts & Assumptions

Given: The short exact sequence above and projective resolutions of A and A.

[L1]

Projective resolutions provide the augmentations and projective degree-zero terms (Projective resolutions in an abelian category).

[L2]

Projective objects lift across epimorphisms (Projective object).

[L3]

Proof

technique · direct
1.1

Since p:AA is epic and P0 is projective, [L2] lifts the augmentation ε:P0A to a map s:P0A with ps=ε.

L1L2construct
2.1

Define λ0(x,y):=iε(x)+s(y). To hit a given aA, first choose yP0 with ε(y)=p(a). Then as(y) lies in ker(p)=im(i), so as(y)=i(a) for some aA, and some xP0 satisfies ε(x)=a. Hence λ0(x,y)=a, so λ0 is epic. Its source is projective by [L3].

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

The horseshoe kernel fits into a short exact sequence

Statement

With the notation of the degree-zero horseshoe lift, let K:=ker(λ0),Ω1(A):=ker(ε),Ω1(A):=ker(ε). Then there is a short exact sequence 0Ω1(A)KΩ1(A)0.

Facts & Assumptions

Given: The degree-zero horseshoe map λ0:P0P0A from The degree-zero horseshoe lift.

[L1]

The degree-zero horseshoe lift gives a commutative diagram with exact rows (The degree-zero horseshoe lift).

[L2]

First syzygies are the kernels of the augmentations (Syzygies and cosyzygies relative to a chosen resolution).

[L3]

The snake lemma extracts an exact kernel sequence from a commutative short-exact diagram (Snake lemma in an abelian category).

[L4]

The nine-lemma package supplies the exactness compatibilities used in the ambient 3×3 diagram (Nine lemma in an abelian category).

Proof

technique · direct
1.1

The map λ0 from [L1] fits into a commutative diagram 0P0P0P0P00 over 0AAA0, where both rows are exact and the top row is split exact. Applying the snake lemma [L3] gives an exact sequence 0ker(ε)ker(λ0)ker(ε)0.

L1L3L4construct
2.1

By [L2], these three kernels are exactly Ω1(A), K, and Ω1(A). Hence the displayed kernel sequence is short exact.

L2step 1.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The inductive horseshoe step

Statement

Suppose 0KnKnKn0 is the short exact sequence of current kernels arising in the horseshoe construction. If the tails of projective resolutions of Kn and Kn are already chosen, then one more degree of the horseshoe construction produces a projective object Pn+1=Pn+1Pn+1 surjecting onto Kn and a new short exact sequence of next kernels.

Facts & Assumptions

Given: The current short exact kernel sequence and the next projective terms of the two side resolutions.

[L1]

The degree-zero horseshoe construction produces the next surjection from a direct sum of projectives (The degree-zero horseshoe lift).

[L2]

The kernel of that new surjection again sits in a short exact sequence with the two side kernels (The horseshoe kernel fits into a short exact sequence).

Proof

technique · direct
1.1

Apply [L1] to the short exact sequence 0KnKnKn0 and to the degree-zero tails of the already chosen projective resolutions of Kn and Kn. This produces a projective object Pn+1=Pn+1Pn+1 together with an epimorphism Pn+1Kn.

L1givenconstruct
2.1

Applying [L2] to that new surjection gives the next short exact sequence of kernels. Therefore the horseshoe construction advances by one degree.

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

The horseshoe lemma for projective resolutions

Statement

Assume the Axiom of Dependent Choice.

Let 0AAA0 be a short exact sequence, and let projective resolutions of A and A be given. Then there exists a projective resolution of A whose degree-n term is PnPn, fitting into a degreewise split short exact sequence of augmented complexes.

Facts & Assumptions

Given: A short exact sequence 0AAA0 and projective resolutions of A and A.

[L1]

The inductive horseshoe step advances the construction by one degree (The inductive horseshoe step).

[L2]

A projective resolution is an exact augmented complex of projective objects (Projective resolutions in an abelian category).

[L3]
[L4]

Dependent choice licenses the countable successor-by-successor selection of the horseshoe lifts and kernel sequences (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Proof

technique · direct
1.1

Start at degree zero with the original short exact sequence 0AAA0. Every current short exact kernel sequence extends one more degree by [L1], and the next choice depends on the previously constructed degree. Therefore [L4] produces the whole augmented complex for A, whose degree-n term is PnPn and whose kernel sequences remain short exact in every degree.

L1L4construct
2.1

Each term PnPn is projective by [L3], and the short exact kernel sequences from step 1.1 are exactly the data needed for exactness of the middle augmented complex. Therefore [L2] identifies the resulting complex as a projective resolution of A.

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

The horseshoe lemma for injective resolutions

Statement

Assume the Axiom of Dependent Choice.

Let 0AAA0 be a short exact sequence, and let injective resolutions of A and A be given. Then there exists an injective resolution of A whose degree-n term is a finite product, equivalently biproduct, InIn.

Facts & Assumptions

Given: A short exact sequence 0AAA0 and injective resolutions of A and A.

[L1]

The projective horseshoe lemma holds (The horseshoe lemma for projective resolutions).

[L2]

Injective resolutions are the cochain objects to be dualized (Injective resolutions in an abelian category).

[L3]

The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).

Proof

technique · direct
1.1

By [L3], pass to the opposite abelian category. The given injective resolutions from [L2] become projective resolutions there, so [L1] supplies the dual horseshoe resolution in the opposite category.

L1L2L3construct
2.1

Translating back to the original category reverses arrows again and turns the opposite-category coproducts into finite products, which in an abelian category are the same biproducts. Hence one obtains the asserted injective horseshoe resolution.

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

Horseshoe resolutions are compatible with morphisms of short exact sequences up to homotopy

Statement

Assume the Axiom of Dependent Choice.

Fix a morphism between two short exact sequences, chosen projective resolutions of the two left objects and the two right objects, and chosen horseshoe middle resolutions for the two middle objects. Then any two middle comparison maps that, together with fixed side comparison maps, form morphisms of short exact sequences of complexes are chain-homotopic. Hence compatibility of chosen horseshoe middle resolutions with the induced middle morphism is only defined up to homotopy.

Facts & Assumptions

Given: A morphism between two short exact sequences, fixed side comparison maps on the chosen end resolutions, and two middle comparison maps that make the corresponding ladders commute.

[L2]

Comparison maps lifting the same morphism are unique up to chain homotopy (Projective comparison maps are unique up to chain homotopy).

[L3]

A morphism of short exact sequences of complexes is the ambient compatibility notion (A morphism of short exact sequences of complexes).

Proof

technique · direct
1.1

By hypothesis and [L3], the two chosen middle maps are comparison maps between the same pair of projective horseshoe resolutions, they lift the same middle-object morphism, and together with the fixed side maps they define morphisms of short exact sequences of complexes.

L3givenalgebra
2.1

Any two such middle comparison maps lifting the same object morphism are chain-homotopic by [L2]. Therefore the horseshoe construction is compatible with morphisms only up to homotopy, not canonically on the nose.

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

A split short exact sequence admits the direct-sum resolution

Statement

Assume the Axiom of Dependent Choice.

Let

0AAA0

be a split short exact sequence, and let projective resolutions of A and A be given. Then the sequence admits a projective resolution of A whose degree-n term is the direct sum PnPn of the chosen side terms.

Facts & Assumptions

Given: A split short exact sequence 0AAA0 and chosen projective resolutions of A and A.

[L1]

The horseshoe lemma produces a middle projective resolution (The horseshoe lemma for projective resolutions).

[L2]

A split short exact sequence identifies the middle object with the direct sum of the two ends (Split short exact sequence in an abelian category).

Proof

technique · direct
1.1

By [L2], identify A with AA. Applying [L1] to the chosen projective resolutions and the chosen splitting maps gives a middle resolution whose degree-n term is PnPn and whose augmentation is the direct-sum augmentation.

L1L2construct
2.1

Under that identification, the differentials are exactly the direct-sum differentials of the two side resolutions. Hence the split short exact sequence admits the direct-sum resolution.

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

Schanuel's lemma in an abelian category

Statement

If 0KPA0and0KPA0 are short exact sequences with P and P projective, then KPKP.

Facts & Assumptions

Given: Two projective presentations of the same object A as displayed.

[L1]

Pullbacks and pushouts provide the comparison object used in the proof (Pullbacks and pushouts as limits and colimits of cospans and spans).

[L2]

The pullback of an epimorphism is an epimorphism (The pullback of an epimorphism is an epimorphism).

[L3]

For a projective object, every epimorphism onto it splits (Projective object characterisations).

Proof

technique · direct
1.1

Form the pullback X=P×AP of the two epimorphisms onto A as in [L1]. By [L2], the projections XP and XP are epimorphisms. Their kernels are K and K respectively, so there are short exact sequences 0KXP0,0KXP0.

L1L2construct
2.1

Since P and P are projective, [L3] splits both short exact sequences. Therefore XKPKP, which yields the claimed isomorphism KPKP.

L3step 1.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Syzygies from two projective resolutions are stably isomorphic

Statement

Syzygies arising from two projective resolutions of the same object are stably isomorphic. In particular, the first syzygies are related by Schanuel's lemma, and higher displayed syzygies inherit the same stable-comparison pattern after truncation.

Facts & Assumptions

Given: Two projective resolutions of the same object A.

[L1]

Syzygies are the kernels selected from a displayed resolution (Syzygies and cosyzygies relative to a chosen resolution).

[L2]

Schanuel's lemma identifies the stable class of two projective presentations of the same object (Schanuel's lemma in an abelian category).

Proof

technique · direct
1.1

The first syzygies of the two resolutions are the kernels of two projective presentations of A by [L1]. Therefore [L2] gives a stable isomorphism between them.

L1L2
2.1

Proceed by induction. Suppose ΩPn1(A)EΩQn1(A)F for projective objects E,F. After identifying these sums with a common object, the two exact rows 0ΩPn(A)Pn1EΩPn1(A)E0 and 0ΩQn(A)Qn1FΩQn1(A)F0 are projective presentations of that common object. Applying [L2] gives ΩPn(A)Qn1FΩQn(A)Pn1E, so the nth syzygies are stably isomorphic. Together with step 1.1 this proves the claim in every degree.

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

The dual Schanuel lemma for injective copresentations

Statement

If 0AIC0and0AIC0 are short exact sequences with I and I injective, then CICI.

Facts & Assumptions

Given: Two injective copresentations of the same object A.

[L1]

Schanuel's lemma holds in an abelian category (Schanuel's lemma in an abelian category).

[L2]

The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).

Proof

technique · direct
1.1

By [L2], pass to the opposite abelian category. The two injective copresentations become projective presentations there, so [L1] applies.

L1L2construct
2.1

Translating the resulting stable isomorphism back to the original category gives CICI, which is the dual Schanuel statement.

step 1.1
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

A projective object has a length-zero projective resolution

Statement

Every projective object admits a length-zero projective resolution.

Facts & Assumptions

Given: A projective object P.

[L1]

A projective resolution is an exact augmented complex of projectives (Projective resolutions in an abelian category).

[L2]

Length at most zero means that all higher terms vanish (The length of a resolution).

[L3]

Projectivity is the standing hypothesis on the degree-zero term (Projective object).

Proof

technique · direct
1.1

Consider the augmented complex 0P1PP0, with P placed in degree zero. It is exact because the augmentation is the identity, and its only nonzero term is projective by [L3].

L1L3construct
2.1

By [L2], this exact augmented complex has length zero. Therefore [L1] identifies it as a length-zero projective resolution of P, including the case P=0.

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

Extension from subobjects of a generator detects injectivity

Statement

Assume the Axiom of Choice.

Let A be a locally small Grothendieck category with a generator U, and let I be an object. If every morphism NI from every subobject NU extends to a morphism UI, then I is injective.

Facts & Assumptions

Given: A locally small Grothendieck category with a generator U and an object I satisfying the extension property for every subobject NU.

[L1]

In an abelian category, if a subobject AB is proper, then some morphism from the generator into B factors through B but not through A (A generator detects comparison of subobjects).

[L2]

A Grothendieck category is an abelian category with AB5 and a generator (Grothendieck category).

[L3]

In a locally small abelian category with a generator, every object has only a set of subobjects up to equivalence (An AB3 locally small abelian category with a generator is well-powered).

[L4]

Injective objects are exactly those extending morphisms across monomorphisms (Injective object).

[L5]

Zorn's lemma supplies maximal elements once every chain has an upper bound (Zorn's lemma).

Proof

technique · direct
1.1

To extend a map AI across a monomorphism AB, consider the set of pairs (A,u) with AAB a subobject and u:AI extending the original map. By [L3], the subobjects AB form a set up to equivalence, and local smallness makes the morphisms AI a set, so this collection is a set. Order it by inclusion of subobjects.

L3givenalgebra
2.1

If T is a chain of such partial extensions, let A be the union of the subobjects in that chain inside B. Because [L2] gives AB5, this filtered colimit is again a subobject of B, and the compatible maps in the chain induce a morphism u:AI extending the original map. Thus every chain has an upper bound.

L2step 1.1algebra
3.1

By [L5], choose a maximal partial extension (Amax,umax).

L5step 2.1choose
4.1

Suppose AmaxB. By [L1], there exists a morphism ψ:UB that does not factor through Amax. Let B0=im(ψ), let N=AmaxB0 inside B, and let M=ψ1(N)U. The composite MNAmaxumaxI extends by hypothesis to a morphism χ:UI.

L1step 3.1givenchoosealgebra
5.1

Because ker(ψ)M, the map χ vanishes on ker(ψ) and therefore factors through B0=im(ψ); write the factor map as u0:B0I. The maps umax:AmaxI and u0:B0I agree on N=AmaxB0, so they glue to a map Amax+B0I extending umax. Since ψ does not factor through Amax, the subobject Amax+B0 is strictly larger than Amax, contradicting maximality. Therefore Amax=B.

step 4.1algebra
6.1

Every map across a monomorphism extends, so I is injective by [L4].

L4step 5.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The one-step generator extension functor

Definition

Let A be a locally small Grothendieck category with fixed generator U, and let M be an object. Because subobjects of U form a set up to equivalence and each hom-class is a set, one may form the set SM={(N,φ)NU, φ:NM}.

For each (N,φ)SM, write iN:NU for the inclusion. The one-step generator extension of M is the pushout (N,φ)SMNM(N,φ)SMUM(M) whose top map is induced by the φ and whose left map is induced by the iN.

The canonical map MM(M) coming from the pushout is denoted ηM. A morphism g:MM carries each pair (N,φ) to (N,gφ), so by the pushout universal property MM(M) defines an endofunctor.

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

The one-step generator map is a functorial monomorphism

Statement

In a locally small Grothendieck category, for the one-step generator extension functor MM(M), the canonical map ηM:MM(M) is a monomorphism, natural in M. In addition, every indexed map NM from a subobject NU extends to a map UM(M) one stage later.

Facts & Assumptions

Given: An object M in a locally small Grothendieck category with fixed generator U.

[L1]

In a locally small Grothendieck category, the one-step generator extension is defined by a pushout over the set of subobjects of U and maps into M (The one-step generator extension functor).

[L2]

Pushouts of monomorphisms are monomorphisms in an abelian category (The pushout of a monomorphism is a monomorphism).

[L3]

AB5 implies AB4, so every small coproduct of monomorphisms in a Grothendieck category is monic (AB5 implies AB4).

Proof

technique · direct
1.1

In the defining pushout square of [L1], the left vertical map is the coproduct of the subobject inclusions NU, hence is monic by [L3]. Therefore the induced map ηM:MM(M) is monic by [L2]. For every g:MM, the morphism M(g) supplied by [L1] is the map of pushouts induced by g, so M(g)ηM=ηMg. Thus the monomorphisms ηM are natural in M.

L1L2L3algebra
2.1

For each (N,φ)SM, let hN,φ:UM(M) be the lower pushout map restricted to the corresponding summand. Commutativity of the defining square gives hN,φiN=ηMφ. Hence every indexed map φ:NM extends across NU after one application of M.

L1step 1.1construct
3.1

Hence ηM is a functorial monomorphism and every indexed generator-subobject map extends after one application of M.

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

Transfinite iteration of the generator extension preserves monomorphisms and factorizes small-source maps

Statement

Assume the Axiom of Choice. In a locally small Grothendieck category, starting from an object M0=M, define a transfinite sequence by Mα+1=M(Mα) and, at limit ordinals λ, by Mλ=colimα<λMα. Then every transition map MαMβ is monic. Let κ bound the cardinalities of the sets of subobjects of all subobjects NU. If λ has cofinality greater than κ, then every map NMλ with NU factors through some earlier stage Mα.

Facts & Assumptions

Given: The Axiom of Choice, a locally small Grothendieck category with generator U, and the transfinite sequence defined from the one-step generator extension functor.

[L1]

The successor-stage maps MαMα+1 are monic (The one-step generator map is a functorial monomorphism).

[L2]

In a Grothendieck category, AB5 governs exactness under filtered colimits (The axioms AB5 and AB5*).

[L3]

In a locally small abelian category with a generator, each object has a set of subobjects (An AB3 locally small abelian category with a generator is well-powered).

Proof

technique · direct
1.1

For every successor ordinal, the transition map MαMα+1 is monic by [L1]. By transfinite induction, any transition map whose target is a successor stage is monic.

L1construct
2.1

Let λ be a limit ordinal and fix α<λ. For αβ<λ, the short exact sequences 0MαMβcoker(MαMβ)0 form a filtered system. Exactness of filtered colimits under [L2] makes the colimit sequence begin 0MαMλ, so the canonical map MαMλ is monic. Together with step 1.1, transfinite induction now shows that every transition map in the tower is monic.

L2step 1.1induction
3.1

By [L3], the subobjects NU form a set and each such N has a set of subobjects. Using Choice, take a cardinal κ bounding all their cardinalities. Fix f:NMλ with NU, and regard each Mα as a subobject of Mλ by step 2.1. The preimages Nα=f1(Mα) form an increasing family of subobjects of N, and [L2] gives α<λNα=f1 ⁣(α<λMα)=N. Choose a set Sλ of at most κ indices representing all distinct Nα. Since cf(λ)>κ, the set S is bounded by some γ<λ. Then Nγ contains every Nα, so the displayed join gives Nγ=N. Equivalently, f factors through Mγ.

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

A sufficiently long generator-extension iteration is injective

Statement

Assume the Axiom of Choice. Let A be a locally small Grothendieck category with generator U, and let (Mα) be the transfinite iteration of the one-step generator extension functor starting at an object M. Let κ bound the cardinalities of the sets of subobjects of all subobjects NU. If λ is a limit ordinal with cf(λ)>κ, then Mλ is injective.

Facts & Assumptions

Given: The Axiom of Choice, the transfinite tower (Mα) in a locally small Grothendieck category with generator U, the bound κ from [L2], and a limit ordinal λ with cf(λ)>κ.

[L1]

Extension from subobjects of the fixed generator detects injectivity (Extension from subobjects of a generator detects injectivity).

[L2]

If cf(λ)>κ, every map from a subobject of the generator to Mλ factors through an earlier stage, and all transition maps are monic (Transfinite iteration of the generator extension preserves monomorphisms and factorizes small-source maps).

[L3]

Every map from a subobject of the generator into one stage extends across the generator at the next stage (The one-step generator map is a functorial monomorphism).

Proof

technique · direct
1.1

Let f:NMλ with NU. By [L2], write f=jα,λg for some α<λ and g:NMα. Since λ is a limit ordinal, α+1<λ. By [L3], there is h:UMα+1 whose restriction to N is ηMαg. Compatibility of the transition maps gives jα+1,λhN=jα+1,ληMαg=jα,λg=f, so jα+1,λh extends f across NU.

L2L3givenconstruct
2.1

Thus every map from every subobject of U extends to U. By [L1], this makes Mλ injective.

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

Grothendieck abelian categories have functorial injective embeddings

Statement

Assume the Axiom of Choice.

Every locally small Grothendieck abelian category admits a functorial monomorphism ηM:ME(M) from each object into an injective object.

Facts & Assumptions

Given: A locally small Grothendieck category A.

[L1]

A Grothendieck category is an abelian category with AB5 and a generator (Grothendieck category).

[L2]

Injectivity is detected by extension from subobjects of the fixed generator (Extension from subobjects of a generator detects injectivity).

[L3]

The one-step generator extension is a functor (The one-step generator extension functor).

[L4]

Its structure maps are functorial monomorphisms (The one-step generator map is a functorial monomorphism).

[L5]

Transfinite iteration preserves monomorphisms and factorizes maps from generator-subobjects at a sufficiently large limit stage (Transfinite iteration of the generator extension preserves monomorphisms and factorizes small-source maps).

[L6]

A sufficiently long iteration is injective (A sufficiently long generator-extension iteration is injective).

Proof

technique · direct
1.1

By [L1], fix a generator U. For any object M, iterate the functor [L3] transfinitely: M=M0M1M2. By [L4] and [L5], every transition map is monic, so the composite MMλ is a monomorphism for every limit stage λ.

L1L3L4L5construct
2.1

Choose a limit stage λ as in [L5]. Then [L6] makes Mλ injective. Because [L3] is functorial at successor stages and colimits preserve that functoriality at limit stages, the assignment MMλ is a functor, and the composite MMλ is natural.

L5L6step 1.1choose
3.1

Writing E(M):=Mλ, the maps ηM:ME(M) give functorial injective embeddings. The detecting lemma [L2] is the reason the transfinite construction closes at stage λ.

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

Every Grothendieck category has enough injectives, and every object admits an injective resolution

Statement

Assume the Axiom of Choice.

Every locally small Grothendieck category has enough injectives, and every object in it admits an injective resolution.

Facts & Assumptions

Given: A locally small Grothendieck category A and an object A of A.

[L1]

Grothendieck categories admit functorial injective embeddings (Grothendieck abelian categories have functorial injective embeddings).

[L2]

A chosen injective embedding of the current cokernel extends a partial coaugmented resolution by one exact step (One-step extension of a partial injective resolution).

[L3]

Enough injectives means that every object embeds in an injective object (A category with enough projectives and with enough injectives).

[L4]

An injective resolution is an exact coaugmented complex of injectives (Injective resolutions in an abelian category).

Proof

technique · direct
1.1

By [L1], every object A admits a monomorphism into an injective object. Therefore A has enough injectives in the sense of [L3].

L1L3
1.2

Starting from the functorial embedding ηA:AE(A) from [L1], let C0 be its cokernel and iterate the same functorial construction on successive cokernels. Applying [L2] at each stage yields an exact coaugmented complex 0AE(A)E(C0)E(C1) of injectives.

L1L2construct
2.1

By [L4], the complex from step 1.2 is an injective resolution of A, including when A=0. Because the embedding functor in [L1] is functorial, no additional arbitrary sequence of choices is introduced.

L1L4step 1.2

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

FALSE: objectwise projective-resolution choices uniquely determine a resolution functor

Statement

False. Once one projective resolution has been chosen for each object in a category with enough projectives, those objectwise choices uniquely determine comparison maps and hence a projective-resolution functor.

Facts & Assumptions

Given: The category of abelian groups and the standard projective resolution of Z/2Z.

[L1]

Enough projectives gives projective resolutions only after choosing successive projective epimorphisms for each fixed object (A chosen chain of projective epimorphisms gives a projective resolution).

[L2]

Finite-rank free modules are projective without any infinite choice (Free modules are projective, with the exact choice boundary).

Refutation

technique · direct
1.1

The proof of [L1] is objectwise: it chooses terms and differentials but supplies no unique lift of a morphism between resolved objects.

L1
1.2

The exact row 0Z2ZZ/2Z0 is a projective resolution by [L2]. On two copies of it, multiplication by 1 in both degrees and multiplication by 3 in both degrees are distinct chain maps lifting the identity of Z/2Z: both commute with multiplication by 2, and 31(mod2). Thus the chosen objectwise resolution does not uniquely determine the map assigned to the identity morphism.

L2algebra
2.1

Therefore objectwise resolution choices do not uniquely determine comparison maps or a resolution functor; additional coherent choices or a separate functorial construction are required.

step 1.1step 1.2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

FALSE: a comparison map between resolutions is unique as a chain map

Statement

False. A comparison map between two projective resolutions is unique as a > chain map.

Facts & Assumptions

Given: The standard projective resolution 0Z2ZZ/2Z0 of Z/2Z.

[L1]

Comparison maps lifting the same object morphism are unique only up to chain homotopy (Projective comparison maps are unique up to chain homotopy).

Refutation

technique · direct
1.1

On two copies of the displayed resolution, multiplication by 1 in both degrees and multiplication by 3 in both degrees are distinct augmentation-preserving chain maps lifting 1Z/2Z, because 31(mod2) and 23=32.

givenalgebra
2.1

Step 1.1 exhibits two different comparison maps lifting the same object morphism. By [L1], the positive theorem only identifies them up to homotopy, so uniqueness as an actual chain map is false.

L1step 1.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: two syzygies of an object are canonically isomorphic

Statement

False. Two syzygies of an object are canonically isomorphic.

Facts & Assumptions

Given: The object Z/2Z.

[L1]

Syzygies are relative to a displayed projective resolution (Syzygies and cosyzygies relative to a chosen resolution).

[L2]

Two projective resolutions give only stable isomorphism data for their syzygies (Syzygies from two projective resolutions are stably isomorphic).

Refutation

technique · direct
1.1

The standard resolution 0Z2ZZ/2Z0 has first syzygy 2ZZ. The stabilized resolution 0ZZ(a,b)(2a,b)ZZZ/2Z0, with augmentation (x,y)xˉ, has first syzygy 2ZZZZ.

L1algebra
2.1

The groups Z and ZZ are not isomorphic, so the two displayed syzygies are certainly not canonically isomorphic. This is exactly why [L2] stops at stable isomorphism rather than literal equality.

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

FALSE: the degree-zero horseshoe lift is unique

Statement

False. Once the side resolutions and the short exact sequence are fixed, the lift s:P0A of the right augmentation through the middle epimorphism in the degree-zero horseshoe step is unique.

Facts & Assumptions

Given: The split short exact sequence 0Zx(x,0)ZZ(x,y)yZ0, with each end object resolved by its length-zero identity resolution.

[L1]

The degree-zero horseshoe construction chooses a lift of the right augmentation through the middle epimorphism (The degree-zero horseshoe lift).

Refutation

technique · direct
1.1

Let p(x,y)=y. The identity augmentation ZZ lifts through p both by s1(y)=(0,y) and by s2(y)=(y,y), since ps1=ps2=idZ. The induced degree-zero middle augmentations are respectively λ1(x,y)=(x,y) and λ2(x,y)=(x+y,y).

givenalgebra
2.1

By step 1.1, both maps satisfy the lifting equation required in [L1], but s1(1)=(0,1)(1,1)=s2(1). Thus the degree-zero horseshoe lift is not unique.

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

FALSE: every abelian category has enough projectives and enough injectives

Statement

False. Every abelian category has enough projectives and enough > injectives.

Facts & Assumptions

Given: The abelian category FinAb of finite abelian groups.

[L1]

Enough projectives and enough injectives are extra hypotheses, not part of the definition of abelian category (A category with enough projectives and with enough injectives).

[L2]

The projective-resolution construction on this page still needs a chosen projective epimorphism at each stage (A chosen chain of projective epimorphisms gives a projective resolution).

[L3]

The Grothendieck theorem gives enough injectives only under additional Grothendieck hypotheses (Every Grothendieck category has enough injectives, and every object admits an injective resolution).

Refutation

technique · direct
1.1

The category FinAb is abelian. If it had enough projectives in the sense of [L1], then some nonzero projective object P would surject onto Z/pZ for some prime p. Choose a cyclic quotient u:PZ/pmZ with m maximal among all cyclic p-power quotients of P.

L1choose
2.1

The canonical quotient q:Z/pm+1ZZ/pmZ is epic. If P were projective, u would lift across q, producing a surjection PZ/pm+1Z, contradicting maximality of m. So FinAb does not have enough projectives, and the universal statement is false. The positive statements [L2] and [L3] are therefore extra-hypothesis results, not automatic consequences of abelianity.

L2L3step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

FALSE: every acyclic complex of projective objects is contractible

Statement

False. Every acyclic complex of projective objects is contractible.

Facts & Assumptions

Given: The bi-infinite chain complex over R=Z/4Z with Cn=R for every n and differential dn equal to multiplication by 2.

[L1]

Contractibility is the existence of a homotopy from the identity to zero (A contractible complex).

[L2]

A bounded-below acyclic complex of projectives is contractible once its cycle epimorphisms split (A bounded below acyclic complex of projective objects is contractible when its cycle epimorphisms split).

Refutation

technique · direct
1.1

Since 22=4=0 in R, the displayed differentials satisfy dn1dn=0. Also ker(dn)=2R=im(dn+1), so the complex is acyclic. Each term R is a free rank-one R-module and hence projective.

givenalgebra
2.1

If a contracting homotopy existed, then for each n one would have 1R=dn+1sn+sn1dn=2sn+2sn1. But every endomorphism of the free rank-one module R is multiplication by an element of R, and the right-hand side is always even while 1R is not. Contradiction.

L1step 1.1algebra
3.1

Therefore the complex is acyclic and degreewise projective but not contractible. The positive theorem [L2] does not apply because this standard counterexample is not bounded below with the required splitting data.

L2step 2.1

Sources