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.

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

Φi = {σ ∈ Φ|(∃x ∈ Xi|x ∈ σ)} , i = 1,...,k<br />

are disjo<strong>in</strong>t; moreover, the pairs Ki =(Xi,Φi), i = 1,...,k, called connected components<br />

of K, are simplicial subcomplexes of K. Hence, the relation of connectedness<br />

subdivides the complex K <strong>in</strong>to a union of disjo<strong>in</strong>t simplicial subcomplexes of K.<br />

From this po<strong>in</strong>t of view, a complex K is connected if and only if it has a unique<br />

connected component.<br />

(II.4.4) Lemma. A simplicial complex K is connected if and only if |K| is connected.<br />

Proof. Suppose K to be connected and let p and q be any two po<strong>in</strong>ts of |K|. Jo<strong>in</strong><br />

p to a vertex x of its carrier s(p) by means of the segment with end po<strong>in</strong>ts p and x;<br />

this segment is conta<strong>in</strong>ed <strong>in</strong> |s(p)| and is therefore a segment of |K|; similarly, jo<strong>in</strong><br />

q to a vertex y of its carrier s(q). However, the vertices x and y are also vertices of K<br />

and s<strong>in</strong>ce K is connected, there is a path of 1-simplexes of K which l<strong>in</strong>ks x to y. In<br />

this manner, we obta<strong>in</strong> a path of |K| that l<strong>in</strong>ks p to q; hence, |K| is path-connected<br />

and so, |K| is connected (see Theorem (I.1.21)).<br />

Conversely, suppose |K| to be connected and let Ki be a connected component<br />

of K; s<strong>in</strong>ceKi and K � Ki are subcomplexes of K, wehavethat|Ki| is open and<br />

closed <strong>in</strong> |K|; s<strong>in</strong>ce|K| is connected, |Ki| = |K|, thatistosay,Ki = K and so, K is<br />

connected. �<br />

The reader is encouraged to review the results on connectedness and pathconnectedness<br />

<strong>in</strong> Sect. I.1; note that these two concepts are equivalent for polyhedra.<br />

(II.4.5) Lemma. The follow<strong>in</strong>g properties regard<strong>in</strong>g a simplicial complex K =<br />

(X,Φ) are equivalent:<br />

1. K is connected;<br />

2. H0(K;Z) � Z;<br />

3. the kernel of the augmentation homomorphism<br />

ε : C0(K) → Z ,<br />

co<strong>in</strong>cides with the group B0(K).<br />

n<br />

∑<br />

i=1<br />

Proof. 1 ⇒ 3: We first notice that the <strong>in</strong>clusion<br />

is always true: <strong>in</strong>deed,<br />

�<br />

ε<br />

�<br />

k<br />

∂1 ∑ gi{x<br />

i=0<br />

i 0 ,xi1 }<br />

B0(K) ⊂ ker ε<br />

��<br />

=<br />

gi{xi} ↦→<br />

k k<br />

∑ gi − ∑<br />

i=0 i=0<br />

n<br />

∑ gi<br />

i=1<br />

gi = 0.<br />

Let x be a fixed vertex of K. The connectedness of K means that, for every vertex<br />

y of K, the 0-cycles {x} and {y} are homological and so, for every 0-cha<strong>in</strong><br />

c0 = ∑ k i=0 gi{xi}, there exists a 1-cha<strong>in</strong> c1 such that

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

Saved successfully!

Ooh no, something went wrong!