Independent scholarship · Open accessThe monthly digest

Indexed text attachment

algebraic-and-differential-topology-in-higher-categories.tex

Source for Algebraic and Differential Topology in Higher Categories

View paper · Download original file

Lines 1321–1420 of 10051. Source text is displayed literally.

1321functorially. Homeomorphic polyhedra have isomorphic homology groups.1322\end{theorem}1323 1324\[\begin{tikzcd}[column sep=large]1325\SCx\arrow[r,"|\cdot|"]\arrow[dr,"H_*"'] & \cat{Pol}\arrow[d,dashed,"H_*"]\arrow[r] & \operatorname{Ho}(\cat{Pol})\arrow[dl,dashed]\\1326 & \cat{grAb} &1327\end{tikzcd}\]1328 1329\noindent The theorem is the left dashed arrow: homology of complexes factors through the category $\cat{Pol}$ of1330polyhedra and continuous maps. The right dashed arrow, through the homotopy category, is \Cref{ch:homotopy}. The1331modern route to both introduces the singular complex $\Sing X$, whose $n$-simplices are all continuous maps1332$|\Delta^n|\to X$; $\Sing$ is right adjoint to realization, $H_*(\Sing X)$ is defined for every space with no1333choices, and the content of \Cref{thm:invariance} becomes the statement that the unit $K\to\Sing|K|$ induces an1334isomorphism on homology. The three constructions of this chapter are exactly what that proof uses: approximation1335to make singular simplices simplicial, subdivision to make them small, and the cone to compare.1336 1337\section*{Notes}1338The source's order is: approximation, cone, subdivision, Sperner's lemma, invariance; we have moved Sperner's1339lemma to the next chapter. For acyclic models see \cite{EiMa53}; for $\operatorname{Ex}^\infty$, \cite{Kan57,GoJa99}.1340The estimate of the number of subdivisions is implicit in every proof of \Cref{thm:approx} and is used in1341\cite{ADTML} to bound the size of a piecewise linear network realizing a homotopy class.1342 1343\section*{Exercises}1344\begin{exercise}\label{exer:mesh}1345Show that the diameter of a simplex of the barycentric subdivision of an $r$-simplex of diameter $d$ is at most1346$\frac r{r+1}d$. How many subdivisions of the triangle of \chk{I4} guarantee mesh below $0.01$ by this bound, and1347how many triangles is that?1348\end{exercise}1349\begin{exercise}\label{exer:oct}1350Explain the degree $2$ found for the octagon: list the images of the eight vertices under the rule for $d=3$ and1351count the signed number of times the edge from the last third to the first is covered.1352\end{exercise}1353\begin{exercise}\label{exer:coneop}1354Verify $\pd D+D\pd=\id$ on a $1$-simplex $[v_0,v_1]$ of the base of a cone.1355\end{exercise}1356\begin{exercise}\label{exer:sdf}1357Let $K$ have $f$-vector $(\alpha_0,\alpha_1,\alpha_2)$. Find the $f$-vector of $\sdv K$ and check that the Euler1358characteristic is unchanged. Apply it to the projective plane.1359\end{exercise}1360%% ---- end ch/03-invariance.tex ----1361\part{Maps}1362%% ---- begin ch/04-sperner.tex ----1363\chapter{Sperner, Brouwer, Dimension}\label{ch:sperner}1364 1365In the middle of its invariance proof the source stops for a digression: a combinatorial lemma about labellings1366of a subdivided simplex, and two consequences, the fixed point theorem and the invariance of dimension1367\src{I,\,\S3, \S10}. The lemma is a degree computation, and the consequences are what one gets from knowing that a1368functor does not vanish.1369 1370\section{The lemma}1371 1372Let $K$ be a subdivision of an $n$-simplex $\Delta$ with vertices $e_0,\dots,e_n$. A \term{Sperner labelling}1373assigns to each vertex of $K$ one of the labels $0,\dots,n$ so that a vertex lying in the face spanned by1374$e_{i_0},\dots,e_{i_k}$ gets one of the labels $i_0,\dots,i_k$. A cell of $K$ is \term{complete} if its vertices1375carry all $n+1$ labels.1376 1377\begin{theorem}[Sperner]\label{thm:sperner}1378\Scl[\src{I,\,\S10}] The number of complete cells is odd. Counted with the sign $+1$ if the labelling preserves the1379orientation of the cell and $-1$ if it reverses it, the number of complete cells is exactly $1$.1380\end{theorem}1381\begin{proof}1382A labelling is a simplicial map $\lambda\colon K\to\Delta$, and the condition says that it maps each face of1383$\Delta$ to itself. On chains, $\lambda$ sends the sum $[K]$ of the oriented cells to $c\,[\Delta]$, where $c$ is the1384signed count. Since $\lambda$ commutes with $\pd$, the restriction of $\lambda$ to the boundary sends $\pd[K]$ to1385$c\,\pd[\Delta]$, so $c$ is also the signed count on each facet, which is a Sperner labelling of dimension $n-1$.1386In dimension $0$ the count is $1$.1387\end{proof}1388 1389\begin{center}1390\begin{tikzpicture}1391\fill[black!28] (3.12,4.053)--(3.51,4.728)--(2.73,4.728)--cycle;1392\fill[black!28] (2.73,4.728)--(3.51,4.728)--(3.12,5.404)--cycle;1393\fill[black!28] (3.12,4.053)--(3.9,4.053)--(3.51,4.728)--cycle;1394\fill[black!28] (3.12,1.351)--(3.51,2.026)--(2.73,2.026)--cycle;1395\fill[black!28] (2.73,2.026)--(3.51,2.026)--(3.12,2.702)--cycle;1396\fill[black!28] (3.51,0.675)--(3.9,1.351)--(3.12,1.351)--cycle;1397\fill[black!28] (3.12,0)--(3.9,0)--(3.51,0.675)--cycle;1398\fill[black!28] (5.46,1.351)--(5.85,2.026)--(5.07,2.026)--cycle;1399\fill[black!28] (5.46,1.351)--(6.24,1.351)--(5.85,2.026)--cycle;1400\draw[ink2,thin] (0,0)--(0.78,0)--(0.39,0.675)--cycle;1401\draw[ink2,thin] (0.78,0)--(1.17,0.675)--(0.39,0.675)--cycle;1402\draw[ink2,thin] (0.39,0.675)--(1.17,0.675)--(0.78,1.351)--cycle;1403\draw[ink2,thin] (1.17,0.675)--(1.56,1.351)--(0.78,1.351)--cycle;1404\draw[ink2,thin] (0.78,1.351)--(1.56,1.351)--(1.17,2.026)--cycle;1405\draw[ink2,thin] (1.56,1.351)--(1.95,2.026)--(1.17,2.026)--cycle;1406\draw[ink2,thin] (1.17,2.026)--(1.95,2.026)--(1.56,2.702)--cycle;1407\draw[ink2,thin] (1.95,2.026)--(2.34,2.702)--(1.56,2.702)--cycle;1408\draw[ink2,thin] (1.56,2.702)--(2.34,2.702)--(1.95,3.377)--cycle;1409\draw[ink2,thin] (2.34,2.702)--(2.73,3.377)--(1.95,3.377)--cycle;1410\draw[ink2,thin] (1.95,3.377)--(2.73,3.377)--(2.34,4.053)--cycle;1411\draw[ink2,thin] (2.73,3.377)--(3.12,4.053)--(2.34,4.053)--cycle;1412\draw[ink2,thin] (2.34,4.053)--(3.12,4.053)--(2.73,4.728)--cycle;1413\draw[ink2,thin] (3.12,4.053)--(3.51,4.728)--(2.73,4.728)--cycle;1414\draw[ink2,thin] (2.73,4.728)--(3.51,4.728)--(3.12,5.404)--cycle;1415\draw[ink2,thin] (3.51,4.728)--(3.9,5.404)--(3.12,5.404)--cycle;1416\draw[ink2,thin] (3.12,5.404)--(3.9,5.404)--(3.51,6.079)--cycle;1417\draw[ink2,thin] (0.78,0)--(1.56,0)--(1.17,0.675)--cycle;1418\draw[ink2,thin] (1.56,0)--(1.95,0.675)--(1.17,0.675)--cycle;1419\draw[ink2,thin] (1.17,0.675)--(1.95,0.675)--(1.56,1.351)--cycle;1420\draw[ink2,thin] (1.95,0.675)--(2.34,1.351)--(1.56,1.351)--cycle;