Skip to main content

Section 2.12 Week 12

Subsection Monday

Last week we built singular homology, established its functoriality, and introduced the relative homology groups \(H_n(X,A)\) together with the long exact sequence of a pair. We closed by defining chain homotopies and showing that chain homotopic chain maps induce the same map on homology. This week we cash that in: we prove homotopy invariance of singular homology (Monday) and develop the technology of barycentric subdivision needed to pass between large and small chains (Wednesday). Friday will be a catch-up day, with no new material; the excision theorem, the Mayer–Vietoris sequence, and the computation of \(H_*(S^n)\) have moved to Monday of week 13, leaving the remaining computations — including \(H_*(\mathbb{RP}^n)\) — for Wednesday of week 13.

Subsubsection The prism operator

Our task is to construct, for any homotopy \(h\colon X\times[0,1]\to Y\) between continuous maps \(f,g\colon X\to Y\text{,}\) a chain homotopy \(P\) from \(f_\sharp\) to \(g_\sharp\text{.}\) The geometric idea is straightforward: a singular simplex \(\sigma\colon\Delta^n\to X\) together with the homotopy gives a "prism"
\begin{equation*} h\circ(\sigma\times\mathrm{id})\colon\Delta^n\times[0,1]\longrightarrow Y, \end{equation*}
and the boundary of this prism consists of the bottom \(f\circ\sigma\text{,}\) the top \(g\circ\sigma\text{,}\) and the side faces, which involve \(\partial\sigma\text{.}\) To turn this into an algebraic chain homotopy we need a canonical decomposition of the prism \(\Delta^n\times[0,1]\) into \((n+1)\)-simplices.
Definition 2.12.1. Simplicial decomposition of the prism.
Let \(\Delta^n=[v_0,\ldots,v_n]\) with \(v_i=e_i\text{.}\) Write the vertices of \(\Delta^n\times[0,1]\) as
\begin{equation*} v_i^- := (v_i,0), \qquad v_i^+ := (v_i,1), \qquad 0\le i\le n. \end{equation*}
For each \(0\le i\le n\text{,}\) let
\begin{equation*} \tau_i := \bigl[v_0^-,\ldots,v_i^-,v_i^+,\ldots,v_n^+\bigr] \end{equation*}
denote the affine-linear singular \((n+1)\)-simplex \(\tau_i\colon\Delta^{n+1}\to\Delta^n\times[0,1]\) sending the vertices of \(\Delta^{n+1}\) in order to \(v_0^-,\ldots,v_i^-,v_i^+,\ldots,v_n^+\text{.}\) The simplices \(\tau_0,\ldots,\tau_n\) have pairwise disjoint interiors and their images cover \(\Delta^n\times[0,1]\text{.}\)
For \(n=2\text{,}\) the prism \(\Delta^2\times[0,1]\) is a triangular prism, and the decomposition produces three tetrahedra \(\tau_0=[v_0^-,v_0^+,v_1^+,v_2^+]\text{,}\) \(\tau_1=[v_0^-,v_1^-,v_1^+,v_2^+]\text{,}\) and \(\tau_2=[v_0^-,v_1^-,v_2^-,v_2^+]\text{.}\) They are separated by two interior triangular cuts \([v_0^-,v_1^+,v_2^+]\) (between \(\tau_0\) and \(\tau_1\)) and \([v_0^-,v_1^-,v_2^+]\) (between \(\tau_1\) and \(\tau_2\)); these cuts add three new (interior) edges, drawn in color below.
described in detail following the image
The triangular prism \(\Delta^2\times[0,1]\) with vertices \(v_0^-,v_1^-,v_2^-\) on the bottom face and \(v_0^+,v_1^+,v_2^+\) on the top face, decomposed into three tetrahedra \(\tau_0,\tau_1,\tau_2\) by the three interior diagonal edges \(v_0^-v_1^+\text{,}\) \(v_0^-v_2^+\text{,}\) and \(v_1^-v_2^+\text{.}\)
Definition 2.12.2. Prism operator.
Let \(h\colon X\times[0,1]\to Y\) be a homotopy. The prism operator \(P_n\colon C_n(X)\to C_{n+1}(Y)\) is defined on a generator \(\sigma\colon\Delta^n\to X\) by
\begin{equation*} P_n(\sigma) := \sum_{i=0}^n (-1)^i\,(h\circ(\sigma\times\mathrm{id}))\circ\tau_i, \end{equation*}
and extended linearly to all of \(C_n(X)\text{.}\)
Each summand \((h\circ(\sigma\times\mathrm{id}))\circ\tau_i\) is a singular \((n+1)\)-simplex in \(Y\text{;}\) intuitively it is the image in \(Y\) of the \(i\)-th piece of the prism. The signs are chosen so that the algebraic boundary of \(P_n(\sigma)\) reproduces the geometric boundary of the prism.

Subsubsection Homotopy invariance

Proof.
By linearity it suffices to evaluate both sides on a generator \(\sigma\colon\Delta^n\to X\text{.}\) Let \(H:=h\circ(\sigma\times\mathrm{id})\colon\Delta^n\times[0,1]\to Y\text{.}\) We compute \(\partial_{n+1}P_n(\sigma)\) using the definition of the boundary on each \(\tau_i\text{.}\) The face of \(\tau_i\) obtained by omitting the vertex with label \(j\) falls into one of three classes:
(a) The faces internal to the prism (omitting \(v_i^-\) from \(\tau_i\) yields the same face as omitting \(v_i^+\) from \(\tau_{i-1}\text{,}\) with opposite sign). All such internal faces cancel pairwise.
(b) The top face (omitting all "minus" vertices from \(\tau_n\text{,}\) i.e., \(j=0\) in \(\tau_n\)) gives \(g\circ\sigma\text{.}\)
(c) The bottom face (omitting all "plus" vertices from \(\tau_0\text{,}\) i.e., \(j=n+1\) in \(\tau_0\)) gives \(-(-1)^0 f\circ\sigma\cdot(-1)^{n+1}\cdot(-1)^{n+1} = -f\circ\sigma\text{;}\) tracking the alternating signs carefully yields exactly \(-f_\sharp\sigma\text{.}\)
(d) The side faces (omitting \(v_j^-\) with \(j<i\text{,}\) or \(v_j^+\) with \(j>i\)) reassemble to \(-P_{n-1}(\partial_n\sigma)\text{.}\) Indeed, the faces involving \(\sigma\circ d_j\) are precisely the prism over the \(j\)-th face of \(\sigma\text{,}\) with the correct signs.
Combining (a)–(d) gives \(\partial_{n+1}P_n(\sigma) = g_\sharp\sigma - f_\sharp\sigma - P_{n-1}(\partial_n\sigma)\text{,}\) which is the desired identity. The detailed sign verification, while tedious, reduces to the simplicial identities for the face maps \(d_i\text{;}\) see Hatcher, Theorem 2.10 for a fully explicit accounting.
Proof.
Choose a homotopy \(h\) from \(f\) to \(g\text{.}\) By Lemma 2.12.3, the prism operator \(P\) is a chain homotopy from \(f_\sharp\) to \(g_\sharp\text{.}\) By Lemma 2.11.23, chain homotopic chain maps induce equal maps on homology, so \(f_*=g_*\text{.}\)
Proof.
Let \(g\colon Y\to X\) be a homotopy inverse, so that \(g\circ f\simeq\mathrm{id}_X\) and \(f\circ g\simeq\mathrm{id}_Y\text{.}\) By functoriality (Proposition 2.11.14) and homotopy invariance,
\begin{equation*} g_*\circ f_* = (g\circ f)_* = (\mathrm{id}_X)_* = \mathrm{id}_{H_n(X)}, \end{equation*}
and similarly \(f_*\circ g_*=\mathrm{id}_{H_n(Y)}\text{.}\) So \(f_*\) is an isomorphism with inverse \(g_*\text{.}\)
The corollary makes our earlier corollary Corollary 2.11.21 precise: if \(X\) is contractible, then the unique map \(X\to\mathrm{pt}\) is a homotopy equivalence, so \(\widetilde{H}_n(X)\cong\widetilde{H}_n(\mathrm{pt})=0\) for all \(n\text{.}\) Concretely, \(\widetilde{H}_n(\mathbb{R}^k)=0\text{,}\) \(\widetilde{H}_n(D^k)=0\text{,}\) and \(\widetilde{H}_n(\mathrm{cone}(Y))=0\) for every space \(Y\) and every \(k,n\text{.}\)

Subsubsection Relative homotopy invariance

The same prism construction gives homotopy invariance of relative homology, provided we track the subspaces. A map of pairs \(f\colon(X,A)\to(Y,B)\) is a continuous map \(f\colon X\to Y\) with \(f(A)\subseteq B\text{.}\) Two such maps \(f,g\) are homotopic as maps of pairs if there is a homotopy \(h\colon X\times[0,1]\to Y\) from \(f\) to \(g\) with \(h(A\times[0,1])\subseteq B\text{.}\)
Proof.
The prism operator built from \(h\) sends \(C_n(A)\) into \(C_{n+1}(B)\) because \(h(A\times[0,1])\subseteq B\text{.}\) Hence it descends to a chain homotopy on the relative chain complexes \(C_\bullet(X,A)\to C_\bullet(Y,B)\text{,}\) and Lemma 2.11.23 applies as before.
Calling a map of pairs \(f\colon(X,A)\to(Y,B)\) a homotopy equivalence of pairs if it admits a homotopy inverse of pairs, we obtain \(H_n(X,A)\cong H_n(Y,B)\) whenever \((X,A)\) and \((Y,B)\) are homotopy equivalent pairs. We will use this freely on Friday.

Subsection Wednesday

The remaining major hurdle on the way to Mayer–Vietoris is to compare the homology computed from all singular simplices to the homology computed from singular simplices that are "small" with respect to a chosen open cover. The bridge is barycentric subdivision, a chain map \(S\colon C_n(X)\to C_n(X)\) together with a chain homotopy from \(S\) to the identity. Iterating \(S\) shrinks any simplex eventually inside any prescribed open cover.

Subsubsection Barycenters and the cone construction

Definition 2.12.7. Barycenter.
The barycenter of an affine simplex \([w_0,\ldots,w_n]\) in a convex set is the point
\begin{equation*} b[w_0,\ldots,w_n] := \frac{1}{n+1}\sum_{i=0}^n w_i. \end{equation*}
For the standard simplex \(\Delta^n=[v_0,\ldots,v_n]\) we write \(b_n:=b[v_0,\ldots,v_n]\text{.}\)
Let \(Y\subseteq\mathbb{R}^N\) be a convex set, and let \(LC_n(Y)\subseteq C_n(Y)\) denote the subgroup generated by \(affine\) singular simplices, i.e., affine-linear maps \(\Delta^n\to Y\text{.}\) We write an affine simplex by its vertices: \([w_0,\ldots,w_n]\text{.}\) The boundary operator restricts to \(LC_\bullet(Y)\) by \(\partial[w_0,\ldots,w_n]=\sum_i(-1)^i[w_0,\ldots,\widehat{w_i},\ldots,w_n]\text{.}\)
Definition 2.12.8. Cone operator.
For a point \(b\in Y\text{,}\) the cone operator \(b\colon LC_n(Y)\to LC_{n+1}(Y)\) is defined on generators by
\begin{equation*} b\cdot[w_0,\ldots,w_n] := [b,w_0,\ldots,w_n]. \end{equation*}
Proof.
Both formulas are immediate from the definition: omitting the vertex \(b\) from \([b,w_0,\ldots,w_n]\) gives \(\alpha\text{,}\) and omitting any other vertex \(w_i\) gives \(b\cdot\) (the corresponding face of \(\alpha\)).
The cone relation expresses the geometric fact that a cone \(b\cdot\alpha\) is a nullhomotopy of \(\alpha\text{:}\) its boundary is \(\alpha\) minus a chain involving the apex \(b\text{.}\) We will use this repeatedly to construct chain homotopies.

Subsubsection Barycentric subdivision

Definition 2.12.10. Subdivision of affine simplices.
Define \(S\colon LC_n(Y)\to LC_n(Y)\) recursively on generators. For \(n=0\text{,}\) set \(S[w_0]:=[w_0]\text{.}\) For \(n\ge 1\text{,}\) let \(\beta:=[w_0,\ldots,w_n]\) with barycenter \(b_\beta\text{,}\) and define
\begin{equation*} S(\beta) := b_\beta\cdot S(\partial\beta). \end{equation*}
That is, subdivide the boundary, then cone from the barycenter.
Unrolling the recursion shows that \(S(\beta)\) is a signed sum of all \((n+1)!\) simplices \([b_{F_0},b_{F_1},\ldots,b_{F_n}]\text{,}\) where \(F_0\subsetneq F_1\subsetneq\cdots\subsetneq F_n=\beta\) is a chain of faces, and \(b_F\) denotes the barycenter of \(F\text{.}\) Geometrically, \(S(\beta)\) is the familiar barycentric subdivision of the simplex \(\beta\text{.}\)
Proof.
By induction on \(n\text{.}\) The base case \(n=0\) is immediate. For \(n\ge 1\text{,}\) using Lemma 2.12.9 and the inductive hypothesis,
\begin{equation*} \partial S(\beta) = \partial(b_\beta\cdot S(\partial\beta)) = S(\partial\beta) - b_\beta\cdot\partial S(\partial\beta) = S(\partial\beta) - b_\beta\cdot S(\partial^2\beta) = S(\partial\beta), \end{equation*}
since \(\partial^2=0\text{.}\)
We now extend \(S\) to general singular chains. Given a singular simplex \(\sigma\colon\Delta^n\to X\text{,}\) define
\begin{equation*} S(\sigma) := \sigma_\sharp\bigl(S(\iota_n)\bigr), \end{equation*}
where \(\iota_n\colon\Delta^n\to\Delta^n\) is the identity (regarded as an affine singular simplex in the convex set \(\Delta^n\)) and \(\sigma_\sharp\colon C_\bullet(\Delta^n)\to C_\bullet(X)\) is the chain map induced by \(\sigma\text{.}\) Naturality is built in: \(S\) is now a natural transformation \(C_\bullet\Rightarrow C_\bullet\) on the category of topological spaces. The chain map property \(\partial S=S\partial\) on general singular chains follows from the affine case applied to \(\iota_n\text{.}\)
Proof.
As for the prism operator, the construction proceeds in two stages. We first build \(T\) on affine chains \(LC_\bullet(Y)\) in a convex set \(Y\subseteq\mathbb{R}^N\) by a recursion using the cone operator; we then transport the result to a general space \(X\) by naturality.
Where the formula comes from. The recipe below can look like it falls from the sky, so it helps to see that it is essentially forced. The only chain-level tool we have on affine chains is the cone operator, which satisfies \(\partial(b\cdot\alpha)=\alpha-b\cdot\partial\alpha\) — i.e., \(b\cdot(-)\) is already a chain homotopy from \(\mathrm{id}\) to \(0\text{.}\) So we try the ansatz \(T(\beta)=b_\beta\cdot\gamma(\beta)\) for some chain \(\gamma(\beta)\) to be determined (using the same canonical vertex \(b_\beta\) as \(S\)). The cone relation then gives \(\partial T(\beta)=\gamma(\beta)-b_\beta\cdot\partial\gamma(\beta)\text{,}\) and the desired identity \(\partial T+T\partial=S-\mathrm{id}\) rearranges to
\begin{equation*} \gamma(\beta) \;=\; S(\beta) - \beta - T(\partial\beta) + b_\beta\cdot\partial\gamma(\beta). \end{equation*}
If we drop the last correction term and simply set \(\gamma(\beta):=S(\beta)-\beta-T(\partial\beta)\text{,}\) a small miracle takes place: \(\partial\gamma(\beta)=0\text{,}\) so \(b_\beta\cdot\partial\gamma(\beta)=0\) and the recursion is self-consistent. The vanishing of \(\partial\gamma(\beta)\) combines three ingredients we already have in hand — \(\partial S = S\partial\text{,}\) \(\partial^2 = 0\text{,}\) and the inductive hypothesis for \(T\) on \(\partial\beta\) — and we verify it explicitly below.
Recursive definition on affine chains. On the generators \([w_0]\) of \(LC_0(Y)\text{,}\) set
\begin{equation*} T\bigl([w_0]\bigr) := 0. \end{equation*}
For \(n\ge 1\text{,}\) assuming \(T\) has been defined on \(LC_{n-1}(Y)\text{,}\) set
\begin{equation*} T(\beta) \;:=\; b_\beta\cdot\bigl(S(\beta)-\beta-T(\partial\beta)\bigr) \qquad\text{for each affine } n\text{-simplex } \beta, \end{equation*}
and extend \(\mathbb{Z}\)-linearly. Here \(b_\beta\) is the barycenter of \(\beta\) and \(b_\beta\cdot(-)\) denotes the cone operator (Definition 2.12.8). The recursion is well-posed because \(T(\partial\beta)\text{,}\) involving only \((n-1)\)-chains, has already been defined.
Verification of the chain-homotopy identity on \(LC_\bullet(Y)\text{.}\) We show \(\partial T(\beta)+T(\partial\beta)=S(\beta)-\beta\) for every affine simplex \(\beta\text{,}\) by induction on \(n=\dim\beta\text{.}\)
Base case \(n=0\text{.}\) For \(\beta=[w_0]\text{,}\) both \(T(\beta)=0\) and \(T(\partial\beta)=0\) (the latter because \(\partial[w_0]=0\)), so the left-hand side is \(0\text{.}\) The right-hand side is also \(0\) since \(S([w_0])=[w_0]\text{.}\)
Inductive step. Fix \(n\ge 1\) and an affine \(n\)-simplex \(\beta\text{,}\) and abbreviate
\begin{equation*} \xi \;:=\; S(\beta)-\beta-T(\partial\beta) \;\in\; LC_n(Y), \qquad\text{so that}\qquad T(\beta)=b_\beta\cdot\xi. \end{equation*}
Applying the cone relation Lemma 2.12.9 to \(b_\beta\cdot\xi\text{,}\)
\begin{equation*} \partial T(\beta) \;=\; \partial(b_\beta\cdot\xi) \;=\; \xi \,-\, b_\beta\cdot\partial\xi. \tag{\(\ast\)} \end{equation*}
We now evaluate \(\partial\xi\text{.}\) By linearity of \(\partial\text{,}\)
\begin{equation*} \partial\xi \;=\; \partial S(\beta)\,-\,\partial\beta\,-\,\partial T(\partial\beta). \end{equation*}
Since \(\partial S=S\partial\) (Lemma 2.12.11), the first term equals \(S(\partial\beta)\text{.}\) For the third term we apply the inductive hypothesis to the \((n-1)\)-chain \(\partial\beta\text{:}\)
\begin{equation*} \partial T(\partial\beta)+T(\partial^2\beta) \;=\; S(\partial\beta)-\partial\beta. \end{equation*}
Because \(\partial^2=0\text{,}\) the \(T(\partial^2\beta)\) term vanishes, and we obtain \(\partial T(\partial\beta)=S(\partial\beta)-\partial\beta\text{.}\) Substituting these two identifications into the expansion of \(\partial\xi\) gives
\begin{equation*} \partial\xi \;=\; S(\partial\beta)\,-\,\partial\beta\,-\,\bigl(S(\partial\beta)-\partial\beta\bigr) \;=\; 0. \end{equation*}
Plugging back into \((\ast)\text{,}\)
\begin{equation*} \partial T(\beta) \;=\; \xi \;=\; S(\beta)-\beta-T(\partial\beta), \end{equation*}
which rearranges to \(\partial T(\beta)+T(\partial\beta)=S(\beta)-\beta\text{,}\) completing the induction.
Extension to singular chains by naturality. Let \(\iota_n\colon\Delta^n\to\Delta^n\) denote the identity \(n\)-simplex, viewed as an affine singular simplex in the convex set \(\Delta^n\subseteq\mathbb{R}^{n+1}\text{.}\) For a general singular simplex \(\sigma\colon\Delta^n\to X\text{,}\) define
\begin{equation*} T(\sigma) \;:=\; \sigma_\sharp\bigl(T(\iota_n)\bigr) \;\in\; C_{n+1}(X), \end{equation*}
and extend linearly to \(T\colon C_n(X)\to C_{n+1}(X)\text{.}\) Every ingredient in the affine recursion (namely \(S\text{,}\) \(\partial\text{,}\) and the cone operator) is natural in the space, so for every continuous map \(\sigma\colon\Delta^n\to X\) the induced chain map \(\sigma_\sharp\) commutes with \(T\text{,}\) \(S\text{,}\) and \(\partial\text{.}\) Concretely,
Naturality square showing that sigma-sharp intertwines the affine T on LC(Delta^n) with the singular T on C(X).
Applying \(\sigma_\sharp\) to the already-proven identity \(\partial T(\iota_n)+T(\partial\iota_n)=S(\iota_n)-\iota_n\) in \(LC_\bullet(\Delta^n)\) yields
\begin{equation*} \partial T(\sigma)+T(\partial\sigma) \;=\; S(\sigma)-\sigma \end{equation*}
in \(C_\bullet(X)\text{,}\) as required. Naturality is built into the definition: for any continuous \(f\colon X\to Y\text{,}\) the square \(f_\sharp\circ T=T\circ f_\sharp\) commutes, since both sides equal \((f\circ\sigma)_\sharp(T(\iota_n))\) on a generator \(\sigma\text{.}\)

Subsubsection Iterated subdivision and the small chains theorem

Let \(\mathcal{U}=\{U_\alpha\}\) be a collection of subspaces of \(X\) whose interiors cover \(X\text{.}\) We say a singular simplex \(\sigma\colon\Delta^n\to X\) is \(\mathcal{U}\)-small if \(\sigma(\Delta^n)\subseteq U_\alpha\) for some \(\alpha\text{.}\) Let
\begin{equation*} C_n^{\mathcal{U}}(X)\subseteq C_n(X) \end{equation*}
denote the subgroup generated by \(\mathcal{U}\)-small singular simplices. Since the boundary of a \(\mathcal{U}\)-small simplex is again a sum of \(\mathcal{U}\)-small simplices, \(C_\bullet^{\mathcal{U}}(X)\) is a subcomplex. Write \(H_n^{\mathcal{U}}(X)\) for its homology and \(\iota\colon C_\bullet^{\mathcal{U}}(X)\hookrightarrow C_\bullet(X)\) for the inclusion.
Proof.
The proof marries two metric facts — the Lebesgue number lemma and the diameter-shrinking property of barycentric subdivision — with an iterated application of the chain homotopy \(T\) from Lemma 2.12.12.
Step 1: Lebesgue numbers. Given an open cover \(\{V_\beta\}\) of a compact metric space \((K,\rho)\text{,}\) a Lebesgue number for the cover is a real \(\delta>0\) with the property that every subset of \(K\) of diameter less than \(\delta\) is contained in some \(V_\beta\text{.}\) A Lebesgue number always exists: pass to a finite subcover \(V_1,\ldots,V_k\text{,}\) and define
\begin{equation*} f\colon K\to\mathbb{R}, \qquad f(x) := \max_{1\le i\le k}\rho(x,\, K\setminus V_i). \end{equation*}
Each distance-to-complement \(x\mapsto\rho(x,K\setminus V_i)\) is continuous, and vanishes exactly on \(K\setminus V_i\text{.}\) Since every \(x\) lies in some \(V_i\text{,}\) at least one of these is positive at \(x\text{,}\) so \(f(x)>0\) on all of \(K\text{.}\) By compactness, \(\delta:=\min_{x\in K}f(x)\) is strictly positive. If \(A\subseteq K\) has diameter \(<\delta\) and contains a point \(x\text{,}\) choose \(i\) attaining the max in \(f(x)\text{:}\) then \(A\subseteq B_\rho(x,\delta)\subseteq V_i\text{.}\)
Step 2: subdivision shrinks simplices. If \(\Delta\subseteq\mathbb{R}^N\) is an affine \(n\)-simplex with diameter \(d\text{,}\) every simplex appearing in \(S(\Delta)\) has diameter at most \(\tfrac{n}{n+1}d\text{.}\) To see this, let \(F\subseteq\Delta\) be a face with vertices \(v_0,\ldots,v_k\) (\(k\le n\)) and barycenter \(b_F=\tfrac{1}{k+1}\sum_{l}v_l\text{.}\) For any vertex \(v_l\) of \(F\text{,}\)
\begin{equation*} v_l - b_F \;=\; \tfrac{1}{k+1}\sum_{m\neq l}(v_l - v_m), \qquad\text{so}\qquad \|v_l - b_F\|\;\le\;\tfrac{k}{k+1}d\;\le\;\tfrac{n}{n+1}d. \end{equation*}
The closed ball of radius \(\tfrac{n}{n+1}d\) around \(b_F\) therefore contains every vertex of \(F\text{,}\) and since balls are convex, it contains all of \(F\text{.}\) Now a simplex of \(S(\Delta)\) has vertices \(b_{F_0},\ldots,b_{F_n}\) with \(F_0\subsetneq\cdots\subsetneq F_n=\Delta\text{.}\) For \(i<j\text{,}\) \(b_{F_i}\in F_i\subseteq F_j\text{,}\) so \(\|b_{F_i}-b_{F_j}\|\le\tfrac{n}{n+1}d\) by the bound applied to \(F_j\text{.}\) The diameter of a simplex is the largest distance between its vertices, so the bound propagates.
Iterating, every simplex of \(S^m(\Delta)\) has diameter at most \(\bigl(\tfrac{n}{n+1}\bigr)^m d\text{,}\) which tends to \(0\) as \(m\to\infty\text{.}\)
Step 3: iteration makes chains \(\mathcal{U}\)-small. Fix a singular simplex \(\sigma\colon\Delta^n\to X\text{.}\) The sets \(\sigma^{-1}(\mathrm{int}\,U_\alpha)\) form an open cover of the compact metric space \(\Delta^n\text{,}\) so by Step 1 it has a Lebesgue number \(\delta_\sigma>0\text{.}\) By Step 2, there is a least \(m(\sigma)\ge 0\) such that every simplex of \(S^{m(\sigma)}(\iota_n)\) has diameter less than \(\delta_\sigma\) (where \(\iota_n\colon\Delta^n\to\Delta^n\) is the identity). Each such sub-simplex has image under \(\sigma\) contained in some \(U_\alpha\text{,}\) so
\begin{equation*} S^{m(\sigma)}(\sigma) \;=\; \sigma_\sharp\bigl(S^{m(\sigma)}(\iota_n)\bigr) \;\in\; C_n^{\mathcal{U}}(X). \end{equation*}
Extend linearly: \(m(\sigma)\) is defined on generators. Note that because the subcomplex \(C_\bullet^{\mathcal{U}}(X)\) is closed under \(\partial\text{,}\) once \(S^m(\sigma)\) is \(\mathcal{U}\)-small so are all its faces: concretely, \(m(\tau)\le m(\sigma)\) whenever \(\tau\) is a face of \(\sigma\text{.}\)
Step 4: a telescoping chain homotopy. For each fixed \(m\ge 0\text{,}\) define \(T_m\colon C_n(X)\to C_{n+1}(X)\) by
\begin{equation*} T_m \;:=\; \sum_{i=0}^{m-1} T\circ S^i. \end{equation*}
Using \(\partial T = (S-\mathrm{id}) - T\partial\) on each summand, together with \(\partial S^i = S^i\partial\text{,}\)
\begin{equation*} \partial T_m \;=\; \sum_{i=0}^{m-1}\bigl[(S-\mathrm{id})S^i - T\partial S^i\bigr] \;=\; (S^m - \mathrm{id}) - T_m\,\partial, \end{equation*}
i.e. \(\partial T_m + T_m\partial = S^m - \mathrm{id}\text{.}\) (The \(S^{i+1}-S^i\) terms telescope.)
Step 5: from fixed \(m\) to variable \(m(\sigma)\text{.}\) Define \(D\colon C_n(X)\to C_{n+1}(X)\) on generators by
\begin{equation*} D(\sigma) \;:=\; T_{m(\sigma)}(\sigma), \end{equation*}
and the candidate retraction \(\rho\colon C_n(X)\to C_n^{\mathcal{U}}(X)\) by
\begin{equation*} \rho(\sigma) \;:=\; \sigma + \partial D(\sigma) + D(\partial\sigma). \end{equation*}
Applying Step 4 on the generator \(\sigma\) (with \(m=m(\sigma)\)) gives \(\partial D(\sigma) = S^{m(\sigma)}(\sigma) - \sigma - T_{m(\sigma)}(\partial\sigma)\text{,}\) so
\begin{equation*} \rho(\sigma) \;=\; S^{m(\sigma)}(\sigma) \,+\, \bigl(D(\partial\sigma) - T_{m(\sigma)}(\partial\sigma)\bigr). \end{equation*}
The first summand is \(\mathcal{U}\)-small by Step 3. For the correction term, on a face \(\tau\) of \(\partial\sigma\) (so that \(m(\tau)\le m(\sigma)\)),
\begin{equation*} D(\tau) - T_{m(\sigma)}(\tau) \;=\; T_{m(\tau)}(\tau) - T_{m(\sigma)}(\tau) \;=\; -\sum_{i=m(\tau)}^{m(\sigma)-1} T\bigl(S^i(\tau)\bigr). \end{equation*}
For \(i\ge m(\tau)\text{,}\) the chain \(S^i(\tau)\) is \(\mathcal{U}\)-small; and because \(T\) applied to any singular simplex \(\eta\) is supported in the image of \(\eta\) (since \(T(\eta)=\eta_\sharp T(\iota_{n-1})\)), \(T(S^i(\tau))\) is also \(\mathcal{U}\)-small. So the correction lies in \(C_\bullet^{\mathcal{U}}(X)\text{,}\) and \(\rho(\sigma)\in C_n^{\mathcal{U}}(X)\) as required.
Step 6: \(\rho\) is a chain-homotopy inverse to \(\iota\text{.}\) A direct computation using \(\partial^2=0\) shows that \(\rho\) is a chain map:
\begin{equation*} \partial\rho(\sigma) \;=\; \partial\sigma + \partial^2 D(\sigma) + \partial D(\partial\sigma) \;=\; \partial\sigma + \partial D(\partial\sigma) \;=\; \rho(\partial\sigma), \end{equation*}
using \(D(\partial^2\sigma)=0\) in the last step. If \(\sigma\) is already \(\mathcal{U}\)-small, then \(m(\sigma)=0\text{,}\) \(D(\sigma)=0\text{,}\) and each face is also \(\mathcal{U}\)-small with \(m(\tau)=0\text{,}\) so \(D(\partial\sigma)=0\text{;}\) hence \(\rho\iota=\mathrm{id}\text{.}\) Finally, the defining formula rearranges to
\begin{equation*} \iota\rho - \mathrm{id} \;=\; \partial D + D\partial, \end{equation*}
exhibiting \(D\) as a chain homotopy from \(\mathrm{id}\) to \(\iota\rho\text{.}\) Therefore \(\iota\) is a chain homotopy equivalence, and the induced map on homology is an isomorphism.
The takeaway is precisely what we want: for any open cover \(\mathcal{U}\) of \(X\text{,}\) every homology class is represented by a chain whose simplices are entirely contained in members of \(\mathcal{U}\text{,}\) and two such chains are homologous via small chains whenever they are homologous at all.

Subsection Friday

No new material. Class spent the period catching up on Monday’s and Wednesday’s developments. Excision, Mayer–Vietoris, and the first major computations of singular homology are deferred to Monday of week 13.