Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

The acyclic-resolution theorem for right derived functors

Statement

Assume the Axiom of Dependent Choice.

Let I be a supplied injective resolution datum on a class D, let F:A→B be an additive left exact functor, and let 0→A→J0→J1→J2→⋯ be an F-acyclic resolution of A relative to I. Assume moreover that A∈D and that, for Z0:=A and 0→Zq→Jq→Zq+1→0(q≥0), each Zq lies in D. Then for every n≥0 there is a canonical isomorphism RInF(A)→ ∼ Hn(F(Jdel∙)).

Facts & Assumptions

Given: An F-acyclic resolution 0→A→J0→J1→⋯ of A relative to I, the associated objects Zq∈D, and an integer n≥0.

[L1]

An F-acyclic resolution is an exact coaugmented complex whose terms are F-acyclic objects (An F-acyclic resolution, An acyclic object for a left exact functor).

[L2]

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

[L3]

Change of supplied injective resolution data produces natural isomorphisms of right derived functors (Two supplied injective resolution data define naturally isomorphic right derived functors).

[L4]

Passing to the opposite abelian category and applying the projective horseshoe lemma produces injective resolutions of a short exact sequence in a degreewise split short exact sequence of cochain complexes (The opposite of an abelian category is abelian, The horseshoe lemma for projective resolutions).

[L5]

A short exact sequence of cochain complexes yields a long exact sequence in cohomology (The long exact sequence in cohomology).

[L6]

An additive functor preserves finite biproducts (An additive functor preserves finite biproducts), and therefore preserves split short exact sequences.

Proof

technique · direct
1.1L1givenconstruct

By exactness in [L1], let Z0=A and for each q≥0 let Zq+1 fit into a short exact sequence 0→Zq→Jq→Zq+1→0. Every Jq is F-acyclic by [L1].

2.1L2L3L4L5L6step 1.1algebra

Apply [L4] to each short exact sequence from step 1.1 using the supplied injective resolutions of Zq and Zq+1, which exist by the domain hypothesis in the statement. The result is a degreewise split short exact sequence of injective resolutions. By [L6], applying F preserves its degreewise exactness, so [L5] gives a long exact cohomology sequence. The middle injective resolution supplied by the horseshoe construction may differ from the one fixed for Jq, but [L3] identifies their right derived objects. Its higher cohomology therefore vanishes because Jq is F-acyclic. Using [L2] for degree 0, we obtain exact sequences 0→F(Zq)→F(Jq)→F(Zq+1)→RI1F(Zq)→0 and isomorphisms RIm+1F(Zq)→∼RImF(Zq+1)(m>0).

3.1step 2.1algebra

Repeatedly applying the isomorphisms from step 2.1 gives RInF(A)=RInF(Z0)→∼RI1F(Zn−1)(n>0).

4.1step 2.1step 3.1algebra

For n>0, the exact sequence 0→F(Zn)→F(Jn)→F(Zn+1) from step 2.1 shows that the nth cohomology of F(Jdel∙) is the cokernel of F(Jn−1)→F(Zn). The same step identifies that cokernel with RI1F(Zn−1), so step 3.1 gives Hn(F(Jdel∙))≅RInF(A).

5.1L2step 2.1step 4.1∎

For n=0, step 2.1 with q=0 gives 0→F(A)→F(J0)→F(Z1) exact, so H0(F(Jdel∙))≅F(A). By [L2], F(A)≅RI0F(A). Together with step 4.1, this proves the theorem for all n≥0.

Depends on

Used by

Dependency tree · two levels

32 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