πn(X,x0)=πb((Sn,0),(X,x0)). Note that π0(X,x0) is the number of path-connected components of X.
He then explained the pictures from Fig 37 and Fig 38 in the book and basically section 8.1.
Depednence on Base Points
If we have another base point x1 and a path from x0 to x1γ, we get a map πn(X,x0)γπn(X,x1)γ~πn(X,x0).
We introduced many algebraic invariants but we can’t compute many of them unless the space is trivial, so let’s look at a covering (T,t0)→(X,x0). In the theory of coverings we showed that mappings p:(T,t0)→(X,x0) are injective. This is because if a loop is contractible in (X,x0), we can use the homotopy lifting lemma to lift this homotopy up to T, and then because the fiber is discrete, we get the same point up there so that the other loop upstairs is also contractible. From this, we get that p∗:πn(T,t0)↪πn(X,x0) is injective for n≥1. It turns out for n≥2, it is also surjective.
Relative Homotopy Groups
He discussed some stuff from this section.
The Reason This Was introduced
This isn’t necessarily helpful for computations or anything, but it let’s us make the long exact homotopy sequence.
He wrote something about AiX and (X,x0,x0)j(X,A,x0).