The ∞-Categorical Reflection Theorem and Applications
Abstract
We prove an ∞-categorical version of the reflection theorem of Adámek-Rosický. Namely, that a full subcategory of a presentable ∞-category which is closed under limits and κ-filtered colimits is a presentable ∞-category. We then use this theorem in order to classify subcategories of a symmetric monoidal ∞-category which are equivalent to a category of modules over an idempotent algebra.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.