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.

VI.3 Homotopy Groups 221<br />

VI.3.1 Action of the Fundamental Group on the Higher<br />

Homotopy Groups<br />

Like the fundamental group, the higher homotopy groups depend on the choice of a<br />

base po<strong>in</strong>t. In fact, <strong>in</strong> Sect. VI.1 we have proved that a path λ : I → Y between two<br />

po<strong>in</strong>ts y0 and y1 of Y def<strong>in</strong>es an isomorphism<br />

as follows: for every [ f ] ∈ π1(Y,y0),<br />

φ λ : π1(Y,y0) −→ π1(Y,y1)<br />

φ λ ([ f ]) :=[λ −1 ∗ ( f ∗ λ)].<br />

When λ is a closed path at y0, that is to say, a loop of Y with base at y0,wehavean<br />

isomorphism from π1(Y,y0) onto itself and this def<strong>in</strong>es an action<br />

given by the conjugation:<br />

φ : π1(Y,y0) × π1(Y,y0) −→ π1(Y,y0)<br />

ν<br />

−1<br />

(∀[ f ],[g] ∈ π1(Y,y0)) φ([ f ],[g]) = [ f ] × [g] ν<br />

× [ f ].<br />

For the higher homotopy groups, we avail ourselves of the Homotopy Extension<br />

Property for polyhedra. Let λ beapathfromy0to y1 <strong>in</strong> Y . We identify Sn with the<br />

polyhedron | •<br />

σn+1| and suppose that the base po<strong>in</strong>t e0 of Sn is identified with a vertex<br />

of | •<br />

σn+1|. By the Homotopy Extension Property, applied to the pair of polyhedra<br />

(| •<br />

σn+1|,e0), the function f and the path λ give rise to a homotopy (not necessarily<br />

unique)<br />

F : | •<br />

σn+1|×I → Y<br />

through the diagram<br />

e0 ×{0}<br />

��<br />

σn+1|×{0}<br />

| •<br />

��<br />

��<br />

e0 × I<br />

��<br />

λ<br />

σn+1|×I<br />

���<br />

���<br />

�F<br />

���<br />

f<br />

���<br />

����<br />

��<br />

Y<br />

| •

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

Saved successfully!

Ooh no, something went wrong!