2000 character limit reached
A note on stable recollements (1607.02064v1)
Published 7 Jul 2016 in math.CT and math.AG
Abstract: In this short \'etude, we observe that the full structure of a recollement on a stable infinity-category can be reconstructed from minimal data: that of a reflective and coreflective full subcategory. The situation has more symmetry than one would expect at a glance. We end with a practical lemma on gluing equivalences along a recollement.
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.
