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.

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

Delta Functors and Universality

1 · Prerequisites

2 · Summary

This page packages the long exact sequence data attached to derived functors into the abstract language of delta functors. The first half isolates the structure itself, including the connecting maps built from horseshoe resolutions and the proof that these maps do not depend on the auxiliary horseshoe choices once the supplied resolution data are fixed.

The second half proves the universality criterion from effacement. That is the point at which delta functors become a comparison tool rather than only a way to print long exact sequences: once a degree-zero construction is known to be universal, later balance arguments can reduce higher-degree comparison to the degree-zero map and then invoke uniqueness.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Homological delta functor

Definition

Let A and B be abelian categories. A homological delta functor from A to B is a family of additive functors Tn:AB,n0, together with, for every short exact sequence 0ABC0 in the sense of Exact sequence and short exact sequence in an abelian category, a family of morphisms n:Tn(C)Tn1(A),n>0, such that:

  1. the sequence Tn(A)Tn(B)Tn(C)nTn1(A)Tn1(B)Tn1(C)T0(C)0 is exact, and
  2. for every morphism between short exact sequences, the connecting squares Tn(C)nTn1(A)Tn(C)nTn1(A) commute.

Thus the structure consists of both the long exact sequence and the naturality of its connecting maps.

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

Cohomological delta functor

Definition

Let A and B be abelian categories. A cohomological delta functor from A to B is a family of additive functors Tn:AB,n0, together with, for every short exact sequence 0ABC0, a family of morphisms n:Tn(C)Tn+1(A),n0, such that:

  1. the sequence 0T0(A)T0(B)T0(C)0T1(A)T1(B)T1(C)1T2(A) is exact, and
  2. for every morphism between short exact sequences, the connecting squares Tn(C)nTn+1(A)Tn(C)nTn+1(A) commute.

In particular, T0 is left exact because it begins such a long exact sequence.

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

Morphism of homological delta functors

Definition

Let S=(Sn,S) and T=(Tn,T) be homological delta functors. A morphism of homological delta functors u:ST is a family of natural transformations un:SnTn,n0, such that for every short exact sequence 0ABC0 and every n>0, the square Sn(C)nSSn1(A)un(C)un1(A)Tn(C)nTTn1(A) commutes.

Equivalently, the degreewise natural transformations assemble into a morphism of the long exact sequences attached to every short exact sequence.

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

Morphism of cohomological delta functors

Definition

Let S=(Sn,S) and T=(Tn,T) be cohomological delta functors. A morphism of cohomological delta functors u:ST is a family of natural transformations un:SnTn,n0, such that for every short exact sequence 0ABC0 and every n0, the square Sn(C)SnSn+1(A)un(C)un+1(A)Tn(C)TnTn+1(A) commutes.

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

Universal delta functor

Definition

Let T be a delta functor.

If T=(Tn,T) is homological, then T is universal when for every homological delta functor S=(Sn,S) and every natural transformation u0:S0T0, there exists a unique morphism of homological delta functors u:ST whose degree-zero component is u0.

If T=(Tn,T) is cohomological, then T is universal when for every cohomological delta functor S=(Sn,S) and every natural transformation u0:T0S0, there exists a unique morphism of cohomological delta functors u:TS whose degree-zero component is u0.

So universality says that the higher-degree components are forced by the degree-zero data and the delta-functor axioms.

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

Effaceable homological delta functor in positive degrees

Definition

Let T=(Tn,) be a homological delta functor on an abelian category A. We say that T is effaceable in positive degrees by projectives when for every n>0 and every object A of A, there exists an epimorphism p:PA with P projective such that the induced map Tn(p):Tn(P)Tn(A) is zero.

No globally chosen family of such epimorphisms is part of the definition.

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

Effaceable cohomological delta functor in positive degrees

Definition

Let T=(Tn,) be a cohomological delta functor on an abelian category A. We say that T is effaceable in positive degrees by injectives when for every n>0 and every object A of A, there exists a monomorphism u:AI with I injective such that the induced map Tn(u):Tn(A)Tn(I) is zero.

Again, the definition only asks for existence object by object and degree by degree.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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 construction stays short exact after applying a right exact functor

Statement

Assume the Axiom of Dependent Choice.

Let F:AB be a right exact functor between abelian categories, and let 0AAA0 be a short exact sequence in A. If 0PHP0 is a horseshoe short exact sequence of projective resolutions of A,A,A, then 0F(P,del)F(H,del)F(P,del)0 is a short exact sequence of complexes in B.

Facts & Assumptions

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

[L2]

The horseshoe lemma produces a degreewise split short exact sequence of projective resolutions (The horseshoe lemma for projective resolutions).

[L3]

Additive functors apply degreewise to complexes and chain maps (An additive functor applies degreewise to complexes and chain maps).

[L4]

Exactness of a sequence of complexes is equivalent to exactness in each degree, and that is the definition of a short exact sequence of complexes (A sequence of chain maps is exact exactly when it is exact degreewise, Short exact sequence of complexes).

Proof

technique · direct
1.1

By [L2], each degree of the horseshoe row is a split short exact sequence 0PnHnPn0. Because F is additive by [L1], it preserves the biproduct decomposition carried by that split sequence, so each degree remains exact after applying F.

L1L2givenalgebra
2.1

By [L3], the degreewise images from step 1.1 assemble into a sequence of chain maps 0F(P,del)F(H,del)F(P,del)0. Since it is exact in every degree, [L4] identifies it as a short exact sequence of complexes.

L3L4step 1.1construct
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-05 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 connecting map for left derived functors

Definition

Assume the Axiom of Dependent Choice.

Let P be supplied projective resolution data on a class D in an abelian category A, and let F:AB be an additive right exact functor. Fix a short exact sequence 0AAA0 of objects of D.

Choose a horseshoe projective resolution H of A whose end terms are the supplied resolutions P(A) and P(A). By The horseshoe construction stays short exact after applying a right exact functor and The connecting morphism in homology, this yields connecting morphisms nH:Hn(F(P(A)del))Hn1(F(P(A)del)),n>0.

Replace the supplied datum P only at the object A by the chosen horseshoe resolution H. The resulting datum computes naturally isomorphic left derived functors by Two supplied projective resolution data define naturally isomorphic left derived functors, so each nH may be read as a map nH:LnPF(A)Ln1PF(A).

This map is the connecting map for the left derived functors attached to the chosen horseshoe resolution. The next item proves that it is independent of the horseshoe choice and of the comparison isomorphisms used to read it in the fixed datum P.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05 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 left derived connecting map is independent of the horseshoe resolution and lifts

Statement

Assume the Axiom of Dependent Choice.

In the situation of The connecting map for left derived functors, the map nH:LnPF(A)Ln1PF(A) does not depend on the chosen horseshoe middle resolution H or on the comparison lifts used to transport the homology connecting morphism to the fixed datum P. More generally, a morphism of short exact sequences and fixed comparison lifts on the two end resolutions admit a compatible comparison map between chosen horseshoe middle resolutions; any two such middle maps induce the same maps on homology.

Facts & Assumptions

Given: Two choices of horseshoe middle resolution and comparison lifts for the same short exact sequence 0AAA0.

[L1]

Item 9 defines the connecting map by transporting homology's connecting morphism from a chosen horseshoe sequence (The connecting map for left derived functors).

[L2]

Two horseshoe middle comparison maps fitting the same side data are chain-homotopic (Horseshoe resolutions are compatible with morphisms of short exact sequences up to homotopy).

[L3]

A horseshoe resolution is degreewise the biproduct of the chosen end resolutions (The horseshoe lemma for projective resolutions).

[L4]

The homology connecting morphism is natural under morphisms of short exact sequences of complexes (Naturality of the homology connecting morphism).

[L5]

Chain-homotopic maps induce the same map on homology (Chain-homotopic maps induce the same map on homology).

[L6]

Any two comparison maps between projective resolutions that lift the same object morphism are chain-homotopic, whether or not they were chosen as the same side maps of a horseshoe ladder (Projective comparison maps are unique up to chain homotopy).

Proof

technique · direct
1.1

By [L1], each horseshoe choice gives a short exact sequence of complexes after applying F, hence a homology connecting morphism. For a morphism of the underlying short exact sequences, fix comparison lifts on the two end resolutions. By [L3], write each horseshoe term as the biproduct of its end terms. Inductively in the degree, define the middle comparison map as the fixed diagonal pair of side maps plus an off-diagonal correction. The chain-map defect in degree n lands in the kernel of the target augmentation or differential; projectivity of the corresponding right-hand resolution term lifts it, giving the next correction. This produces a middle chain map for which both side squares commute, hence a morphism of short exact sequences of complexes.

L1L3givenconstruct
2.1

Applied to the identity morphism of the original short exact sequence, step 1.1 supplies a comparison between any two chosen horseshoes. By [L2], any two compatible middle comparisons with the fixed side maps are chain-homotopic.

L2step 1.1
3.1

Applying [L4] to the ladder from step 1.1 shows that the homology connecting morphisms commute with the induced maps on the two ends. If the end comparison lifts are changed, [L6] makes the old and new lifts chain-homotopic and [L5] makes their induced end homology maps equal. With either fixed pair of side lifts, [L2] likewise makes any two compatible middle maps chain-homotopic. Thus all transport maps occurring in the connecting square are unchanged on homology. Applying this to the comparison in step 2.1 shows that the resulting map LnPF(A)Ln1PF(A) is independent of both the horseshoe and transport choices.

L2L4L5L6step 1.1step 2.1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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.

Left derived functors form a homological delta functor

Statement

Assume the Axiom of Dependent Choice.

Let A and B be abelian categories, let P be supplied projective resolution data on all objects of A, and let F:AB be an additive right exact functor. Then the additive functors LnPF:AB,n0, together with the connecting maps of The connecting map for left derived functors, form a homological delta functor on A. Moreover L0PF is naturally isomorphic to F.

Facts & Assumptions

Given: A short exact sequence 0AAA0 in A and an integer n>0.

[L1]
[L2]

Item 9 supplies connecting maps from a chosen horseshoe construction, and item 10 makes them independent of that choice (The connecting map for left derived functors, The left derived connecting map is independent of the horseshoe resolution and lifts).

[L3]

The long exact homology sequence of a short exact sequence of complexes is natural (The long exact homology sequence is natural).

[L4]

The zeroth left derived functor of a right exact functor recovers the original functor (The zero-th left derived functor of a right exact functor recovers the functor).

[L5]

A homological delta functor is exactly the data listed in Homological delta functor.

Proof

technique · direct
1.1

By [L2], choose any horseshoe middle resolution for the given short exact sequence and define the connecting maps from its long exact homology sequence. Using [L3], that horseshoe sequence yields an exact long sequence LnPF(A)LnPF(A)LnPF(A)nLn1PF(A), and item 10 ensures that this sequence depends only on the original short exact sequence, not on the auxiliary horseshoe data.

L2L3givenconstruct
2.1

For a morphism of short exact sequences in A, the generalized comparison assertion in [L2] supplies a compatible morphism between chosen horseshoe sequences. Apply [L3] to it. The connecting squares commute on the horseshoe level, and [L2] transports that naturality to the fixed datum P. Together with the additivity from [L1], this is exactly the homological delta-functor structure required by [L5].

L1L2L3L5step 1.1algebra
3.1

The degree-zero term is naturally isomorphic to F by [L4]. Hence the left derived functors form a homological delta functor with degree zero equal to the original right exact functor.

L4step 2.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05 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.

Right derived functors form a cohomological delta functor

Statement

Assume the Axiom of Dependent Choice.

Let A and B be abelian categories, let I be supplied injective resolution data on all objects of A, and let F:AB be an additive left exact functor. Then the additive functors RInF:AB,n0, admit connecting maps that make them into a cohomological delta functor on A, and RI0F is naturally isomorphic to F.

Facts & Assumptions

Given: A short exact sequence 0AAA0 in A and an integer n0.

[L1]
[L2]

The injective horseshoe is obtained by dualizing the projective horseshoe; the latter fits into a degreewise split short exact sequence of augmented complexes. Consequently the injective horseshoe also carries the dual degreewise split short exact sequence of cochain complexes (The horseshoe lemma for injective resolutions, The horseshoe lemma for projective resolutions).

[L3]

Applying F to a short exact sequence of injective resolution complexes produces a long exact sequence in cohomology, natural under morphisms of such sequences (The long exact sequence in cohomology, Naturality of the cohomology connecting morphism).

[L4]

Replacing the supplied injective resolution datum at one object changes the derived functor only by natural isomorphism (Two supplied injective resolution data define naturally isomorphic right derived functors).

[L5]

The zeroth right derived functor of a left exact functor recovers the original functor (The zero-th right derived functor of a left exact functor recovers the functor).

[L6]

A cohomological delta functor is exactly the data listed in Cohomological delta functor.

[L7]

Different injective comparison extensions of the same object morphism induce the same maps on cohomology (The induced cohomology map is independent of the chosen injective comparison extension).

Proof

technique · direct
1.1

Choose the injective horseshoe from [L2]. Its degreewise split short exact sequence remains split exact after applying the additive functor F, so it becomes a short exact sequence of cochain complexes in B. Now [L3] gives its long exact cohomology sequence, and [L4] transports the middle cohomology groups to the fixed datum I. This defines connecting maps n:RInF(A)RIn+1F(A).

L2L3L4givenconstruct
2.1

Given a morphism of short exact sequences, use the degreewise biproduct form of the two injective horseshoes and construct compatible comparison maps by the dual comparison induction: injectivity extends the off-diagonal correction at each degree. By [L7], different comparison extensions induce the same maps on cohomology. Naturality of the cohomology connecting morphism in [L3] then makes the connecting squares commute, and [L1] supplies additivity. Therefore [L6] identifies (RInF,n) as a cohomological delta functor on A.

L1L2L3L4L6L7step 1.1construct
3.1

The degree-zero term is naturally isomorphic to F by [L5].

L5step 2.1
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05 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.

Natural transformations of base functors give morphisms of derived delta functors

Statement

Assume the Axiom of Dependent Choice.

Let P be supplied projective resolution data, let I be supplied injective resolution data, and let α:FG be a natural transformation between additive functors AB.

If F and G are right exact, then the induced transformations LnP(α):LnPFLnPG assemble into a morphism of homological delta functors.

If F and G are left exact, then the induced transformations RIn(α):RInFRInG assemble into a morphism of cohomological delta functors.

Facts & Assumptions

Given: A short exact sequence 0AAA0 and an integer n0.

[L1]
[L2]

The left and right derived families already carry delta-functor structures (Left derived functors form a homological delta functor, Right derived functors form a cohomological delta functor).

[L3]

The homology and cohomology connecting morphisms are natural with respect to morphisms of short exact sequences of complexes (Naturality of the homology connecting morphism, Naturality of the cohomology connecting morphism).

[L4]

A morphism of delta functors is a degreewise natural transformation that commutes with the connecting maps (Morphism of homological delta functors, Morphism of cohomological delta functors).

Proof

technique · direct
1.1

By [L1], the components LnP(α) and RIn(α) are already natural in the object variable.

L1given
2.1

Compute the connecting maps for the chosen short exact sequence from a horseshoe resolution on the projective or injective side as in [L2]. Applying α degreewise gives a morphism between the two short exact sequences of complexes obtained after applying F and G. By [L3], the corresponding connecting squares in homology or cohomology commute.

L2L3step 1.1construct
3.1

Step 2.1 is exactly the compatibility demanded in [L4]. Therefore the induced degreewise natural transformations from step 1.1 assemble into morphisms of the corresponding derived delta functors.

L4step 2.1
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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 derived long exact sequence

Statement

Assume the Axiom of Dependent Choice.

Let A and B be abelian categories, let P be supplied projective resolution data on all objects of A, and let I be supplied injective resolution data on all objects of A.

If F:AB is additive and right exact, then every short exact sequence 0AAA0 in A yields a natural long exact sequence LnPF(A)LnPF(A)LnPF(A)Ln1PF(A)L0PF(A)0.

If G:AB is additive and left exact, then every such short exact sequence yields a natural long exact sequence 0RI0G(A)RI0G(A)RI0G(A)RI1G(A)RI1G(A).

Facts & Assumptions

Given: A short exact sequence 0AAA0 in A.

[L1]

Left derived functors form a homological delta functor (Left derived functors form a homological delta functor).

[L2]

Right derived functors form a cohomological delta functor (Right derived functors form a cohomological delta functor).

Proof

technique · direct
1.1

The first displayed sequence is exactly the long exact sequence attached by [L1] to the given short exact sequence.

L1given
2.1

The second displayed sequence is exactly the long exact sequence attached by [L2] to the same short exact sequence.

L2step 1.1
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05 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.

Positive left derived functors are effaceable by projectives

Statement

Assume the Axiom of Dependent Choice.

Let A be an abelian category with enough projectives, let P be supplied projective resolution data on all objects of A. Let F:AB be an additive right exact functor. Then the homological delta functor (LnPF) is effaceable in positive degrees by projectives.

Facts & Assumptions

Given: An object AA and an integer n>0.

[L1]

Enough projectives gives an epimorphism q:QA with Q projective (A category with enough projectives and with enough injectives).

[L2]

Positive left derived functors vanish on projective objects (Positive left derived functors vanish on projective objects).

[L3]

Effaceability in positive degrees means killing the induced map from some projective epimorphism (Effaceable homological delta functor in positive degrees).

Proof

technique · direct
1.1

By [L1], choose a projective epimorphism q:QA. The datum P is defined on all of A, so LnPF(Q) is defined; since Q is projective and n>0, [L2] gives LnPF(Q)=0.

L1L2givenconstruct
2.1

The induced map LnPF(q):LnPF(Q)LnPF(A) is therefore the zero map. By [L3], this is exactly the required positive-degree effacement of LnPF(A) by a projective object.

L3step 1.1
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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.

Positive right derived functors are effaceable by injectives

Statement

Assume the Axiom of Dependent Choice.

Let A be an abelian category with enough injectives, let I be supplied injective resolution data on all objects of A. Let F:AB be an additive left exact functor. Then the cohomological delta functor (RInF) is effaceable in positive degrees by injectives.

Facts & Assumptions

Given: An object AA and an integer n>0.

[L1]

Enough injectives gives a monomorphism u:AJ with J injective (A category with enough projectives and with enough injectives).

[L2]

Positive right derived functors vanish on injective objects (Positive right derived functors vanish on injective objects).

[L3]

Effaceability in positive degrees means killing the induced map into some injective object (Effaceable cohomological delta functor in positive degrees).

Proof

technique · direct
1.1

By [L1], choose a monomorphism u:AJ with J injective. The datum I is defined on all of A, so RInF(J) is defined; since J is injective and n>0, [L2] gives RInF(J)=0.

L1L2givenconstruct
2.1

The induced map RInF(u):RInF(A)RInF(J) is therefore zero. By [L3], this is exactly the required positive-degree effacement.

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

Dimension shift for a homological delta functor effaced in the middle

Statement

Let T=(Tn,) be a homological delta functor. For a short exact sequence 0KPA0 and an integer n>0, the connecting map n:Tn(A)Tn1(K) has the following properties:

  1. if Tn(P)Tn(A) is the zero map, then n is a monomorphism,
  2. if Tn1(K)Tn1(P) is the zero map, then n is an epimorphism,
  3. if both conditions hold, then n is an isomorphism.

Facts & Assumptions

Given: A short exact sequence 0KPA0 and an integer n>0.

[L1]

A homological delta functor attaches an exact segment Tn(P)Tn(A)nTn1(K)Tn1(P) to the given short exact sequence (Homological delta functor).

Proof

technique · direct
1.1

By [L1], the kernel of n is the image of Tn(P)Tn(A). Therefore if that incoming map is zero, then ker(n)=0 and n is monic.

L1givenalgebra
1.2

Again by [L1], the image of n is the kernel of Tn1(K)Tn1(P). If the outgoing map is zero, then that kernel is all of Tn1(K), so n is epic.

L1givenalgebra
2.1

When both hypotheses hold, steps 1.1 and 1.2 show that n is both monic and epic, hence an isomorphism in the abelian target category.

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

Dimension shift for a cohomological delta functor effaced in the middle

Statement

Let T=(Tn,) be a cohomological delta functor. For a short exact sequence 0AIC0 and an integer n>0, the connecting map n1:Tn1(C)Tn(A) has the following properties:

  1. if Tn1(I)Tn1(C) is the zero map, then n1 is a monomorphism,
  2. if Tn(A)Tn(I) is the zero map, then n1 is an epimorphism,
  3. if both conditions hold, then n1 is an isomorphism.

Facts & Assumptions

Given: A short exact sequence 0AIC0 and an integer n>0.

[L1]

A cohomological delta functor attaches an exact segment Tn1(I)Tn1(C)n1Tn(A)Tn(I) to the given short exact sequence (Cohomological delta functor).

Proof

technique · direct
1.1

By [L1], the kernel of n1 is the image of Tn1(I)Tn1(C). If that map is zero, then ker(n1)=0, so n1 is monic.

L1givenalgebra
1.2

By [L1], the image of n1 is the kernel of Tn(A)Tn(I). If the latter map is zero, this kernel is all of Tn(A), so n1 is epic.

L1givenalgebra
2.1

When both hypotheses hold, steps 1.1 and 1.2 show that n1 is an isomorphism.

step 1.1step 1.2
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05Open item page →

A partial morphism of delta functors extends through one dimension shift

Statement

Let S and T be delta functors on an abelian category. In the homological case fix n>0; in the cohomological case fix n0.

Homological case: suppose S=(Si,S) and T=(Ti,T) are homological, suppose natural transformations ui:SiTi,0i<n, have already been chosen compatibly with the connecting maps in degrees <n, and choose for an object A a short exact sequence 0KPpA0 such that P is projective and Tn(p)=0. Then there is a unique morphism un(p)(A):Sn(A)Tn(A) such that nTun(p)(A)=un1(K)nS. If a morphism f:AA is covered by a morphism between two such chosen short exact sequences, then the maps un(p)(A) and un(p)(A) are natural with respect to f.

Cohomological case: suppose S=(Si,S) and T=(Ti,T) are cohomological, suppose natural transformations ui:SiTi,0in, have already been chosen compatibly with the connecting maps in degrees <n, and choose for an object A a short exact sequence 0AeIC0 such that I is injective and Sn+1(e)=0. Then there is a unique morphism uAn+1,(e):Sn+1(A)Tn+1(A). More explicitly, let qS:coker(Sn(I)Sn(C))Sn+1(A) be induced by Sn, let un be the map on cokernels induced by un, and let qT:coker(Tn(I)Tn(C))Tn+1(A) be induced by Tn. Then uAn+1,(e) is characterized by uAn+1,(e)qS=qTun. If a morphism f:AA is covered by a morphism between two such chosen short exact sequences, then these maps are natural with respect to f.

Facts & Assumptions

Given: An object A and a chosen effacement sequence as in the statement.

[L1]

Effaceability supplies the chosen projective or injective short exact sequence (Effaceable homological delta functor in positive degrees, Effaceable cohomological delta functor in positive degrees).

[L2]

In the homological case, the chosen effacement makes the connecting map nT:Tn(A)Tn1(K) monic; in the cohomological case, the chosen effacement makes Sn+1(A) the cokernel of Sn(I)Sn(C) (Dimension shift for a homological delta functor effaced in the middle, Dimension shift for a cohomological delta functor effaced in the middle).

[L3]

A natural transformation is defined by commuting with the maps induced by the chosen morphisms (Natural transformation and its components).

Proof

technique · direct
1.1

In the homological case, exactness of the long sequences for the chosen short exact sequence gives Sn(P)Sn(A)nSSn1(K)Sn1(P) and Tn(P)Tn(A)nTTn1(K)Tn1(P). Because the lower incoming map is zero by the chosen effacement, [L2] makes nT monic. The already defined map un1(K) therefore determines at most one map un(p)(A) satisfying nTun(p)(A)=un1(K)nS, and exactness shows that the right-hand side lands in ker(Tn1(K)Tn1(P))=im(nT), so this map exists.

L1L2givenconstruct
2.1

If f:AA is covered by a morphism of chosen effacement sequences, then the already defined degree-(n1) maps are natural by [L3]. Applying the defining equation from step 1.1 on both objects and using naturality of the connecting morphisms inside the two long exact sequences shows that nT has the same composite with both Tn(f)un(p)(A) and un(p)(A)Sn(f). Since the target nT is monic by [L2], these two maps are equal.

L2L3step 1.1algebra
3.1

In the cohomological case, [L2] makes qS an isomorphism. The known map un induces un on the displayed cokernels, while exactness makes Tn factor through the map qT from the target cokernel. Define uAn+1,(e):=qTunqS1. This is the unique map satisfying uAn+1,(e)qS=qTun. The same cokernel equation, together with naturality of the known degree-n maps from [L3], gives naturality for morphisms covered by chosen effacement ladders.

L2L3givenconstruct
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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 effacement extension is independent of the effacing morphism

Statement

In either case of A partial morphism of delta functors extends through one dimension shift, the new component defined from a chosen effacement of A is independent of which effacing morphism is used.

Facts & Assumptions

Given: Two chosen effacements of the same object A.

[L1]

Item 19 defines the next-degree component from any chosen effacement and proves naturality for morphisms covered by morphisms between chosen effacement sequences (A partial morphism of delta functors extends through one dimension shift).

[L2]

Finite coproducts of projectives are projective and finite products of injectives are injective (A coproduct of projectives is projective and a product of injectives is injective).

Proof

technique · direct
1.1

In the homological case, let pi:PiA be two effacements of the relevant target value. Form the epimorphism p=(p1,p2):P1P2A. By [L2], P1P2 is projective. Since Tn is additive, the canonical biproduct identification gives Tn(P1P2)Tn(P1)Tn(P2), and under this identification the map Tn(p) has components Tn(p1) and Tn(p2), both zero. Thus Tn(p)=0, so p is again an admissible effacement.

L1L2givenconstruct
2.1

The inclusions ιi:PiP1P2 satisfy pιi=pi, so they give morphisms from each original effacement to the dominating effacement of step 1.1 over the identity of A. By the naturality part of [L1], the component defined from pi agrees with the one defined from p for each i. Hence the components defined from p1 and p2 are equal.

L1step 1.1algebra
3.1

The cohomological case is dual: if ei:AIi are two effacements, then e=(e1,e2):AI1×I2 is again an admissible effacement by [L2], and the projections I1×I2Ii compare it with each original choice. Applying [L1] as in step 2.1 shows that the resulting degree-(n+1) component is independent of the chosen injective effacement.

L1L2givenalgebra
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05 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 effacement extension commutes with connecting morphisms

Statement

The next-degree components supplied by A partial morphism of delta functors extends through one dimension shift can be chosen so that they commute with the connecting morphisms of every short exact sequence. Equivalently, once the lower-degree components form a partial morphism of delta functors, the one-step extension may be chosen to preserve that compatibility in the next degree as well.

Facts & Assumptions

Given: A short exact sequence and lower-degree components already compatible with its connecting maps.

[L1]

Item 19 defines the next-degree components from chosen effacements and proves naturality when the chosen effacement sequences fit into a ladder (A partial morphism of delta functors extends through one dimension shift).

[L2]

Item 20 makes those next-degree components independent of which effacing morphisms are used (The effacement extension is independent of the effacing morphism).

[L3]

The dimension-shift lemmas give the monicity or epicity used to define the one-step components from the connecting morphisms of the chosen effacement sequences (Dimension shift for a homological delta functor effaced in the middle, Dimension shift for a cohomological delta functor effaced in the middle).

Proof

technique · direct
1.1

In the homological case, write the given sequence as 0AAA0 and choose the projective effacement 0KPpA0 used by [L1] to define un(A). Projectivity of P lifts p through the epimorphism AA; the lift restricts to a map k:KA, producing a morphism from the effacement sequence to the given sequence. By [L2], using this ladder-compatible effacement does not change un(A). Naturality of the two connecting morphisms, the defining equation from [L1], and naturality of the already constructed un1 give givenTun(A)=Tn1(k)effTun(A)=Tn1(k)un1(K)effS=un1(A)givenS. This is the required homological connecting square.

L1L2L3givenconstruct
1.2

In the cohomological case, choose the injective effacement 0AeIC0 used by [L1] to define un+1(A). Injectivity of I extends e across the monomorphism AA and induces a map AC, producing a morphism from the given sequence to the effacement sequence. Again [L2] permits this compatible choice. Naturality of the connectors, the defining cokernel equation from [L1], and naturality of un then give un+1(A)givenS=un+1(A)effSSn(AC)=effTTn(AC)un(A)=givenTun(A). This is the required cohomological connecting square.

L1L2L3givenconstruct
2.1

The two cases show that the one-step extension preserves every connecting morphism, independently of the effacement choices by [L2].

step 1.1step 1.2
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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.

Effaceable homological delta functors are universal

Statement

Let T=(Tn,T) be a homological delta functor on an abelian category. If T is effaceable in positive degrees by projectives, then T is universal.

Facts & Assumptions

Given: A homological delta functor S=(Sn,S) and a natural transformation u0:S0T0.

[L1]

Universality for a homological delta functor means unique extension of u0 to a morphism of homological delta functors (Universal delta functor, Morphism of homological delta functors).

[L2]

Effaceability supplies admissible projective effacements, and the dimension-shift lemma makes the corresponding connecting maps monic (Effaceable homological delta functor in positive degrees, Dimension shift for a homological delta functor effaced in the middle).

[L3]

Item 19 defines the next-degree component from one chosen effacement, item 20 makes it independent of that choice, and item 21 preserves compatibility with connecting morphisms (A partial morphism of delta functors extends through one dimension shift, The effacement extension is independent of the effacing morphism, The effacement extension commutes with connecting morphisms).

Proof

technique · induction
1.1

Start with the given u0 as the degree-zero component.

basegiven
1.2

Suppose by induction that for some n>0 we have already constructed natural transformations ui:SiTi for all i<n, and that these form a morphism of homological delta functors through degree n1. For each object A, choose an effacement pA:PAA for the target value Tn(A) using [L2]. Then [L3] defines a map un(A):Sn(A)Tn(A) from that effacement, and [L3] makes it independent of the chosen pA.

ihL2L3construct
2.1

To check naturality of the family from step 1.2, compare two chosen effacements over a morphism f:AB by a common dominating effacement. The covered naturality from [L3] applies to that dominating choice, and the choice independence from [L3] transports the result back to the original objects. Thus un is natural. The same comparison argument, now applied over a short exact sequence, together with the connecting-map compatibility from [L3], shows that adjoining un preserves the morphism-of-delta-functors condition in degree n.

L3step 1.2discharge-induction
3.1

This constructs a morphism u:ST extending u0 in every degree. For uniqueness, let vn be any other degree-n component compatible with the already fixed lower-degree data. Choose an effacement p:PA for Tn(A). Because un and vn have the same lower-degree compatibility, their composites with nT agree. The map nT is monic by [L2], so un(A)=vn(A). Hence the extension is unique in each degree, and [L1] identifies T as universal.

L1L2step 1.1step 2.1discharge-induction
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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.

Effaceable cohomological delta functors are universal

Statement

Let T=(Tn,T) be a cohomological delta functor on an abelian category. If T is effaceable in positive degrees by injectives, then T is universal.

Facts & Assumptions

Given: A cohomological delta functor S=(Sn,S) and a natural transformation u0:T0S0.

[L1]

Universality for a cohomological delta functor means unique extension of u0 to a morphism of cohomological delta functors (Universal delta functor, Morphism of cohomological delta functors).

[L2]

Effaceability supplies admissible injective effacements, and the dimension-shift lemma identifies the source of the next map with a cokernel (Effaceable cohomological delta functor in positive degrees, Dimension shift for a cohomological delta functor effaced in the middle).

[L3]

Item 19 defines the next-degree component from one chosen effacement, item 20 makes it choice-free, and item 21 preserves compatibility with the connecting maps (A partial morphism of delta functors extends through one dimension shift, The effacement extension is independent of the effacing morphism, The effacement extension commutes with connecting morphisms).

Proof

technique · induction
1.1

Set the degree-zero component to be the given map u0.

basegiven
1.2

Suppose by induction that for some n0 we have already constructed natural transformations ui:TiSi for all in, compatible with the connecting morphisms through degree n1. For each object A, choose an injective effacement eA:AIA for Tn+1(A) using [L2]. The cohomological clause of [L3], which is valid for every n0, defines a map uAn+1:Tn+1(A)Sn+1(A), and [L3] makes it independent of the chosen effacement.

ihL2L3construct
2.1

Naturality and compatibility with the connecting morphisms follow exactly as in the homological case: use the covered naturality from [L3] on a common dominating injective effacement and then appeal to the choice-independence from [L3]. Thus adjoining un+1 extends the partial morphism one degree further.

L3step 1.2discharge-induction
3.1

Uniqueness in degree n+1 comes from the cokernel description in [L2]: once the degree-n component is fixed, item 19 gives only one possible map out of Tn+1(A). Hence the inductive extension is unique in every degree, and [L1] shows that T is universal.

L1L2step 1.1step 2.1discharge-induction
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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.

Derived functors are universal delta functors

Statement

Assume the Axiom of Dependent Choice.

Let A and B be abelian categories, let P be supplied projective resolution data on all objects of A, let I be supplied injective resolution data on all objects of A, and let F:AB be additive.

If F is right exact and the source category has enough projectives, then the left derived delta functor (LnPF) is universal.

If F is left exact and the source category has enough injectives, then the right derived delta functor (RInF) is universal.

Facts & Assumptions

Given: The stated exactness and enough-projectives or enough-injectives hypotheses.

[L1]

Left and right derived functors carry homological and cohomological delta functor structures (Left derived functors form a homological delta functor, Right derived functors form a cohomological delta functor).

[L3]

Effaceable homological or cohomological delta functors are universal (Effaceable homological delta functors are universal, Effaceable cohomological delta functors are universal).

Proof

technique · direct
1.1

In the right exact case, [L1] makes (LnPF) a homological delta functor and [L2] makes it effaceable in positive degrees. Therefore [L3] shows that it is universal.

L1L2L3given
2.1

In the left exact case, [L1] makes (RInF) a cohomological delta functor and [L2] makes it positively effaceable. Applying [L3] again gives its universality.

L1L2L3step 1.1
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

Universal delta functors extending the same degree-zero functor are uniquely isomorphic

Statement

Let F be a fixed degree-zero functor.

If S and T are universal homological delta functors equipped with chosen natural isomorphisms σ:S0F,τ:T0F, then there is a unique isomorphism of homological delta functors ST whose degree-zero part is τ1σ:S0T0.

If S and T are universal cohomological delta functors equipped with chosen natural isomorphisms σ:S0F,τ:T0F, then there is a unique isomorphism of cohomological delta functors ST whose degree-zero part is τ1σ:S0T0.

Facts & Assumptions

Given: Two universal delta functors together with chosen degree-zero identifications to F.

[L1]

Universality for homological and cohomological delta functors is the unique extension property from degree zero (Universal delta functor).

[L2]

Morphisms of delta functors are the degreewise maps compatible with the connecting morphisms (Morphism of homological delta functors, Morphism of cohomological delta functors).

Proof

technique · direct
1.1

In the homological case, set t0=τ1σ:S0T0. Applying [L1] to t0 gives a morphism ϕ:ST, and applying [L1] to t01 gives a morphism ψ:TS. Their composites extend idS0 and idT0 respectively, so uniqueness in [L1] forces ψϕ=idS and ϕψ=idT. Hence ϕ is the unique isomorphism extending τ1σ.

L1L2givenalgebra
2.1

The cohomological case is identical, with the maps oriented out of the universal functors as required by [L1].

L1L2step 1.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

A morphism between universal delta functors is determined in degree zero

Statement

Let S and T be universal delta functors of the same variance.

In the homological case, two morphisms u,v:ST are equal as soon as u0=v0.

In the cohomological case, two morphisms u,v:ST are equal as soon as u0=v0.

Facts & Assumptions

Given: Two morphisms between universal delta functors with the same degree-zero component.

[L1]

Universality says that a degree-zero map has at most one extension to a morphism of delta functors (Universal delta functor).

[L2]

Morphisms of delta functors are exactly the degreewise compatible maps (Morphism of homological delta functors, Morphism of cohomological delta functors).

Proof

technique · direct
1.1

In either variance, the two given morphisms are both extensions of the same degree-zero map. By the uniqueness clause in [L1], there is at most one such extension. Therefore the two morphisms coincide in every degree.

L1L2givenalgebra
2.1

This is precisely the claim that the full morphism is determined in degree zero.

step 1.1
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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.

An exact base functor has the trivial universal delta functor

Statement

Assume the Axiom of Dependent Choice.

Let F:AB be an exact functor between abelian categories. Then both of the following are universal delta functors:

  1. the homological delta functor with degree-zero term F, all higher terms 0, and all connecting maps 0,
  2. the cohomological delta functor with degree-zero term F, all higher terms 0, and all connecting maps 0.

Facts & Assumptions

Given: An exact functor F.

[L1]

An exact functor is additive, left exact, and right exact (Exact functor between abelian categories).

[L2]

Universality for delta functors is the unique extension property from degree zero (Universal delta functor).

Proof

technique · direct
1.1

Fix a short exact sequence 0ABC0. Because F is exact, [L1] gives an exact sequence 0F(A)F(B)F(C)0. Therefore the homological family with degree zero F, higher degrees 0, and zero connecting maps has the required long exact sequences and naturality squares, so it is a homological delta functor.

L1givenalgebra
2.1

Let S=(Sn,S) be any homological delta functor and let u0:S0F be a natural transformation. Define un=0 for n>0. In every connecting square with n>1 this is automatic. For n=1, exactness of S gives im(1S)=ker(S0(A)S0(B)), while step 1.1 gives ker(F(A)F(B))=0; naturality of u0 therefore implies u0(A)1S=0, so the degree-one connecting square also commutes. The extension is unique because there is only one morphism into the zero object in each positive degree. Hence the trivial homological delta functor is universal by [L2].

L1L2step 1.1givenalgebra
3.1

The cohomological case is dual. Step 1.1 already gives exact sequences 0F(A)F(B)F(C)0, so the family with T0=F, Tn=0 for n>0, and zero connecting maps is a cohomological delta functor. Given any cohomological delta functor S=(Sn,S) and any u0:FS0, define un=0 for n>0. Exactness of S gives ker(S0)=im(S0(B)S0(C)), and exactness of F makes F(B)F(C) epic, so naturality of u0 implies S0u0(C)=0. Thus the connecting squares commute, and uniqueness is again immediate in positive degrees. Therefore the trivial cohomological delta functor is universal by [L2].

L1L2step 1.1step 2.1algebra
PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-09-05 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.

Satellites give the first derived functor

Statement

Assume the Axiom of Dependent Choice.

Let A and B be abelian categories, and let F:AB be additive.

If A has enough projectives, F is right exact, and S=(Sn) is any universal homological delta functor equipped with a chosen natural isomorphism S0F, then S1L1PF naturally, for every supplied projective resolution datum P on all objects of A. In this sense the first left satellite of F, defined as the degree-one term of a universal homological delta functor extending F, agrees with L1PF.

If A has enough injectives, F is left exact, and T=(Tn) is any universal cohomological delta functor equipped with a chosen natural isomorphism T0F, then T1RI1F naturally, for every supplied injective resolution datum I on all objects of A. This is the corresponding first right satellite agreement.

Facts & Assumptions

Given: A universal delta functor extending F and the corresponding derived delta functor.

[L1]

Derived functors are universal delta functors (Derived functors are universal delta functors).

[L2]

Two universal delta functors equipped with chosen degree-zero identifications to the same functor are uniquely isomorphic (Universal delta functors extending the same degree-zero functor are uniquely isomorphic).

[L3]

Universality is the structure that defines the satellite terminology used on this page (Universal delta functor).

[L4]

The derived delta functors come with canonical degree-zero identifications to F (Left derived functors form a homological delta functor, Right derived functors form a cohomological delta functor).

Proof

technique · direct
1.1

In the homological case, [L1] makes (LnPF) universal and [L4] identifies its degree-zero term canonically with F. The given satellite functor S is also a universal extension of F by [L3]. Therefore [L2] yields a unique isomorphism of delta functors SLPF, and its degree-one component is the asserted natural isomorphism S1L1PF.

L1L2L3L4givenalgebra
2.1

The cohomological case is identical with (RInF) in place of (LnPF). Its degree-one component gives the natural isomorphism T1RI1F.

L1L2L3L4step 1.1
RemarkRemark: AI-adaptedProof: Not applicableaudited 2026-09-05 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.

Universality is the construction-independence principle

Remark

Universality is what turns a higher-degree construction into an invariant of its degree-zero functor. By Derived functors are universal delta functors, derived functors have that property once their delta-functor structure has been built; by A morphism between universal delta functors is determined in degree zero, any later comparison is forced as soon as degree zero is understood.

That is the principle used on later balance pages such as A balanced derived bifunctor: first construct a degree-zero agreement between two candidate models, then use universality to conclude that every higher comparison is forced. Universality does not replace the earlier need to define the constructions honestly.

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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: any sequence of functors with long exact sequences is a delta functor

Statement

False. Any family of functors that sends every short exact sequence to a long exact sequence is automatically a delta functor.

Facts & Assumptions

Given: The homology delta functor on complexes and one short exact sequence of complexes whose connecting map is nonzero.

[L1]

A delta functor requires naturality of the connecting maps, not only exactness of the long sequence (Homological delta functor, Cohomological delta functor).

[L2]

Homology of complexes is a genuine homological delta functor (Homology of complexes satisfies the delta-functor naturality and exactness laws).

[L3]

There exists a short exact sequence of complexes with a nonzero connecting map (A degreewise split sequence with nonzero connecting map).

Refutation

technique · direct
1.1

Start from the homology delta functor of [L2]. Keep all functors Hn and all connecting maps unchanged except on one chosen short exact sequence with nonzero connector from [L3], where replace the connecting map by its negative. Each long exact sequence stays exact, because negating one map does not change its image or kernel.

L2L3givenconstruct
2.1

By construction, the modified family still has long exact sequences, but on an isomorphism between the altered sequence and an unaltered copy the connecting square no longer commutes: one side uses and the other uses , which are different because 0. Thus [L1] fails, so the modified family is not a delta functor.

L1step 1.1algebra
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-05 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: effaceability means every positive value is zero

Statement

Assume the Axiom of Dependent Choice.

False. If a delta functor is effaceable in positive degrees, then all of its positive-degree values are zero.

Facts & Assumptions

Given: The right exact functor F=()ZZ/n on abelian groups, where n>1 is an integer, together with supplied projective resolution data on all abelian groups.

[L2]

Positive left derived functors of a right exact functor on a category with enough projectives are effaceable (Positive left derived functors are effaceable by projectives).

[L3]

Replacing supplied projective resolution data gives naturally isomorphic left derived functors (Two supplied projective resolution data define naturally isomorphic left derived functors).

Refutation

technique · direct
1.1

Every abelian group is a quotient of a free abelian group, so Ab has enough projectives. Hence [L2] makes the positive left derived functors of F effaceable in the sense of [L1].

L1L2given
1.2

Let Q be supplied projective resolution data obtained from the given datum by using 0ZnZZ/n0 at the object Z/n. Applying F to this resolution gives a deleted complex whose differential n:Z/nZ/n is zero. Therefore L1QF(Z/n)ker(Z/n0Z/n)Z/n0. By [L3], L1PF(Z/n)L1QF(Z/n) for the original supplied datum P, so its first derived value is nonzero as well.

L3givenalgebra
2.1

Thus this homological delta functor is effaceable in positive degrees but has a nonzero positive-degree value, refuting the statement.

step 1.1step 1.2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

FALSE: a degree-zero natural transformation between delta functors always extends uniquely

Statement

False. Every degree-zero natural transformation between delta functors extends uniquely to a morphism of delta functors.

Facts & Assumptions

Given: The exact identity functor E=idAb.

[L1]

Extension from degree zero is the extra property called universality (Universal delta functor).

[L2]

A homological delta functor consists of additive functors, exact long sequences, and natural connecting maps (Homological delta functor).

Refutation

technique · direct
1.1

Define a homological delta functor T on Ab by T1=E and Tn=0 for n1, with every connecting map zero. For each short exact sequence, the only nonzero part of its long sequence is 0E(A)E(B)E(C)0, which is exact because E is exact; naturality is immediate. Thus [L2] applies.

L2givenconstruct
2.1

The unique degree-zero transformation T0=0T0=0 has at least two extensions TT: the zero morphism and the identity morphism. They differ in degree 1, since T1=E0, but have the same degree-zero component. Therefore arbitrary delta functors do not have the unique-extension property [L1].

L1step 1.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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 horseshoe connecting map is independent without a comparison proof

Statement

False. Once the left derived connecting map has been written using a horseshoe resolution, its independence from the chosen horseshoe is automatic and needs no proof.

Facts & Assumptions

Given: Two choices of horseshoe resolution for the same short exact sequence.

[L1]

Item 9 defines the left derived connecting map from a chosen horseshoe resolution and comparison isomorphisms (The connecting map for left derived functors).

[L2]

Item 10 is the statement that different horseshoe choices give the same map (The left derived connecting map is independent of the horseshoe resolution and lifts).

Refutation

technique · direct
1.1

Before [L2] is proved, item 9 produces one map from each chosen horseshoe resolution. Those maps are a priori attached to different auxiliary choices, so there is no equality available merely from the definition in [L1].

L1givenalgebra
2.1

The assertion of [L2] is exactly the missing comparison statement. Thus the independence is not automatic; it is a separate mathematical obligation that must be proved.

L2step 1.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-05 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: universality removes the need for supplied resolution data

Statement

False. Because derived functors are universal delta functors, one never needs to supply projective or injective resolution data in their definition.

Facts & Assumptions

Given: The derived-functor construction and its universality theorem.

[L1]

Left and right derived objects are defined relative to supplied projective or injective resolution data (Supplied projective resolution data, Supplied injective resolution data).

[L2]
[L3]

Universality is a later comparison principle for already constructed delta functors (Derived functors are universal delta functors, A morphism between universal delta functors is determined in degree zero).

Refutation

technique · direct
1.1

The construction of the derived objects starts with the chosen resolution data in [L1]. Without those data there is no deleted resolution to which the functor can be applied.

L1givenalgebra
2.1

Item [L2] shows that even the basic well-definedness claim is a separate comparison theorem about different supplied data. Only after that construction work is in place does [L3] compare the resulting delta functors abstractly. Therefore universality does not remove the need for supplied resolution data at the definition stage.

L2L3step 1.1algebra

Sources