Categorical hypercompleteness conjecture for finite and infinite categories

From papers

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

n-Catn-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

ω-Catcoindn-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 ω-Catcoind\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.

Progress summary

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

Sources & referencesView supporting material

Primary source

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

Solutions 0

No solutions have been posted yet.