Indexed text attachment
galois-theory-in-higher-categories.tex
Source for Galois Theory in Higher Categories
View paper · Download original file
Lines 781–880 of 4071. Source text is displayed literally.
781\]782Indeed the representable \(\operatorname{Map}(Q_j,-)\) is a term783in the filtered presentation of \(F_Q\). A natural transformation from784\(F_Q\) to \(F_P\) is a compatible family of transformations from those785representables. The Yoneda lemma identifies the family with the right786side of \eqref{eq:pro-map}. In particular, an equivalence of pro-spaces787can be checked against every constant test \(T\). Here and below an788ambient size enlargement may be used for the categories of test functors.789 790The realized inverse limit \(\lim_i P_i\) loses this test property. Take791\(P_m=\{m,m+1,\dots\}\) with the inclusions as transition maps. As792discrete spaces their inverse limit is empty. Yet \(F_P(\varnothing)\)793is empty because every \(P_m\) is nonempty. The constant empty794pro-space has \(F_{\varnothing}(\varnothing)\simeq *\). Thus even795this tower of discrete spaces cannot be replaced by its realized796inverse limit for a classification problem.797 798\begin{definition}799\index{profinite completion}\index{protruncation}\index{pi-finite space@$\pi$-finite space}800A space is \emph{\(\pi\)-finite} if it is truncated, has finitely801many components, and has finite positive homotopy groups at every802basepoint. Let \(\mathcal S_\pi\) be the full subcategory on these803spaces, and let \(\mathcal S_{<\infty}\) be the full subcategory of804all truncated spaces. The corresponding completions of \(P\) are805written \(P^{\wedge}_\pi\in\operatorname{Pro}(\mathcal S_\pi)\)806and \(P_{<\infty}\in\operatorname{Pro}(\mathcal S_{<\infty})\).807\end{definition}808 809These completions are characterized by retaining exactly the tests of810the indicated kind. In the functor presentation, restrict811\(F_P\) to the indicated full subcategory. Each subcategory admits812finite limits. In the \(\pi\)-finite case, this follows from the813homotopy exact sequence for a pullback and the finiteness of the814component sets. Both restrictions preserve finite limits because815filtered colimits of spaces do so. The pro-object characterization by816accessible finite-limit-preserving functors then gives the completions.817For truncated spaces the accessibility issue can be handled by the818cofiltered diagram \(\{\tau_{\leq d}P_i\}_{i,d}\), since maps to any fixed819truncated test stabilize in the Postnikov coordinate. A particular consequence that will be820used repeatedly is821\begin{equation}822\label{eq:pro-completion}823 \operatorname{Map}(P^{\wedge}_\pi,T)824 \simeq\operatorname{Map}(P,T)825 \qquad (T\in\mathcal S_\pi).826\end{equation}827There is an analogous formula for \(P_{<\infty}\) with828\(T\in\mathcal S_{<\infty}\). Either construction is left adjoint829to the inclusion of the corresponding pro-category. This follows830for a general target by taking the limit of the equivalences for831its constant stages. The same argument in degree \(0\) recovers832the equivalence between pro-finite sets and Stone spaces used in833\cite[Ch.~3]{bj}. The higher completion tests Eilenberg--Mac Lane834spaces, classifying spaces, and their finite Postnikov combinations.835 836\section{A representation category at stages}837\index{representation!at a stage}838 839For a coefficient \(\infty\)-category \(\mathcal D\), set840\begin{equation}841\label{eq:stage-representations}842 \operatorname{Rep}_{\mathcal D}(P)=843 \operatorname*{colim}_{i}\operatorname{Fun}(P_i,\mathcal D),844\end{equation}845where the colimit is in \(\operatorname{Cat}_{\infty}\), and846the arrows are given by restriction. A representative of an object is847a family and all its transport coherence at a single stage.848A representative of a morphism is a natural transformation after849passing to a common stage. More precisely, if \(F\) and \(G\)850are already represented at a common stage \(i\), their mapping851space is852\begin{equation}853\label{eq:rep-map}854 \operatorname{Map}_{\operatorname{Rep}_{\mathcal D}(P)}(F,G)855 \simeq \operatorname*{colim}_{(k\to i)}856 \operatorname{Map}_{\operatorname{Fun}(P_k,\mathcal D)}857 (F|_{P_k},G|_{P_k}).858\end{equation}859This follows by computing mapping spaces as fibers of the core of860the arrow category over the core of pairs of objects. Filtered colimits861of \(\infty\)-categories commute with forming these cores and arrow862categories, and filtered colimits of spaces commute with the fibers.863The reason for the first commutation can also be seen in simplicial864models: every prescribed simplex and every witness that an edge is865invertible involves a finite diagram, so it is already present at a866single refinement. Two stages that represent a prescribed datum867become comparable after a further refinement. This proves invariance868under cofiltered change of presentation and recovers the functorial869construction of \cite[\S2]{hoyois}.870 871The coefficient category may have infinitely many objects up to872equivalence. A finite stage can still carry an arbitrary object of873\(\mathcal D\). The crucial finiteness for completion is instead the874size and truncation of the spaces classifying possible transport875and coherent maps.876 877\begin{lemma}878\label{lem:pifinitemap}879If \(A\) and \(B\) are \(\pi\)-finite, then880\(\operatorname{Map}(A,B)\) is \(\pi\)-finite.