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 361–460 of 10051. Source text is displayed literally.

361An \term{abstract simplicial complex} $K$ is a finite set $V$ of \emph{vertices} with a family of non-empty362subsets, the \emph{simplices}, closed under passing to non-empty subsets and containing every singleton. A363simplex with $r+1$ vertices has dimension $r$. A \term{simplicial map} $K\to L$ is a map of vertex sets taking364simplices to simplices; it need not be injective on a simplex. This is the category $\SCx$.365\end{definition}366 367\noindent A simplex $\sigma$ has a geometric realization $|\sigma|$, the convex hull of its vertices placed in368general position, and a face $\tau\subseteq\sigma$ gives an inclusion $|\tau|\subseteq|\sigma|$. The source defines369a complex as a set of simplices in a Euclidean space that meet properly, and its polyhedron as their union370\src{I,\,\S2}. Categorically:371 372\begin{proposition}[The polyhedron is a colimit]\label{prop:colim}373\Srf[\cite{Spa66}] Regard $K$ as a poset under inclusion. Then374\[ |K|\;=\;\colim_{\sigma\in K}|\sigma| \]375in topological spaces, and $K\mapsto|K|$ is a functor $\SCx\to\Top$: a simplicial map is realized by the map that is376affine on each simplex.377\end{proposition}378 379\noindent The colimit says exactly what ``meeting properly'' says: two simplices are glued along their common380face and nowhere else. That the abstract colimit can be drawn in a Euclidean space of small dimension is the first381theorem of the source.382 383\begin{theorem}[Realization]\label{thm:realization}384\Scl[\src{I,\,\S1--2, Thms.~1--3}] A complex of dimension $r$ has a realization by straight simplices in385$\R^{2r+1}$: place the vertices in general position, so that every $2r+2$ of them are affinely independent.386\end{theorem}387\begin{proof}388Two simplices have at most $2r+2$ vertices between them. If these are affinely independent, the convex hulls of389two subsets of them meet in the convex hull of the common part.390\end{proof}391 392\noindent Points on the moment curve $t\mapsto(t,t^2,\dots,t^{n})$ are in general position in $\R^n$, by the393Vandermonde determinant; for seven points and $n=5$ all seven six-point subsets are affinely independent, so394every $2$-complex on seven vertices, the torus of \Cref{fig:torus7} included, sits in $\R^5$. \chk{C2} The number395$2r+1$ returns in \Cref{ch:position} as Whitney's embedding dimension, for the same reason: two $r$-dimensional396things in a space of dimension $2r+1$ do not meet in general.397 398\section{What is wrong with complexes: products}399 400The category $\SCx$ has products, but they are the wrong ones. A vertex of $K\times L$ is a pair of vertices, and a401set of pairs is a simplex when both projections are. For two edges this gives four vertices of which \emph{every}402subset is a simplex: a tetrahedron, where a square was wanted.403 404\begin{center}405\begin{tikzpicture}[scale=1.0]406\begin{scope}407\draw[thick] (0,0)--(1.6,0) node[midway,below]{\small$\Delta^1$};408\node at (2.1,0.8) {$\times$};409\draw[thick] (2.6,0)--(2.6,1.6) node[midway,right]{\small$\Delta^1$};410\end{scope}411\begin{scope}[xshift=4.6cm]412\fill[fwd!10] (0,0) rectangle (1.6,1.6);413\draw[thick] (0,0) rectangle (1.6,1.6);414\draw[thick,fwd] (0,0)--(1.6,1.6);415\foreach \p in {(0,0),(1.6,0),(0,1.6),(1.6,1.6)} \fill \p circle (1.7pt);416\node at (0.8,-0.45) {\small in $\sSet$: two triangles};417\end{scope}418\begin{scope}[xshift=8.6cm]419\fill[bwd!10] (0,0)--(1.7,0.25)--(1.1,1.7)--cycle;420\draw[thick] (0,0)--(1.7,0.25)--(1.1,1.7)--cycle;421\draw[thick] (0,0)--(2.3,1.0)--(1.7,0.25) (2.3,1.0)--(1.1,1.7);422\draw[thick,densely dashed] (0,0)--(2.3,1.0);423\foreach \p in {(0,0),(1.7,0.25),(1.1,1.7),(2.3,1.0)} \fill \p circle (1.7pt);424\node at (1.1,-0.45) {\small in $\SCx$: a tetrahedron};425\end{scope}426\end{tikzpicture}427\figcap{The product of two edges. The categorical product of simplicial complexes fills in everything; the product428of simplicial sets is the square, cut along the diagonal that the ordering of the vertices selects.}429\end{center}430 431\noindent The source meets the same difficulty when it needs $K\times[0,1]$ and resolves it by hand, with an432explicit subdivision of each prism \src{I,\,\S14}; see \Cref{ch:homotopy}. The systematic repair is to remember an433order on the vertices and to allow degenerate simplices.434 435\begin{definition}\label{def:sset}436Let $\Delta$ be the category of the finite ordinals $[n]=\{0<\dots<n\}$ and monotone maps. A \term{simplicial437set} is a functor $\Delta^{\op}\to\Set$; these form the category $\sSet$. An ordered complex $K$ gives the438simplicial set whose $n$-simplices are the monotone maps $[n]\to V$ with image a simplex.439\end{definition}440 441\begin{theorem}\label{thm:sset}442\Scl[\cite{Mil57,GoJa99}] \emph{(a)} Geometric realization $|\cdot|\colon\sSet\to\Top$ is the left Kan extension443of $[n]\mapsto|\Delta^n|$ along the Yoneda embedding; on ordered complexes it agrees with \Cref{prop:colim}.444\emph{(b)} It preserves finite products, in compactly generated spaces. \emph{(c)} The non-degenerate445$(p+q)$-simplices of $\Delta^p\times\Delta^q$ are the $\binom{p+q}p$ shuffles.446\end{theorem}447 448\noindent The counts are $2$, $3$, $6$, $10$ for $(p,q)=(1,1),(2,1),(2,2),(3,2)$. \chk{C4} The middle one is the449prism over a triangle cut into three tetrahedra, which is the cylindric construction of the source. A simplicial450set is a presheaf, so $\sSet$ has all limits and colimits, computed pointwise; a complex is a presheaf on its own451poset of simplices. That is the sense of the chapter's title.452 453\section{Nerves}454 455\begin{definition}\label{def:nerve}456The \term{nerve} of a finite family of sets $\{U_i\}_{i\in I}$ is the complex on $I$ whose simplices are the457subfamilies with non-empty intersection.458\end{definition}459 460\begin{center}