15.01.2013 Views

Simplicial Structures in Topology

Simplicial Structures in Topology

Simplicial Structures in Topology

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

II.3 Homological Algebra 67<br />

is exact and each square is commutative.<br />

The next result is very important; it is the so-called Long Exact Sequence<br />

Theorem.<br />

(II.3.1) Theorem. Let<br />

(C,∂) ��<br />

f<br />

��<br />

′ ′<br />

(C ,∂ )<br />

g<br />

��<br />

��<br />

′′ ′′<br />

(C ,∂ )<br />

be a short exact sequence of cha<strong>in</strong> complexes. For every n ∈ Z, there exists a homomorphism<br />

λn : Hn(C ′′ ) → Hn−1(C)<br />

(called connect<strong>in</strong>g homomorphism) mak<strong>in</strong>g exact the follow<strong>in</strong>g sequence of homology<br />

groups<br />

... ��<br />

Hn(C) Hn( f )<br />

��<br />

Hn(C ′ ) Hn(g)<br />

��<br />

Hn(C ′′ )<br />

λn ��<br />

Hn−1(C)<br />

��<br />

....<br />

Proof. The proof of this theorem is not difficult. However, it is very long; we shall<br />

divide it <strong>in</strong>to several steps, leav<strong>in</strong>g some of the proofs to the reader, as exercises.<br />

1. Def<strong>in</strong>ition of λn. Take the follow<strong>in</strong>g portion of the short exact sequence of cha<strong>in</strong><br />

complexes:<br />

∂n<br />

Cn<br />

��<br />

��<br />

Cn−1 ��<br />

fn−1<br />

fn ��<br />

C ′ n<br />

∂ ′ n<br />

��<br />

gn �<br />

��<br />

′<br />

C n−1 gn−1<br />

� ��<br />

∂ ′′<br />

n<br />

C ′′<br />

n<br />

��<br />

��<br />

��<br />

′′<br />

C<br />

Let z be a cycle of C ′′<br />

n ;s<strong>in</strong>cegn is surjective, there exists a cha<strong>in</strong> ˜z ∈ C ′ n such<br />

that gn(˜z)=z. Because the diagram is commutative,<br />

gn−1∂ ′ n<br />

(˜z)=∂ ′′<br />

n<br />

n−1<br />

gn(˜z)=∂ ′′<br />

n (z)=0<br />

and thus, ∂ ′ n(˜z) ∈ kergn−1 = im fn−1; hence, there exists a unique cha<strong>in</strong> c ∈ Cn−1<br />

such that<br />

fn−1(c)=∂ ′ n (˜z).<br />

Actually, c is a cycle because<br />

fn−2∂n−1(c)=∂ ′ n−1 fn−1(c)=∂ ′ n−1∂ ′ n (˜z)=0<br />

and fn−2 is a monomorphism. It follows that we can def<strong>in</strong>e<br />

by sett<strong>in</strong>g λn[z] :=[c].<br />

λn : Hn(C ′′ ) → Hn−1(C)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!