2000 character limit reached
The $\infty$-Categorical Reflection Theorem and Applications
Published 19 Jul 2022 in math.AT and math.CT | (2207.09244v1)
Abstract: In this paper we prove an $\infty$-categorical version of the reflection theorem of Ad\'amek-Rosick\'y. Namely, that a full subcategory of a presentable $\infty$-category which is closed under limits and $\kappa$-filtered colimits is a presentable $\infty$-category. We then use this theorem in order to classify subcategories of a symmetric monoidal $\infty$-category which are equivalent to a category of modules over an idempotent algebra.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.