Indexed text attachment
galois-theory-in-higher-categories.tex
Source for Galois Theory in Higher Categories
View paper · Download original file
Lines 3851–3950 of 4071. Source text is displayed literally.
3851points distinguish all objects.3852 3853\section{What truncation preserves}3854 3855The preceding calculation is also valid with truncated3856coefficients. For an integer \(n\geq0\), let3857\(\mathcal L_n(B)=\Fun(B,\SSet_{\leq n})\). Denote the3858evaluation functor on \(\mathcal L_n(B)\) by3859\(\mathrm{ev}_b^n\), giving its output as a space.3860 3861\begin{proposition}[Truncated reconstruction]3862\label{prop:comparison-trunc}3863There is a natural equivalence3864\[3865\Map_{\Fun(\mathcal L_n(B),\SSet)}3866 (\mathrm{ev}_b^n,\mathrm{ev}_c^n)3867 \simeq\tau_{\leq n}\Map_B(b,c).3868\]3869Every component of the left side consists of equivalences.3870Restricted evaluation consequently defines a fully faithful3871functor \(\tau_{\leq n+1}B\to\Fun(\mathcal L_n(B),\SSet)\).3872\end{proposition}3873 3874\begin{proof}3875Objectwise truncation is left adjoint to the inclusion3876\(\mathcal L_n(B)\hookrightarrow\mathcal L(B)\).3877Hence \(\mathrm{ev}_b^n\) is represented by3878\(R_b^n=\tau_{\leq n}R_b\) in \(\mathcal L_n(B)\).3879The two Yoneda identifications give3880\(\Map(\mathrm{ev}_b^n,\mathrm{ev}_c^n)3881\simeq \Map_{\mathcal L_n(B)}(R_c^n,R_b^n)3882\simeq R_b^n(c)\).3883The components of \(R_b^n(c)\) come from actual paths in \(B\),3884so all corresponding natural transformations are equivalences.3885The full subcategory spanned by the evaluations is thus an3886\((n+1)\)-truncated groupoid. The evaluation functor factors3887through \(\tau_{\leq n+1}B\) by its truncation universal3888property. The mapping-space description identifies the3889factorization as fully faithful.3890\end{proof}3891 3892In particular, set-valued monodromy recovers the fundamental3893groupoid and its groups of loops at chosen points. A space of3894coefficients truncated in a higher degree records one additional3895degree in the classifying groupoid. The regular representable3896need not lie in the subcategory of finite coefficients. The3897proof above therefore gives no reconstruction of the uncompleted3898base from finite tests. The pro-space mapping formula and3899finite-range hypotheses from Chapters~\ref{ch:profinite}3900and~\ref{ch:shape} are the relevant comparison in that setting.3901 3902For infinite discrete groups, the loss can already occur with3903set coefficients. The additive group \(\mathbb Q\) has no3904nontrivial finite quotient. If a map \(\mathbb Q\to H\) has3905finite image of order dividing \(m\), write any \(x\) as \(my\).3906Its image is the \(m\)th power of the image of \(y\), hence3907the identity. Any action of \(\mathbb Q\) on a finite set3908is trivial, since it factors through a finite permutation group.3909In contrast the regular action recovers \(\mathbb Q\) itself by3910Proposition~\ref{prop:comparison-trunc}. The choice of coefficient3911category therefore changes the reconstruction even for an ordinary3912group.3913 3914\section{A comparison of the classification results}3915 3916The constructions used throughout the book can be read in the3917following order. Choose a base and the objects considered over3918it. Specify the splitting condition. Determine the overlap3919diagram under which such objects can descend. Then decide whether3920the overlap diagram has a smaller groupoid, pro-object, or directed3921category as a presentation. The outputs below indicate which3922of these steps require hypotheses.3923 3924\begingroup3925\small3926\renewcommand{\arraystretch}{1.19}3927\begin{longtable}{@{}3928>{\raggedright\arraybackslash}p{0.205\textwidth}3929>{\raggedright\arraybackslash}p{0.347\textwidth}3930>{\raggedright\arraybackslash}p{0.365\textwidth}@{}}3931\toprule3932Input & Key hypothesis & Classification \\3933\midrule3934\endfirsthead3935\toprule3936Input & Key hypothesis & Classification \\3937\midrule3938\endhead3939An internal cover \(U\to B\) &3940Effective epimorphism in an \(\infty\)-topos &3941Objects over \(B\) as cartesian actions of the overlap groupoid.3942Chapter~\ref{ch:descent}. \\3943An adjunction \(L\dashv R\) and a cover \(U\to B\) &3944Admissibility in slices and effective descent for the chosen maps &3945Objects split by \(U\) as a limit of slices over the image overlap3946diagram. Additional exactness makes that diagram a groupoid.3947Chapter~\ref{ch:reflections}. \\3948A space, a pro-space, or the shape of a topos &3949Representable base for ordinary straightening or the coefficient3950and locality hypotheses of higher Galois theory &