Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-07
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.

Classical derived functors are the cohomology objects of the total derived functor

Statement

Assume the Axiom of Dependent Choice. Let F:AB be additive between abelian categories. On the left assume enough projectives and supplied bounded-above projective replacements, and on the right enough injectives and supplied bounded-below injective replacements. On the respective domains D(A) and D+(A), Hn(LF(M[0]))=LnF(M) and Hn(RF(M[0]))=RnF(M) for n0, relative to the same resolution data, naturally. To compare the classical cycle-lifting connecting maps with the triangle connecting maps for the page's cone convention, multiply these degree-n identifications by (1)n; the resulting natural isomorphisms commute with connecting maps. The left comparison with F in degree zero is an isomorphism when F is right exact; the right comparison is an isomorphism when F is left exact. Conversely such a natural degree-zero comparison isomorphism forces that side-exactness.

The functor LF preserves upper cohomological bounds and RF preserves lower bounds. The truncation maps induce HiLF(X)HiLF(τaX) for ia, and HiRF(τaX)HiRF(X) for ia. On objects of A, H0LF is right exact and H0RF is left exact.

For left exact F, call M right F-acyclic when F(M)[0]RF(M[0]) is invertible. This holds iff RnF(M)=0 for all n>0. In 0ABC0, right acyclicity of (A,C) implies that of B; that of (A,B) implies that of C; that of (B,C) together with epic F(B)F(C) implies that of A. In each case 0F(A)F(B)F(C)0 is exact. Dually, for right exact F, left acyclicity is equivalent to LnF(M)=0 for n>0: the pairs (A,C) and (B,C) imply respectively B and A, while (A,B) implies C provided F(A)F(B) is monic, again with the resulting short exact sequence. Under DC, both supplied object-resolution data, and the respective enough-projective/right-exact or enough-injective/left-exact hypotheses, these are the classical universal delta functors.

Facts & Assumptions

Given: The Axiom of Dependent Choice, abelian source and target categories, an additive functor F, and the stated supplied projective or injective replacement data.

[F1]

The left total construction uses supplied bounded-above projective models (Existence of the bounded above left total derived functor).

[F2]

The right total construction uses supplied bounded-below injective models (Existence of the bounded below right total derived functor).

[F3]

Classical left derived objects are homology of the image of the supplied deleted resolution (Left derived objects relative to supplied projective resolution data).

[F4]

Classical right derived objects are cohomology of the image of the supplied deleted resolution (Right derived objects relative to supplied injective resolution data).

[F5]

Under DC and both supplied data, the respective exactness and enough-objects hypotheses give universal classical delta functors (Derived functors are universal delta functors).

[F6]

Total derived functors preserve distinguished triangles (Total derived functors send distinguished triangles to distinguished triangles).

[F7]

Given projective resolutions of the endpoints of a short exact sequence, the projective horseshoe lemma supplies a degreewise split short exact sequence of resolutions; dually the injective horseshoe lemma supplies injective resolutions with biproduct middle terms (The horseshoe lemma for projective resolutions, The horseshoe lemma for injective resolutions).

[F8]

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

[F9]

Replacements can retain any given cohomological upper or lower bound (Bounded above complexes admit projective replacements, Bounded below complexes admit injective replacements).

[F10]

Short exact sequences and canonical truncations give distinguished triangles (Canonical truncations fit a distinguished triangle).

Proof

1.1

For M[0] choose a resolution supported in degrees 0 on the projective side or 0 on the injective side. Up to the comparison homotopy equivalence with the supplied replacement, the model complex is precisely the image of the deleted classical resolution, after Pn=Pn. Its cohomology is therefore exactly the stated classical derived object, including M=0 and n=0. Comparison maps are the same homotopy classes on both constructions.

F1F2F3F4
1.2

A complex with cohomology below a zero admits an injective model zero below a; its image under F retains this support. The projective construction gives the dual upper-bound assertion. Apply exact RF to the truncation triangle: the tail RF(τa+1X) has zero cohomology in degrees a, and its preceding degree is zero too. The long exact sequence gives the stated isomorphism for ia. The dual argument with the head supported at most a1 gives the LF isomorphism for ia.

F1F2F6F9F10algebra
2.1

For a short exact sequence choose projective horseshoes using [F7]. For the injective side apply the projective assertion of [F7] to 0CBA0 in the abelian category Aop of [F8]: the supplied injective resolutions become projective resolutions there. Reversing all arrows gives chain maps 0IAJBIC0 and a splitting in every degree. Thus both sides have a degreewise split short exact sequence of resolutions, not merely biproduct middle objects. Applying additive F preserves this splitting. Comparison homotopy equivalences identify the auxiliary middle resolution with the supplied one.

F1F2F7F8step 1.1
3.1

Write either image sequence in cochain form 0EiGqH0. Choose degreewise splittings s:HG and π:GE. The off-diagonal map t=πdGs:HjEj+1 satisfies dGssdH=it and dEt+tdH=0. It induces the classical cycle-lifting boundary [t]. The map HCone(i) given by (s,t) is a complex map, and its composite with e(g,e)=q(g) is identity. Since e is the quasi-isomorphism used in [F10], the triangle arrow pe1 induces [t], with p(g,e)=e. Consequently the identity cohomology identifications intertwine boundaries up to minus one. Multiplication in degree n by (1)n fixes this on both sides: (1)n+1(1)=(1)n on the right and (1)n1(1)=(1)n on the left. The formulas are biproduct-morphism identities, valid in any abelian category. Splitting changes give homotopic maps, and the replacement comparisons are natural, so these are natural comparisons of delta functors with identity comparison at degree zero.

F6F10step 2.1algebra
3.2

On objects the support result and the exact triangle of a short exact sequence give 0H0RF(A)H0RF(B)H0RF(C) and H0LF(A)H0LF(B)H0LF(C)0. Hence these degree-zero functors have the stated side-exactness. If F is left exact, 0F(M)F(I0)F(I1) is exact, identifying F(M) with H0RF(M). Right exactness similarly identifies the cokernel H0LF(M) with F(M). Conversely an isomorphic functor inherits the corresponding exactness.

step 1.1step 2.1step 1.2algebra
4.1

Under the stated side-exactness the comparison already induces an isomorphism in degree zero, and both complexes have zero cohomology on the opposite side. It is therefore a quasi-isomorphism iff all positive right derived objects (or all positive left derived objects) vanish. This proves both implications of each acyclic-object criterion.

step 1.2step 3.2algebra
5.1

In the right-hand long exact sequence 0F(A)F(B)F(C)R1F(A)R1F(B)R1F(C), vanishing for (A,C) gives vanishing for B degree by degree, and vanishing for (A,B) gives vanishing for C. For (B,C) all degrees of A above one vanish and R1F(A)=coker(F(B)F(C)); this is exactly the extra epic condition. Each case also makes the displayed F sequence short exact. Reversing arrows and reindexing gives the three left cases; the last obstruction is L1F(C)=ker(F(A)F(B)).

step 2.1step 4.1algebra
6.1

Finally impose DC and both supplied object-resolution data, exactly as in the published universality theorem, together with the appropriate enough-objects and side-exactness hypothesis. That theorem gives universality of the classical delta functor. The natural object identifications and sign-adjusted connecting comparisons in steps 1.1 and 3.1 transfer it to the cohomology description. No universality assertion with weaker assumptions is inferred from that citation.

F5step 1.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

46 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources