\documentclass[12pt,titlepage]{article} \usepackage{amsmath} \usepackage{mathrsfs} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsthm} \usepackage{mathtools} \usepackage{graphicx} \usepackage{color} \usepackage{ucs} \usepackage[utf8x]{inputenc} \usepackage{xparse} \usepackage{hyperref} %----Macros---------- % % Unresolved issues: % % \righttoleftarrow % \lefttorightarrow % % \color{} with HTML colorspec % \bgcolor % \array with options (without options, it's equivalent to the matrix environment) % Of the standard HTML named colors, white, black, red, green, blue and yellow % are predefined in the color package. Here are the rest. \definecolor{aqua}{rgb}{0, 1.0, 1.0} \definecolor{fuschia}{rgb}{1.0, 0, 1.0} \definecolor{gray}{rgb}{0.502, 0.502, 0.502} \definecolor{lime}{rgb}{0, 1.0, 0} \definecolor{maroon}{rgb}{0.502, 0, 0} \definecolor{navy}{rgb}{0, 0, 0.502} \definecolor{olive}{rgb}{0.502, 0.502, 0} \definecolor{purple}{rgb}{0.502, 0, 0.502} \definecolor{silver}{rgb}{0.753, 0.753, 0.753} \definecolor{teal}{rgb}{0, 0.502, 0.502} % Because of conflicts, \space and \mathop are converted to % \itexspace and \operatorname during preprocessing. % itex: \space{ht}{dp}{wd} % % Height and baseline depth measurements are in units of tenths of an ex while % the width is measured in tenths of an em. \makeatletter \newdimen\itex@wd% \newdimen\itex@dp% \newdimen\itex@thd% \def\itexspace#1#2#3{\itex@wd=#3em% \itex@wd=0.1\itex@wd% \itex@dp=#2ex% \itex@dp=0.1\itex@dp% \itex@thd=#1ex% \itex@thd=0.1\itex@thd% \advance\itex@thd\the\itex@dp% \makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}} \makeatother % \tensor and \multiscript \makeatletter \newif\if@sup \newtoks\@sups \def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}% \def\reset@sup{\@supfalse\@sups={}}% \def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else% \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}% \else \append@sup#2 \@suptrue \fi% \expandafter\mk@scripts\fi} \def\tensor#1#2{\reset@sup#1\mk@scripts#2_/} \def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2% \reset@sup\mk@scripts#3_/} \makeatother % \slash \makeatletter \newbox\slashbox \setbox\slashbox=\hbox{$/$} \def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$} \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa \copy\slashbox \kern-\@tempdima \box\@tempboxa} \def\slash{\protect\itex@pslash} \makeatother % math-mode versions of \rlap, etc % from Alexander Perlis, "A complement to \smash, \llap, and lap" % http://math.arizona.edu/~aprl/publications/mathclap/ \def\clap#1{\hbox to 0pt{\hss#1\hss}} \def\mathllap{\mathpalette\mathllapinternal} \def\mathrlap{\mathpalette\mathrlapinternal} \def\mathclap{\mathpalette\mathclapinternal} \def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}} \def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}} \def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}} % Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2} \let\oldroot\root \def\root#1#2{\oldroot #1 \of{#2}} \renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}} % Manually declare the txfonts symbolsC font \DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n} \SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n} \DeclareFontSubstitution{U}{txsyc}{m}{n} % Manually declare the stmaryrd font \DeclareSymbolFont{stmry}{U}{stmry}{m}{n} \SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n} % Manually declare the MnSymbolE font \DeclareFontFamily{OMX}{MnSymbolE}{} \DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n} \SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n} \DeclareFontShape{OMX}{MnSymbolE}{m}{n}{ <-6> MnSymbolE5 <6-7> MnSymbolE6 <7-8> MnSymbolE7 <8-9> MnSymbolE8 <9-10> MnSymbolE9 <10-12> MnSymbolE10 <12-> MnSymbolE12}{} % Declare specific arrows from txfonts without loading the full package \makeatletter \def\re@DeclareMathSymbol#1#2#3#4{% \let#1=\undefined \DeclareMathSymbol{#1}{#2}{#3}{#4}} \re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46} \re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12} \re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64} \re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6} \re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77} \re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77} \makeatother % \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE \makeatletter \def\Decl@Mn@Delim#1#2#3#4{% \if\relax\noexpand#1% \let#1\undefined \fi \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}} \def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}} \def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}} \Decl@Mn@Open{\llangle}{mnomx}{'164} \Decl@Mn@Close{\rrangle}{mnomx}{'171} \Decl@Mn@Open{\lmoustache}{mnomx}{'245} \Decl@Mn@Close{\rmoustache}{mnomx}{'244} \makeatother % Widecheck \makeatletter \DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}} \def\@widecheck#1#2{% \setbox\z@\hbox{\m@th$#1#2$}% \setbox\tw@\hbox{\m@th$#1% \widehat{% \vrule\@width\z@\@height\ht\z@ \vrule\@height\z@\@width\wd\z@}$}% \dp\tw@-\ht\z@ \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@ \setbox\tw@\hbox{% \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box \tw@}}}% {\ooalign{\box\tw@ \cr \box\z@}}} \makeatother % \mathraisebox{voffset}[height][depth]{something} \makeatletter \NewDocumentCommand\mathraisebox{moom}{% \IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{% \IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}% }{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}% \mathpalette\@temp{#4}} \makeatletter % udots (taken from yhmath) \makeatletter \def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.} \mkern2mu\raise4\p@\hbox{.}\mkern1mu \raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}} \makeatother %% Fix array \newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}} %% \itexnum is a noop \newcommand{\itexnum}[1]{#1} %% Renaming existing commands \newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}} \newcommand{\widevec}{\overrightarrow} \newcommand{\darr}{\downarrow} \newcommand{\nearr}{\nearrow} \newcommand{\nwarr}{\nwarrow} \newcommand{\searr}{\searrow} \newcommand{\swarr}{\swarrow} \newcommand{\curvearrowbotright}{\curvearrowright} \newcommand{\uparr}{\uparrow} \newcommand{\downuparrow}{\updownarrow} \newcommand{\duparr}{\updownarrow} \newcommand{\updarr}{\updownarrow} \newcommand{\gt}{>} \newcommand{\lt}{<} \newcommand{\map}{\mapsto} \newcommand{\embedsin}{\hookrightarrow} \newcommand{\Alpha}{A} \newcommand{\Beta}{B} \newcommand{\Zeta}{Z} \newcommand{\Eta}{H} \newcommand{\Iota}{I} \newcommand{\Kappa}{K} \newcommand{\Mu}{M} \newcommand{\Nu}{N} \newcommand{\Rho}{P} \newcommand{\Tau}{T} \newcommand{\Upsi}{\Upsilon} \newcommand{\omicron}{o} \newcommand{\lang}{\langle} \newcommand{\rang}{\rangle} \newcommand{\Union}{\bigcup} \newcommand{\Intersection}{\bigcap} \newcommand{\Oplus}{\bigoplus} \newcommand{\Otimes}{\bigotimes} \newcommand{\Wedge}{\bigwedge} \newcommand{\Vee}{\bigvee} \newcommand{\coproduct}{\coprod} \newcommand{\product}{\prod} \newcommand{\closure}{\overline} \newcommand{\integral}{\int} \newcommand{\doubleintegral}{\iint} \newcommand{\tripleintegral}{\iiint} \newcommand{\quadrupleintegral}{\iiiint} \newcommand{\conint}{\oint} \newcommand{\contourintegral}{\oint} \newcommand{\infinity}{\infty} \newcommand{\bottom}{\bot} \newcommand{\minusb}{\boxminus} \newcommand{\plusb}{\boxplus} \newcommand{\timesb}{\boxtimes} \newcommand{\intersection}{\cap} \newcommand{\union}{\cup} \newcommand{\Del}{\nabla} \newcommand{\odash}{\circleddash} \newcommand{\negspace}{\!} \newcommand{\widebar}{\overline} \newcommand{\textsize}{\normalsize} \renewcommand{\scriptsize}{\scriptstyle} \newcommand{\scriptscriptsize}{\scriptscriptstyle} \newcommand{\mathfr}{\mathfrak} \newcommand{\statusline}[2]{#2} \newcommand{\tooltip}[2]{#2} \newcommand{\toggle}[2]{#2} % Theorem Environments \theoremstyle{plain} \newtheorem{theorem}{Theorem} \newtheorem{lemma}{Lemma} \newtheorem{prop}{Proposition} \newtheorem{cor}{Corollary} \newtheorem*{utheorem}{Theorem} \newtheorem*{ulemma}{Lemma} \newtheorem*{uprop}{Proposition} \newtheorem*{ucor}{Corollary} \theoremstyle{definition} \newtheorem{defn}{Definition} \newtheorem{example}{Example} \newtheorem*{udefn}{Definition} \newtheorem*{uexample}{Example} \theoremstyle{remark} \newtheorem{remark}{Remark} \newtheorem{note}{Note} \newtheorem*{uremark}{Remark} \newtheorem*{unote}{Note} %------------------------------------------------------------------- \begin{document} %------------------------------------------------------------------- \section*{generalized multicategory} \hypertarget{context}{}\subsubsection*{{Context}}\label{context} \hypertarget{category_theory}{}\paragraph*{{Category theory}}\label{category_theory} [[!include category theory - contents]] \hypertarget{higher_algebra}{}\paragraph*{{Higher algebra}}\label{higher_algebra} [[!include higher algebra - contents]] \hypertarget{contents}{}\section*{{Contents}}\label{contents} \noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak \noindent\hyperlink{definitions}{Definitions}\dotfill \pageref*{definitions} \linebreak \noindent\hyperlink{cartesian_monads}{Cartesian monads}\dotfill \pageref*{cartesian_monads} \linebreak \noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak \noindent\hyperlink{kleisli_bicategories}{Kleisli bicategories}\dotfill \pageref*{kleisli_bicategories} \linebreak \noindent\hyperlink{examples_2}{Examples}\dotfill \pageref*{examples_2} \linebreak \noindent\hyperlink{double_categories}{Double categories}\dotfill \pageref*{double_categories} \linebreak \noindent\hyperlink{equipments}{Equipments}\dotfill \pageref*{equipments} \linebreak \noindent\hyperlink{virtual_double_categories}{Virtual double categories}\dotfill \pageref*{virtual_double_categories} \linebreak \noindent\hyperlink{examples_3}{Examples}\dotfill \pageref*{examples_3} \linebreak \noindent\hyperlink{units_and_transformations}{Units and transformations}\dotfill \pageref*{units_and_transformations} \linebreak \noindent\hyperlink{equipments_and_normalization}{Equipments and normalization}\dotfill \pageref*{equipments_and_normalization} \linebreak \noindent\hyperlink{obtaining_the_relevant_monads}{Obtaining the relevant monads}\dotfill \pageref*{obtaining_the_relevant_monads} \linebreak \noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak \hypertarget{idea}{}\subsection*{{Idea}}\label{idea} An ordinary [[category]] consists of a set of objects and a set of arrows, each with a single input or domain object and a single output or codomain object. Arrows are composed by plugging outputs into inputs, as when one composes unary operations. An ordinary [[multicategory]] consists of a set of objects and a set of ``multi-arrows'', each with a finite list of inputs or domain objects and a single output or codomain object. These multi-arrows are composed by means of multiple plug-ins or substitutions, as when one substitutes a list of $m$ operations of varying arities into an $m$-ary operation. Both categories and multicategories can be seen as [[monads]] in an appropriate [[bicategory]] of [[span]]-like objects. Categories are monads in the category of ordinary spans (of sets). Multicategories are monads in a bicategory of spans of shape \begin{displaymath} X \leftarrow R \to Y^* \end{displaymath} where $Y^*$ is the set of finite lists of elements of $Y$. In order to compose spans of this type, one uses the fact that $(-)^*$ has itself the structure of a monad on $Set$, namely the [[list monad]] or ``free monoid'' monad. The idea of a \emph{generalized multicategory} is to replace this monad by some more general monad $T$. There are a lot of ways of making this precise, ranging in abstractness from the fairly concrete (cartesian monads on a cartesian category) to the most general and abstract (monads on a [[virtual equipment]]). We will start from the former and gradually generalize to the latter. \hypertarget{definitions}{}\subsection*{{Definitions}}\label{definitions} \hypertarget{cartesian_monads}{}\subsubsection*{{Cartesian monads}}\label{cartesian_monads} Let $V$ be a [[finitely complete category]], and let $T$ be a [[cartesian monad]] on $V$, i.e. a monad whose functor part $T$ preserves pullbacks, and for which the naturality squares of its unit and multiplication are pullbacks. Then there is a [[bicategory]] $Span(V,T)$ of \textbf{$T$-spans} in $V$, whose objects $X$ are objects of $V$, whose morphisms $X \to Y$ are spans from $X$ to $T Y$, and whose 2-cells are morphisms of such spans. The identity $X \to X$ is the span \begin{displaymath} X \overset{id}{\leftarrow} X \overset{\eta X}{\to} T X \end{displaymath} where $\eta: 1_V \to T$ is the unit of $T$. The composite of $T$-spans $R\colon X \to Y$, $S\colon Y \to Z$ is given by taking the following pullback: \begin{displaymath} \itexarray{ & & & & R \circ S & & & &\\ & & & \swarrow & & \searrow & & & \\ & & R & & & & T S & &\\ & ^f \swarrow & & \searrow ^g & & ^{T h} \swarrow & & \searrow ^{T k} & \\ X & & & & T Y & & & & T T Z & \overset{\mu Z}{\rightarrow} & TZ} \end{displaymath} A $T$\textbf{-multicategory} in $V$ is by definition a [[monad]] in the bicategory described above. However, it is convenient to use the alternate word \emph{monoid} rather than \emph{monad} here, to avoid confusion with the monad $T$ which lives \emph{on} $V$, and because the relevant morphisms of monoids (see below) are rather different from any of the usual sort of morphisms of monads. If we spell out what this means more explicitly, a $T$-multicategory consists of an object $C_0$ of $V$, along with a span $C_0 \leftarrow C_1 \to T C_0$, and suitable identity-assigning and composition morphisms. If $C_0$ is the [[terminal object]], then we speak instead of a $T$\textbf{-operad}. \hypertarget{examples}{}\paragraph*{{Examples}}\label{examples} \begin{itemize}% \item When $T$ is the ``free monoid'' monad on $Set$, a $T$-multicategory is precisely an ordinary multicategory. \item When $T$ is the identity monad on $V$, a $T$-multicategory is simply an [[internal category]] in $V$. \item When $T$ is the ``free [[strict ∞-category]]'' monad on [[globular sets]], a $T$-multicategory with $C_0 = 1$ is a [[globular operad]] in the sense of Batanin (this reformulation was found by Leinster). \item If $M$ is a monoid in $Set$ and $T = M\times -$ is the ``free $M$-set'' monad, then a $T$-multicategory is an ``$M$-graded category.'' \item When $T$ is the [[free category]] monad on [[quivers]], a $T$-multicategory is a [[virtual double category]] (also called an \emph{fc-multicategory}, coming from the name ``fc'' for this monad). \item If $A$ is a small category and $T$ is the monad on $Set^{ob(A)}$ whose algebras are functors $A\to Set$, then a $T$-multicategory can be identified with an object of $Cat/A$. \end{itemize} \hypertarget{kleisli_bicategories}{}\subsubsection*{{Kleisli bicategories}}\label{kleisli_bicategories} Note that when $T$ is a cartesian monad on a finitely complete category $V$, then it extends to a (pseudo) [[2-monad]] on the bicategory $Span(V)$. The functor part of this 2-monad is given simply by applying $T$; this is a (pseudo) [[2-functor]] since $T$ preserves pullbacks. The unit of this 2-monad is given by the spans \begin{displaymath} X \overset{id}{\leftarrow} X \overset{\eta X}{\to} T X \end{displaymath} and its multiplication by \begin{displaymath} T T X \overset{id}{\leftarrow} T T \overset{\mu X}{\to} T X; \end{displaymath} these are [[pseudonatural transformations]] since $\eta$ and $\mu$ are cartesian natural transformations. Moreover, the bicategory $Span(V,T)$ defined above is easily seen to be precisely the [[Kleisli category|Kleisli bicategory]] of this extended 2-monad $T$ on $Span(V)$. Thus, a more general notion of ``generalized multicategory'' would be a monad (monoid) in some Kleisli bicategory. \hypertarget{examples_2}{}\paragraph*{{Examples}}\label{examples_2} Are ordinary \emph{symmetric} multicategories the $T$-multicategories relative to any monad $T$? Recall that in a symmetric multicategory, the source of a morphism $f\colon (x_1,\dots,x_n) \to y$ is still an \emph{ordered} list, but we have an action of the symmetric groups on the morphisms, in such a way that for $\sigma\in S_n$ we have $\sigma \cdot f \colon (x_{\sigma 1}, \dots, x_{\sigma n}) \to y$, and composition is equivariant for this action. It doesn't work to let $T$ be the ``free commutative monoid'' monad, since that would destroy all ordering on the lists. (Also, that monad is not cartesian.) Really what we want is to let $T$ be the ``free symmetric strict monoidal category'' monad, since for a discrete set $A$ we have $T A =$ the set of finite ordered lists of elements of $A$, with isomorphisms imposed for all permutations. However, of course this monad does not live on $Set$, but rather on $Cat$. But there is a natural bicategory which extends $Cat$ analogously to how $Span$ extends $Set$, namely the bicategory $Prof$ of categories and [[profunctors]]. The ``free symmetric strict monoidal category'' monad $T$ does extend to a pseudomonad on $Prof$, and symmetric multicategories can be identified with monads $C_0 ⇸ T C_0$ in the Kleisli bicategory of this $T$ such that $C_0$ is a [[discrete category]]. \hypertarget{double_categories}{}\subsubsection*{{Double categories}}\label{double_categories} While the bicategorical framework is very nice, it does not provide a good definition of the \emph{functors} between generalized multicategories. From the explicit point of view, a functor $f\colon C\to D$ between $T$-multicategories should consist of morphisms \begin{displaymath} \array { C_0 & \leftarrow & C_1 & \to & T C_0 \\ ^{f_0} \downarrow & & ^{f_1}\downarrow & & \downarrow^{T f_0}\\ D_0 & \leftarrow & D_1 & \to & T D_0 } \end{displaymath} which respect the identity and structure maps. This reduces to the natural notion of functor in all the examples mentioned above. However, such morphisms cannot be identified with any of the usual notions of ``morphisms of monads'' in the bicategory $Span(V,T)$. The closest thing there is would be a ``colax morphism of monads,'' but that would allow $f_0$ to be an arbitrary \emph{span} rather than a morphism in $V$. We can remedy this problem if instead of the bicategory $Span(V,T)$, we consider a [[pseudo double category]] whose horizontal bicategory is $Span(V,T)$, and whose vertical arrows are the morphisms of $V$. In particular, a square in this double category will be precisely a diagram of the above sort. Thus, if we define a \emph{monoid} in a double category to be the same as monad in its horizontal bicategory, we can also define a \emph{monoid homomorphism} in a double category to consist of a vertical arrow and a square respecting the multiplication and identities, in such a way that monoid homomorphisms in $Span(V,T)$ are precisely the correct functors of $T$-multicategories mentioned above. Thus, a better definition of $T$-multicategory is ``a monoid in the double category $Span(V,T)$,'' since this definition recovers the correct morphisms immediately. And a better generalized definition, which works for symmetric multicategories as well (using the double category of categories, functors, and profunctors), is ``a monoid in a Kleisli double category.'' \hypertarget{equipments}{}\subsubsection*{{Equipments}}\label{equipments} When we try to make the notion of ``Kleisli double category'' precise, however, we run into some issues. We want the ``Kleisli-ness'' to happen \emph{horizontally}, i.e. in the span/profunctor direction. However, in the examples, the monads in question live most naturally in in the 2-category of double categories, functors, and \emph{vertical} natural transformations. For example, when $T$ is a monad on $V$, its multiplication and unit transformations naturally induce vertical transformations $Id_{Span(V)} \to Span(T)$ and $Span(T)^2 \to Span(T)$, where $Span(T)$ denotes the induced functor on $Span(V)$. Similarly, for the ``free symmetric strict monoidal category'' monad on the double category $Prof$, the unit and multiplication are naturally \emph{functors}, i.e. vertical arrows, not profunctors. However, in general, if all we know is that $T$ is a monad on a double category $X$ in the ``vertical'' sense, then there is no way to define a ``horizontally Kleisli'' double category of $T$. The composite of horizontal arrows $A\to T B$ and $B \to T C$ in such a double category would have to be the composite $A\to T B \to T T C \overset{\mu}{\to} T C$, but in a double category there is no way to compose the horizontal arrow $A\to T T C$ with the vertical arrow $\mu\colon T T C \to T C$. Specifically, the problem is that while any (pseudo) double functor between pseudo double categories induces a (pseudo) 2-functor between horizontal bicategories, a vertical transformation does not necessarily induce a pseudonatural one. There are two solutions to this problem, and it turns out that the best approach is to use them both. The first, and most obvious, is to generalize the way in which the monads in these two examples do, in fact, induce pseudomonads on the horizontal bicategory. Namely, in both of the double categories $Span$ and $Prof$, every vertical arrow $f\colon A\to B$ gives rise to a horizontal arrow $B(1,f)\colon A\to B$ in a universal way. This construction, along with its dual, makes $Span$ and $Prof$ into [[framed bicategories]], or equivalently [[proarrow equipments]]. Now in general, a vertical transformation between double categories that are proarrow equipments does not quite induce a \emph{pseudo} natural transformation on horizonal bicategories, but only an \emph{oplax} natural transformation. However, in the examples we have considered so far, the oplax transformations are in fact pseudo, and so there is a horizontally-Kleisli double category (which is easily seen to be, itself, a proarrow equipment). \hypertarget{virtual_double_categories}{}\subsubsection*{{Virtual double categories}}\label{virtual_double_categories} From the double-category point of view, it seems unnatural to require that the unit and multiplication of the monad induce ``horizontally pseudo'' transformations; the vertical transformation of double categories is surely the more basic notion. Moreover, it is also unnatural to require the functor $T$ to be pseudo; there are interesting examples where $T$ is only a (horizontally) \emph{lax} functor. Note that unlike the case for bicategories, there is a 2-category of double categories, lax functors, and vertical transformations, so we can talk about monads in such a 2-category. However, at this level of generality, the horizontal Kleisli construction does not yield a double category. It does, however, yield a [[virtual double category]]. Moreover, it also suffices to take as \emph{input} a monad $T$ on a virtual double category $X$; we write the result of this construction as $HKl(X,T)$. (Recall that for pseudo double categories regarded as virtual ones, functors of virtual double categories can be identified with \emph{lax} functors of pseudo double categories.) Thus a natural and even more general notion of generalized multicategory is ``a monoid in the horizontal-Kleisli virtual double category for some monad $T$ on a virtual double category;'' we call such a thing a \textbf{$T$-monoid}. Note also that for any virtual double category $X$, there is another virtual double category $Mod(X)$ whose objects are monoids in $X$, whose vertical arrows are monoid homomorphisms, and whose horizontal arrows are ``bimodules.'' Therefore, for any monad $T$ on a virtual double category $X$, there is another virtual double category $KMod(X,T) = Mod(HKl(X,T))$ whose objects are $T$-monoids, and whose vertical arrows are $T$-monoid homomorphisms. \hypertarget{examples_3}{}\paragraph*{{Examples}}\label{examples_3} \begin{itemize}% \item If $V$ has pullbacks and $T$ is a monad preserving pullbacks (no condition on $\eta$ and $\mu$), then $T$ induces a monad on the virtual double category (which is actually, of course, a pseudo double category) $Span(V)$. The $T$-monoids in $Span(V)$ are then precisely the $T$-multicategories, as defined above. \item The ``free symmetric strict monoidal category'' monad on $Prof$ can also be regarded as a monad on the virtual double category $Prof$, and its $T$-monoids on a discrete category are [[symmetric multicategories]]. \item If we use instead the ``free category with finite products'' monad on the virtual double category $Prof$, then $T$-monoids on discrete categories can be identified with [[cartesian multicategories]], which include a sub-collection equivalent to that of [[Lawvere theories]]. \item More basically, we also have a ``free strict monoidal category'' monad on $Prof$, whose $T$-monoids on discrete categories are ordinary non-symmetric multicategories. Noting that $Prof = Mod(Span)$, this $T$ is also $Mod(S)$, where $S$ is the ``free monoid'' monad on $Span = Span(Set)$. In fact, quite generally for any monad $S$ on a virtual double category $X$, we can identify $S$-monoids in $X$ with $Mod(S)$-monoids in $Mod(X)$ on ``discrete objects.'' \item The [[ultrafilter monad]] $U$ on $Set$ has a ``canonical'' extension to the virtual double category $Rel$ of sets, functions, and binary relations. Although $Rel$ is a pseudo double category and this monad is a strict functor, $\eta$ is only oplax. The $U$-monoids in $Rel$ can be identified with [[topological spaces]], by an observation originally due to Barr. In this context they are often referred to as [[relational ∞-modules]], where $\beta$ is another name for $U$. \item Similarly, the powerset monad $P$ on $Set$ extends to $Rel$ in a canonical way, and the $P$-monoids in $Rel$ are [[closure space]]s. Topological examples of this sort are sometimes called \textbf{$(T,V)$-algebras}, where $T$ denotes a Set-monad like $U$ or $P$, and $V$ a category (usually a [[quantale]]) of enrichment. \item There is a 2-monad on $Cat-Prof$ (whose objects are [[2-categories]]) whose generalized multicategories are [[2-categories with contravariance]]. \end{itemize} \hypertarget{units_and_transformations}{}\subsubsection*{{Units and transformations}}\label{units_and_transformations} \ldots{} \hypertarget{equipments_and_normalization}{}\subsubsection*{{Equipments and normalization}}\label{equipments_and_normalization} \ldots{} \hypertarget{obtaining_the_relevant_monads}{}\subsection*{{Obtaining the relevant monads}}\label{obtaining_the_relevant_monads} Each of the above contexts for generalized multicategories requires a monad of a certain sort. Various technologies exist for producing examples of such monads, for instance: \begin{itemize}% \item [[clubs]] and [[polynomial monads]] give ways to construct cartesian monads. \item [[relative pseudomonads]] give a way to construct pseudomonads on bicategories like $Prof$. \item [[double clubs]] and [[double polynomials]] give ways to construct monads on double categories. \end{itemize} \hypertarget{references}{}\subsection*{{References}}\label{references} \begin{itemize}% \item [[Tom Leinster]], \emph{Higher Operads, Higher Categories}, London Math. Soc. Lec. Note Series \textbf{298}, \href{http://arxiv.org/abs/math.CT/0305049}{math.CT/0305049}, \href{http://www.maths.gla.ac.uk/~tl/book.html}{another link} \item [[Geoff Cruttwell]] and [[Mike Shulman]], \emph{A unified framework for generalized multicategories}, \href{http://arxiv.org/abs/0907.2460}{arxiv/0907.2460} \item [[Tom Leinster]], \emph{Generalized enrichment for categories and multicategories}, \href{http://arxiv.org/abs/math.CT/9901139}{math.CT/9901139} \item A blog post (of probably many; someone should find some others): \href{http://golem.ph.utexas.edu/category/2009/10/generalized_operads_in_classic.html}{Generalized Operads in Classical Algebraic Topology} \item [[Martin Hyland]], \emph{Elements of a theory of algebraic theories}, \href{http://arxiv.org/abs/1311.7642}{arXiv:1311.7642}. \end{itemize} [[!redirects generalized multicategories]] [[!redirects generalised multicategory]] [[!redirects generalised multicategories]] [[!redirects virtual T-algebra]] [[!redirects virtual T-algebras]] [[!redirects generalized operad]] [[!redirects generalized operads]] [[!redirects (T,V)-algebra]] [[!redirects (T,V)-algebras]] \end{document}