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.

Positive right derived functors vanish on injective objects

Statement

Assume the Axiom of Dependent Choice.

Let I be a supplied injective resolution datum on a class D and F:AB an additive functor between abelian categories. If JD is an injective object, then for every n>0, RInF(J)=0.

Facts & Assumptions

Given: An injective object JD and an integer n>0.

[L1]

An injective resolution is a coaugmented exact complex of injectives (Injective resolutions in an abelian category).

[L2]

The object J is injective (Injective object).

[L3]

Changing the supplied injective resolution datum changes the derived objects only by natural isomorphism (Two supplied injective resolution data define naturally isomorphic right derived functors).

[L4]

The right derived object is the cohomology of the deleted chosen resolution after applying F (Right derived objects relative to supplied injective resolution data).

Proof

technique · direct
1.1

The coaugmented complex 0J1JJ00 is exact and all its terms are injective by [L2], so [L1] makes it an injective resolution of J. After applying F, its deleted cochain complex has only one nonzero term, namely F(J) in degree 0.

L1L2L4givenconstruct
2.1

Let I be the supplied injective resolution datum on the same domain as I that agrees with I away from J and assigns the trivial injective resolution from step 1.1 to J. By [L3], the right derived object computed from I is isomorphic to the one computed from I. By [L4], the complex computing RInF(J) is the one-term complex from step 1.1, whose cohomology is zero in every positive degree. Hence RInF(J)=0 for n>0.

L3L4step 1.1

Depends on

Used by

Dependency tree · two levels

18 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