15.01.2013 Views

Simplicial Structures in Topology

Simplicial Structures in Topology

Simplicial Structures in Topology

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

30 I Fundamental Concepts<br />

The quotient set obta<strong>in</strong>ed from Top(X,Y ) and the relation ∼ is denoted by [X,Y ];<br />

its elements are equivalence classes for homotopy of maps, or homotopy classes of<br />

maps from X to Y.<br />

The category HTop,thehomotopy category associated with Top, has topological<br />

spaces for objects and its morphisms are homotopy classes of maps: the set of<br />

morphisms is, therefore,<br />

HTop(X,Y)=[X,Y].<br />

When deal<strong>in</strong>g with based maps f ,g ∈ Top ∗((X,x0),(Y,y0)), we say that f ∼ g if<br />

there is a map H : X × I → Y such that<br />

(∀t ∈ I) H(x0,t)=y0 , H(−,0)= f , and H(−,1)=g.<br />

In this case, we use the notation [X,Y]∗ = Top ∗(X,Y)/∼.<br />

Relative homotopy <strong>in</strong> CTop is a useful concept: two maps of pairs f ,g: (X,A) →<br />

(Y,B) are homotopic relative to X ′ ⊂ X if f |X ′ = g|X ′ and there exists a map<br />

such that<br />

H : (X × I,A × I) −→ (Y,B)<br />

(∀x ∈ X) H(x,0)= f (x) H(x,1)=g(x)<br />

(∀x ∈ X ′ , ∀t ∈ I) H(x,t)= f (x)=g(x).<br />

This be<strong>in</strong>g the case, we denote the relative homotopy from f to g with<br />

f ∼ relX ′ g<br />

and we say that f is homotopic to g rel X ′ . If X ′ = /0, we have a free homotopy<br />

<strong>in</strong> CTop. In the category Top ∗ the based homotopy co<strong>in</strong>cides with the homotopy<br />

relative to the base po<strong>in</strong>t.<br />

We say that two spaces X,Y ∈ Top are of the same homotopy type (or simply,<br />

type) iftherearemapsf : X → Y and g: Y → X such that gf ∼ 1X and fg∼ 1Y ;<br />

the map f is called a homotopy equivalence.<br />

The “functions” between categories are called functors, which take objects to<br />

objects and morphisms to morphisms. Specifically, a covariant functor or simply<br />

functor<br />

F : C → C ′<br />

is a relation between these two categories such that<br />

1. (∀X ∈ C) F(X) ∈ C ′<br />

2. (∀ f ∈ C(A,B)) F( f ) ∈ C ′ (F(A),F(B))<br />

3. (∀ f ∈ C(A,B))(∀g ∈ C(B,C)) F(gf)=F(g)F( f )<br />

4. (∀A ∈ C) F(1A)=1FA

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

Saved successfully!

Ooh no, something went wrong!