3.4. Hypercompletion
Finite truncations need not detect all morphisms in a topos. A morphism may be \(n\)-connected for every finite \(n\) without being an isomorphism, so that it is invisible at every finite stage of the Postnikov hierarchy. Hypercompletion is the localization which forces all such morphisms to become isomorphisms. We now construct this localization and show that it is left exact, hence again a topos.
A morphism \(f\colon X \to Y\) in \(T\) is called \(\infty\)-connected if it is \(n\)-connected for every \(n\). It is called \(\infty\)-truncated (or hypercomplete) if it is right orthogonal to the class of \(\infty\)-connected maps.
Let \(T_{\leq \infty}\) denote the full subcategory of \(\infty\)-truncated objects in \(T\). An alternative notation for this subcategory is \(T^{\hyp}\). We say that \(T\) is hypercomplete if every object is \(\infty\)-truncated.
The term “hypercomplete” is historical but slightly misleading: hypercompleteness is a separation condition rather than a completeness condition. “Postnikov separated” might have been a better term. In [Anel et al. 2025], the authors use the term “hyperreduced” instead.
Let \(T\) be a topos.
The \(\infty\)-connected maps form a strongly saturated class of small generation, stable under base change and diagonals.
The inclusion \(T_{\leq \infty} \hookrightarrow T\) admits a left adjoint \(\tau_{\infty}\colon T \to T_{\leq \infty}\).
The pair (\(\infty\)-connected, \(\infty\)-truncated) is a factorization system on \(T\).
Proof
The left adjoint \(\tau_{\infty}\colon T \to T_{\leq \infty}\) is left exact. In particular, \(T_{\leq \infty}\) is again a topos.
Proof
References
- Mathieu Anel, Georg Biedermann, Eric Finster, André Joyal. Left-exact localizations of $\infty$-topoi III: The acyclic product. 2025.
- Jacob Lurie. Higher topos theory. Ann. Math. Stud. 170, Princeton, NJ: Princeton University Press. 2009.