Misplaced Pages

In algebraic topology, simplicial homology is the sequence of homology groups of a simplicial complex. It formalizes the idea of the number of holes of a given dimension in the complex. This generalizes the number of connected components (the case of dimension 0).

Simplicial homology arose as a way to study topological spaces whose building blocks are n-simplices, the n-dimensional analogs of triangles. This includes a point (0-simplex), a line segment (1-simplex), a triangle (2-simplex) and a tetrahedron (3-simplex). By definition, such a space is homeomorphic to a simplicial complex (more precisely, the geometric realization of an abstract simplicial complex). Such a homeomorphism is referred to as a triangulation of the given space. Many topological spaces of interest can be triangulated, including every smooth manifold (Cairns and Whitehead).

Simplicial homology is defined by a simple recipe for any abstract simplicial complex. It is a remarkable fact that simplicial homology only depends on the associated topological space. As a result, it gives a computable way to distinguish one space from another.

Definitions

Orientations

A key concept in defining simplicial homology is the notion of an orientation of a simplex. By definition, an orientation of a k-simplex is given by an ordering of the vertices, written as (v₀,...,v_k), with the rule that two orderings define the same orientation if and only if they differ by an even permutation. Thus every simplex has exactly two orientations, and switching the order of two vertices changes an orientation to the opposite orientation. For example, choosing an orientation of a 1-simplex amounts to choosing one of the two possible directions, and choosing an orientation of a 2-simplex amounts to choosing what "counterclockwise" should mean.

Chains

Let S be a simplicial complex. A simplicial k-chain is a finite formal sum

${\displaystyle \sum _{i=1}^{N}c_{i}\sigma _{i},\,}$

where each c_i is an integer and σ_i is an oriented k-simplex. In this definition, we declare that each oriented simplex is equal to the negative of the simplex with the opposite orientation. For example,

${\displaystyle (v_{0},v_{1})=-(v_{1},v_{0}).}$

The group of k-chains on S is written C_k. This is a free abelian group which has a basis in one-to-one correspondence with the set of k-simplices in S. To define a basis explicitly, one has to choose an orientation of each simplex. One standard way to do this is to choose an ordering of all the vertices and give each simplex the orientation corresponding to the induced ordering of its vertices.

Boundaries and cycles

Let σ = (v₀,...,v_k) be an oriented k-simplex, viewed as a basis element of C_k. The boundary operator

${\displaystyle \partial _{k}:C_{k}\rightarrow C_{k-1}}$

is the homomorphism defined by:

${\displaystyle \partial _{k}(\sigma )=\sum _{i=0}^{k}(-1)^{i}(v_{0},\dots ,{\widehat {v_{i}}},\dots ,v_{k}),}$

where the oriented simplex

${\displaystyle (v_{0},\dots ,{\widehat {v_{i}}},\dots ,v_{k})}$

is the i face of σ, obtained by deleting its i vertex.

In C_k, elements of the subgroup

${\displaystyle Z_{k}:=\ker \partial _{k}}$

are referred to as cycles, and the subgroup

${\displaystyle B_{k}:=\operatorname {im} \partial _{k+1}}$

is said to consist of boundaries.

Boundaries of boundaries

Because ${\displaystyle (-1)^{i+j-1}(v_{0},\dots ,{\widehat {v_{i}}},\dots ,{\widehat {\widehat {v_{j}}}},\dots ,v_{k})=-(-1)^{i+j}(v_{0},\dots ,{\widehat {\widehat {v_{i}}}},\dots ,{\widehat {v_{j}}},\dots ,v_{k})}$, where ${\displaystyle {\widehat {\widehat {v_{x}}}}}$ is the second face removed, ${\displaystyle \partial ^{2}=0}$. In geometric terms, this says that the boundary of a boundary of anything has no boundary. Equivalently, the abelian groups

${\displaystyle (C_{k},\partial _{k})}$

form a chain complex. Another equivalent statement is that B_k is contained in Z_k.

As an example, consider a tetrahedron with vertices oriented as ${\displaystyle w,x,y,z}$. By definition, its boundary is given by

${\displaystyle xyz-wyz+wxz-wxy}$.

The boundary of the boundary is given by

${\displaystyle (yz-xz+xy)-(yz-wz+wy)+(xz-wz+wx)-(xy-wy+wx)=0}$

Homology groups

The k homology group H_k of S is defined to be the quotient abelian group

${\displaystyle H_{k}(S)=Z_{k}/B_{k}\,.}$

It follows that the homology group H_k(S) is nonzero exactly when there are k-cycles on S which are not boundaries. In a sense, this means that there are k-dimensional holes in the complex. For example, consider the complex S obtained by gluing two triangles (with no interior) along one edge, shown in the image. The edges of each triangle can be oriented so as to form a cycle. These two cycles are by construction not boundaries (since every 2-chain is zero). One can compute that the homology group H₁(S) is isomorphic to Z, with a basis given by the two cycles mentioned. This makes precise the informal idea that S has two "1-dimensional holes".

Holes can be of different dimensions. The rank of the k homology group, the number

${\displaystyle \beta _{k}=\operatorname {rank} (H_{k}(S))\,}$

is called the k Betti number of S. It gives a measure of the number of k-dimensional holes in S.

Example

Homology groups of a triangle

Let S be a triangle (without its interior), viewed as a simplicial complex. Thus S has three vertices, which we call v₀, v₁, v₂, and three edges, which are 1-dimensional simplices. To compute the homology groups of S, we start by describing the chain groups C_k:

• C₀ is isomorphic to Z with basis (v₀), (v₁), (v₂),
• C₁ is isomorphic to Z with a basis given by the oriented 1-simplices (v₀, v₁), (v₀, v₂), and (v₁, v₂).
• C₂ is the trivial group, since there is no simplex like ${\displaystyle (v_{0},v_{1},v_{2})}$ because the triangle has been supposed without its interior. So are the chain groups in other dimensions.

The boundary homomorphism ∂: C₁ → C₀ is given by:

${\displaystyle \partial (v_{0},v_{1})=(v_{1})-(v_{0})}$

${\displaystyle \partial (v_{0},v_{2})=(v_{2})-(v_{0})}$

${\displaystyle \partial (v_{1},v_{2})=(v_{2})-(v_{1})}$

Since C₋₁ = 0, every 0-chain is a cycle (i.e. Z₀ = C₀); moreover, the group B₀ of the 0-boundaries is generated by the three elements on the right of these equations, creating a two-dimensional subgroup of C₀. So the 0th homology group H₀(S) = Z₀/B₀ is isomorphic to Z, with a basis given (for example) by the image of the 0-cycle (v₀). Indeed, all three vertices become equal in the quotient group; this expresses the fact that S is connected.

Next, the group of 1-cycles is the kernel of the homomorphism ∂ above, which is isomorphic to Z, with a basis given (for example) by (v₀,v₁) − (v₀,v₂) + (v₁,v₂). (A picture reveals that this 1-cycle goes around the triangle in one of the two possible directions.) Since C₂ = 0, the group of 1-boundaries is zero, and so the 1st homology group H₁(S) is isomorphic to Z/0 ≅ Z. This makes precise the idea that the triangle has one 1-dimensional hole.

Next, since by definition there are no 2-cycles, C₂ = 0 (the trivial group). Therefore the 2nd homology group H₂(S) is zero. The same is true for H_i(S) for all i not equal to 0 or 1. Therefore, the homological connectivity of the triangle is 0 (it is the largest k for which the reduced homology groups up to k are trivial).

Homology groups of higher-dimensional simplices

Let S be a tetrahedron (without its interior), viewed as a simplicial complex. Thus S has four 0-dimensional vertices, six 1-dimensional edges, and four 2-dimensional faces. The construction of the homology groups of a tetrahedron is described in detail here. It turns out that H₀(S) is isomorphic to Z, H₂(S) is isomorphic to Z too, and all other groups are trivial. Therefore, the homological connectivity of the tetrahedron is 0.

If the tetrahedron contains its interior, then H₂(S) is trivial too.

In general, if S is a d-dimensional simplex, the following holds:

• If S is considered without its interior, then H₀(S) = Z and H_d−1(S) = Z and all other homologies are trivial;
• If S is considered with its interior, then H₀(S) = Z and all other homologies are trivial.

Simplicial maps

Let S and T be simplicial complexes. A simplicial map f from S to T is a function from the vertex set of S to the vertex set of T such that the image of each simplex in S (viewed as a set of vertices) is a simplex in T. A simplicial map f: S → T determines a homomorphism of homology groups H_k(S) → H_k(T) for each integer k. This is the homomorphism associated to a chain map from the chain complex of S to the chain complex of T. Explicitly, this chain map is given on k-chains by

${\displaystyle f((v_{0},\ldots ,v_{k}))=(f(v_{0}),\ldots ,f(v_{k}))}$

if f(v₀), ..., f(v_k) are all distinct, and otherwise f((v₀, ..., v_k)) = 0.

This construction makes simplicial homology a functor from simplicial complexes to abelian groups. This is essential to applications of the theory, including the Brouwer fixed point theorem and the topological invariance of simplicial homology.

Related homologies

Singular homology is a related theory that is better adapted to theory rather than computation. Singular homology is defined for all topological spaces and depends only on the topology, not any triangulation; and it agrees with simplicial homology for spaces which can be triangulated. Nonetheless, because it is possible to compute the simplicial homology of a simplicial complex automatically and efficiently, simplicial homology has become important for application to real-life situations, such as image analysis, medical imaging, and data analysis in general.

Another related theory is Cellular homology.

Applications

A standard scenario in many computer applications is a collection of points (measurements, dark pixels in a bit map, etc.) in which one wishes to find a topological feature. Homology can serve as a qualitative tool to search for such a feature, since it is readily computable from combinatorial data such as a simplicial complex. However, the data points have to first be triangulated, meaning one replaces the data with a simplicial complex approximation. Computation of persistent homology involves analysis of homology at different resolutions, registering homology classes (holes) that persist as the resolution is changed. Such features can be used to detect structures of molecules, tumors in X-rays, and cluster structures in complex data.

More generally, simplicial homology plays a central role in topological data analysis, a technique in the field of data mining.

Implementations

• Exact, efficient, computation of simplicial homology of large simplical complexes can be computed using the GAP Simplicial Homology.
• A MATLAB toolbox for computing persistent homology, Plex (Vin de Silva, Gunnar Carlsson), is available at this site.
• Stand-alone implementations in C++ are available as part of the Perseus, Dionysus and PHAT software projects.
• For Python, there are libraries such as scikit-tda, Persim, giotto-tda and GUDHI, the latter aimed at generating topological features for machine learning. These can be found at the PyPI repository.

See also

• Simplicial homotopy

References

1. Prasolov, V. V. (2006), Elements of combinatorial and differential topology, American Mathematical Society, ISBN 0-8218-3809-1, MR 2233951
2. Armstrong, M. A. (1983), Basic topology, Springer-Verlag, ISBN 0-387-90839-0, MR 0705632
3. Wildberger, Norman J. (2012). "More homology computations". YouTube. Archived from the original on 2021-12-22.
4. Hatcher, Allen (2002), Algebraic topology, Cambridge University Press, ISBN 0-521-79540-0, MR 1867354
5. Edelsbrunner, H.; Letscher, D.; Zomorodian, A. (2002). "Topological Persistence and Simplification". Discrete & Computational Geometry. 28 (4): 511–533. doi:10.1007/s00454-002-2885-2.
   Robins, V. (Summer 1999). "Towards computing homology from finite approximations" (PDF). Topology Proceedings. 24: 503–532.

External links

• Topological methods in scientific computing
• Computational homology (also cubical homology)

• Simplicial homology
• Computational topology