Categorical hypercompleteness conjecture for finite and infinite categories

Let n-Cat⁡n\text{-}\operatorname{Cat} denote the category of nn-categories, let Surj⁡ω\operatorname{Surj}_{\omega} denote the class of ω\omega-surjective morphisms, and let ω-Cat⁡coind\omega\text{-}\operatorname{Cat}^{\mathrm{coind}} be the full subcategory of ω-Cat⁡\omega\text{-}\operatorname{Cat} consisting of objects local with respect to ΣnEeqcoind→Dn\Sigma_nE_{eq}^{\mathrm{coind}}\to \mathbf{D}_n for every n∈Nn\in\mathbb{N}, so that their coinductive ω\omega-equivalences are trivial. Categorical hypercompleteness conjecture. For every n∈Nn\in\mathbb{N}, the morphism

n-Cat⁡→n-Cat⁡[Surj⁡ω−1]n\text{-}\operatorname{Cat}\to n\text{-}\operatorname{Cat}[\operatorname{Surj}_{\omega}^{-1}]

is an equivalence. Equivalently, every ω\omega-surjective morphism between nn-categories is an equivalence. Moreover, the morphism

ω-Cat⁡coind→n-Cat⁡[Surj⁡ω]\omega\text{-}\operatorname{Cat}^{\mathrm{coind}}\to n\text{-}\operatorname{Cat}[\operatorname{Surj}_{\omega}]

is an equivalence. In other words, the categorical hypercompletion of ω-Cat⁡\omega\text{-}\operatorname{Cat} consists of ω-Cat⁡coind\omega\text{-}\operatorname{Cat}^{\mathrm{coind}}. The assertion concerns whether iterated surjectivity detects equivalences in finite dimensions and identifies the corresponding hypercompletion in the infinite-dimensional setting; its status is not established in the supplied text.

References

Primary source

Félix Loubaton, “Effectivity of Generalized Double -Categories”, arXiv:2503.19242 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.