PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30

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.

Finite biproducts of complexes are computed degreewise

Statement

Let $A$ be an abelian category. Finite biproducts in $Ch (A)$ are formed degreewise. In particular, $H_{n} (C_{∙} \oplus D_{∙}) ≅ H_{n} (C_{∙}) \oplus H_{n} (D_{∙})$ for every $n$ .

Facts & Assumptions

Given: An abelian category $A$ and chain complexes $C_{∙}$ and $D_{∙}$ in $A$ .

[L1]

$Ch (A)$ is additive, so it has finite biproducts (The category of complexes in an additive category is additive).

[L2]

Homology is an additive functor (Homology is an additive functor).

Proof

technique · direct

1.1

The proof of [L1] constructs the biproduct $C_{∙} \oplus D_{∙}$ degreewise, with term $C_{n} \oplus D_{n}$ and differential $d_{n}^{C} \oplus d_{n}^{D}$ . Thus finite biproducts of complexes are formed degreewise.

2.1

Since $H_{n}$ is additive by [L2], it preserves finite biproducts. Applying it to the biproduct from step 1.1 gives $H_{n} (C_{∙} \oplus D_{∙}) ≅ H_{n} (C_{∙}) \oplus H_{n} (D_{∙}) .$

L2step 1.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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

Charles A. Weibel, Chapter 1 of An Introduction to Homological Algebra (standard reference, not scraped)