Augmenting the chain complex makes degree-zero homology count components minus one. This is a compact note, but the quantifiers and hypotheses stay on the page.
Objects and notation
A chain complex \((C_\bullet,\partial)\) satisfies \(\partial_{n-1}\partial_n=0\). Homology \(H_n=\ker\partial_n/\operatorname{im}\partial_{n+1}\) measures cycles not explained as boundaries.
The typography mirrors the proof: first declare \(\mathsf D\), then state \(\mathsf C\). The symbol \(\Longrightarrow\) below is a logical dependency, not extra mathematical structure.
Push the symbols
The computation below is not a second theorem. It is a checksum for the definitions and a place to inspect the difficult LaTeX at full size.
Structural reading
The two-row display is also a debugging tool: if the conclusion changes when only notation changes, some hidden choice has entered the argument.
A hypothesis worth keeping
Homology depends on the chosen coefficient ring. Torsion may disappear over a field or change under reduction modulo a prime.
The notation is dense, but it is doing honest work: every delimiter records scope and every index records dependence. Removing one should require a mathematical reason.