Definable orthogonality classes in accessible categories are small
Joan Bagaria, Carles Casacuberta, A. R. D. Mathias, Jiri Rosicky

TL;DR
This paper shows that the validity of certain category theory results depends on the complexity of formulas defining classes, with large-cardinal hypotheses required for more complex classes, linking set-theoretic assumptions to categorical properties.
Contribution
It establishes a hierarchy of large-cardinal assumptions based on formula complexity, connecting them to definable orthogonality classes in accessible categories and their properties.
Findings
Orthogonal class of objects is small-orthogonality class for formulas in ZFC.
Existence of cohomological localizations implies large-cardinal hypotheses.
Homological localizations are provable in ZFC due to simpler definability.
Abstract
We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopenka's principle. We prove that the necessary large-cardinal hypotheses depend on the complexity of the formulas defining the given classes, in the sense of the Levy hierarchy. For example, the statement that, for a class S of morphisms in a locally presentable category C of structures, the orthogonal class of objects is a small-orthogonality class (hence reflective) is provable in ZFC if S is \Sigma_1, while it follows from the existence of a proper class of supercompact cardinals if S is \Sigma_2, and from the existence of a proper class of what we call C(n)-extendible cardinals if S is \Sigma_{n+2} for n bigger than or equal to 1. These cardinals form a new hierarchy, and we show that Vopenka's principle is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
