A CW structure produces a chain complex whose nth group is free on the n-cells. The example is deliberately concrete; it is a test of the statement, not a substitute for it.
Notation
A CW complex is assembled by attaching disks \(D^n\) along maps from their boundaries \(S^{n-1}\). Cellular chains convert the attaching data into algebra.
A reliable calculation names domain and codomain. The notation \(\mathsf{data}\mapsto\mathsf{claim}\) is harmless only after both \(\operatorname{dom}\) and \(\operatorname{cod}\) have been fixed.
Stress the formula
An explicit case prevents the notation from becoming ceremonial. Every subscript and superscript in the display contributes to the value.
Interpretation
The two-row display is also a debugging tool: if the conclusion changes when only notation changes, some hidden choice has entered the argument.
Limit of the argument
Euler characteristic is homotopy invariant for finite CW complexes, but equal Euler characteristics do not imply homotopy equivalence.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.