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> 3<br />

We need to show that, with this def<strong>in</strong>ition, the set U of open sets satisfies properties<br />

A1, A2, and A3 for open sets. Property A1 is easily verified. Let us prove now<br />

that A2 is true: let {Uα | α ∈ J} be a set of elements of U; we want to show that<br />

U = �<br />

α∈J Uα ∈ U. In fact, for each x ∈ U there is α ∈ J such that x ∈ Uα; hence,<br />

there is a B ∈ B such that x ∈ B ⊂ Uα ⊂ U. We prove A3 by <strong>in</strong>duction. Let us<br />

consider two elements U1,U2 ∈ U. If U1 ∩U2 = /0, then U1 ∩U2 ∈ U. Otherwise,<br />

for each x ∈ U1 ∩U2, wemayf<strong>in</strong>dtwosetsB1,B2∈Bsuch that x ∈ B1 ⊂ U1 and<br />

x ∈ B2 ⊂ U2; s<strong>in</strong>ceBis a basis, there exists an element B3 ∈ B such that x ∈ B3 ⊂<br />

B1 ∩ B2. We conclude that x ∈ B3 ⊂ U1 ∩U2 and so, U1 ∩U2 ∈ U. Suppose now that<br />

A3 holds for any <strong>in</strong>tersection of n −1elementsofU. LetU1,U2,...,Un be elements<br />

of U; we write<br />

� �<br />

n� n−1 �<br />

Ui = Ui ∩Un<br />

i=1<br />

i=1<br />

and note that �n−1 i=1 Ui ∈ U by the <strong>in</strong>duction hypothesis; hence, the <strong>in</strong>tersection of<br />

all the given elements Ui belongs to U. We also note that all elements of a basis<br />

are elements of the topology it generates (that is to say, all elements of a basis are<br />

automatically open).<br />

We give now an important example of a topological space which illustrates well<br />

the concepts given so far. Let Rn be the Euclidean n-dimensional space, namely,<br />

the set of all n-tuples x =(x1,...,xn) of real numbers xi. Let d : Rn × Rn → Rn be the function def<strong>in</strong>ed <strong>in</strong> the follow<strong>in</strong>g manner: for each x =(x1,...,xn) and y =<br />

(y1,...,yn) <strong>in</strong> Rn ,<br />

� n<br />

d(x,y)= ∑(xi<br />

− yi)<br />

i=1<br />

2 .<br />

This function, called Euclidean distance (or metric) has the follow<strong>in</strong>g properties:<br />

(∀x,y ∈ R n ) d(x,y)=d(y,x),<br />

d(x,y)=0 ⇐⇒ x = y,<br />

(∀x,y,z ∈ R n ) d(x,z) ≤ d(x,y)+d(y,z).<br />

For every x ∈ R n and every real number ε > 0, we def<strong>in</strong>e the n-dimensional open<br />

disk (or open n-disk) with centre x and radius ε as the set<br />

The set<br />

˚D n ε(x)={y ∈ R n | d(x,y) < ε} .<br />

B = { ˚D n ε(x) | x ∈ R n , ε > 0}<br />

is a basis for the Euclidean topology of Rn . In fact, it is evident that condition<br />

B1 above holds; let us prove condition B2: let ˚D n ε(x) and ˚D n δ (y) be two elements<br />

of B with non-empty <strong>in</strong>tersection; for each z <strong>in</strong> this <strong>in</strong>tersection, consider the real<br />

numbers γ1 = ε − d(x,z) and γ2 = δ − d(y,z); letμbethe m<strong>in</strong>imum of γ1 and γ2.<br />

Then, as we can see from Fig. I.1,<br />

z ∈ ˚D n μ (z) ⊂ ˚D n ε (x) ∩ ˚D n δ (y).

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

Saved successfully!

Ooh no, something went wrong!