2000 character limit reached
Codescent and bicolimits of pseudo-algebras (2204.06055v4)
Published 12 Apr 2022 in math.CT
Abstract: We categorify cocompleteness results of monad theory, in the context of pseudomonads. We first prove a general result establishing that, in any 2-category, weighted bicolimits can be constructed from oplax bicolimits and bicoequalizers of codescent objects. After prerequisites on pseudomonads and their pseudo-algebras, we give a 2-dimensional Linton theorem reducing bicocompleteness of 2-categories of pseudo-algebras to existence of bicoequalizers of codescent objects. Finally we prove this condition to be fulfilled in the case of a bifinitary pseudomonad, ensuring bicocompleteness.
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.