Homology (mathematics)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics (especially algebraic topology and abstract algebra), homology (in part from Greek ὁμός homos "identical") is a certain general procedure to associate a sequence of abelian groups or modules with a given mathematical object such as a topological space or a group. See singular homology for a concrete version for topological spaces, or group cohomology for a concrete version for groups.

For a topological space, the homology groups are generally much easier to compute than the homotopy groups, and consequently one usually will have an easier time working with homology to aid in the classification of spaces.

The original motivation for defining homology groups is the observation that shapes are distinguished by their holes. But because a hole is "not there", it is not immediately obvious how to define a hole, or how to distinguish between different kinds of holes. Homology is a rigorous mathematical method for defining and categorizing holes in a shape. As it turns out, subtle kinds of holes exist that homology cannot "see" — in which case homotopy groups may be what is needed.

Informal examples[edit]

Informally, the homology of a topological space X is a set of topological invariants of X represented by its homology groups

H_0(X), H_1(X), H_2(X), \ldots

where the k^{\rm th} homology group H_k(X) describes the k-dimensional holes in X. A 0-dimensional hole is simply a gap between two components, consequently H_0(X) describes the path-connected components of X.[1]

The circle or 1-sphere S^1

A one-dimensional sphere S^1 is a circle. It has a single connected component and a one-dimensional hole, but no higher-dimensional holes. The corresponding homology groups are given as

H_k(S^1) = \begin{cases} \mathbb Z & k=0, 1 \\ \{0\} & \text{otherwise} \end{cases}

where \mathbb Z is the group of integers and \{0\} is the trivial group. The group H_1(S^1) = \mathbb Z represents a finitely-generated abelian group, with a single generator representing the one-dimensional hole contained in a circle.[2]

The 2-sphere S^2

A two-dimensional sphere S^2 has a single connected component, no one-dimensional holes, a two-dimensional hole, and no higher-dimensional holes. The corresponding homology groups are[3]

H_k(S^2) = \begin{cases} \mathbb Z & k=0, 2 \\ \{0\} & \text{otherwise} \end{cases}

In general for an n-dimensional sphere Sn, the homology groups are

H_k(S^n) = \begin{cases} \mathbb Z & k=0, n \\ \{0\} & \text{otherwise} \end{cases}
The solid disc or 1-ball B^1

A one-dimensional ball B1 is a solid disc. It has a single path-connected component, but in contrast to the circle, has no one-dimensional or higher-dimensional holes. The corresponding homology groups are all trivial except for H_0(B^1) = \mathbb Z. In general, for an n-dimensional ball Bn,[4]

H_k(B^n) = \begin{cases} \mathbb Z & k=0 \\ \{0\} & \text{otherwise} \end{cases}
The torus T = S^1 \times S^1

The torus is defined as a Cartesian product of two circles T = S^1 \times S^1. The torus has a single path-connected component, two independent one-dimensional holes (indicated by circles in red and blue) and one two-dimensional hole as the interior of the torus. The corresponding homology groups are[5]

H_k(T) =  \begin{cases} \mathbb Z & k=0, 2 \\ \mathbb Z\times \mathbb Z & k=1 \\ \{0\} & \text{otherwise} \end{cases}

The two independent 1D holes form independent generators in a finitely-generated abelian group, expressed as the Cartesian product group \mathbb Z\times \mathbb Z.


Homology theory can be said to start with the Euler polyhedron formula, or Euler characteristic.[6] This was followed by Riemann's definition of genus and n-fold connectedness numerical invariants in 1857 and Betti's proof in 1871 of the independence of "homology numbers" from the choice of basis.[7]

Homology classes and relations were first defined rigorously by Henri Poincaré in his seminal paper "Analysis situs", J. Ecole polytech. (2) 1. 1–121 (1895). Poincaré was also the first to consider the simplicial homology of a triangulated manifold and to create what is now called a chain complex.[8]

The homology group was further developed by Emmy Noether[9][10] and, independently, by Leopold Vietoris and Walther Mayer, in the period 1925–28.[11] Prior to this, topological classes in combinatorial topology were not formally considered as abelian groups. The spread of homology groups marked the change of terminology and viewpoint from "combinatorial topology" to "algebraic topology".[12]

Construction of homology groups[edit]

The construction begins with an object such as a topological space X, on which one first defines a chain complex C(X) encoding information about X. A chain complex is a sequence of abelian groups or modules C0, C1, C2, ... connected by homomorphisms \partial_n : C_n \to C_{n-1}, which are called boundary operators.[13] That is,

C_0\overset{\partial_0}{\longrightarrow\,} 0

where 0 denotes the trivial group and C_i\equiv0 for i < 0. It is also required that the composition of any two consecutive boundary operators be trivial. That is, for all n,

 \partial_n \circ \partial_{n+1} = 0_{n+1,n-1},

i.e., the constant map sending every element of Cn+1 to the group identity in Cn - 1. That the boundary of a boundary is trivial implies \mathrm{im}(\partial_{n+1})\subseteq\ker(\partial_n), where \mathrm{im}(\partial_{n+1}) denotes the image of the boundary operator and \ker(\partial_n) its kernel. Elements of B_n(X) = \mathrm{im}(\partial_{n+1}) are called boundaries and elements of Z_n(X) = \ker(\partial_n) are called cycles.

Since each chain group Cn is abelian all its subgroups are normal. Then because \mathrm{im}(\partial_{n+1}) and \ker(\partial_n) are both subgroups of Cn, \mathrm{im}(\partial_{n+1}) is a normal subgroup of \ker(\partial_n). Then one can create the factor group

 H_n(X) := \ker(\partial_n) / \mathrm{im}(\partial_{n+1}) = Z_n(X)/B_n(X),

called the n-th homology group of X. The elements of Hn(X) are called homology classes. Each homology class is an equivalence class over cycles and two cycles in the same homology class are said to be homologous.[14]

A chain complex is said to be exact if the image of the (n + 1)-th map is always equal to the kernel of the n-th map. The homology groups of X therefore measure "how far" the chain complex associated to X is from being exact.[15]

The reduced homology groups of a chain complex C(X) are defined as homologies of the augmented chain complex[16]

\Z {\longrightarrow\,} 

where the boundary operator \epsilon is

\epsilon \left (\sum_i n_i \sigma_i \right ) = \sum_i n_i

for a combination Σ niσi of points σi, which are the fixed generators of C0. The reduced homology groups \tilde{H}_i(X) coincide with H_i(X) for i ≠ 0. The extra \Z in the chain complex represents the unique map [\emptyset] \longrightarrow X from the empty simplex to X.

Computing the cycle Z_n(X) and boundary B_n(X) groups is usually rather difficult since they have a very large number of generators. On the other hand, there are tools which make the task easier.

The simplicial homology groups Hn(X) of a simplicial complex X are defined using the simplicial chain complex C(X), with C(X)n the free abelian group generated by the n-simplices of X. The singular homology groups Hn(X) are defined for any topological space X, and agree with the simplicial homology groups for a simplicial complex.

Cohomology groups are formally similar to homology groups: one starts with a cochain complex, which is the same as a chain complex but whose arrows, now denoted dn point in the direction of increasing n rather than decreasing n; then the groups \ker(d^n) = Z^n(X) and \mathrm{im}(d^{n - 1}) = B^n(X) follow from the same description. The n-th cohomology group of X is then the factor group

H^n(X) = Z^n(X)/B^n(X),

in analogy with the n-th homology group.

Types of homology[edit]

The different types of homology theory arise from functors mapping from various categories of mathematical objects to the category of chain complexes. In each case the composition of the functor from objects to chain complexes and the functor from chain complexes to homology groups defines the overall homology functor for the theory.[17]

Simplicial homology[edit]

The motivating example comes from algebraic topology: the simplicial homology of a simplicial complex X. Here An is the free abelian group or module whose generators are the n-dimensional oriented simplexes of X. The mappings are called the boundary mappings and send the simplex with vertices

 (a[0], a[1], \dots, a[n])

to the sum

 \sum_{i=0}^n (-1)^i \left (a[0], \dots, a[i-1], a[i+1], \dots, a[n] \right )

(which is considered 0 if n = 0).

If we take the modules to be over a field, then the dimension of the n-th homology of X turns out to be the number of "holes" in X at dimension n. It may be computed by putting matrix representations of these boundary mappings in Smith normal form.

Singular homology[edit]

Using simplicial homology example as a model, one can define a singular homology for any topological space X. A chain complex for X is defined by taking An to be the free abelian group (or free module) whose generators are all continuous maps from n-dimensional simplices into X. The homomorphisms ∂n arise from the boundary maps of simplices.

Group homology[edit]

In abstract algebra, one uses homology to define derived functors, for example the Tor functors. Here one starts with some covariant additive functor F and some module X. The chain complex for X is defined as follows: first find a free module F1 and a surjective homomorphism p1 : F1X. Then one finds a free module F2 and a surjective homomorphism p2 : F2 → ker(p1). Continuing in this fashion, a sequence of free modules Fn and homomorphisms pn can be defined. By applying the functor F to this sequence, one obtains a chain complex; the homology Hn of this complex depends only on F and X and is, by definition, the n-th derived functor of F, applied to X.

Other homology theories[edit]

Homology functors[edit]

Chain complexes form a category: A morphism from the chain complex (dn: AnAn-1) to the chain complex (en: BnBn-1) is a sequence of homomorphisms fn: AnBn such that f_{n-1} \circ d_n = e_{n} \circ f_n for all n. The n-th homology Hn can be viewed as a covariant functor from the category of chain complexes to the category of abelian groups (or modules).

If the chain complex depends on the object X in a covariant manner (meaning that any morphism X → Y induces a morphism from the chain complex of X to the chain complex of Y), then the Hn are covariant functors from the category that X belongs to into the category of abelian groups (or modules).

The only difference between homology and cohomology is that in cohomology the chain complexes depend in a contravariant manner on X, and that therefore the homology groups (which are called cohomology groups in this context and denoted by Hn) form contravariant functors from the category that X belongs to into the category of abelian groups or modules.


If (dn: AnAn-1) is a chain complex such that all but finitely many An are zero, and the others are finitely generated abelian groups (or finite-dimensional vector spaces), then we can define the Euler characteristic

 \chi = \sum (-1)^n \, \mathrm{rank}(A_n)

(using the rank in the case of abelian groups and the Hamel dimension in the case of vector spaces). It turns out that the Euler characteristic can also be computed on the level of homology:

 \chi = \sum (-1)^n \, \mathrm{rank}(H_n)

and, especially in algebraic topology, this provides two ways to compute the important invariant χ for the object X which gave rise to the chain complex.

Every short exact sequence

 0 \rightarrow A \rightarrow B \rightarrow C \rightarrow 0

of chain complexes gives rise to a long exact sequence of homology groups

 \cdots \to H_n(A) \to H_n(B) \to H_n(C) \to H_{n-1}(A) \to H_{n-1}(B) \to H_{n-1}(C) \to H_{n-2}(A) \to \cdots

All maps in this long exact sequence are induced by the maps between the chain complexes, except for the maps Hn(C)Hn-1(A) The latter are called connecting homomorphisms and are provided by the snake lemma. The snake lemma can be applied to homology in numerous ways that aid in calculating homology groups, such as the theories of relative homology and Mayer-Vietoris sequences.

Applications and Software[edit]

Notable theorems proved using homology include the following:

Application in science and engineering[edit]

In topological data analysis, data sets are regarded as a point cloud sampling of a manifold or algebraic variety embedded in Euclidean space. By linking nearest neighbor points in the cloud into a triangulation, a simplicial approximation of the manifold is created and its simplicial homology may be calculated. Finding techniques to robustly calculate homology using various triangulation strategies over multiple length scales is the topic of persistent homology.[18]

In sensor networks, sensors may communicate information via an ad-hoc network that dynamically changes in time. To understand the global context of this set of local measurements and communication paths, it is useful to compute the homology of the network topology to evaluate, for instance, holes in coverage.[19]

In dynamical systems theory in physics, Poincare was one of the first to consider the interplay between the invariant manifold of a dynamical system and its topological invariants. Morse theory relates the dynamics of a gradient flow on a manifold to, for example, its homology. Floer homology extended this to infinite-dimensional manifolds. The KAM theorem established that periodic orbits can follow complex trajectories; in particular, they may form braids that can be investigated using Floer homology.[20]

In one class of finite element methods, boundary-value problems for differential equations involving the Hodge-Laplace operator may need to be solved on topologically nontrivial domains, for example, in electromagnetic simulations. In these simulations, solution is aided by fixing the cohomology class of the solution based on the chosen boundary conditions and the homology of the domain. FEM domains can be triangulated, from which the simplicial homology can be calculated.[21][22]


Various software packages have been developed for the purposes of computing homology groups of finite cell complexes. Linbox is a C++ library for performing fast matrix operations, including Smith normal form; it interfaces with both Gap and Maple. Chomp, CAPD::Redhom and Perseus are also written in C++. All three implement pre-processing algorithms based on Simple-homotopy equivalence and discrete Morse theory to perform homology-preserving reductions of the input cell complexes before resorting to matrix algebra. Kenzo is written in Lisp, and in addition to homology it may also be used to generate presentations of homotopy groups of finite simplicial complexes.

See also[edit]


  1. ^ Spanier 1966, p. 155
  2. ^ Gowers 2010, p. 390-391
  3. ^ Gowers 2010, p. 390-391
  4. ^ Gowers 2010, p. 390-391
  5. ^ Hatcher 2002, p. 106
  6. ^ Stillwell 1993, p. 170
  7. ^ Weibel 1999, p. 2-3 (in PDF)
  8. ^ Weibel 1999, p. 4
  9. ^ Hilton 1988, p. 284
  10. ^ For example L'émergence de la notion de groupe d'homologie, Nicolas Basbois (PDF), in French, note 41, explicitly names Noether as inventing the homology group.
  11. ^ Hirzebruch, Friedrich, Emmy Noether and Topology in Teicher 1999, pp. 61–63.
  12. ^ Bourbaki and Algebraic Topology by John McCleary (PDF) gives documentation (translated into English from French originals).
  13. ^ Hatcher 2002, p. 106
  14. ^ Hatcher 2002, p. 105-106
  15. ^ Hatcher 2002, p. 113
  16. ^ Hatcher 2002, p. 110
  17. ^ Spanier 1966, p. 156
  18. ^ "CompTop overview". Retrieved 16 March 2014. 
  19. ^ "Robert Ghrist: applied topology". Retrieved 16 March 2014. 
  20. ^ J.B. van den Berg , R. Ghrist , R.C. Vandervorst and W. Wojcik. "http://www.math.vu.nl/~janbouwe/pub/braidfloerhomology.pdf". Retrieved 16 March 2014. 
  21. ^ Pellikka, M; S. Suuriniemi, L. Kettunen, and C. Geuzaine (2013). "Homology and Cohomology Computation in Finite Element Modeling". SIAM J. Sci. Comput. 35 (5): B1195–B1214. doi:10.1137/130906556. 
  22. ^ Arnold, Douglas N.; Richard S. Falk and Ragnar Winther (16 May 2006). "Finite element exterior calculus, homological techniques, and applications". Acta Numerica 15: 1–155. doi:10.1017/S0962492906210018.