Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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 are effaceable by injectives

Statement

Assume the Axiom of Dependent Choice.

Let A be an abelian category with enough injectives, let I be supplied injective resolution data on all objects of A. Let F:A→B be an additive left exact functor. Then the cohomological delta functor (RInF) is effaceable in positive degrees by injectives.

Facts & Assumptions

Given: An object A∈A and an integer n>0.

[L1]

Enough injectives gives a monomorphism u:A↣J with J injective (A category with enough projectives and with enough injectives).

[L2]

Positive right derived functors vanish on injective objects (Positive right derived functors vanish on injective objects).

[L3]

Effaceability in positive degrees means killing the induced map into some injective object (Effaceable cohomological delta functor in positive degrees).

Proof

technique · direct
1.1L1L2givenconstruct

By [L1], choose a monomorphism u:A↣J with J injective. The datum I is defined on all of A, so RInF(J) is defined; since J is injective and n>0, [L2] gives RInF(J)=0.

2.1L3step 1.1∎

The induced map RInF(u):RInF(A)→RInF(J) is therefore zero. By [L3], this is exactly the required positive-degree effacement.

Depends on

Used by

Dependency tree · two levels

17 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