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.

VI.3 Homotopy Groups 231<br />

Z ���<br />

��<br />

ℓ<br />

h<br />

���<br />

���<br />

��<br />

X<br />

k<br />

��<br />

��<br />

A<br />

4. Let f ∈ Top ∗((A,a0),(B,b0)) be a given map; construct the space of based functions<br />

PB = {λ : I → B | λ(0)=b0}<br />

(space of paths beg<strong>in</strong>n<strong>in</strong>g at b0) andthemap<br />

¯g<br />

¯f<br />

f<br />

��<br />

��<br />

Y<br />

g<br />

��<br />

��<br />

B<br />

g: PB −→ B , λ ↦→ λ(1).<br />

Then, construct the pullback diagram determ<strong>in</strong>ed by f and g to obta<strong>in</strong> the space<br />

Cf = {(a,λ) ∈ A × PB | f (a)=g(λ )}<br />

with the maps ¯f and ¯g. Prove that for every n the sequence of homotopy groups<br />

is exact <strong>in</strong> πn(A,a0).<br />

πn(Cf ,∗) πn( ¯g)<br />

��<br />

πn(A,a0) πn( f )<br />

��<br />

πn(B,b0)<br />

5. Amap f : A → B is a fibration if,<br />

(∀X ∈ Top)(∀g ∈ Top(X,A))(∀H ∈ Top(X × I,B)) | Hi0 = fg,<br />

there exists G: X ×I → A such that G(−,0)=g and fG= H. Prove that a projection<br />

map f : X ×Y → X is a fibration. Moreover, prove that the map p: PB → B of<br />

Exercise 4 above is a fibration.<br />

6. Prove that, if the map f : (A,a0) → (B,b0) of Exercise 4 above is a fibration, then<br />

the space Cf is of the same homotopy type as the fiber f −1 (b0) over b0.<br />

7. Prove that, if f : (A,a0) → (B,b0) is a fibration, there exists an (left) <strong>in</strong>f<strong>in</strong>ite exact<br />

sequence of homotopy groups<br />

... ��<br />

πn( f −1 (b0),a0)<br />

��<br />

πn−1( f −1 (b0),a0)<br />

��<br />

πn(A,a0)<br />

��<br />

πn−1(A,a0)<br />

��<br />

πn(B,b0)<br />

��<br />

...

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

Saved successfully!

Ooh no, something went wrong!