For a finite chain complex, χ(X)=∑n≥0(−1)nrankCn=∑n≥0(−1)nβn(X).
Why is it true?
This says the alternating sum of the number of cells (a combinatorial count, easy to compute by hand) equals the alternating sum of Betti numbers (a topological invariant that only depends on the shape, not the triangulation). It generalizes V−E+F=2 to every dimension.
Proof sketch
Fix n and consider the boundary map ∂n:Cn→Cn−1 as a linear map of finite-dimensional vector spaces (working over Q for simplicity). By the rank-nullity theorem, rankCn=dimker∂n+rank∂n, where rank∂n:=dimim∂n.
Also, dimHn(X)=dimker∂n−dimim∂n+1 directly from the quotient definition Hn=ker∂n/im∂n+1, so dimker∂n=βn+rank∂n+1.
Substituting, rankCn=βn+rank∂n+1+rank∂n. Now form the alternating sum over all n from 0 to the top dimension N: ∑n(−1)nrankCn=∑n(−1)nβn+∑n(−1)nrank∂n+1+∑n(−1)nrank∂n.
In the last two sums, the term rank∂k appears once from the rank∂n sum (at n=k, with sign (−1)k) and once from the rank∂n+1 sum (at n=k−1, with sign (−1)k−1); these two signs are opposite, so every rank∂k cancels exactly (telescoping), except the boundary terms ∂0=0 and ∂N+1=0 which contribute nothing anyway.
What remains is ∑n(−1)nrankCn=∑n(−1)nβn, and since the left side is χ(X) by definition, this is exactly χ(X)=∑n≥0(−1)nrankCn=∑n≥0(−1)nβn(X).