LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passaudited 2026-09-01

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 preconnecting arrow annihilates boundaries

Statement

For a short exact sequence of complexes, the composite $B_{n} (C) \to Z_{n} (C) \overset{{\tilde{\partial}}_{n}}{\to} H_{n - 1} (A)$ is zero.

Facts & Assumptions

Given: A short exact sequence $0 \to A_{∙} \to B_{∙} \to C_{∙} \to 0$ of complexes and an integer $n$ .

[L1]

The preconnecting arrow is ${\tilde{\partial}}_{n} = δ_{n}^{s n a k e} q_{n}$ , where $q_{n} : Z_{n} (C) \to H_{n} (C)$ is the homology quotient (The preconnecting arrow on cycles).

[L2]

The homology quotient $q_{n}$ is the cokernel of the canonical boundary-to-cycle map $β_{n} : B_{n} (C) \to Z_{n} (C)$ (Homology object of a chain complex).

Proof

technique · direct

1.1L2given

Because $q_{n}$ is the cokernel of $β_{n}$ , one has $q_{n} β_{n} = 0$ .

2.1L1step 1.1algebra∎

Using [L1], ${\tilde{\partial}}_{n} β_{n} = δ_{n}^{s n a k e} q_{n} β_{n} = 0.$ Thus the composite from the boundary subobject to $H_{n - 1} (A)$ is the zero morphism.

Depends on

Used by

The connecting morphism in homology Definition

Dependency tree · two levels

7 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)
The Stacks Project, Section 12.13: Complexes (standard reference, not scraped)