Simplicial Homology - Applications

Simplicial homology provides computational tools for proving deep topological theorems and solving concrete problems.

Theorem

(Brouwer Fixed Point Theorem) Every continuous map $f : D^n \to D^n$ has a fixed point.

Proof via homology: If $f$ had no fixed point, define a retraction $r : D^n \to S^{n-1}$ by extending the ray from $f(x)$ through $x$ to the boundary. This would give $H_{n-1}(D^n) \to H_{n-1}(S^{n-1})$ surjective, contradicting $H_{n-1}(D^n) = 0$ and $H_{n-1}(S^{n-1}) = \mathbb{Z}$ .

Theorem

(Invariance of Domain) If $U \subseteq \mathbb{R}^n$ is open and $f : U \to \mathbb{R}^n$ is a continuous injection, then $f(U)$ is open in $\mathbb{R}^n$ .

This non-obvious result follows from homology invariance: $f$ would induce an isomorphism on local homology groups, which forces $f(U)$ to be open.

Theorem

(No Retraction) For $n \geq 1$ , there is no continuous retraction $r : D^n \to S^{n-1}$ . Consequently, $S^{n-1}$ is not a retract of $D^n$ .

Proof: If $r$ existed, then $r \circ i = \text{id}_{S^{n-1}}$ where $i : S^{n-1} \hookrightarrow D^n$ is inclusion. On $H_{n-1}$ , this gives $\mathbb{Z} = H_{n-1}(S^{n-1}) \to 0 = H_{n-1}(D^n) \to \mathbb{Z}$ with composition identity, which is impossible.

Example

Computational topology: Simplicial homology enables computation of topological data analysis (TDA). Given a point cloud, construct a simplicial complex (e.g., Vietoris-Rips or Čech complex) and compute its homology to detect features in data.

Theorem

(Jordan Curve Theorem) A simple closed curve $\gamma \subseteq \mathbb{R}^2$ divides the plane into exactly two connected components: a bounded "inside" and an unbounded "outside".

Proof sketch: Compute $H_1(\mathbb{R}^2 \setminus \gamma)$ using Mayer-Vietoris. The curve contributes a generator in $H_1$ , and Alexander duality relates this to components of the complement.

Example

Knot theory: Knot complements $S^3 \setminus K$ have non-trivial homology for non-trivial knots. More refined invariants like knot Floer homology extend these ideas to distinguish knots that $\pi_1$ cannot.

Remark

Persistent homology tracks how homology changes across a filtration of spaces, providing multi-scale analysis. Applications include sensor networks, neuroscience, and machine learning where data has geometric structure.

Theorem

(Euler-Poincaré Formula) For a finite simplicial complex $K$ with $f_i$ simplices of dimension $i$ : $\sum_{i=0}^n (-1)^i f_i = \sum_{i=0}^n (-1)^i \text{rank}(H_i(K)) = \chi(K)$

This connects combinatorial data (number of simplices) to algebraic invariants (homology ranks).