Ingredients
Incarnations
Properties
Universal aspects
Classification
Induced theorems
…
In higher category theory
Given a category , we may construct the free cocompletion of , freely adding some class of colimits. Often, however, will already have some colimits, which we wish to preserve. A conservative cocompletion of a category is a cocompletion that preserves the colimits in .
For a small category with -colimits, there is a simple description of the -conservative cocompletion (for a class of colimits). It is the the full subcategory of the presheaf category on spanned by the functors sending -colimits in to limits in the presheaf category.
For a large category, this description does not suffice in general, nor does it suffices to consider categories of small presheaves: in fact, there are locally small categories that do not admit locally small conservative cocompletions (see AV02) (however, they do admit conservative cocompletions that are large and not locally small).
Joachim Lambek, Completions of categories: Seminar lectures given 1966 in Zürich, Lecture Notes in Mathematics 24 (1966), Springer. doi, ISBN: 978-3-540-03607-4 (softcover), 978-3-540-34840-5 (electronic).
Věra Trnková, Limits in categories and limit-preserving functors, Commentationes Mathematicae Universitatis Carolinae 7.1 (1966): 1-73.
J. F Kennison, On limit-preserving functors, Illinois Journal of Mathematics 12.4 (1968): 616-619.
Max Kelly, Basic Concepts of Enriched Category Theory, Cambridge University Press, Lecture Notes in Mathematics 64 (1982). TAC reprint.
Jiřı́ Adámek and Jiřı́ Velebil?. A remark on conservative cocompletions of categories. Journal of Pure and Applied Algebra 168.1 (2002): 107-124.
See also Theorem 11.5 of:
See section 6.4 (and Theorem 6.4.3 in particular) of:
For examples:
Adámek, J., Myers, R. S., Urbat, H., & Milius, S. “On continuous nondeterminism and state minimality.” Electronic Notes in Theoretical Computer Science 308 (2014): 3-23.
Mimram, Samuel, and Cinzia Di Giusto. “A categorical theory of patches.” Electronic notes in theoretical computer science 298 (2013): 283-307.
Calin Tataru, “Partial orders are the free conservative cocompletion of total orders.” arXiv:2404.12924 (2024).
Last revised on January 7, 2025 at 01:01:44. See the history of this page for a list of all contributions to it.