Alphabeta Math
TheoremStatement: 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.

Left derived functors relative to supplied data are additive functors

Statement

Assume the Axiom of Dependent Choice.

Let P be a supplied projective resolution datum and F:A→B an additive functor between abelian categories. For every n∈Z, the assignments A⟼LnPF(A),u⟼LnPF(u) define an additive functor on the domain of P.

Facts & Assumptions

Given: An integer n.

[L1]

Left derived maps preserve identities (Left derived maps preserve identities).

[L2]

Left derived maps preserve composition (Left derived maps preserve composition).

[L3]

The category of complexes in an additive category is additive, so comparison lifts can be added degreewise (The category of complexes in an additive category is additive).

[L4]

Two comparison lifts of the same morphism are chain-homotopic (Projective comparison maps are unique up to chain homotopy).

[L5]

Applying F degreewise preserves chain maps, and homology is an additive functor on complexes (An additive functor applies degreewise to complexes and chain maps, Homology is an additive functor).

[L6]

Chain-homotopic maps induce the same map on homology (Chain-homotopic maps induce the same map on homology).

[L7]

An additive functor is a functor that is additive on each hom-group (Additive functor).

Proof

technique · direct
1.1L1L2

By [L1] and [L2], the assignments A↦LnPF(A) and u↦LnPF(u) already form a functor.

1.2L3givenconstruct

Let u,v:A→B. Choose comparison lifts u~∙ and v~∙. By [L3], their degreewise sum u~∙+v~∙ is again a chain map, and it lifts u+v because augmentations are additive. Thus it is a comparison lift of u+v.

2.1L4L5L6step 1.2algebra

By definition of the derived map and [L5], LnPF(u+v)=Hn ⁣(F(u~∙+v~∙))=Hn ⁣(F(u~∙))+Hn ⁣(F(v~∙)). If a different comparison lift of u+v were chosen, [L4] and [L6] would give the same homology map. Hence LnPF(u+v)=LnPF(u)+LnPF(v).

3.1L7step 1.1step 2.1∎

Step 1.1 gives functoriality, and step 2.1 gives additivity on each hom-group. Therefore [L7] identifies LnPF as an additive functor.

Depends on

Used by

Dependency tree · two levels

34 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