MathLabs
TheoremProved

The Euler–Poincaré theorem

Statement

For a finite chain complex, χ(X)=∑n≥0(−1)nrank⁡Cn=∑n≥0(−1)nβn(X)\chi(X) = \sum_{n\ge 0} (-1)^n \operatorname{rank} C_n = \sum_{n\ge 0} (-1)^n \beta_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=2V - E + F = 2 to every dimension.

Proof sketch

Fix nn and consider the boundary map ∂n:Cn→Cn−1\partial_n : C_n \to C_{n-1} as a linear map of finite-dimensional vector spaces (working over Q\mathbb{Q} for simplicity). By the rank-nullity theorem, rank⁡Cn=dim⁡ker⁡∂n+rank⁡∂n\operatorname{rank} C_n = \dim \ker \partial_n + \operatorname{rank} \partial_n, where rank⁡∂n:=dim⁡im⁡∂n\operatorname{rank}\partial_n := \dim \operatorname{im} \partial_n.

Also, dim⁡Hn(X)=dim⁡ker⁡∂n−dim⁡im⁡∂n+1\dim H_n(X) = \dim \ker \partial_n - \dim \operatorname{im} \partial_{n+1} directly from the quotient definition Hn=ker⁡∂n/im⁡∂n+1H_n = \ker \partial_n / \operatorname{im}\partial_{n+1}, so dim⁡ker⁡∂n=βn+rank⁡∂n+1\dim \ker \partial_n = \beta_n + \operatorname{rank}\partial_{n+1}.

Substituting, rank⁡Cn=βn+rank⁡∂n+1+rank⁡∂n\operatorname{rank} C_n = \beta_n + \operatorname{rank}\partial_{n+1} + \operatorname{rank}\partial_n. Now form the alternating sum over all nn from 00 to the top dimension NN: ∑n(−1)nrank⁡Cn=∑n(−1)nβn+∑n(−1)nrank⁡∂n+1+∑n(−1)nrank⁡∂n\sum_n (-1)^n \operatorname{rank} C_n = \sum_n (-1)^n \beta_n + \sum_n (-1)^n \operatorname{rank}\partial_{n+1} + \sum_n (-1)^n \operatorname{rank}\partial_n.

In the last two sums, the term rank⁡∂k\operatorname{rank}\partial_k appears once from the rank⁡∂n\operatorname{rank}\partial_n sum (at n=kn=k, with sign (−1)k(-1)^k) and once from the rank⁡∂n+1\operatorname{rank}\partial_{n+1} sum (at n=k−1n=k-1, with sign (−1)k−1(-1)^{k-1}); these two signs are opposite, so every rank⁡∂k\operatorname{rank}\partial_k cancels exactly (telescoping), except the boundary terms ∂0=0\partial_0 = 0 and ∂N+1=0\partial_{N+1}=0 which contribute nothing anyway.

What remains is ∑n(−1)nrank⁡Cn=∑n(−1)nβn\sum_n (-1)^n \operatorname{rank} C_n = \sum_n (-1)^n \beta_n, and since the left side is χ(X)\chi(X) by definition, this is exactly χ(X)=∑n≥0(−1)nrank⁡Cn=∑n≥0(−1)nβn(X)\chi(X) = \sum_{n\ge 0} (-1)^n \operatorname{rank} C_n = \sum_{n\ge 0} (-1)^n \beta_n(X).

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Allen Hatcher (2002). Algebraic Topology
  2. James R. Munkres (1984). Elements of Algebraic Topology
  3. Gunnar Carlsson (2009). Topology and data