§ Homotopic maps produce same singular homology: Intuition
Take two maps f,g:X→Y which are homotopic. We wish
to show that if f is homotopic to g, then we will get the same
induced singular homology groups from f and g. The idea is to take a chain
c[n]∈C[n], then study the image f♯(c[n]) and g♯(c[n]). Since f
and g are homotopic, we can build a "prism" that connects f♯(c[n]) and g♯(c[n])
by means of a prism operator, that sends a chain c∈C[n]
to the prism p(c) produced by the chain which lives in D[n+1]. Next, we compute the
boundary of this prism, ∂p(c). This boundary will contain a top portion,
which is f♯(c), a bottom portion which is g♯(c), and the boundary edges
of the prism itself, which is the same as taking the prism of the boundary edges
p(∂c). This gives the equation ∂(p(c))=p(∂c)+g♯(c)−f♯(c).
Rearranging, this gives g♯(c)−f♯(c)=∂p(c)−p(∂c). To inspect
homology, we wish to check that f♯,g♯ agree on elements of ker(∂[n])/im(∂[n+1]).
So, we set c∈ker(∂[n]). This kills of p(∂c). Further, since we
quotient by ∂[n+1], the ∂(p[c]) also dies off. This means that
g♯(c)−f♯(c)=0 when interpreted as an element of H[Y][n]. Philosophically,
living in ker(∂[n]) kills −∘∂, and quotienting
by im(∂[n+1]) kills ∂∘−. Thus, we get that g♯ and f♯ produce the same
homology element. Intuitively, we are saying that these can be connected by a prism in the space,
and thus produce the same element. Think of the 0D case in a path-connected
space, where all points become equivalent since we can connect them by paths.
To compute the boundary of the prism, we break the prism into an interplation from
f♯ into g♯ by raising f♯ into g♯ one vertex at a time. This then allows us
to induce cancellations and show that ∂(p(c)) contains the terms
p(∂(c)), f♯(c) and g♯(c).
Let's consider a 1D line l:Δ1→X in X, with vertices
l[0],l[1]. The image of this line under f is m≡f∘l with m[0],m[1] as vertices,
and under g is n with n[0],n[1] as vertices. Let H:[0,1]×[0,1]→X
be the homotopy between H(0)f and H(1)=g. The prism is image of the function p:[0,1]×Δ1, defined
as p(t,i)≡H(t,l(i)). We see that p(0,i)=H(0,l(i))=f(l(i))=m, and p(1,i)=g(l(i))=n.
So, we get a "prism" whose endpoints are m=f∘l and n=g∘l.