Categorical hypercompleteness conjecture for finite and infinite categories
Categorical hypercompleteness conjecture for finite and infinite categories
Let denote the category of -categories, let denote the class of -surjective morphisms, and let be the full subcategory of consisting of objects local with respect to for every , so that their coinductive -equivalences are trivial. Categorical hypercompleteness conjecture. For every , the morphism
is an equivalence. Equivalently, every -surjective morphism between -categories is an equivalence. Moreover, the morphism
is an equivalence. In other words, the categorical hypercompletion of consists of . 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
Sign in to submit a solution.
No solutions have been posted yet.