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.

A natural transformation induces natural transformations of right derived functors

Statement

Assume the Axiom of Dependent Choice.

Let I be a supplied injective resolution datum, let F,G:AB be additive functors, and let α:FG be a natural transformation. Then for every nZ the maps RIn(α)A:=Hn ⁣(αI(A)del):RInF(A)RInG(A) define a natural transformation RIn(α):RInFRInG.

Facts & Assumptions

Given: An integer n.

[L1]

A natural transformation is objectwise and satisfies the naturality equation on every morphism (Natural transformation and its components).

[L2]

A cochain complex is read as a reindexed chain complex (Cochain complex in an abelian category).

[L3]

Additive functors apply degreewise to chain maps, and every chain map induces a homology map (An additive functor applies degreewise to complexes and chain maps, A chain map induces a well-defined map on homology).

[L4]

Right derived maps are induced by comparison extensions on the chosen injective resolutions (The right derived map relative to supplied resolution data).

[L5]

The source and target assignments are already functors (Right derived functors relative to supplied data are additive functors).

Proof

technique · direct
1.1

For each object A, the components αIk(A) commute with the cochain differentials by [L1], so they form a cochain map F(I(A)del)G(I(A)del). Reindexing by [L2] turns this into a chain map.

L1L2givenalgebra
2.1

By [L3], step 1.1 induces a map on homology of the reindexed complexes, hence on cohomology: RIn(α)A:RInF(A)RInG(A).

L2L3step 1.1construct
3.1

Let u:AB, and choose a comparison extension u~:I(A)I(B). Naturality in [L1] gives degreewise commutative squares with the maps αIk(A) and αIk(B). Passing to cohomology and translating through [L4] gives RInG(u)RIn(α)A=RIn(α)BRInF(u). Thus the components from step 2.1 are natural.

L1L4L5step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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