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 left derived functors

Statement

Assume the Axiom of Dependent Choice.

Let P be a supplied projective resolution datum, let F,G:A→B be additive functors between abelian categories, and let α:F⇒G be a natural transformation. Then for every n∈Z the maps LnP(α)A:=Hn ⁣(αP(A)del):LnPF(A)→LnPG(A) define a natural transformation LnP(α):LnPF⇒LnPG.

Facts & Assumptions

Given: An integer n.

[L1]

A natural transformation is a family of components satisfying the naturality equation on every morphism (Natural transformation and its components).

[L2]

Additive functors apply degreewise to complexes and chain maps (An additive functor applies degreewise to complexes and chain maps).

[L3]

Every chain map induces a well-defined map on homology (A chain map induces a well-defined map on homology).

[L4]

The left derived maps are the homology maps induced from comparison lifts (The left derived map relative to supplied resolution data).

[L5]

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

Proof

technique · direct
1.1L1L2givenalgebra

For each object A, the components αPk(A) form a chain map αP(A)del:F(P(A)del)→G(P(A)del), because [L1] makes them commute with each differential of the chosen deleted resolution.

2.1L3step 1.1construct

By [L3], step 1.1 induces a morphism LnP(α)A:LnPF(A)→LnPG(A) for each A.

3.1L1L4L5step 2.1algebra∎

Let u:A→B, and choose a comparison lift u~∙:P∙(A)→P∙(B). Naturality in [L1] gives G(u~k) αPk(A)=αPk(B) F(u~k) for every degree k, so the square of chain maps commutes. Passing to homology and using [L4] gives LnPG(u)∘LnP(α)A=LnP(α)B∘LnPF(u). Thus the components from step 2.1 are natural.

Depends on

Used by

Dependency tree · two levels

22 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