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.

I.1 <strong>Topology</strong> 11<br />

We recall that an <strong>in</strong>terval of R (or more generally, of an ordered set) is a subset<br />

A ⊂ R such that, for each a,b,x ∈ R with a < x < b, ifa,b ∈ A, wehavex ∈ A.<br />

Real l<strong>in</strong>e <strong>in</strong>tervals are important examples of connected spaces, as shown by the<br />

next theorem. It is not difficult to prove that every (non-empty) <strong>in</strong>terval of R must<br />

be of one of the follow<strong>in</strong>g types. 2 The set<br />

[a,b]={x ∈ R | a ≤ x ≤ b}<br />

is the closed <strong>in</strong>terval with end-po<strong>in</strong>ts a,b;theset<br />

(a,b)={x ∈ R | a < x < b}<br />

is the open <strong>in</strong>terval with end-po<strong>in</strong>ts a,b;thesets<br />

(a,b]={x ∈ R | a < x ≤ b} and [a,b)={x ∈ R | a ≤ x < b}<br />

are semi-open <strong>in</strong>tervals. Thesets<br />

(a,+∞)={x ∈ R | a < x}, [a,+∞)={x ∈ R | a ≤ x},<br />

(−∞,b)={x ∈ R | x < b} e (−∞,b]={x ∈ R | x ≤ b}<br />

are <strong>in</strong>f<strong>in</strong>ite <strong>in</strong>tervals (and naturally R =(−∞,∞) is the maximal <strong>in</strong>terval).<br />

(I.1.14) Theorem. Any <strong>in</strong>terval of R is a connected space.<br />

Proof. Let X ⊂ R be a closed <strong>in</strong>terval, say X =[a,b]. LetU �= /0 be a subset of X,<br />

both open and closed; we wish to prove that U = X. S<strong>in</strong>ceU is open <strong>in</strong> X, wemay<br />

choose u ∈ U such that u ∈ ˚X. Let<br />

s = sup{x ∈ X | [u,x) ⊂ U};<br />

clearly, u < s. We prove that [u,s) ⊂ U. Indeed, for each v ∈ [u,s), there exists x ∈ X<br />

such that v < x and [u,x) ⊂ U; hence, v ∈ U. We now prove that s = b. In fact, if<br />

s �= b, thens < b; s<strong>in</strong>ceU is closed <strong>in</strong> X, we conclude that s ∈ U and so, [u,s] ⊂ U.<br />

However, U is also open and consequently there is ε > 0 such that [u,s + ε) ⊂ U;<br />

but this contradicts the def<strong>in</strong>ition of least upper bound. It follows that s = b and<br />

[u,b) ⊂ U. Similarly, (a,u] ⊂ U which implies that X =(a,b) ⊂ U ⊂ X, andwe<br />

conclude that U = X.<br />

The reader may verify that this proof applies to the other types of <strong>in</strong>terval (open,<br />

semi-open or <strong>in</strong>f<strong>in</strong>ite); alternatively, once every f<strong>in</strong>ite or <strong>in</strong>f<strong>in</strong>ite, open or closed<br />

<strong>in</strong>terval is the telescopic union of a sequence of closed <strong>in</strong>tervals, for <strong>in</strong>stance,<br />

(0,1)= �<br />

n≥2<br />

� �<br />

1 1<br />

,1 − ,<br />

n n<br />

the rema<strong>in</strong>der of the proof follows from part 2 of Theorem (I.1.13). �<br />

2 It is enough to consider the extrema of the <strong>in</strong>terval a = <strong>in</strong>fA and b = sup A, if they exist. If <strong>in</strong>fA<br />

does not exist, set a = −∞;ifsupA does not exist, set b =+∞.

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

Saved successfully!

Ooh no, something went wrong!