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

The induced homology map is independent of the chosen comparison lift

Statement

Assume the Axiom of Dependent Choice.

Let P be a supplied projective resolution datum and F:AB an additive functor. If u:AB is a morphism and u~,u^:P(A)P(B) are two comparison lifts of u, then for every nZ the induced maps on homology Hn ⁣(F(u~)),Hn ⁣(F(u^)):LnPF(A)LnPF(B) are equal.

Facts & Assumptions

Given: A morphism u:AB and two comparison lifts u~,u^ of u.

[L1]

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

[L2]

A chain homotopy is given by equations of the form fngn=dn+1sn+sn1dn (A chain homotopy).

[L3]

Additive functors preserve sums and zero morphisms (Additive functor, An additive functor preserves zero morphisms).

[L4]

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

[L5]

The objects LnPF(A) and LnPF(B) are the homology objects of the deleted resolutions after applying F (Left derived objects relative to supplied projective resolution data).

Proof

technique · direct
1.1

By [L1], the two lifts u~ and u^ are chain-homotopic. Let s be such a homotopy.

L1givenconstruct
2.1

The equations in [L2] become F(u~n)F(u^n)=F(dn+1)F(sn)+F(sn1)F(dn) after applying F, because [L3] lets F preserve sums and zero morphisms. Hence F(s) is a chain homotopy from F(u~) to F(u^).

L2L3step 1.1algebra
3.1

By [L4], chain-homotopic maps induce the same map on homology. Using [L5] to identify those homology objects with the displayed left derived objects gives Hn ⁣(F(u~))=Hn ⁣(F(u^)) for every n.

L4L5step 2.1

Depends on

Used by

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