1 The Fundamental Group
1.1 (§51) Homotopy of paths
- •
Def. are homotopic, , if there is a map with , . is a homotopy.
- •
Notation. ; the rule is a path from to .
- •
Def. A path in from to : a map with , .
- •
Def. Paths from to are path homotopic, , if there is with The endpoints stay fixed throughout.
- •
Lem. and are equivalence relations.
Proof. Reflexive: constant homotopy. Symmetric: . Transitive: concatenate, for , for ; continuous by the pasting lemma since .
- •
Notation. = homotopy class; for paths, = path homotopy class.
- •
Ex. Straight-line homotopy. For (or into any convex ): . So any two maps into a convex set are homotopic; and if are paths with the same endpoints, this is a path homotopy.
- •
Ex. In the punctured plane , with , , : (the straight-line homotopy stays in ), but the straight-line homotopy from to passes through the origin. In fact — proved later.
Note. and are homotopic as maps if endpoints are released. That is why path homotopy, not homotopy, is the right relation here.
- •
Def. For a path and a path , the product
Continuous by the pasting lemma.
- •
Lem. and . Hence is well defined.
- •
Thm. on path homotopy classes satisfies:
- (1)
Associativity: ;
- (2)
Units: with the constant path, ;
- (3)
Inverses: with , and .
Proof. All three are reparametrisation homotopies. For (1) let the breakpoints slide: traverse on , on , thereafter. Draw the square with the two subdivision patterns and interpolate.
- (1)
- •
Caution. is not a group operation on paths — only on path homotopy classes, and only when endpoints match.