Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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.

Homology factors uniquely through the homotopy category

Statement

Fix nZ. Let Q:Ch(A)K(A) be the canonical quotient functor for an abelian category A. Then there is a unique additive functor Hn:K(A)A such that Hn=HnQ.

Facts & Assumptions

Given: An abelian category A and an integer n.

[L1]

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

[L2]

Homology is an additive functor on chain complexes (Homology is an additive functor).

[L4]

Morphisms in K(A) are homotopy classes of chain maps (The homotopy category of chain complexes).

Proof

technique · direct
1.1

Define Hn(C):=Hn(C) on objects and Hn([f]):=Hn(f) on morphisms. This is well defined because [L1] shows that homotopic representatives have the same homology map, and [L4] says those are exactly the equal morphisms in K(A).

L1L4givenconstruct
2.1

Because Hn is additive by [L2] and Q is additive by [L3], the definition in step 1.1 gives an additive functor with Hn=HnQ. Uniqueness is immediate from [L4]: every morphism of K(A) is a class [f], so any factorization must send [f] to Hn(f).

L2L3L4step 1.1discharge-construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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