ConceptComplete

Simplicial Homology - Core Definitions

Simplicial homology provides an algebraic approach to studying topological spaces by decomposing them into simple building blocks called simplices.

Definition

A nn-simplex is the convex hull of n+1n+1 affinely independent points in some Euclidean space. Standard examples:

  • 0-simplex: a point
  • 1-simplex: a line segment
  • 2-simplex: a triangle
  • 3-simplex: a tetrahedron

The standard nn-simplex is Ξ”n={(t0,…,tn)∈Rn+1:βˆ‘ti=1,tiβ‰₯0}\Delta^n = \{(t_0, \ldots, t_n) \in \mathbb{R}^{n+1} : \sum t_i = 1, t_i \geq 0\}.

Definition

A simplicial complex KK is a finite collection of simplices in some RN\mathbb{R}^N such that:

  1. If ΟƒβˆˆK\sigma \in K and Ο„\tau is a face of Οƒ\sigma, then Ο„βˆˆK\tau \in K
  2. If Οƒ1,Οƒ2∈K\sigma_1, \sigma_2 \in K, then Οƒ1βˆ©Οƒ2\sigma_1 \cap \sigma_2 is either empty or a face of both

The geometric realization ∣K∣|K| is the union of all simplices in KK with the subspace topology.

Example

The circle can be represented as a simplicial complex with vertices v0,v1,v2v_0, v_1, v_2 and edges [v0,v1],[v1,v2],[v2,v0][v_0, v_1], [v_1, v_2], [v_2, v_0]. The torus requires more vertices and includes 2-simplices (triangles).

Definition

Let KK be a simplicial complex. The nn-th chain group Cn(K)C_n(K) is the free abelian group generated by oriented nn-simplices of KK: Cn(K)=ZβŸ¨Οƒ:σ isΒ anΒ n-simplexΒ inΒ K⟩C_n(K) = \mathbb{Z}\langle \sigma : \sigma \text{ is an } n\text{-simplex in } K \rangle

Elements of Cn(K)C_n(K) are nn-chains: formal sums βˆ‘niΟƒi\sum n_i \sigma_i where ni∈Zn_i \in \mathbb{Z} and Οƒi\sigma_i are nn-simplices.

The chain groups form the algebraic foundation. An nn-chain represents a formal combination of nn-dimensional pieces of the complex.

Definition

The boundary operator βˆ‚n:Cn(K)β†’Cnβˆ’1(K)\partial_n : C_n(K) \to C_{n-1}(K) is defined on a simplex Οƒ=[v0,…,vn]\sigma = [v_0, \ldots, v_n] by: βˆ‚nΟƒ=βˆ‘i=0n(βˆ’1)i[v0,…,v^i,…,vn]\partial_n \sigma = \sum_{i=0}^n (-1)^i [v_0, \ldots, \hat{v}_i, \ldots, v_n] where v^i\hat{v}_i denotes omitting viv_i. This extends linearly to all chains.

Example

For a 2-simplex (triangle) Οƒ=[v0,v1,v2]\sigma = [v_0, v_1, v_2]: βˆ‚2Οƒ=[v1,v2]βˆ’[v0,v2]+[v0,v1]\partial_2 \sigma = [v_1, v_2] - [v_0, v_2] + [v_0, v_1] The boundary is the three edges with appropriate orientations.

Theorem

The fundamental property: βˆ‚nβˆ’1βˆ˜βˆ‚n=0\partial_{n-1} \circ \partial_n = 0 for all nn. In other words, the boundary of a boundary is zero.

This property βˆ‚2=0\partial^2 = 0 is the cornerstone of homology theory. It means we have a chain complex: β‹―β†’Cn+1(K)β†’βˆ‚n+1Cn(K)β†’βˆ‚nCnβˆ’1(K)β†’β‹―\cdots \to C_{n+1}(K) \xrightarrow{\partial_{n+1}} C_n(K) \xrightarrow{\partial_n} C_{n-1}(K) \to \cdots

Remark

Simplicial homology captures "holes" of various dimensions: 0-dimensional (connected components), 1-dimensional (loops), 2-dimensional (voids), and higher. The algebraic machinery converts geometric intuition into computable invariants.