Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pushforward monads

Published 21 Jun 2024 in math.CT and math.AC | (2406.15256v2)

Abstract: Given a monad $T$ on $\mathscr{A}$ and a functor $G \colon \mathscr{A} \to \mathscr{B}$, one can construct a monad $G_#T$ on $\mathscr{B}$ subject to the existence of a certain Kan extension; this is the pushforward of $T$ along $G$. We develop the general theory of this construction in a $2$-category, giving two universal properties it satisfies. In the case of monads in $\mathsf{CAT}$, this gives, among other things, two adjunctions between categories of monads on $\mathscr{A}$ and $\mathscr{B}$. We conclude by computing the pushforward of several familiar monads on the category of finite sets along the inclusion $\mathsf{FinSet} \hookrightarrow \mathsf{FinSet}$, which produces the monad for continuous lattices, among others. We also show that, with two trivial exceptions, these pushforwards never have rank.

Authors (1)

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.

Collections

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

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.