Search: in
Homology (mathematics)
Homology (mathematics) Encyclopedia
  Tutorials     Encyclopedia     Dictionary     Directory  
Homology_(mathematics) Email this to a friend      Homology_(mathematics)

Homology (mathematics)

In mathematics (especially algebraic topology and abstract algebra), homology (in 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 homology theory for more background, or 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.

Contents


Construction of homology groups

The procedure works as follows: Given an object such as a topological space X, one first defines a chain complex A=C(X) that encodes information about X. A chain complex is a sequence of abelian groups or modules A_0, A_1, A_2, \dots connected by homomorphisms d_n : A_n \rightarrow A_{n-1}, such that the composition of any two consecutive maps is zero: d_n \circ d_{n+1} = 0 for all n. This means that the image of the n+1-th map is contained in the kernel of the n-th, and we can define the n-th homology group of X to be the factor group (or quotient module)

H_n(X) = \ker(d_n) / \mathrm{Im}(d_{n+1})

The standard notation is \ker(d_n)=Z_n(X) and \operatorname{im}(d_{n+1})=B_n(X). Note that the computation of these two groups is usually rather difficult, since they are very large groups. On the other hand, machinery exists that allows one to compute the corresponding homology group easily.

The simplicial homology groups H_n(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 H_n(X) are defined for any topological space X, and agree with the simplicial homology groups for a simplicial complex.

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 nth map. The homology groups of X therefore measure "how far" the chain complex associated to X is from being exact.

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

H^n(X) = Z^n(X)/B^n(X)\ , as before.

Examples

The motivating example comes from algebraic topology: the simplicial homology of a simplicial complex X. Here A_n 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(a[0], \dots, a[i-1], a[i+1], \dots, a[n])

(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.

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

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 F_1 and a surjective homomorphism p_1 : F_1 \rightarrow X . Then one finds a free module F_2 and a surjective homomorphism p_2 : F_2 \rightarrow \mathrm{ker}(p_1) . Continuing in this fashion, a sequence of free modules F_n and homomorphisms p_n can be defined. By applying the functor F to this sequence, one obtains a chain complex; the homology H_n of this complex depends only on F and X and is, by definition, the n-th derived functor of F, applied to X.

Homology functors

Chain complexes form a category: A morphism from the chain complex (d_n \colon A_n \rightarrow A_{n-1}) to the chain complex (e_n\colon B_n \rightarrow B_{n-1}) is a sequence of homomorphisms f_n\colon A_n \rightarrow B_n 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.

Properties

If (d_n : A_n \rightarrow A_{n-1}) is a chain complex such that all but finitely many A_n 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 \chi 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 \rightarrow H_n(A) \rightarrow H_n(B) \rightarrow H_n(C) \rightarrow H_{n-1}(A) \rightarrow H_{n-1}(B) \rightarrow H_{n-1}(C) \rightarrow H_{n-2}(A) \rightarrow \cdots \,

All maps in this long exact sequence are induced by the maps between the chain complexes, except for the maps H_n(C) \rightarrow H_{n-1}(A). The latter are called connecting homomorphisms and are provided by the snake lemma.

See also

References

  • Cartan, Henri Paul and Eilenberg, Samuel (1956) Homological Algebra Princeton University Press, Princeton, NJ, OCLC 529171
  • Eilenberg, Samuel and Moore, J. C. (1965) Foundations of relative homological algebra (Memoirs of the American Mathematical Society number 55) American Mathematical Society, Providence, R.I., OCLC 1361982
  • Hatcher, A., (2002) Algebraic Topology Cambridge University Press, ISBN 0-521-79540-0. Detailed discussion of homology theories for simplicial complexes and manifolds, singular homology, etc.

de:Homologie (Mathematik) es:Homología (matemática) ko:???? it:Omologia (algebra) nl:Homologie (wiskunde) pt:Homologia (matemática) ru:????????? (?????????) fi:Homologia zh:??





Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article



Related Links in Homology (mathematics)

Search for Homology (mathematics) in Tutorials
Search for Homology (mathematics) in Encyclopedia
Search for Homology (mathematics) in Dictionary
Search for Homology (mathematics) in Open Directory
Search for Homology (mathematics) in Store
Search for Homology (mathematics) in PriceGig



Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor

Advertisement

Advertisement



Homology (mathematics)
Homology_(mathematics) top Homology_(mathematics)

Home - Add TutorGig to Your Site - Disclaimer

©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement