Homology (mathematics) : Homology group

word looked up :


	Homology (mathematics) : Homology group (See also Homology (biology).) In mathematics (especially algebraic topology and abstract algebra), homology is a certain general procedure to associate a sequence of abelian groups or modules to a given mathematical object.

Construction of homology groups

The procedure works as follows: Given the object X, one first defines a chain complex that encodes information about X. A chain complex is a sequence of abelian groups or modules A₀, A₁, A₂... connected by homomorphisms d_n : A_n -> A_n-1, such that the composition of any two consecutive maps is zero: d_n o 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 factor module)

H_n(X) = ker(d_n) / im(d_n+1).

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.

Examples

A gentler introduction with pictures would be nice

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[1], a[2], ..., a[n]) to the sum of (-1)ⁱ (a[1], ..., a[i-1], a[i+1], ..., a[n]) from i = 0 to i = n. 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 simplicial 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₁ and a surjective homomorphism p₁ : F₁ -> X. Then one finds a free module F₂ and a surjective homomorphism p₂ : F₂ -> ker(p₁). Continuing in this fashion, a sequence of free modules F_n and homorphisms 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.

Cohomology

Chain complexes form a category: A morphism from the chain complex (d_n : A_n -> A_n-1) to the chain complex (e_n : B_n -> B_n-1) is a sequence of homomorphisms f_n : A_n -> B_n such that f_n-1 o d_n = e_n-1 o f_n for all n. The n-th homology H_n 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 X's chain complex to Y's), then the H_n 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 Hⁿ) form contravariant functors from the category that X belongs to into the category of abelian groups or modules.

Properties

If (d_n : A_n -> 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 defined the Euler characteristic

χ = ∑ (-1)ⁿ 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:

χ = ∑ (-1)ⁿ 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 -> A -> B -> C -> 0

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

... -> H_n(A) -> H_n(B) -> H_n(C) -> H_n-1(A) -> H_n-1(B) -> H_n-1(C) -> H_n-2(A) -> ...

All maps in this long exact sequence are induced by the maps between the chain complexes, except for the maps H_n(C) -> H_n-1(A). These latter are called connecting homomorphisms and are provided by the snake lemma.

copy. If you received it electronically, such person may.html">may.html">may receive it electronically. THIS ETEXT IS OTHERWISE PROVIDED TO YOU "AS-IS". NO OTHER TO THE ETEXT OR ANY MEDIUM IT MAY BE ON, INCLUDING BUT NOT PARTICULAR PURPOSE. Some states do not allow disclaimers of implied warranties or above disclaimers and exclusions may not apply to you, and you You will indemnify and hold the Project, its directors, and expense, including legal fees, that arise directly or [1] distribution of this etext, [2] alteration, modification, You may distribute copies of this etext electronically, or by "Small Print!" and all other references to Project Gutenberg, requires that you do not remove, alter or modify the if you wish, distribute this etext in machine readable including any form.html">form.html">form resulting from conversion by word pro- *EITHER*: [*] The etext, when displayed, is clearly readable, and intended by the author of the work, although tilde be used to convey punctuation intended by the indicate hypertext links; OR [*] The etext may be readily converted by the reader at form by the program that displays the etext (as is OR [*] You provide, or agree to also provide on request at etext in its original plain ASCII form (or in EBCDIC "Small Print!" statement. [3] Pay a trademark license fee to the Project of 20% of the already use to calculate your applicable taxes. If you payable to "Project Gutenberg Association/Carnegie-Mellon .

On wordlookup.net

All is still licensed under the GNU FDL.
It uses material from the wikipedia.

navig stuff