Indexed text attachment
differential-topology-in-higher-categories.tex
Source for Differential Topology in Higher Categories
View paper · Download original file
Lines 5661–5760 of 6119. Source text is displayed literally.
5661For \(a\le b\) there is an inclusion \(X_f(a)\hookrightarrow X_f(b)\).5662These data give a functor from the real line with its order arrows to5663topological spaces, and hence a diagram in the category of homotopy5664types. In particular, using singular chains before passing to5665homology keeps a chain-level diagram. For any coefficient field \(k\),5666the homology groups \(a\mapsto H_j(X_f(a);k)\) form a persistence module.5667Its structure map is the homology map induced by inclusion.5668 5669Given \(\varepsilon\ge0\), translation takes a diagram \(F\) to5670\(a\mapsto F(a+\varepsilon)\). A strict \(\varepsilon\)-interleaving of5671diagrams of spaces consists of natural maps5672\[5673\alpha_a:F(a)\longrightarrow E(a+\varepsilon),\qquad5674\beta_a:E(a)\longrightarrow F(a+\varepsilon).5675\]5676The two shifted composites must equal the respective structure maps5677for a step of length \(2\varepsilon\). Passing from actual spaces to5678homotopy types sends these identities to coherent comparisons. A5679strict interleaving is enough for the applications below.5680 5681\begin{proposition}[Uniform control of filtered spaces]5682\label{prop:sublevel-interleaving}5683If \(f,g:X\to\mathbb R\) are continuous and5684\(\sup_{x\in X}|f(x)-g(x)|\le\varepsilon\), their sublevel diagrams5685have a strict \(\varepsilon\)-interleaving. It is natural under5686pullback of functions along continuous maps. When \(f,g\) are5687invariant under a common group action, the maps of the5688interleaving are equivariant.5689\end{proposition}5690 5691\begin{proof}5692The inequalities \(g(x)\le f(x)+\varepsilon\) and5693\(f(x)\le g(x)+\varepsilon\) give inclusions in the indicated5694directions. All arrows are the restrictions of the identity map5695on \(X\). In particular the composition5696\[5697\begin{tikzcd}[column sep=large]5698X_f(a) \arrow[r,hook,"\alpha_a"] &5699X_g(a+\varepsilon) \arrow[r,hook,"\beta_{a+\varepsilon}"] &5700X_f(a+2\varepsilon)5701\end{tikzcd}5702\]5703is the structure inclusion, and the reverse composite is the5704analogous inclusion on \(g\)-sublevels. For a continuous map5705\(u:Y\to X\), use \(u\) on sublevel sets of the pulled-back functions.5706It commutes with the interleaving inclusions. Invariance makes5707each sublevel set a \(G\)-space and makes the inclusions equivariant.5708\end{proof}5709 5710This estimate survives functorial operations on the diagram. For5711instance one can take fixed spaces under a subgroup \(H\), followed5712by homology. The fixed sublevel \(X_f(a)^H\) is the sublevel of5713\(f|_{X^H}\) inside \(X^H\). Alternatively, one can apply homology5714to \(EG\times_G X_f(a)\), the homotopy quotient at threshold \(a\).5715The resulting invariants answer different questions about symmetry,5716and the same uniform bound at the diagram level applies to both.5717A bottleneck bound for their homology still requires a tameness5718hypothesis for the resulting modules.5719 5720\section{When persistence diagrams are available}5721 5722A persistence module is called \(q\)-tame if every structure map5723over a strictly positive step has finite rank. This does not5724require finite-dimensional homology exactly at each threshold.5725When \(X\) is the realization of a finite simplicial complex,5726the homology persistence modules of every continuous real-valued5727\(f\) on \(X\) are \(q\)-tame. In fact, fix \(a<b\) and subdivide5728so that the oscillation of \(f\) on every simplex is less than5729\(b-a\), using compactness and uniform continuity. The union of5730simplices that meet \(X_f(a)\), together with their faces, is a5731finite subcomplex \(K\) with5732\[5733X_f(a)\subseteq |K|\subseteq X_f(b).5734\]5735The corresponding homology map factors through a finite-dimensional5736vector space \(H_j(|K|;k)\). This also applies to compact smooth5737manifolds by smooth triangulability.5738 5739The stability theorem for persistence diagrams bounds their5740bottleneck distance by the interleaving distance for \(q\)-tame5741modules \cite{chazal-persistence}. Consequently the bound in5742Proposition~\ref{prop:sublevel-interleaving} gives a bottleneck5743bound \(\varepsilon\) in the finite-complex setting. One way to5744read the estimate is that a feature with lifetime exceeding5745\(2\varepsilon\) cannot simply be matched to the diagonal under5746a bottleneck matching of cost at most \(\varepsilon\).5747See \cite{cohen-steiner-stability} for the classical stability5748result for sublevel-set persistence. The inclusions proved here5749are assertions at the level of spaces, independent of the5750tameness used to assign persistence diagrams. Applying homology5751forgets information, such as cup products, that can distinguish5752otherwise identical homology groups or homology persistence modules.5753 5754\begin{example}[Equal homology modules with different filtered spaces]5755Equip \(S^2\vee S^4\) and \(\mathbb{CP}^2\) with the constant5756function zero. In both cases the sublevel is empty before zero,5757and the entire space thereafter. The two spaces have one5758homology generator in each of degrees \(0,2,4\), with field5759coefficients, so the ordinary homology persistence modules agree5760in every degree. The degree-two generator on \(\mathbb{CP}^2\)