\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*{duoidal category}

\hypertarget{context}{}\subsubsection*{{Context}}\label{context}

\hypertarget{monoidal_categories}{}\paragraph*{{Monoidal categories}}\label{monoidal_categories}

[[!include monoidal categories - contents]]

\hypertarget{duoidal_categories}{}\section*{{Duoidal categories}}\label{duoidal_categories}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak
\noindent\hyperlink{duoidal_categories_2}{Duoidal categories}\dotfill \pageref*{duoidal_categories_2} \linebreak
\noindent\hyperlink{duoidal_functors}{Duoidal functors}\dotfill \pageref*{duoidal_functors} \linebreak
\noindent\hyperlink{virtual_duoidal_categories}{Virtual duoidal categories}\dotfill \pageref*{virtual_duoidal_categories} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{structures_in_duoidal_categories}{Structures in duoidal categories}\dotfill \pageref*{structures_in_duoidal_categories} \linebreak
\noindent\hyperlink{bimonoids_bicomonoids_and_duoids}{Bimonoids, bicomonoids, and duoids}\dotfill \pageref*{bimonoids_bicomonoids_and_duoids} \linebreak
\noindent\hyperlink{rings_and_nearrings}{Rings and near-rings}\dotfill \pageref*{rings_and_nearrings} \linebreak
\noindent\hyperlink{strong_and_commutative_monoids}{Strong and commutative monoids}\dotfill \pageref*{strong_and_commutative_monoids} \linebreak
\noindent\hyperlink{relation_to_intercategories}{Relation to intercategories}\dotfill \pageref*{relation_to_intercategories} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


\hypertarget{idea}{}\subsection*{{Idea}}\label{idea}

A \emph{duoidal category} is a [[category]] with two [[monoidal category|monoidal structures]] which [[interchange law|interchange]] laxly.

\hypertarget{definition}{}\subsection*{{Definition}}\label{definition}

\hypertarget{duoidal_categories_2}{}\subsubsection*{{Duoidal categories}}\label{duoidal_categories_2}

A \textbf{duoidal category}, or \textbf{2-monoidal category}, is a [[pseudomonoid]] in the [[2-category]] $MonCat_l$ of [[monoidal categories]] and [[lax monoidal functors]]. Thus it is a monoidal category, say $(C,\diamond,I)$, together with an additional monoidal structure $(C,\star,J)$ such that $\star:C\times C\to C$ and $J:1\to C$ are [[lax monoidal functors]] with respect to $(\diamond,I)$ and the [[coherence]] axioms of $(C,\diamond,I)$ are [[monoidal natural transformations]] with respect to $(\diamond,I)$. The laxity of $\star$ consists of [[natural transformations]]

\begin{displaymath}
(A\star B) \diamond (C\star D) \to (A\diamond C) \star (B\diamond D)
\end{displaymath}
and

\begin{displaymath}
I\to I\star I
\end{displaymath}
while the laxity of $J$ consists of transformations

\begin{displaymath}
J\diamond J \to J
\end{displaymath}
and

\begin{displaymath}
I \to J.
\end{displaymath}
There are then various axioms, which in particular say that $J$ is a $\diamond$-[[monoid]] and $I$ is a $\star$-[[comonoid]].

It is equivalent to ask that $(C,\diamond,I)$ is a pseudomonoid structure on $(C,\star,J)$ in the 2-category $MonCat_c$ of monoidal categories and \emph{colax} monoidal functors.

The map $I\to J$ is actually determined by the rest of the structure; it is the composite

\begin{displaymath}
I \xrightarrow{\cong} (J\star I)\diamond (I\star J) \to (J\diamond I) \star (I\diamond J) \xrightarrow{\cong} J
\end{displaymath}
as well as the dual composite. If this map is an isomorphism, the duoidal category is called \textbf{normal}.

\hypertarget{duoidal_functors}{}\subsubsection*{{Duoidal functors}}\label{duoidal_functors}

There are three natural kinds of functors between duoidal categories, which are compatibly lax or colax with respect to $\star$ and $\diamond$. The possible choices of lax and colax seem like there should be four, but in fact only three of them work; in the fourth case the compatibility condition would involve wrong-way composites due to the non-invertibility of the duoidal interchange constraints.

\hypertarget{virtual_duoidal_categories}{}\subsubsection*{{Virtual duoidal categories}}\label{virtual_duoidal_categories}

A \textbf{virtual duoidal category} is a pseudomonoid in the 2-category of [[multicategories]]. That is, it is a multicategory with a monoidal structure $(C,\star,J)$: the $\diamond$-monoidal structure is replaced by the multicategory structure. Since every monoidal category can be regarded as a [[representable multicategory]], and multicategory functors correspond exactly to lax monoidal functors, duoidal categories can be identified with virtual duoidal categories in which the multicategory structure is representable.

In particular, note that $J$ in a virtual duoidal category is a functor of multicategories $1\to C$, i.e. precisely a [[monoid]] in the multicategory $C$. As part of this monoid structure it has a unit map $()\to J$; we say that the virtual duoidal category $C$ is \textbf{normal} if this map exhibits $J$ as a unit object for the multicategory structure.

Nearly all the definitions given below for duoidal categories (except for coduoids and colax/colax functors) make sense just as well for virtual ones.

\hypertarget{examples}{}\subsection*{{Examples}}\label{examples}

\begin{itemize}%
\item Any [[braided monoidal category]] can be made into a (normal) duoidal category in which the two monoidal structures agree. The interchange transformation is built out of the braiding. Indeed, by the Eckmann-Hilton argument, a duoidal category whose above structure transformations are invertible necessarily arises in this way (up to equivalence).


\item Similarly but somewhat more generally, an 2-monoidal category, as a special case of [[iterated monoidal category]] (in the sense of Balteanu, Fiedorowicz, Schw\"a{}nzl, and Vogt), is a duoidal category. More precisely, 2-monoidal categories are the duoidal categories such that $\star$ and $J$ are \emph{normal} lax monoidal functors, meaning concretely that the morphisms $I\to I\star I$ and $I\to J$ are isomorphisms.


\item If $(C,\diamond,I)$ is a monoidal category with [[finite products]], then it becomes duoidal with $\star$ the [[cartesian monoidal category|cartesian monoidal structure]]. Dually, if $(C,\star,J)$ is a monoidal category with finite coproducts, then it becomes duoidal with $\diamond$ the cocartesian monoidal structure.


\item If $A$ and $B$ are monoidal categories, with $A$ small and $B$ cocomplete and closed, then the functor category $[A,B]$ is duoidal with $\star$ the pointwise tensor product, $(X\star Y)(a) = X(a) \otimes Y(a)$, and $\diamond$ the [[Day convolution]] tensor product.


\item In particular, if $A$ is a monoid (in Set) and $B$ a cocomplete closed monoidal category, then the category $B^A$ of ``$A$-graded objects of $B$'' is duoidal with $\star$ the pointwise (or ``Hadamard'') product and $\diamond$ the ``Cauchy'' product, $(X\diamond Y)_a = \sum_{b+c=a} X_a \otimes Y_b$. If $B$ is [[pointed category|pointed]], then the interchange law in this case is naturally a [[split mono]], and its canonical retraction gives $B^A$ a different duoidal structure with the roles of $\star$ and $\diamond$ switched.


\item Similarly, the category $[core(FinSet),Vect]$ of vector [[species]] has both a ``Hadamard product'' $(p\diamond q)(I) = p(I) \otimes q(I)$. and a ``Cauchy product'' $(p\star q)(I) = \bigoplus_{I = S\sqcup T} p(S) \otimes q(T)$, and is duoidal in two ways.


\item The category $FF(C)$ of [[functorial factorizations]] on a category $C$ is a duoidal category. The $\star$ product of functorial factorizations $F$ and $F'$ is obtained by $F$-factoring a morphism and then $F'$-factoring the first factor, while the $\diamond$ product is obtained by $F$-factoring a morphism and then $F'$-factoring the \emph{second} factor.


\item The category $C=[V,V]$ of endofunctors of a closed symmetric monoidal category $V$ is \emph{virtually} duoidal, with $\star$ being functor composition the multicategory structure being ``the one that would be represented by Day convolution if it existed''. That is, a morphism $(F,G) \to H$ is a natural transformation $F\otimes G \to H\circ \otimes$ between functors $V\times V \to V$, and so on. This multicategory structure is not generally representable, since the convolution product requires colimits of the size of the domain category, but $V$ can't in general be expected to have $V$-sized colimits. However, if $V$ is monoidally [[locally presentable category|locally presentable]], then we can restrict to the subcategory $End_\kappa(V)$ of $\kappa$-accessible endofunctors, and in this case there is no problem, since $End_\kappa(V) \simeq [V_\kappa,V]$ where $V_\kappa$ is the essentially small subcategory of $\kappa$-presentable objects. If $V=Set$ then this (virtual) duoidal structure is normal with $I=J$ being the identity functor, but for general $V$ it need not be normal.


\item As special case of the preceding when $V=Set$ and $\kappa=\omega$, consider the functor category $[FinSet,Set]$, which is equivalent to the category $[Set,Set]_f$ of [[finitary endofunctors]] of $Set$. Since the composite of finitary endofunctors is finitary, we have an induced composition monoidal structure $\star$. We can define $\diamond$ by convolution with the monoidal structure of $FinSet$, making $[FinSet,Set]$ duoidal.


\item More generally, instead of $End_\kappa(V) = [V_\kappa,V]$ we can consider any category $[V',V]$ where $V'$ is a small monoidal subcategory of $V$ as long as the category of functors $V\to V$ that are left Kan extended from $V'$ is closed under composition. For instance, if $A$ is a monoidal category and $V=[A^{op},Set]$ with $V'=A$, then $[V',V] \simeq Prof(A,A)$ is the category of endo-profunctors of $A$, which is therefore duoidal. More generally, the category of endo-proarrows of any monoidal object in a [[proarrow equipment]] is duoidal by a similar construction: $\star$ is proarrow composition and $\diamond$ is convolution with the monoidal structure on both sides.


\item We can do something similar for [[generalized operads]] with respect to any [[monoidal monad|monoidal]] [[pseudomonad]] on [[Prof]]. For instance, with the pseudomonad for symmetric monoidal categories, we obtain a duoidal structure on the category of [[collections]].



\end{itemize}
\hypertarget{structures_in_duoidal_categories}{}\subsection*{{Structures in duoidal categories}}\label{structures_in_duoidal_categories}

\hypertarget{bimonoids_bicomonoids_and_duoids}{}\subsubsection*{{Bimonoids, bicomonoids, and duoids}}\label{bimonoids_bicomonoids_and_duoids}

In a duoidal category $C$, the category $Mon_\diamond(C)$ of [[monoid]] objects with respect to $\diamond$ is again a monoidal category under the $\star$ product. Specifically, if $A$ and $B$ are $\diamond$-monoids, then the multiplication of $A\star B$ is

\begin{displaymath}
(A\star B) \diamond (A\star B) \to (A\diamond A) \star (B\diamond B) \to A\star B.
\end{displaymath}
We define a \textbf{[[bimonoid]]} in $C$ to be a [[comonoid]] in the monoidal category $(\Mon_\diamond(C),\star)$. An equivalent definition is obtained by considering $\diamond$-monoids in the category of $\star$-comonoids.

Of course, if $C$ is [[braided monoidal category|braided]], this reduces to the usual definition of [[bimonoid]] in a braided monoidal category.

A nontrivially duoidal example is that a bimonoid with respect to the duoidal structure on functorial factorizations described above is precisely an [[algebraic weak factorization system]].

Similarly, a \textbf{[[duoid]]} is defined to be a $\star$-monoid in the monoidal category $(\Mon_\diamond(C),\star)$ of $\diamond$-monoids, while a \emph{coduoid} is a $\diamond$-comonoid in the category of $\star$-comonoids. Duoids, bimonoids, and coduoids in $C$ are equivalently duoidal functors $1\to C$ of the three possible kinds (see above).

\hypertarget{rings_and_nearrings}{}\subsubsection*{{Rings and near-rings}}\label{rings_and_nearrings}

We can define [[near-rig|(near-)]][[rigs]] and near-[[rings]] in a duoidal category, where the additive and multiplicative monoidal structures are expressed with respect to $\star$ and $\diamond$ respectively. Since the distributive law requires duplication of variables, we need the additive monoidal structure to actually be a [[bimonoid]] (or a [[Hopf monoid]] in the case of a ring), and hence that $\star$ is (on its own) braided.

More precisely, let $C$ be a duoidal category such that the tensor $\star$ is braided (and probably some compatibility holds between the braiding and the duoidal structure). A \textbf{near-rig} in $C$ is of an object $R$ together with

\begin{itemize}%
\item A [[bimonoid]] structure on $R$ with respect to the braided monoidal category $(C,\star,J)$, written as addition $add:R\star R \to R$ and ``coaddition'' $\Delta:R\to R\star R$;


\item A [[monoid]] structure on $R$ with respect to $(C,\diamond,I))$, written as multiplication $mult : R \diamond R \to R$;


\item The following diagram commutes, expressing right distributivity:

\begin{displaymath}
\itexarray{
  (R\star R) \diamond R & \xrightarrow{add\diamond id} &
  R\diamond R & \xrightarrow{mult} &
  R\\
  ^{id \diamond \Delta}\downarrow & & & &
  \uparrow^{add}\\
  (R\star R) \diamond (R\star R) &\to &
  (R\diamond R) \star (R\diamond R) & \xrightarrow{mult \star mult} &
  R\star R
}
\end{displaymath}

\item The following diagram commutes, expressing right absorption:

\begin{displaymath}
\itexarray{ 
  R & \xrightarrow{\epsilon} &
  J & \xrightarrow{0} &
  R\\
  ^\cong\downarrow & & & & \uparrow^{mult} \\
  I\diamond R & \to &
  J \diamond R & \xrightarrow{0\diamond id} &
  R\diamond R
}
\end{displaymath}


\end{itemize}
It is a \textbf{near-ring} if the additive bimonoid structure is a [[Hopf monoid]], and a \textbf{rig} or \textbf{ring} if the left distributive law and left absorption also hold.

Of course, this all makes sense in particular in a braided monoidal category regarded as duoidal. In particular, in a [[cartesian monoidal category]], it reduces to the obvious internal definition of (near-)rigs and (near-)rings (since every object of a cartesian monoidal category is a comonoid in a unique way).

One can show that for near-rings, cocommutativity is automatic, in which case the Hopf monoid $(R,add,\Delta)$ can equivalently be regarded as a Hopf monoid in the \emph{cartesian} monoidal category $CComon_\star(C)$ of cocommutative comonoids in $(C, \star, J)$. In this case, the above definitions coincide with the definitions of (near-)rings in the [[colax-distributive rig category]] induced by $\diamond$ and the cartesian structure of $CComon_\star(C)$. However, for general (near)-rigs, the definitions do not coincide, because cocommutativity is not automatic for near-rigs.

\hypertarget{strong_and_commutative_monoids}{}\subsubsection*{{Strong and commutative monoids}}\label{strong_and_commutative_monoids}

Note that the constraints $J\diamond J\to J$ and $I\to J$ make $J$ into a $\diamond$-monoid, and indeed also a bimonoid (since it is certainly a $\star$-comonoid). Also, just as the category of $\diamond$-monoids is $\star$-monoidal, the category of left, right, or bi-$\diamond$-modules over any bimonoid $A$ is $\star$-monoidal, with actions such as

\begin{displaymath}
(M\star N) \diamond A \to (M\star N) \diamond (A\star A) \to (M\diamond A) \star (N\diamond A) \to M\star N.
\end{displaymath}
If $C$ admits reflexive coequalizers preserved in each variable by $\diamond$, then the category of $(A,\diamond)$-bimodules is in fact duoidal, with $\diamond$ the usual tensor product of bimodules. (In the absence of such coequalizers, this category is virtually duoidal.)

We define a \textbf{bistrong $\star$-monoid} in a duoidal category to be a $\star$-monoid in the monoidal category of $J$-$\diamond$-bimodules. In the duoidal categories of endofunctors considered above, this reproduces the usual notion of ``bistrong functor'' (i.e. functor with a compatible left and right [[tensorial strength]]). Note that in a \emph{normal} duoidal category, every object is uniquely a $J$-bimodule, so every $\star$-monoid is bistrong; and conversely, the duoidal category of $(J,\diamond)$-bimodules is (when it exists) always normal.

If the monoidal structure $\diamond$ is [[braided monoidal category|braided]] (compatibly with $\star$), then a one-sided module automatically acquires a module structure on the other side. In this case, we define a \textbf{strong $\star$-monoid} to be a bistrong one whose $J$-$\diamond$-bimodule structure is obtained in this way.

Now let $S$ and $T$ be arbitrary objects and $M$ a (bi)strong $\star$-monoid. We say that two morphisms $\sigma:S\to M$ and $\tau:T\to M$ be morphisms \textbf{commute} if the following diagram commutes:

\begin{displaymath}
\itexarray{
  T\diamond S & \xrightarrow{\cong} &
  (T\star J) \diamond (J \star S) & \to &
  (T\diamond J) \star (J\diamond S) \\
  ^\cong\downarrow  &&&& \downarrow^{\tau \star \sigma}\\
  (J\star T) \diamond (S \star J) &&&& M\star M\\
  \downarrow &&&& \downarrow^{mult}\\
  (J\diamond S) \star (T\diamond J) & \xrightarrow{\sigma \star \tau} &
  M\star M & \xrightarrow{mult} & M.
}
\end{displaymath}
We say that $M$ is \textbf{commutative} if $id_M$ and $id_M$ commute.

In a braided monoidal category regarded as a normal duoidal one, this reduces to the usual notion of [[commutative monoid]] object. On the other hand, in the endofunctor-like examples above, it results in the notion of [[commutative monad]] or [[commutative theory]].

\hypertarget{relation_to_intercategories}{}\subsection*{{Relation to intercategories}}\label{relation_to_intercategories}

A duoidal category is the same as an [[intercategory]] with one object and only identity horizontal arrows, vertical arrows, horizontal cells, and vertical cells. The objects of the duoidal category are the basic cells of the intercategory, and its morphisms are the cubes. Like duoidal categories, intercategories support three (but not four) different kinds of morphism.

\hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts}

\begin{itemize}%
\item [[distributivity for monoidal structures]]
\item [[intercategory]]

\end{itemize}
\hypertarget{references}{}\subsection*{{References}}\label{references}

\begin{itemize}%
\item [[Marcelo Aguiar]] and [[Swapneel Mahajan]], \emph{Monoidal Functors, Species and Hopf Algebras}, \href{http://www.math.cornell.edu/~maguiar/a.pdf}{pdf}. Here the notion is called a ``2-monoidal category''.


\item [[Richard Garner]], \emph{Understanding the small object argument}, \href{http://arxiv.org/abs/0712.0724}{arXiv}. Here the notion is called a ``2-fold monoidal category'', although [[iterated monoidal category|that term]] is also used for the case when the two units coincide.


\item [[Michael Batanin]] and [[Martin Markl]], \emph{Centers and homotopy centers in enriched monoidal categories.} Advances in Mathematics 230 , 4-6 (2012), 1811–1858. Here apparently the term ``duoidal category'' was introduced.


\item [[Richard Garner]], [[Ignacio López Franco]], \emph{Commutativity}, \href{http://arxiv.org/abs/1507.08710}{arXiv}. See also \emph{Commutativity and tensor products of theories, monads, and operads}, talk at CT2013, \href{https://www.dpmms.cam.ac.uk/~ill20/ct2013-talk.pdf}{slides}


\item Zoran Petri and [[Todd Trimble]] 2014, \emph{Symmetric bimonoidal intermuting categories and $\omega \times \omega$ reduced bar constructions}, Applied Categorical Structures 22(3): 467-499, \href{http://arxiv.org/abs/0906.2954}{arXiv:0906.2954}



\end{itemize}
[[!redirects duoidal category]] [[!redirects duoidal categories]] [[!redirects 2-monoidal category]] [[!redirects 2-monoidal categories]]

[[!redirects virtual duoidal category]] [[!redirects virtual duoidal categories]]



\end{document}