It turns out that we are not just interested in spaces of continuous maps, but we are concerned with path-connected components of these spaces, or like things that are continuous but also can deform the thing.

Consider the maps Xf1YX \xrightarrow{f_1} Y and Xf0YX \xrightarrow{f_0} Y. We say f0f1f_0 \sim f_1 are homotopic if there is some F:X×IYF : X \times I \rightarrow Y such that F(x,0)=f0F(x,0) = f_0, F(x,1)=f1F(x,1) = f_1.

π(X,Y)=C(X,Y)/\pi(X,Y) = C(X,Y)/\sim
we can consider homotopy classes of maps XYX \rightarrow Y. We get path-connected components or something (maybe homotopies parition any set into classes of path connected components or something).

The classic example to distinguish path connectedness and connectedness is the union of sin(1/x)\sin(1/x) and the yy-axis, which is supposedly connected but not path connected.

We say that XX and YY are homotopy equivalent if gfidXg \circ f \sim \text{id}_X (homotopic to the identity on XX), and fgidYf \circ g \sim \text{id}_Y.

We define a retraction r:XAXr : X \twoheadrightarrow A\subseteq X so that rA=idAr|_A = \text{id}_A. A retraction is deformational if iridXi \circ r \sim \text{id}_X. Strict if the homotopy is identical on AA, like for example, AA doesn’t rotate or something during the retraction and stuff. In other words, strict means that AA doesn’t move during the retraction. Apparently there are some pathological examples, for which one can refer to the book.

Proposition. Deformation retraction is a homotopy equivalence.

Proof.

iridXi \circ r \sim \text{id}_X, ri=idAr \circ i = \text{id}_A.

Now XX is called contractible if x0Xx_0 \in X is a deformtaional retraction of XX.

Proposition. XX is contractible is equivalent to XptX \sim \text{pt}.

Remark. There is some result that we will eventually discuss called Borsuk or something about extending retractions or something.

There is a classification of homotopies or something:

Theorem. TFAE (the following are equivalent):

  1. XYX \sim Y
  2. Z\forall Z, αZ:π(X,Z)π(Y,Z)\exists \alpha^Z : \pi(X,Z) \rightarrow \pi(Y, Z) which is natural with respect to ZZ, meaning that for any ψ:ZW\psi : Z \rightarrow W, then whenever we have a map from XX to ZZ, we can compose it with a map from ZZ to WW to get a map from XX to WW or something? More like in the sense that π(X,Z)π(X,W)\pi(X,Z) \rightarrow \pi(X,W) there is a map ψ\psi_* induced by ψ\psi. And there is also a map ψ\psi_* from π(Y,Z)\pi(Y,Z) to π(Y,W)\pi(Y,W). In between we have two bijections, and it commutes. Just naturality from category theory, but not sure how the naturality idea is motivated from anything right now.
  3. Z\forall Z, βZ:π(Z,X)π(Z,Y)\exists \beta_Z : \pi(Z,X) \rightarrow \pi(Z,Y) which is a bijection which is natural with respect to ZZ.
Proof.

We start by showing that 1 implies 3. If XYX \sim Y, then there exist maps f:XYf : X \rightarrow Y and g:YXg : Y \rightarrow X such that the compositions are identity. Then we get maps:

π(Z,X)fπ(Z,Y)gπ(Z,X)\pi(Z, X) \xrightarrow{f_*} \pi(Z,Y) \xrightarrow{g_*} \pi(Z,X)
and the composition is identity. You can also do this in the opposite order and get identity. Therefore, the maps are set-theoretic inverses and so these are bijections.

Strat. Many things in mathematics relating to associativity come down to associativity of maps, for example associativity of vector addition comes from that of maps by thinking of vectors as translation maps. Apparently that comes in here too. He drew a square with π(Z,X)\pi(Z,X), π(Z,Y)\pi(Z,Y), π(W,X)\pi(W,X), and π(Z,Y)\pi(Z,Y).

Now we can do the direction that 3 implies 1. For this direction, he started by taking the image of the identity of π(X,X)\pi(X,X) in π(X,Y)\pi(X,Y) under the map βX\beta_X which was defined previously as ff_* I think (so that βX(id)=f\beta_X(id) = f). Awesome proof using the square π(X,X)\pi(X,X), π(X,Y)\pi(X,Y), π(Y,X)\pi(Y,X), π(Y,Y)\pi(Y,Y) basically by tracing where the elements idX\text{id}_X and idY\text{id}_Y go to throughout the diagram. We then do a similar square for the other way.

Remark. There is also a basepoint version of this, where we define πb(x,y)\pi_b(x,y) similarly to π\pi above. Another remark is

πb(ΣX,Y)=πb(X,ΩY)\pi_b(\Sigma X, Y) = \pi_b(X, \Omega Y)
We can essentially think of these CC or πb\pi_b or π\pi or whatever as functors, and so we see that Σ\Sigma and Ω\Omega are sort of adjoint. It is also important to note that they are not just functors to sets, they have some algebraic structure because loops can be adjoined, you can combine two loops to get another loop. I should note he put strikethroughs through the bbs in πb\pi_b but I am not completely sure why. Something like this is in Fuchs Chapter 4. Apparently Fuchs makes two errors in each of his lectures.