Pushforward monads (Q6925595)

Given a monad \(T\) on \(\mathcal{A}\) with a functor \(G:\mathcal{A}\rightarrow\mathcal{B}\), the right Kan extension of \(GT\) along \(T\), when it exists, has a monad structure, the monad of which is the pushforward of \(T\) along \(G\) [\textit{R. Street}, J. Pure Appl. Algebra 2, 149--168 (1972; Zbl 0241.18003), p.155]. This paper explores the property of this construction, studying several examples.\N\NThe synopsis of the paper goes as follows.\N\N\begin{itemize}\N\item[\S 2] develops the theory of pushforward monads in a general 2-category. A universal property satisfied by pushforwards with respect to lax transformations of monads is established (Theorem 2.1.7). The author also identifies a new kind of universal property of pushforwards with respect to colax transformations of monads (Corollary 2.2.6), which later allows of generalizing some ideas already present in \textit{J. Adámek} and \textit{L. Sousa}'s work on \(D\)-ultrafilters [Adv. Math. 377, Article ID 107486, 42 p. (2021; Zbl 1461.18003)].\N\item[\S 3] specializes the above results to the 2-category \textsf{CAT} of locally small categories, giving sufficient conditions for the existence of pushforwards (Proposition 3.1.5) and for the possibility of their iteration (Proposition 3.1.6). The existence of two adjunctions between categories of monads is established (Theorem 3.2.3), which implies that the concepDt of the pseudoconstants of a theory appears naturally from the consideration of pushforwards along \textsf{Set}\(_{\neq\phi} \rightarrow\ \)\textsf{Set} (Example 3.2.5). The last subsection demonstrates that codensity monads are stable under limit completions (Proposition 3.3.5), relating them to \textit{Y. Diers}'s theory of multiadjunctions [J. Pure Appl. Algebra 17, 153--170 (1980; Zbl 0434.18007); J. Pure Appl. Algebra 22, 57--74 (1981; Zbl 0466.18003)] as well as \textit{W. Tholen}'s \(\mathcal{D}\)-pro-adjunctions [Can. J. Math. 36, 144--155 (1984; Zbl 0529.18002)].\N\item[\S 4] studies explicit examples of pushforward monads, examining the pushforward of three different families of monads on \textsf{FinSet} along the inclusion \textsf{FinSet}\(\ \hookrightarrow\ \)\textsf{Set} bsed on \textit{J. F. Kennison} and \textit{D. Gildenhuys}'s result [J. Pure Appl. Algebra 1, 317--346 (1971; Zbl 0234.18006)]. The most striking of these is the pushforward of the powerset monad, which is identified as the filter monad, whose algebras are continuous lattices.\N\end{itemize}