Stefanich's conjecture on limits of presentable n-categories

Let nPrn\mathsf{Pr} be the 11-category of presentable nn-categories, defined as the filtered colimit

nPr=lim→⁡κnPrκn\mathsf{Pr}=\varinjlim_{\kappa}n\mathsf{Pr}^{\kappa}

where nPrκn\mathsf{Pr}^{\kappa} is the category of κ\kappa-compactly generated nn-categories, for regular cardinals κ\kappa. Stefanich's conjecture. The 11-category nPrn\mathsf{Pr} has small limits for every n≥0n\geq0. This problem was widely open and was posed by Stefanich as Conjecture 5.5.1; the supplied text gives no resolution.

References

Primary source

Ko Aoki, “Higher presentable categories and limits”, arXiv:2510.13503 (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.