Indexed text attachment
galois-theory-in-higher-categories.tex
Source for Galois Theory in Higher Categories
View paper · Download original file
Lines 1321–1420 of 4071. Source text is displayed literally.
1321limit of the functors. More explicitly, fullness of each image1322lifts all transition equivalences, and every higher simplex1323whose vertices are in the image lies in that full1324subcategory. Descent supplies a representation over \(U\).1325\end{proof}1326 1327The constant comparison in the lemma has an elementary form.1328For \(A,B\in\mathcal S\) define1329\(F_U(B)=\operatorname{Map}_{\mathcal X}(U,\Delta B)\).1330We have natural equivalences1331\[1332\begin{aligned}1333 \operatorname{Map}_{\operatorname{Rep}_{\mathcal S}(\Pi(U))}(A,B)1334 &\simeq F_U(\operatorname{Map}(A,B)),\\1335 \operatorname{Map}_{\mathcal X_{/U}}(\Delta_U A,\Delta_U B)1336 &\simeq \operatorname{Map}(A,F_U(B)).1337\end{aligned}1338\]1339The first is the formula for maps of constant diagrams at each1340stage. The second uses \(\Delta_U A\simeq\operatorname{colim}_A U\)1341in the slice and then maps out of that colimit. If1342\(\Pi(U)=\{P_i\}\), the comparison is consequently1343\begin{equation}1344\label{eq:constant-stage-comparison}1345 \operatorname*{colim}_i1346 \operatorname{Map}(A,\operatorname{Map}(P_i,B))1347 \longrightarrow1348 \operatorname{Map}\bigl(A,\operatorname*{colim}_i1349 \operatorname{Map}(P_i,B)\bigr).1350\end{equation}1351This displays the relevant commutation requirement directly.1352 1353\section{Two comparison theorems}1354 1355\begin{theorem}[Higher local monodromy]1356\label{thm:shape-local}1357\index{topos!locally connected}1358Fix \(n\geq0\), or let \(n=\infty\).1359Suppose that the constant-object functor on \(n\)-truncated1360objects admits a genuine left adjoint1361\[1362 L_n\colon\mathcal X_{\leq n}\longrightarrow\mathcal S_{\leq n}.1363\]1364Then for each \(U\in\mathcal X\), realization gives an equivalence1365\[1366 \operatorname{Rep}_{\mathcal S_{\leq n}}(\Pi(U))1367 \simeq \operatorname{LC}_{\leq n}(\mathcal X_{/U}).1368\]1369\end{theorem}1370 1371\begin{proof}1372For an \(n\)-truncated test \(T\), \(\Delta T\) is1373\(n\)-truncated. By adjunction,1374\[1375 F_U(T)\simeq1376 \operatorname{Map}(L_n\tau_{\leq n}U,T).1377\]1378If \(B\) is \(n\)-truncated, so is \(\operatorname{Map}(A,B)\)1379for any space \(A\). For constant coefficients in the theorem1380both sides of \eqref{eq:constant-stage-comparison} therefore1381agree by the exponential law for spaces, with1382\(L_n\tau_{\leq n}U\) as the representing space.1383Apply Lemma \ref{lem:stage-comparison-local}.1384For \(n=\infty\), truncation in this argument means the1385identity.1386\end{proof}1387 1388The hypothesis of Theorem \ref{thm:shape-local} is local1389\(n\)-connectedness in the convention of \cite[Def.~3.2]{hoyois}.1390For finite \(n\), the genuine left adjoint represents the relative1391shape on \(n\)-truncated tests. Even then the monodromy category1392in general uses the \emph{pro-\((n+1)\)-truncation} of shape.1393Indeed the objects in \(W_0(\mathcal S_{\leq n})\) have loops1394given by automorphism spaces, hence this classifier is1395\((n+1)\)-truncated. The endpoint map of the arrow classifier has1396\(n\)-truncated fibers, so its total space is also1397\((n+1)\)-truncated. By \eqref{eq:rezk-stage} and the1398mapping-space description using the arrow classifier, these1399two tests suffice to recognize equivalences of the representation1400categories. For \(n=0\) this recovers why a fundamental groupoid1401rather than just a space of connected components is needed1402to classify coverings.1403 1404\begin{theorem}[Finite-coefficient higher Galois theory]1405\label{thm:shape-finite}1406\index{locally constant object!finite coefficient}1407For every \(\infty\)-topos and every \(U\), realization induces an1408equivalence1409\[1410 \operatorname{Rep}_{\mathcal S_\pi}(\Pi(U))1411 \simeq \operatorname{LC}_{\pi}(\mathcal X_{/U}).1412\]1413Here local trivializations may have arbitrarily many different1414\(\pi\)-finite fiber types across the cover.1415\end{theorem}1416 1417\begin{proof}1418For \(A\in\mathcal S_\pi\) and fixed finite \(n\),1419\(\operatorname{Map}(A,-)\) preserves filtered colimits of1420\(n\)-truncated spaces. Use the finite \((n+1)\)-skeleton in the