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

The Hom-complex differential squares to zero

Statement

For every pair of chain complexes $C_{∙}, D_{∙}$ , the differential $\partial$ of The Hom complex of chain complexes satisfies $\partial_{r - 1} \partial_{r} = 0$ for every $r \in Z$ .

Facts & Assumptions

Given: A degree- $r$ graded morphism $u = (u_{n})_{n} \in \underset{}{Hom} (C, D)_{r}$ .

[L1]

The differential on the Hom complex is $(\partial u)_{n} = d_{n + r}^{D} u_{n} - (- 1)^{r} u_{n - 1} d_{n}^{C}$ (The Hom complex of chain complexes).

Proof

technique · direct

1.1

Using [L1] twice, the $n$ th component of $\partial (\partial u)$ is $d_{n + r - 1}^{D} d_{n + r}^{D} u_{n} - (- 1)^{r} d_{n + r - 1}^{D} u_{n - 1} d_{n}^{C} - (- 1)^{r - 1} d_{n + r - 1}^{D} u_{n - 1} d_{n}^{C} - u_{n - 2} d_{n - 1}^{C} d_{n}^{C} .$

L1givenalgebra

2.1

The middle two terms cancel because $- (- 1)^{r} - (- 1)^{r - 1} = 0$ , and the outer two terms vanish because successive differentials in $C$ and $D$ compose to zero. Hence every component of $\partial (\partial u)$ is zero, so $\partial^{2} = 0$ .

step 1.1algebra∎

Depends on

The Hom complex of chain complexes

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by The Hom complex of chain complexes.

Dependency tree · two levels

3 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)