Indexed text attachment
galois-theory-in-higher-categories.tex
Source for Galois Theory in Higher Categories
View paper · Download original file
Lines 3671–3770 of 4071. Source text is displayed literally.
3671 3672An $\infty$-topos is hypercomplete if every $\infty$-connective3673map is an equivalence. Hypercompletion is the left exact3674localization which forces these equivalences. Each3675$\infty$-connective morphism gives a constant simplicial3676hypercover in its target slice, according to the equivalent3677iterated-diagonal test for $\infty$-connectivity3678\cite[Lem.~6.5.3.5]{htt}. Thus effectiveness of3679all hypercovers is equivalent to hypercompleteness3680\cite[Thm.~6.5.3.12]{htt}. A bounded truncated object3681already satisfies the extra locality condition. Mapping3682into an $n$-truncated object cannot distinguish an3683$\infty$-connective map from an equivalence, by orthogonality3684to $n$-truncated maps. In particular,3685passing to ordinary sheaves of sets cannot test whether3686a given $\infty$-topos is hypercomplete.3687 3688A concrete instance of the distinction is the canonical3689$1$-localic lift of continuous $\mathbb Z_p$-sets. One can3690present it by the category of transitive quotients3691$\mathbb Z_p/p^n\mathbb Z_p$ with its atomic topology.3692This is an $\infty$-topos of ordinary sheaves of spaces3693in the sense of covering sieves, and it fails to be3694hypercomplete by Wieland's example3695\cite[Warning~7.2.2.31]{htt}. The site is ordinary and3696its underlying ordinary topos already has a classical3697group-theoretic presentation. Neither fact removes the3698hyperdescent distinction. The higher quotient3699\eqref{eq:higher-quotient-actions} uses an effective3700groupoid object, so it works in that topos before3701hypercompletion as well as in hypercomplete examples.3702 3703\begin{proposition}[Relative hypercompletion]3704\label{prop:relative-hypercompletion}3705Let $L\colon\mathcal X\to\mathcal X^\wedge$ be hypercompletion.3706For every $U\in\mathcal X$, the induced functor3707\[3708 L_{/U}\colon\mathcal X_{/U}\longrightarrow3709 (\mathcal X^\wedge)_{/LU}3710\]3711is the hypercompletion of the slice. In particular, applying3712$L$ to a hypercover $V_\bullet\to V$ gives a slice3713comparison3714\[3715 (\mathcal X^\wedge)_{/LV}3716 \ \simeq\3717 \lim_{[n]\in\Delta}3718 (\mathcal X^\wedge)_{/LV_n}.3719\]3720\end{proposition}3721 3722\begin{proof}3723Let $i\colon\mathcal X^\wedge\hookrightarrow\mathcal X$ be3724the fully faithful inclusion. For $T\to LU$, the right3725adjoint of $L_{/U}$ is the object3726$U\times_{iLU}iT\to U$. Indeed, a map into this pullback3727over $U$ amounts under $L\dashv i$ to a map into $T$3728over $LU$. The counit is invertible by left exactness of3729$L$ and the counit equivalence $LiT\simeq T$. It follows3730that $L_{/U}$ is a localization. A morphism in the slice3731is inverted precisely when its underlying morphism in3732$\mathcal X$ is inverted by $L$. This is the class of3733$\infty$-connective maps by the strong saturation theorem3734\cite[Prop.~6.5.2.8]{htt}. Connectivity in the slice agrees3735with the connectivity of the underlying map. For example,3736the slice over its codomain in $\mathcal X_{/U}$ identifies3737with the slice over that same codomain in $\mathcal X$,3738so the relative truncation tests are identical. This3739identifies the localization as the desired hypercompletion.3740 3741Finally, $L$ preserves the realization of $V_\bullet$3742and sends its $\infty$-connective augmentation to an3743equivalence. Apply3744\eqref{eq:higher-slice-vankampen} inside $\mathcal X^\wedge$.3745The result can also be read as descent for relative3746hypercomplete objects. The base object in the formula3747is $LV$, even when $V$ itself has not been assumed3748hypercomplete.3749\end{proof}3750 3751In the $\mathbb Z_p$ example the constant hypercover of a3752nonequivalence supplied by infinite connectivity has a slice3753comparison that fails before hypercompletion. The proposition3754makes the comparison an equivalence after applying $L$ to3755its entire augmentation. The higher Čech theorem continues3756to apply to actual groupoid quotients in the original topos.3757 3758% End chapters/12-presentations.tex3759% Begin chapters/14-comparison.tex3760\chapter{Reconstruction and comparison}\label{ch:comparison}3761\index{reconstruction}\index{fiber functor}3762 3763A classification theorem identifies a category of forms or coverings3764from a symmetry object and chosen coefficients. A reconstruction3765theorem asks what symmetry can be read back from that category.3766This direction is sensitive to the fiber functor, the availability3767of representing objects, and the tests used to define equivalence.3768We finish by comparing the different reconstruction problems.3769 3770\section{Recovering the space of fibers}