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 1701–1800 of 10051. Source text is displayed literally.
1701\fill[white] (5.07,2.026) circle (2pt); \draw[bwd,thick] (5.07,2.026) circle (2pt);1702\fill[white] (5.46,2.702) circle (2pt); \draw[bwd,thick] (5.46,2.702) circle (2pt);1703\fill[white] (4.68,0) circle (2pt); \draw[bwd,thick] (4.68,0) circle (2pt);1704\fill[white] (5.07,0.675) circle (2pt); \draw[bwd,thick] (5.07,0.675) circle (2pt);1705\fill[fwd] (5.46,1.351) circle (2pt);1706\fill[accent] (5.785,1.961) rectangle (5.915,2.091);1707\fill[fwd] (5.46,0) circle (2pt);1708\fill[fwd] (5.85,0.675) circle (2pt);1709\fill[white] (6.24,1.351) circle (2pt); \draw[bwd,thick] (6.24,1.351) circle (2pt);1710\fill[white] (6.24,0) circle (2pt); \draw[bwd,thick] (6.24,0) circle (2pt);1711\fill[white] (6.63,0.675) circle (2pt); \draw[bwd,thick] (6.63,0.675) circle (2pt);1712\fill[white] (7.02,0) circle (2pt); \draw[bwd,thick] (7.02,0) circle (2pt);1713\end{tikzpicture}1714\figcap{The labelling of \Cref{fig:sperner} with its walks. A walk passes from cell to cell through edges labelled $01$. The 3 walks that enter through the bottom side (solid) end in 3 complete cells; the other 6 complete cells are joined in pairs by walks that never reach the boundary (dashed). Hence the parity.}\label{fig:doors}1715\end{center}1716 1717\section{No retraction, and fixed points}1718 1719\begin{theorem}\label{thm:noretract}1720\Scl[\src{I,\,\S10}] \emph{(a)} There is no continuous retraction of a simplex onto its boundary. \emph{(b)}1721(Brouwer) Every continuous map of a simplex to itself has a fixed point.1722\end{theorem}1723 1724\[\begin{tikzcd}[column sep=large]1725\pd\Delta\arrow[r,hook]\arrow[rr,bend right=25,"\id"'] & \Delta\arrow[r,"r"] & \pd\Delta1726&[2em] \Z\arrow[r]\arrow[rr,bend right=25,"\id"'] & 0\arrow[r] & \Z1727\end{tikzcd}\]1728 1729\noindent Apply $\tilde H_{n-1}$ to the left diagram to get the right one, which cannot commute. This is the1730whole use of a functor: a retraction would be a factorization of an identity through zero. Sperner's lemma gives1731the same conclusion without homology, and effectively: label a vertex $x$ of a fine subdivision by an index $i$1732with $x_i>0$ and $f(x)_i\le x_i$ in barycentric coordinates; a complete cell is one near which no coordinate can1733increase, and so contains an approximately fixed point. For one map of the triangle, the point at the centre of a1734complete cell of the grid of side $n$ is moved by $0.059$, $0.014$ and $0.0026$ for $n=8,32,128$. \chk{S4}1735 1736\begin{center}1737\begin{tikzpicture}1738\draw[thin,fill=bwd!18] (0.433,0.25)--(0,0.5)--(-0.433,0.25)--(-0.433,-0.25)--(0,-0.5)--(0.433,-0.25)--cycle;1739\draw[thin,fill=bwd!18] (1.299,0.25)--(0.866,0.5)--(0.433,0.25)--(0.433,-0.25)--(0.866,-0.5)--(1.299,-0.25)--cycle;1740\draw[thin,fill=bwd!18] (2.165,0.25)--(1.732,0.5)--(1.299,0.25)--(1.299,-0.25)--(1.732,-0.5)--(2.165,-0.25)--cycle;1741\draw[thin,fill=bwd!18] (3.031,0.25)--(2.598,0.5)--(2.165,0.25)--(2.165,-0.25)--(2.598,-0.5)--(3.031,-0.25)--cycle;1742\draw[thin,fill=bwd!18] (3.897,0.25)--(3.464,0.5)--(3.031,0.25)--(3.031,-0.25)--(3.464,-0.5)--(3.897,-0.25)--cycle;1743\draw[thin,fill=bwd!18] (4.763,0.25)--(4.33,0.5)--(3.897,0.25)--(3.897,-0.25)--(4.33,-0.5)--(4.763,-0.25)--cycle;1744\draw[thin,fill=fwd!45] (5.629,0.25)--(5.196,0.5)--(4.763,0.25)--(4.763,-0.25)--(5.196,-0.5)--(5.629,-0.25)--cycle;1745\draw[thin,fill=fwd!45] (0.866,-0.5)--(0.433,-0.25)--(0,-0.5)--(0,-1)--(0.433,-1.25)--(0.866,-1)--cycle;1746\draw[thin,fill=bwd!18] (1.732,-0.5)--(1.299,-0.25)--(0.866,-0.5)--(0.866,-1)--(1.299,-1.25)--(1.732,-1)--cycle;1747\draw[thin,fill=bwd!18] (2.598,-0.5)--(2.165,-0.25)--(1.732,-0.5)--(1.732,-1)--(2.165,-1.25)--(2.598,-1)--cycle;1748\draw[thin,fill=bwd!18] (3.464,-0.5)--(3.031,-0.25)--(2.598,-0.5)--(2.598,-1)--(3.031,-1.25)--(3.464,-1)--cycle;1749\draw[thin,fill=fwd!45] (4.33,-0.5)--(3.897,-0.25)--(3.464,-0.5)--(3.464,-1)--(3.897,-1.25)--(4.33,-1)--cycle;1750\draw[thin,fill=fwd!45] (5.196,-0.5)--(4.763,-0.25)--(4.33,-0.5)--(4.33,-1)--(4.763,-1.25)--(5.196,-1)--cycle;1751\draw[thin,fill=fwd!45] (6.062,-0.5)--(5.629,-0.25)--(5.196,-0.5)--(5.196,-1)--(5.629,-1.25)--(6.062,-1)--cycle;1752\draw[thin,fill=bwd!18] (1.299,-1.25)--(0.866,-1)--(0.433,-1.25)--(0.433,-1.75)--(0.866,-2)--(1.299,-1.75)--cycle;1753\draw[thin,fill=bwd!18] (2.165,-1.25)--(1.732,-1)--(1.299,-1.25)--(1.299,-1.75)--(1.732,-2)--(2.165,-1.75)--cycle;1754\draw[thin,fill=fwd!45] (3.031,-1.25)--(2.598,-1)--(2.165,-1.25)--(2.165,-1.75)--(2.598,-2)--(3.031,-1.75)--cycle;1755\draw[thin,fill=fwd!45] (3.897,-1.25)--(3.464,-1)--(3.031,-1.25)--(3.031,-1.75)--(3.464,-2)--(3.897,-1.75)--cycle;1756\draw[thin,fill=fwd!45] (4.763,-1.25)--(4.33,-1)--(3.897,-1.25)--(3.897,-1.75)--(4.33,-2)--(4.763,-1.75)--cycle;1757\draw[thin,fill=bwd!18] (5.629,-1.25)--(5.196,-1)--(4.763,-1.25)--(4.763,-1.75)--(5.196,-2)--(5.629,-1.75)--cycle;1758\draw[thin,fill=bwd!18] (6.495,-1.25)--(6.062,-1)--(5.629,-1.25)--(5.629,-1.75)--(6.062,-2)--(6.495,-1.75)--cycle;1759\draw[thin,fill=fwd!45] (1.732,-2)--(1.299,-1.75)--(0.866,-2)--(0.866,-2.5)--(1.299,-2.75)--(1.732,-2.5)--cycle;1760\draw[thin,fill=bwd!18] (2.598,-2)--(2.165,-1.75)--(1.732,-2)--(1.732,-2.5)--(2.165,-2.75)--(2.598,-2.5)--cycle;1761\draw[thin,fill=fwd!45] (3.464,-2)--(3.031,-1.75)--(2.598,-2)--(2.598,-2.5)--(3.031,-2.75)--(3.464,-2.5)--cycle;1762\draw[thin,fill=bwd!18] (4.33,-2)--(3.897,-1.75)--(3.464,-2)--(3.464,-2.5)--(3.897,-2.75)--(4.33,-2.5)--cycle;1763\draw[thin,fill=fwd!45] (5.196,-2)--(4.763,-1.75)--(4.33,-2)--(4.33,-2.5)--(4.763,-2.75)--(5.196,-2.5)--cycle;1764\draw[thin,fill=fwd!45] (6.062,-2)--(5.629,-1.75)--(5.196,-2)--(5.196,-2.5)--(5.629,-2.75)--(6.062,-2.5)--cycle;1765\draw[thin,fill=bwd!18] (6.928,-2)--(6.495,-1.75)--(6.062,-2)--(6.062,-2.5)--(6.495,-2.75)--(6.928,-2.5)--cycle;1766\draw[thin,fill=fwd!45] (2.165,-2.75)--(1.732,-2.5)--(1.299,-2.75)--(1.299,-3.25)--(1.732,-3.5)--(2.165,-3.25)--cycle;1767\draw[thin,fill=fwd!45] (3.031,-2.75)--(2.598,-2.5)--(2.165,-2.75)--(2.165,-3.25)--(2.598,-3.5)--(3.031,-3.25)--cycle;1768\draw[thin,fill=bwd!18] (3.897,-2.75)--(3.464,-2.5)--(3.031,-2.75)--(3.031,-3.25)--(3.464,-3.5)--(3.897,-3.25)--cycle;1769\draw[thin,fill=bwd!18] (4.763,-2.75)--(4.33,-2.5)--(3.897,-2.75)--(3.897,-3.25)--(4.33,-3.5)--(4.763,-3.25)--cycle;1770\draw[thin,fill=fwd!45] (5.629,-2.75)--(5.196,-2.5)--(4.763,-2.75)--(4.763,-3.25)--(5.196,-3.5)--(5.629,-3.25)--cycle;1771\draw[thin,fill=bwd!18] (6.495,-2.75)--(6.062,-2.5)--(5.629,-2.75)--(5.629,-3.25)--(6.062,-3.5)--(6.495,-3.25)--cycle;1772\draw[thin,fill=bwd!18] (7.361,-2.75)--(6.928,-2.5)--(6.495,-2.75)--(6.495,-3.25)--(6.928,-3.5)--(7.361,-3.25)--cycle;1773\draw[thin,fill=bwd!18] (2.598,-3.5)--(2.165,-3.25)--(1.732,-3.5)--(1.732,-4)--(2.165,-4.25)--(2.598,-4)--cycle;1774\draw[thin,fill=fwd!45] (3.464,-3.5)--(3.031,-3.25)--(2.598,-3.5)--(2.598,-4)--(3.031,-4.25)--(3.464,-4)--cycle;1775\draw[thin,fill=bwd!18] (4.33,-3.5)--(3.897,-3.25)--(3.464,-3.5)--(3.464,-4)--(3.897,-4.25)--(4.33,-4)--cycle;1776\draw[thin,fill=bwd!18] (5.196,-3.5)--(4.763,-3.25)--(4.33,-3.5)--(4.33,-4)--(4.763,-4.25)--(5.196,-4)--cycle;1777\draw[thin,fill=bwd!18] (6.062,-3.5)--(5.629,-3.25)--(5.196,-3.5)--(5.196,-4)--(5.629,-4.25)--(6.062,-4)--cycle;1778\draw[thin,fill=bwd!18] (6.928,-3.5)--(6.495,-3.25)--(6.062,-3.5)--(6.062,-4)--(6.495,-4.25)--(6.928,-4)--cycle;1779\draw[thin,fill=fwd!45] (7.794,-3.5)--(7.361,-3.25)--(6.928,-3.5)--(6.928,-4)--(7.361,-4.25)--(7.794,-4)--cycle;1780\draw[thin,fill=fwd!45] (3.031,-4.25)--(2.598,-4)--(2.165,-4.25)--(2.165,-4.75)--(2.598,-5)--(3.031,-4.75)--cycle;1781\draw[thin,fill=fwd!45] (3.897,-4.25)--(3.464,-4)--(3.031,-4.25)--(3.031,-4.75)--(3.464,-5)--(3.897,-4.75)--cycle;1782\draw[thin,fill=fwd!45] (4.763,-4.25)--(4.33,-4)--(3.897,-4.25)--(3.897,-4.75)--(4.33,-5)--(4.763,-4.75)--cycle;1783\draw[thin,fill=fwd!45] (5.629,-4.25)--(5.196,-4)--(4.763,-4.25)--(4.763,-4.75)--(5.196,-5)--(5.629,-4.75)--cycle;1784\draw[thin,fill=fwd!45] (6.495,-4.25)--(6.062,-4)--(5.629,-4.25)--(5.629,-4.75)--(6.062,-5)--(6.495,-4.75)--cycle;1785\draw[thin,fill=bwd!18] (7.361,-4.25)--(6.928,-4)--(6.495,-4.25)--(6.495,-4.75)--(6.928,-5)--(7.361,-4.75)--cycle;1786\draw[thin,fill=fwd!45] (8.227,-4.25)--(7.794,-4)--(7.361,-4.25)--(7.361,-4.75)--(7.794,-5)--(8.227,-4.75)--cycle;1787\draw[line width=1.6pt,black] (3.464,-4.5)--(3.031,-3.75)--(2.598,-3)--(3.031,-2.25)--(3.464,-1.5)--(3.897,-0.75)--(4.763,-0.75)--(5.196,0);1788\end{tikzpicture}1789\figcap{A filled Hex board. The dark player joins the top side to the bottom, the light player the left to the right. Here the dark player has a chain, drawn; the other cannot then have one, and one of the two always does.}\label{fig:hex}1790\end{center}1791 1792\noindent The game of Hex gives a third form of the same statement. On a rhombic board of hexagons filled with1793two colours, exactly one of the two players has a chain joining their pair of opposite sides; that it cannot be1794both is the Jordan curve theorem in a simple case, and that it must be one is equivalent to Brouwer's theorem in1795the plane \cite{Gal79}. In $300$ random fillings of the $9\times9$ board there was always exactly one winner, the1796first player in $156$ of them. \chk{S5}1797 1798\section{Dimension}1799 1800The \term{order} of a finite cover is the largest number of its members with a common point, so the nerve of a