Papers
Topics
Authors
Recent
Search
2000 character limit reached

Codescent and bicolimits of pseudo-algebras

Published 12 Apr 2022 in math.CT | (2204.06055v4)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.