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.

68 II <strong>Simplicial</strong> Complexes<br />

2. λn is well def<strong>in</strong>ed. We must verify that λn is <strong>in</strong>dependent from both the choice<br />

of the cycle z represent<strong>in</strong>g the homology class and the cha<strong>in</strong> ˜z mapped <strong>in</strong>to z.<br />

Let z ′ ∈ C ′′ be a cycle such that [z]=[z ′ ],andlet˜z ′ ∈ C ′ n be such that gn(˜z ′ )=z ′ ;<br />

moreover, take a cycle c ′ <strong>in</strong> C ′ n−1 satisfy<strong>in</strong>g the property fn−1(c ′ )=∂ ′ n (˜z′ ).The<br />

def<strong>in</strong>ition of homology classes implies that there exists a cha<strong>in</strong> b ∈ C ′′<br />

n+1 such<br />

that ∂ ′′<br />

n+1 (b) =z − z′ . S<strong>in</strong>ce gn+1 is an epimorphism, we can f<strong>in</strong>d a ˜b ∈ C ′ n+1<br />

such that gn+1(˜b)=b. Hence,<br />

gn(˜z − ˜z ′ − ∂ ′ n+1 (˜b)) = z − z ′ − ∂ ′′<br />

n+1 (b)=0<br />

and thus, there exists a ∈ Cn such that<br />

At this po<strong>in</strong>t, we have that<br />

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

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

and because fn−1 is <strong>in</strong>jective, we conclude that c − c ′ = ∂n(a). Therefore, c and<br />

c ′ represent the same homology class <strong>in</strong> Hn(C).<br />

(II.3.2) Remark. The previous items 1. and 2. are typical examples of the<br />

so-called “diagram chas<strong>in</strong>g” technique. We suggest the reader to draw the<br />

diagrams <strong>in</strong>dicat<strong>in</strong>g the maps without their <strong>in</strong>dices which, although necessary<br />

for precision, are sometimes difficult to read; all this will help <strong>in</strong> follow<strong>in</strong>g up<br />

the arguments.<br />

3. The sequence is exact. To prove the exactness of the sequence of homology<br />

groups, we must show the follow<strong>in</strong>g:<br />

a. imHn( f )=kerHn(g);<br />

b. imHn(g)=kerλn;<br />

c. imλn = kerHn−1( f ).<br />

We shall only prove (b), leav<strong>in</strong>g the proof of the other cases to the reader. We<br />

pick a class [z] ∈ Hn(C ′′ ) and compute λnHn(g)([z]) = λn[gn(z)]. S<strong>in</strong>ce we can<br />

take any (!) element of C ′ n which is projected onto gn(z), we choose z itself;<br />

given that ∂ ′′<br />

n (z)=0, we conclude that λn[gn(z)] = 0, that is to say, imHn(g) ⊆<br />

kerλn. Conversely,let[z] be a homology class of Hn(C ′′ ) such that λn[z] =0;<br />

the def<strong>in</strong>ition of λn implies that there exist ˜z ∈ C ′ n and a cycle c ∈ Cn−1 such that<br />

gn(˜z)=z and Cn−1( f )(c)=∂ ′ n(˜z).<br />

Because λn[z]=0, there exists ˜c ∈ Cn such that c = ∂n( ˜c). Notice that<br />

∂ ′ n (Cn( f )( ˜c) − ˜z)=0<br />

and moreover, Hn(g)(Cn(g)( ˜c) − ˜z)=z; hence, kerλn ⊆ imHn(g).<br />

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

Saved successfully!

Ooh no, something went wrong!