Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

Negative derived degrees vanish for one-sided resolutions

Statement

Let P and I be supplied projective and injective resolution data, and let F be an additive functor.

If n<0, then for every object A in the common domain, LnPF(A)=0andRInF(A)=0.

Facts & Assumptions

Given: An object A and an integer n<0.

[L1]

The object LnPF(A) is the homology of the deleted projective resolution F(P(A)del) in degree n (Left derived objects relative to supplied projective resolution data).

[L2]

The object RInF(A) is the cohomology of the deleted injective resolution F(I(A)del) in degree n (Right derived objects relative to supplied injective resolution data).

Proof

technique · direct
1.1

By [L1], the complex computing LnPF(A) is zero in every negative degree, because a deleted projective resolution is supported only in nonnegative homological degrees. Therefore both its degree-n cycle object and its degree-n boundary object are zero, so LnPF(A)=0.

L1givenalgebra
1.2

By [L2], the cochain complex computing RInF(A) is zero in every negative cohomological degree, because a deleted injective resolution begins in degree 0. Hence its degree-n cocycle and coboundary objects are zero, so RInF(A)=0.

L2givenalgebra
2.1

Steps 1.1 and 1.2 prove the claimed vanishing for both one-sided derived constructions.

step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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