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

An exact functor has vanishing positive derived functors

Statement

Let P be a supplied projective resolution datum on a class DP, let I be a supplied injective resolution datum on a class DI, and let F:A→B be an exact functor between abelian categories. Then for every A∈DP and every n>0, LnPF(A)=0, and for every B∈DI and every n>0, RInF(B)=0.

Facts & Assumptions

Given: An integer n>0, an object A∈DP, and an object B∈DI.

[L1]

The left and right derived objects are the homology or cohomology of the deleted chosen resolutions after applying F (Left derived objects relative to supplied projective resolution data, Right derived objects relative to supplied injective resolution data).

[L2]

Exact functors commute with homology of chain complexes (An exact functor commutes with homology).

[L3]

Exactness means that F is exact on both the projective and injective resolution complexes (Exact functor between abelian categories).

Proof

technique · direct
1.1L1L3givenalgebra

The deleted projective resolution of A is exact in every positive degree. By [L3], applying F preserves that exactness, so the resulting chain complex has zero homology in every positive degree. Using [L1], this says LnPF(A)=0 for n>0.

1.2L1L2L3algebra

Read the deleted injective resolution of B as a reindexed chain complex. It is exact in every positive cohomological degree, and [L3] preserves that exactness after applying F. By [L2], the resulting homology, hence cohomology, is zero in every positive degree. Therefore RInF(B)=0 for n>0.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove the claimed vanishing on both sides.

Depends on

Used by

Dependency tree · two levels

14 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