Independent scholarship · Open accessThe monthly digest

Indexed text attachment

galois-theory-in-higher-categories.tex

Source for Galois Theory in Higher Categories

View paper · Download original file

Lines 2741–2840 of 4071. Source text is displayed literally.

2741Every functor \(f:A\to B\) factors as an essentially surjective functor followed by a fully faithful functor. These classes form an orthogonal factorization system on \(\operatorname{Cat}_\infty\).2742\end{proposition}2743 2744\begin{proof}2745Choose the full subcategory \(I\subseteq B\) on the union of the components of \(B^\simeq\) meeting \(f(A^\simeq)\). It contains the image of \(f\), every object is equivalent to one from \(A\), and inclusion is fully faithful.2746 2747For orthogonality, take an essentially surjective \(e:A\to B\) and a fully faithful \(m:X\to Y\). Replace \(X\) over \(Y\) by its full essential image using the preceding construction and full faithfulness. Given a square with \(e\) on the left and \(m\) on the right, the map \(B\to Y\) sends every object into this full subcategory since every object is equivalent to one in the image of \(A\). A full subcategory is determined by its allowed vertices and includes every simplex of \(Y\) with those vertices in a quasicategory model. The map \(B\to Y\) thus lifts. Postcomposition with a full inclusion gives a fully faithful functor \(\operatorname{Fun}(B,X)\to\operatorname{Fun}(B,Y)\). On cores the space of a lift with its prescribed identification is empty or contractible. The existence just proved, and the same full faithfulness for \(A\), show that imposing the rest of the square leaves a contractible space of lifts. Closure under retracts follows from the intrinsic definitions. Existence and orthogonality give the factorization system.2748\end{proof}2749 2750A second factorization has a different right class. Given \(f:A\to B\), let \((b\downarrow f)\) be the comma category of objects \((a,b\to f(a))\), with arrows over \(b\). Write \(|D|\) for the groupoidification of \(D\). We call \(f\) final if every \(|b\downarrow f|\) is contractible. By the higher form of Quillen's Theorem~A, this is equivalent to \(f\) preserving colimit computations by restriction \cite[\S4.1.3]{htt}. An initial functor is one whose opposite is final. Its test uses the comma categories of arrows \(f(a)\to b\).2751 2752\index{comprehensive factorization}\begin{theorem}[Comprehensive factorization]2753\label{thm:comprehensive-factor}2754There is an orthogonal factorization system on \(\operatorname{Cat}_\infty\) with left class the final functors and right class the right fibrations, taken up to equivalence of arrows. The right-fibration factor of \(f:A\to B\) is classified by the presheaf2755\[2756 L_f=\operatorname{Lan}_{f^{\mathrm{op}}}\mathbf 1_A,\qquad2757 L_f(b)\simeq |b\downarrow f|.2758\]2759Dually, the initial functors and the left fibrations form an orthogonal factorization system.2760\end{theorem}2761 2762\begin{proof}2763Here \(\mathbf 1_A\) is the terminal presheaf. The pointwise formula for left Kan extension has indexing category \((b\downarrow f)^{\mathrm{op}}\). The colimit of the constant point diagram is its groupoidification, canonically equivalent to that of the opposite category. In these terms the action of \(L_f\) is precomposition on comma categories. Let \(p:E_f\to B\) be the right fibration classified by \(L_f\). The Kan unit \(\mathbf 1_A\to (f^{\mathrm{op}})^*L_f\) corresponds to a section of \(f^*E_f\) over \(A\), giving \(j:A\to E_f\) with \(pj=f\). Under the comma description, \(j(a)\) is the point represented by \((a,\operatorname{id}_{f(a)})\).2764 2765To prove finality of \(j\), fix \(e=(b,z)\) in \(E_f\). A lift of \(\beta:b\to f(a)\) from \(e\) to \(j(a)\) is specified by a path between \(z\) and the transported point \(L_f(\beta)(j(a))\) in \(L_f(b)\). This description is natural in \((a,\beta)\), since an arrow of this comma category supplies a homotopy relating the two transported points. Consequently \((e\downarrow j)\) is classified over \((b\downarrow f)\) by the family of path spaces \(\operatorname{Map}_{L_f(b)}(z,\lambda(a,\beta))\), where \(\lambda:(b\downarrow f)\to |b\downarrow f|\) is the localization map. This family sends every arrow to an equivalence. Its total groupoidification is the colimit of the family in spaces by straightening and the universal property of a colimit. Universality of colimits in spaces computes this colimit by pulling the colimit of the points \(\lambda(a,\beta)\) in \(\mathcal S_{/L_f(b)}\) back along \(z\). That colimit is \(\operatorname{id}_{L_f(b)}\), so the pullback is contractible. This is the comma criterion for \(j\).2766 2767For orthogonality, pull a right fibration back along the bottom map \(B\to C\) of a square and let the resulting fibration over \(B\) correspond to \(F\). A top map lifting a given arrow \(e:A\to B\) gives a section over \(A\), equivalently an element of \(\operatorname{Map}(\mathbf 1_A,(e^{\mathrm{op}})^*F)\). The space of fillers is the fiber of the restriction map from \(\operatorname{Map}(\mathbf 1_B,F)\) over this element. The left Kan extension adjunction identifies restriction with precomposition by \(L_e\to\mathbf 1_B\). This arrow is an equivalence when \(e\) is final, so the fiber is contractible. Finally final functors and right fibrations are each closed under retracts. For the right class this follows directly from the defining pullback condition, or from its lifting tests against terminal-vertex inclusions. Thus the factorizations and mutual orthogonality identify both classes. Taking opposites proves the dual assertion.2768\end{proof}2769 2770The distinction between the two factorizations is visible on a category with indefinitely composable arrows. Take \(\mathbb Z\) with its usual order, viewed as an \(\infty\)-category. The inclusion of the even integers is final since the even integers above each given \(b\) form a poset with a least element. It is fully faithful and fails essential surjectivity. Conversely \(\mathbb Z_{\mathrm{disc}}\to\mathbb Z\) is essentially surjective, whereas \((b\downarrow f)\) is a discrete infinite ray for this \(f\) and has noncontractible groupoidification. Even a groupoidification equivalence need not be final. The inclusion of \(0\) in \(\mathbb Z\) induces an equivalence on groupoidifications because \(\mathbb Z\) is filtered and nonempty, yet \((1\downarrow f)\) is empty.2771 2772The internal versions of the comprehensive factorization and of the comma criterion are established in \cite[\S4.4]{martini}. The tests there use every context \(T\) and take groupoidification internally. Applying the preceding external criterion only to global points of \(B\) would not give that result.2773 2774\section{Descent along an augmented diagram}2775 2776The precategories of \cite[\S\S7.1--7.5]{bj} are diagrams retaining a small amount of categorical incidence data, before enforcing the Segal pullback conditions. Their coefficient presheaves are formed by a two-dimensional limit. The corresponding higher construction can start from an arbitrary indexing \(\infty\)-category. This preserves the distinction the original book makes between a limit of change-of-base categories and the category of ordinary directed presheaves on an internal category.2777 2778Let \(I\) be small, let \(D:I^\triangleright\to\mathcal A\) be an augmented diagram with cone point \(a\), and let \(F,G:\mathcal A^{\mathrm{op}}\to\operatorname{Cat}_\infty\) be contravariant coefficient systems. The natural transformations between them are homotopy coherent. We call the augmentation effective for \(G\) when the canonical comparison2779\[2780 G(a)\longrightarrow \operatorname*{lim}_{i\in I^{\mathrm{op}}}G(D_i)2781\]2782is an equivalence. An object of the limit includes objects in the coefficient categories and equivalences relating every pullback of them, together with higher coherences. The maps between the objects of a compatible family are likewise compared in the entire mapping spaces.2783 2784\index{relative splitting}\begin{theorem}[Relative splitting along a diagram]2785\label{thm:relative-indexed-split}2786Suppose \(F\to G\) is pointwise fully faithful, the augmentation \(D\) is effective for \(G\), and there is an object \(i_0\) such that every \(i\) admits an arrow \(i\to i_0\) in \(I\). The choices of those arrows are immaterial. Let \(\operatorname{Split}_F(D)\subseteq G(a)\) consist of those \(x\) whose restriction to \(D_{i_0}\) belongs to the essential image of \(F(D_{i_0})\). Then comparison induces an equivalence2787\[2788 \operatorname{Split}_F(D)\simeq2789       \operatorname*{lim}_{i\in I^{\mathrm{op}}} F(D_i).2790\]2791\end{theorem}2792 2793\begin{proof}2794A limit of full inclusions is fully faithful. Its image consists of those coherent families whose entries lie in the respective essential images. One way to see this last assertion is to replace each \(F(D_i)\) by the full subcategory of \(G(D_i)\) on its image. Naturality ensures that each reindexing map restricts to the relevant full subcategories. In the model of a limit as the category of Cartesian sections of the associated Cartesian fibration over \(I\), the section belongs to the subfibration precisely when its objects do. Fullness in each fiber implies that every compatibility equivalence and coherent simplex of that section belongs to the subfibration as well.2795 2796For a section \(x_\bullet\), membership of \(x_{i_0}\) implies membership of \(x_i\) because an arrow \(i\to i_0\) yields \(x_i\simeq G(D_i\to D_{i_0})(x_{i_0})\). Naturality of \(F\to G\) places this pullback in the image of \(F(D_i)\). The converse follows by evaluation at \(i_0\). This identifies the limit of the \(F(D_i)\) with the pullback of2797\[2798 F(D_{i_0})\longrightarrow G(D_{i_0})2799 \quad\text{along}\quad2800 \lim G(D_i)\longrightarrow G(D_{i_0}).2801\]2802Using effectivity, this pullback is the defining full subcategory of \(G(a)\).2803\end{proof}2804 2805Taking \(I\) to be the shape of the precategory in \cite[\S7.2]{bj}, each of its object, arrow, and composable-pair indices maps to the object index. In the ordinary category-valued case the coherent pullback equivalences are isomorphisms in the coefficient categories, and the limit computes the pseudolimit used in the book. The relative splitting criterion is then exactly the requirement at the object index in \cite[Theorem~7.5.2]{bj}. The higher theorem allows the whole simplicial shape and the resulting mapping spaces, with no reduction to comparison isomorphisms on a truncated shape.2806 2807If a diagram has several distinguished objects collectively receiving arrows from each index, the same argument imposes the condition at all distinguished objects. If \(D_\bullet\) is simplicial, \(I=\Delta^{\mathrm{op}}\) and \(i_0=[0]\) can be used. In that case a vertex inclusion in \(\Delta\) supplies the arrow required by the proof. For the \Cech{} nerve of an effective epimorphism in an \(\infty\)-topos, the slice coefficient system \(G(T)=\mathcal B_{/T}\) has effective descent. The theorem then restricts ordinary descent to a full class of objects that is stable under reindexing. Its naturality requirement on \(F\to G\) is explicit. It does not imply that every adjunction on slice categories determines such a subsystem.2808 2809There is a precise interpretation of the slice construction on an arbitrary simplicial object \(D_\bullet\). Every colimit in an \(\infty\)-topos is van Kampen \cite[\S6.1.3]{htt}, so2810\[2811 \operatorname*{lim}_{[n]\in\Delta}\mathcal B_{/D_n}2812   \simeq \mathcal B_{/|D_\bullet|_{\mathcal B}},2813 \qquad2814 |D_\bullet|_{\mathcal B}=2815       \operatorname*{colim}_{[n]\in\Delta^{\mathrm{op}}}D_n .2816\]2817Indeed a compatible family amounts to a map of simplicial objects \(E_\bullet\to D_\bullet\) for which the naturality square for every simplicial operator is Cartesian. If \(D_\bullet\) is Segal, this includes both vertex conditions, so transports from one endpoint to the other are equivalences. Over a complete Segal space the realization \(|D_\bullet|_{\mathcal S}\) models the groupoidification. It counts simplices as coherent paths in a space, and in that target every edge becomes invertible. Thus these particular limit coefficients generalize the precategorical construction, while noninvertible directed transport requires the left- or right-fibration construction.2818 2819\section{Descent of directed representations}2820 2821Two useful forms of directed gluing keep track of which category contains the colimit. The first has its presentation in \(\operatorname{Cat}_\infty\), where arrows remain directed. The second is indexed by objects in a base topos and glues all simplicial degrees using pullback.2822 2823\begin{proposition}[Gluing over categorical colimits]2824\label{prop:directed-colim-glue}2825Let \(C=\operatorname*{colim}_{i\in I}C_i\) in \(\operatorname{Cat}_\infty\), with all \(C_i\) small, and let \(\mathcal E\) be an \(\infty\)-category in the coefficient universe. Then2826\[2827 \operatorname{Fun}(C,\mathcal E)\simeq2828       \operatorname*{lim}_{i\in I^{\mathrm{op}}}\operatorname{Fun}(C_i,\mathcal E).2829\]2830If a collection \(W_i\) of arrows is specified in each \(C_i\) compatibly with the diagram, the equivalence restricts to functors inverting the union \(W\) of their images in \(C\). The contravariant version follows by taking opposites of the indexing categories \(C_i\).2831\end{proposition}2832 2833\begin{proof}2834For any \(\infty\)-category \(K\) of the appropriate size, \(K\times-\) preserves colimits, as its right adjoint is \(\operatorname{Fun}(K,-)\). Mapping from \(K\) to the comparison functor therefore yields2835\[2836 \operatorname{Map}(K\times C,\mathcal E)2837  \simeq \lim_i\operatorname{Map}(K\times C_i,\mathcal E).2838\]2839Testing against all \(K\) proves the equivalence of \(\infty\)-categories. Inverting an image arrow is a pointwise property of an object of the functor category. A full subcategory of the limit defined by these conditions consequently corresponds to the specified full subcategory on the left. The operation \(C\mapsto C^{\mathrm{op}}\) is an autoequivalence of \(\operatorname{Cat}_\infty\) and preserves the colimit in question.2840\end{proof}