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 721–820 of 4071. Source text is displayed literally.

721\begin{proof}722Precomposition equips the frame object \(\operatorname{Fr}(E)\) with a right \(G\)-action. A choice of local equivalence with \(U\times K\) gives a section over \(U\) and identifies the action there with the regular right action. The torsor comparison723\[724 \operatorname{Fr}(E)\times G\longrightarrow725 \operatorname{Fr}(E)\times_B\operatorname{Fr}(E)726\]727is an equivalence after pulling back along \(U\to B\), and is therefore an equivalence globally. The frame map to \(B\) is effective since it has a section over \(U\). Conversely, for a right \(G\)-torsor \(P\) form \(P\times^G K\) by realizing the diagonal action groupoid, where \(g\) acts by \((p,x)\mapsto(p g^{-1},g x)\). Over the effective epimorphism \(P\to B\) the pulled-back torsor has its tautological section. The associated object then identifies with the product with \(K\). The map from \(P\) to the frames of this associated object sends a local point \(p\) to \(x\mapsto[p,x]\). It is equivariant by the relation \([p g,x]=[p,g x]\), and becomes an equivalence where \(P\) is trivialized, so it is an equivalence. The evaluation of a frame on \(K\) gives \(\operatorname{Fr}(E)\times^G K\to E\), which becomes the product equivalence on the same trivializing cover and is thus an equivalence. Both maps are natural, giving inverse equivalences on cores. Corollary~\ref{cor:torsor-classification} gives the mapping-space description.728\end{proof}729 730If a finite-level truncation of \(K\) is imposed, its automorphism object also has bounded truncation degree, because mapping into an \(n\)-truncated object gives \(n\)-truncated mapping spaces. The classification then uses a correspondingly truncated target \(BG\). For general \(K\), it involves coherence at every degree. A section of the frame torsor is a chosen trivialization, and two sections may differ by a nontrivial automorphism. This distinguishes a property, being split, from the moduli of its witnesses.731 732\section{The boundary between \v{C}ech descent and hyperdescent}733\index{hypercover}\index{hypercompleteness}734 735A hypercover \(V_\bullet\to B\) is an augmented simplicial object whose relative matching maps are effective epimorphisms, including \(V_0\to B\). The \v{C}ech nerve of an effective epimorphism is a hypercover, with the matching maps in positive degrees equivalences. A general hypercover may have additional local choices in higher degrees. It need not be a groupoid, so the effectivity argument for Theorem~\ref{thm:effective-descent} does not prove descent along it.736 737For an object \(E\) of \(\mathcal X\), hypercompleteness means that mapping into \(E\) inverts all infinitely connective maps. The hypercover criterion identifies this with the requirement that the augmentation induce an equivalence738\[739     \operatorname{Map}_{\mathcal X}(B,E)740       \longrightarrow741     \lim_{[n]\in\Delta}\operatorname{Map}_{\mathcal X}(V_n,E)742\]743for all hypercovers \(V_\bullet\to B\) \cite[Theorem 6.5.3.12]{htt}. This uses the fact that \(|V_\bullet|\to B\) is infinitely connective. In a hypercomplete topos it is an equivalence. A truncated target \(E\) also satisfies the displayed condition in an arbitrary \(\infty\)-topos, because maps into a target of fixed finite truncation cannot detect an infinitely connective discrepancy. The distinction matters when local trivializations or coefficients are given as unbounded towers. Categorical descent for one effective epimorphism here avoids any completeness hypothesis because the augmentation of that particular nerve is already an equivalence.744 745% End chapters/02-descent.tex746\part{Monodromy and shape}747% Begin chapters/03-profinite.tex748\chapter{Pro-spaces and continuous monodromy}749\label{ch:profinite}750\index{pro-space}\index{monodromy!continuous}751 752The passage from a single splitting field to a directed family of splitting753fields in \cite[Ch.~3]{bj} changes the meaning of an action. At each finite754stage the Galois group acts discretely. An orbit in the limit need only be755controlled by a quotient large enough to see that orbit. A continuous756action on an entire space can require a more restrictive or a more757flexible definition, depending on whether one demands a single758trivializing stage for the object or permits a filtered assembly of759objects with that property. This chapter distinguishes those constructions760before passing to the shape of a topos.761 762\section{Pro-objects and the role of the test space}763 764Write \(\mathcal S\) for the \(\infty\)-category of spaces. A pro-space765\(P\) is represented by a small cofiltered diagram766\(i\mapsto P_i\). For a second pro-space \(Q=\{Q_j\}_{j\in J}\),767the mapping formula is768\begin{equation}769\label{eq:pro-map}770 \operatorname{Map}_{\operatorname{Pro}(\mathcal S)}(P,Q)771 \simeq772 \lim_{j\in J}\operatorname*{colim}_{i\in I^{\mathrm{op}}}773             \operatorname{Map}_{\mathcal S}(P_i,Q_j).774\end{equation}775We place \(\operatorname{colim}_{i}\) over the filtered direction776throughout this chapter. Formula \eqref{eq:pro-map} comes from the777embedding of \(\operatorname{Pro}(\mathcal S)^{\mathrm{op}}\) in778\(\operatorname{Fun}(\mathcal S,\mathcal S)\) taking \(P\) to779\[780 F_P(T)=\operatorname*{colim}_{i}\operatorname{Map}(P_i,T).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 is