Welcome to roadsat.com on July 11 2009.
This is an internet experiment running to monitor browsing habbits of individuals through wikipedia contents.

Cellular homology

From Wikipedia, the free encyclopedia

Jump to: navigation, search

In mathematics, cellular homology in algebraic topology is a homology theory for CW-complexes.

It agrees with singular homology, and can provide an effective means of computing homology modules. If X is a CW-complex with n-skeleton Xn, the cellular homology modules are defined as the homology groups of the cellular chain complex:

 \cdots \to  H_{n+1}( X_{n+1}, X_n ) \to H_n( X_n, X_{n-1} ) \to H_{n-1}( X_{n-1}, X_{n-2} ) \to \cdots .

The module

H_n( X_n, X_{n-1} ) \,

is free, with generators which can be identified with the n-cells of X. The boundary maps

H_n(X_n,X_{n-1}) \to H_{n-1}(X_{n-1},X_{n-2}) \,

can be determined by computation of the degrees of the attaching maps of the cells.

One sees from the cellular chain complex that the n-skeleton determines all lower-dimensional homology:

H_k(X) \cong H_k(X_n)

for k < n.

An important consequence of the cellular perspective is that if a CW-complex has no cells in consecutive dimensions, all its homology modules are free. For example, complex projective space CPn has a cell structure with one cell in each even dimension; it follows that for 0 ≤ kn,

 H_{2k}(\mathbb{CP}^n; \mathbb{Z}) \cong \mathbb{Z}

and

 H_{2k+1}(\mathbb{CP}^n) = 0 .

[edit] Euler characteristic

For a cellular complex X, let Xj be its j-th skeleton, and cj be the number of j-cells, i.e. the rank of the free module Hj(Xj, Xj-1). The Euler characteristic of X is defined by

\chi (X) = \sum _0 ^n (-1)^j c_j.

The Euler characteristic is a homotopy invariant. In fact, in terms of the Betti numbers of X,

\chi (X) = \sum _0 ^n (-1)^j \; \mbox{rank} \; H_j (X).

This can be justified as follows. Consider the long exact sequence of relative homology for the triple (Xn, Xn - 1 , ∅):

 \cdots \to  H_i( X_{n-1}, \empty) \to H_i( X_n, \empty) \to H_i( X_{n}, X_{n-1} ) \to \cdots .

Chasing exactness through the sequence gives


\sum_{i = 0} ^n (-1)^i \; \mbox{rank} \; H_i (X_n, \empty)

= \sum_{i = 0} ^n (-1)^i \; \mbox{rank} \; H_i (X_n, X_{n-1}) \; + \; \sum_{i = 0} ^n (-1)^i \; \mbox{rank} \; H_i (X_{n-1}, \empty).

The same calculation applies to the triple (Xn - 1, Xn - 2, ∅), etc. By induction,



\sum_{i = 0} ^n (-1)^i \; \mbox{rank} \; H_i (X_n, \empty)

= \sum_{j = 0} ^n  \; \sum_{i = 0} ^j (-1)^i \; \mbox{rank} \; H_i (X_j, X_{j-1}) 

= \sum_{j = 0} ^n  (-1)^j c_j.


[edit] References

Personal tools

Visit joltnews for the latest headlines
Visit bloit.com for company information
Geed Media does computer consulting on long island.
This page viewed times. See Logs