\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*{cartesian bicategory}

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

\hypertarget{2category_theory}{}\paragraph*{{2-Category theory}}\label{2category_theory}

[[!include 2-category theory - contents]]

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

[[!include monoidal categories - contents]]

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{technical_preliminaries}{Technical preliminaries}\dotfill \pageref*{technical_preliminaries} \linebreak
\noindent\hyperlink{2adjunctions_between_2categories}{2-adjunctions between 2-categories}\dotfill \pageref*{2adjunctions_between_2categories} \linebreak
\noindent\hyperlink{lax_adjunctions_between_2categories}{Lax adjunctions between 2-categories}\dotfill \pageref*{lax_adjunctions_between_2categories} \linebreak
\noindent\hyperlink{the_2category_}{The 2-category $Map(B)$}\dotfill \pageref*{the_2category_} \linebreak
\noindent\hyperlink{definition_of_cartesian_structure_and_basic_results}{Definition of cartesian structure and basic results}\dotfill \pageref*{definition_of_cartesian_structure_and_basic_results} \linebreak
\noindent\hyperlink{symmetric_monoidal_structure_via_cartesian_structure}{Symmetric monoidal structure via cartesian structure}\dotfill \pageref*{symmetric_monoidal_structure_via_cartesian_structure} \linebreak
\noindent\hyperlink{comparison_with_carboniwalters}{Comparison with Carboni-Walters}\dotfill \pageref*{comparison_with_carboniwalters} \linebreak
\noindent\hyperlink{local_cartesian_products}{Local cartesian products}\dotfill \pageref*{local_cartesian_products} \linebreak
\noindent\hyperlink{essential_uniqueness_of_cartesian_structure}{Essential uniqueness of cartesian structure}\dotfill \pageref*{essential_uniqueness_of_cartesian_structure} \linebreak
\noindent\hyperlink{cartesian_bicategories_and_hyperdoctrines}{Cartesian bicategories and hyperdoctrines}\dotfill \pageref*{cartesian_bicategories_and_hyperdoctrines} \linebreak
\noindent\hyperlink{frobenius}{Frobenius conditions}\dotfill \pageref*{frobenius} \linebreak


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

A \textbf{cartesian bicategory} is a [[bicategory]] with properties that make it behave like a bicategory of generalized [[relations]].

Examples of cartesian bicategories include

\begin{itemize}%
\item the bicategory [[Rel]] of sets and relations,
\item more generally, the [[bicategory of relations]] of a [[regular category]],
\item the bicategory [[Span]] of sets and spans,
\item more generally, the bicategory of [[spans]] in a finitely [[complete category]],
\item the bicategory [[profunctor|Prof]] of (small) categories and profunctors,
\item more generally, the bicategory of internal categories and [[modules]] ([[profunctors]]) in a finitely complete category $C$,
\item as an alternative generalization, the bicategory of enriched categories and modules over a \emph{cartesian} monoidal category $V$.
\item ??(This is a guess) the bicategory of bialgebroids and modules in a general symmetric monoidal category $V$.

\end{itemize}
Non-examples include

\begin{itemize}%
\item the locally-discrete bicategory [[Set]] of sets and functions,
\item the bicategory [[Prof]] of categories and profunctors,
\item the bicategory of profunctors and enriched in a \emph{noncartesian} monoidal category $V$.

\end{itemize}
Consider for example the bicategory [[Rel]]. This bicategory admits a symmetric monoidal structure given by the cartesian product. Because the cartesian product is \emph{not} the categorical product, this symmetric monoidal structure is \emph{not} [[cartesian monoidal category|cartesian monoidal]]. However, the cartesian product restricts to the locally-discrete sub-bicategory [[Set]] of sets and functions, on which it \emph{is} the categorical product. Note that a relation is the graph of a function if and only if it possesses a right adjoint (which is given by the opposite relation). In a general bicategory, a 1-cell is called \emph{map-like} if it possesses a right adjoint, and these are the 1-cells playing the role that functions play in $Rel$.

Generalizing this situation, a cartesian bicategory $B$ is a symmetric monoidal bicategory for which the monoidal product restricts to the categorical product on the sub-bicategory of map-like 1-cells, subject to natural compatibility conditions. Remarkably, the structure of such a tensor is [[property-like structure|property-like]] (is essentially unique when it exists). Thus the definition can be formulated directly in terms of the bicategory $B$ without mentioning a symmetric monoidal structure at all. Not only is this technically convenient (as the precise definition of a symmetric monoidal bicategory is quite technical), but it is moreover a very natural perspective to take.

Like allegories, cartesian bicategories provide a convenient abstract setting in which to study the calculus of relations, but unlike allegories they embrace higher examples like $Span$ and $Mod$. The original idea, as explained by Carboni and Walters in their paper, clearly had these various examples in mind but was initially confined to the locally posetal case; in part this was due to the lack at the time (circa 1987) of a complete definition of symmetric monoidal bicategories. In more recent years a full bicategorical treatment has emerged, due principally to Carboni, Kelly, Verity, and Wood. The alternative treatment we give below has not yet appeared in the literature as far as this author ([[Todd Trimble]]) is aware.

\hypertarget{technical_preliminaries}{}\subsection*{{Technical preliminaries}}\label{technical_preliminaries}

Note: All compositions will be written in the traditional order, in which application proceeds from right to left.

We work with familiar notions of the theory of bicategories (which, for reasons of consonance with 2-terminology, we also call 2-categories) but in some cases under new names. We calculate with pasting diagrams in 2-categories as if they were strict 2-categories.

Our notion of morphism between 2-categories has gone under various names: ``homomorphism'' in the sense of B\'e{}nabou, also known as ``pseudofunctor'' or weak 2-functor, where the structural constraints are isomorphisms. Here they are simply called \textbf{2-functors}.

Each 2-category $B$ gives rise to a hom 2-functor $hom: B^{op} \times B \to Cat$, which we denote by $B(-, -)$, with the contravariant argument in the first place as is customary.

Given 2-functors $F, G: B \to C$, it is for our purposes convenient to use the [[lax natural transformation|lax notion of morphism]] $\theta: F \to G$ between 2-functors for which the structural cells $\theta \cdot f$ (for 1-cells $f: a \to b$ in $B$) point in the direction

\begin{displaymath}
\itexarray{
F a & \overset{\theta a}{\to} & G a\\
F f \downarrow & \overset{\theta \cdot f}{\Rightarrow} & \downarrow G f\\
F b & \underset{\theta b}{\to} & G b
}
\end{displaymath}
These are called ``oplax transformations'' by some authors such as B\'e{}nabou and ``lax transformations'' by other authors such as Johnstone; on this page we will simply call them (2-)\textbf{transformations}. A transformation is \textbf{strong} if the structural cells $\theta \cdot f$ are isomorphisms.

There is a well-known notion of morphism between transformation which has been called [[modification]]. We retain this usage, but as an aside we counsel against inventing a new term (e.g., ``perturbation'' between modifications) every time a new level of morphism is reached -- a more uniform terminology is called for. The term ``transfor'' (due to Sjoerd Crans) has been tentatively adopted elsewhere on this site; modifications may then be called \textbf{2-transfors}.

In any case, given 2-categories $B$ and $C$, there is a 2-category of 2-functors, strong transformations and modifications from $B$ to $C$; this will be denoted $Hom_s(B, C)$. We have also the 2-category of 2-functors, transformations, and modifications; this will be denoted $Hom_l(B, C)$.

\hypertarget{2adjunctions_between_2categories}{}\subsubsection*{{2-adjunctions between 2-categories}}\label{2adjunctions_between_2categories}

A \textbf{2-adjunction} $F \dashv G$ consists of 2-functors $F: B \to C$, $G: C \to B$, and an adjoint equivalence

\begin{displaymath}
C(F -, -) \simeq B(-, G -)
\end{displaymath}
in the 2-category $Hom_s(B^{op} \times C, Cat)$. In more elementary terms, the data of a 2-adjunction is given by strong transformations

\begin{displaymath}
\eta: 1_B \to G F \qquad \varepsilon: F G \to 1_C
\end{displaymath}
and invertible modifications (called \emph{triangulators})

\begin{displaymath}
\itexarray{
G & \overset{\eta G}{\to} & G F G & & & & F & \overset{F\eta}{\to} & F G F\\ 
1_G \downarrow & \overset{s}{\Rightarrow} & \downarrow G \varepsilon & & & & 1_F \downarrow & \overset{t}{\Leftarrow} & \downarrow \varepsilon F\\ 
G & \underset{1_G}{\to} & G & & & & F & \underset{1_F}{\to} & F
}
\end{displaymath}
such that the \emph{triangulator coherence conditions} hold: there are pasting diagram equalities

\begin{displaymath}
\itexarray{
1_B & \overset{\eta}{\to} & G F & \overset{1_{G F}}{\to} & G F\\
\eta \downarrow & \overset{\eta \cdot \eta}{\Rightarrow} & \downarrow G F \eta & & \downarrow 1_{G F}\\ 
G F & \underset{\eta G F}{\to} & G F G F & \overset{G t}{\Rightarrow} & G F & & & = & 1_{\eta}\\
1_{G F} \downarrow & & \overset{s F}{\Rightarrow} & G \varepsilon F \searrow & \downarrow 1_{G F} \\
G F & \underset{1_{G F}}{\to} & G F & \underset{1_{G F}}{\to} & G F 
}
\end{displaymath}
$\,$

\begin{displaymath}
\itexarray{
F G & \overset{1_{F G}}{\to} & F G & \overset{1_{F G}}{\to} & F G\\
1_{F G} \downarrow & F \eta G \searrow & \overset{t G}{\Rightarrow} & & \downarrow 1_{F G}\\
F G & \overset{F s}{\Rightarrow} & F G F G & \overset{\varepsilon F G}{\to} & F G & & & = & 1_{\varepsilon}\\
1_{F G} \downarrow & & F G \varepsilon \downarrow & \overset{\varepsilon \cdot \varepsilon}{\Rightarrow} & \downarrow \varepsilon\\
F G & \underset{1_{F G}}{\to} & F G & \underset{\varepsilon}{\to} & 1
}
\end{displaymath}
\hypertarget{lax_adjunctions_between_2categories}{}\subsubsection*{{Lax adjunctions between 2-categories}}\label{lax_adjunctions_between_2categories}

A \textbf{lax} adjunction is defined in the same way as a 2-adjunction, except that we relax (remove) the assumptions that $\eta$ and $\varepsilon$ are strong and that $s$, $t$ are invertible; the triangulator coherence conditions are still in effect. In that case, for objects $b$ of $B$ and $c$ of $C$, there is a local adjunction between hom-categories

\begin{displaymath}
(L: B(b, G c) \to C(F b, c)) \dashv (R: C(F b, c) \to B(b, G c))
\end{displaymath}
given by $L(g: b \to G c) = (F b \overset{F g}{\to} F G c \overset{\varepsilon c}{\to} c)$ and $R(f: F b \to c) = (b \overset{\eta b}{\to} G F b \overset{G f}{\to} G c)$. The unit of $L \dashv R$ at $g: b \to G c$ is given by the pasting

\begin{displaymath}
\itexarray{
b & \overset{g}{\to} & G c & \overset{1_{G c}}{\to} & G c\\
\eta b \downarrow & \overset{\eta \cdot g}{\Leftarrow} & \downarrow \eta G c & \overset{s c}{\Leftarrow} & \downarrow 1_{G c}\\
G F b & \underset{G F g}{\to} & G F G c & \underset{G \varepsilon}{\to} & G c
}
\end{displaymath}
and the counit of $L \dashv R$ at $f: F b \to c$ is given by the pasting

\begin{displaymath}
\itexarray{
F b & \overset{F \eta b}{\to} & F G F b & \overset{F G f}{\to} & F G c\\
1_{F b} \downarrow & \overset{t b}{\Leftarrow} & \downarrow \varepsilon F b & \overset{\varepsilon \cdot f}{\Leftarrow} & \downarrow \varepsilon c\\
F b & \underset{1_{F b}}{\to} & F b & \underset{f}{\to} & c
}
\end{displaymath}
The triangular equations for $L \dashv R$ follow from the triangulator coherence conditions. (Warning: it is not generally true that a lax adjunction induces an adjoint pair in $Hom_l(B^{op} \times C, Cat)$. Cf. lemma 1 below.)

\hypertarget{the_2category_}{}\subsubsection*{{The 2-category $Map(B)$}}\label{the_2category_}

Let $B$ be a 2-category. Following Carboni and Walters, we define a \emph{map} in $B$ to be a 1-cell in $B$ that possesses a right adjoint. It is useful to think of them as playing the role of ``functional relations'' in an ambient 2-category of relations. We let $Map(B)$ be the locally full sub-2-category whose 0-cells are those of $B$ and whose 1-cells are the maps in $B$. We observe that every 2-functor $F: B \to C$ restricts to a 2-functor $F|: Map(B) \to Map(C)$, and by the following proposition, every transformation $\theta: F \to G$ restricts to a strong transformation $\theta$ in $Hom_s(Map(B), C)$:

\textbf{Proposition 1:} If $f: b \to c$ is a map in $B$, then $\theta \cdot f$ is invertible.

\textbf{Proof:} Let $f^*$ denote a right adjoint of $f$. It is easily verified that the diagram

\begin{displaymath}
\itexarray{
F b & \overset{F f}{\to} & F c & \overset{\theta c}{\to} & G c & \overset{1_{G c}}{\to} & G c\\
1_{F b} \downarrow & \Rightarrow & F f^* \downarrow & \overset{\theta \cdot f^*}{\Rightarrow} & \downarrow G f^* & \Rightarrow & \downarrow 1_{G c}\\
F b & \underset{1_{F b}}{\to} & F b & \underset{\theta b}{\to} & G b & \underset{G f}{\to} & G c
}
\end{displaymath}
pastes to give the inverse $(\theta \cdot f)^{-1}$, where the left and right squares are the unit and counit of adjunctions $F f \dashv F f^*$, $G f \dashv G f^*$.

A transformation $\theta: F \to G: B \to C$ is \textbf{map-valued} if each 1-cell $\theta b$ is a map in $C$. By the previous proposition, a map-valued transformation $\theta$ in $Hom_l(B, C)$ restricts to a strong transformation $\theta|: F| \to G|$ in $Hom_s(Map(B), Map(C))$.

\begin{itemize}%
\item \textbf{Warning:} In general it is imprecise to identify maps in a 2-category with the ``functional relations''. That is, for some of the standard examples of cartesian bicategories, such as $B = Prof$, we cannot simply identify $Map(B)$ with $Cat$: 1-cell equivalences are only Morita equivalences, not $Cat$-equivalences. A better adapted framework is one of a bicategory with a proarrow equipment, or a [[framed bicategory]]. Eventually this article will be rewritten with this remark in mind\ldots{}

\end{itemize}
\hypertarget{definition_of_cartesian_structure_and_basic_results}{}\subsection*{{Definition of cartesian structure and basic results}}\label{definition_of_cartesian_structure_and_basic_results}

A \textbf{cartesian structure} on a bicategory $B$ consists of the following data:

\begin{itemize}%
\item 2-functors $\otimes: B \times B \to B$ and $I: \mathbf{1} \to B$, where $\mathbf{1}$ is the terminal 2-category;


\item Map-valued transformations

\begin{displaymath}
\delta: 1_B \to \otimes \Delta, \qquad \pi: \Delta \otimes \to 1_{B \times B}, \qquad \varepsilon: 1_B \to I !
\end{displaymath}
where $\Delta: B \to B \times B$ is the diagonal 2-functor and $!: B \to \mathbf{1}$ is the unique 2-functor;


\item Invertible modifications

\begin{displaymath}
\itexarray{
\otimes & \overset{\delta \otimes}{\to} & \otimes \Delta \otimes & & & & \Delta & \overset{\Delta \delta}{\to} & \Delta \otimes \Delta & & & & I & \overset{\varepsilon I}{\to} & I ! I\\
\mathllap{1_{\otimes}} \downarrow & \overset{s}{\Rightarrow} & \downarrow \mathrlap{\otimes \pi} & & & & \mathllap{1_{\Delta}} \downarrow & \overset{t}{\Leftarrow} & \downarrow \mathrlap{\pi \Delta} & & & & \mathllap{1_{I}} \downarrow & \overset{u}{\Rightarrow} & \downarrow \mathrlap{I \cdot id}\\
\otimes & \underset{1_{\otimes}}{\to} & \otimes & & & & \Delta & \underset{1_{\Delta}}{\to} & \Delta & & & & I & \underset{1_I}{\to} & I
}
\end{displaymath}
satisfying the triangulator coherence conditions. $\Box$



\end{itemize}
The crucial observation is that, by proposition 1, this data restricts to give 2-adjunctions

\begin{displaymath}
(Map(B) \overset{\Delta}{\to} Map(B) \times Map(B)) \dashv (Map(B) \times Map(B) \overset{\otimes}{\to} Map(B))
\end{displaymath}
\begin{displaymath}

\end{displaymath}
\begin{displaymath}
(Map(B) \overset{!}{\to} \mathbf{1}) \dashv (\mathbf{1} \overset{I}{\to} Map(B))
\end{displaymath}
making the restriction of $\otimes$ to $Map(B)$ a \emph{2-product} on $Map(B)$ with 2-terminal object $I$. Naturally this finite 2-product structure on $Map(B)$ is property-like: is uniquely determined up to equivalence which is uniquely specified up to unique isomorphism.

A little later we will argue that cartesian structure on the full bicategory $B$ is also property-like; the main thing is to see that the way in which $\otimes$ acts on 1-cells is essentially uniquely determined.

\hypertarget{symmetric_monoidal_structure_via_cartesian_structure}{}\subsubsection*{{Symmetric monoidal structure via cartesian structure}}\label{symmetric_monoidal_structure_via_cartesian_structure}

We now argue that a cartesian bicategory $B$ carries a symmetric monoidal structure whose tensor product is

\begin{displaymath}
\otimes: B \times B \to B
\end{displaymath}
The proof is pretty easy to sketch, once the fact is admitted that the induced 2-product structure makes $Map(B)$ a symmetric monoidal bicategory. This fact about 2-products, while never in dispute, was given a complete proof only in the past few years by the late Max Kelly, and we freely take advantage of it below.

First, given objects $a, b, c$ of $B$, we may regard them as objects of $Map(B)$, where there is an associativity constraint

\begin{displaymath}
\alpha_{a, b, c}: (a \otimes b) \otimes c \to a \otimes (b \otimes c)
\end{displaymath}
on $Map(B)$ which is definable by exploiting 2-universal properties of the 2-product. The associativity thus has an expression in terms of $\otimes$, $\delta$, and $\pi$ which are globally defined on $B$, hence $\alpha$ is globally defined as a transformation on $B$. By similar considerations, the symmetry and unit constraints on $Map(B)$ also extend to globally defined transformations on $B$. We argue in a moment that these constraints are strong (adjoint) equivalences.

Symmetric monoidal structure on $B$ also demands various structural modifications (such as a Yang-Baxter modification $R_{\bullet |\bullet, \bullet}$) satisfying various coherence conditions, but the components of such modifications ($R_{a|b, c}$, say) are defined by regarding their components $a, b, c$ as objects of $Map(B)$ and using the corresponding modifications there. Again, each such modification on $Map(B)$ is defined in terms of 2-adjunction data $\otimes$, $I$, $\delta$, $\pi$, $\varepsilon$, $s$, $t$, $u$ which are globally defined on $B$, so each such structure is a modification on $B$. Various coherence conditions on the modifications must be checked, but the conditions hold at every choice of objects of $B$ by regarding them as objects of $Map(B)$ and using the symmetric monoidal structure there, so the conditions hold on $B$.

Now we check that the structural transformations $\alpha$ are strong adjoint equivalences. Indeed, when regarded as being defined on $Map(B)$, the constraint $\alpha$ is an equivalence and so has a left adjoint (with invertible unit and counit) $\alpha^-$ with components

\begin{displaymath}
\alpha_{a, b, c}^{-}: a \otimes (b \otimes c) \to (a \otimes b) \otimes c
\end{displaymath}
and just like $\alpha$, $\alpha^-$ is definable in terms of global structure on $B$, making $\alpha^-$ a transformation on $B$. Then $\alpha$, and by similar reasoning the symmetry and unit constraints, are strong transformations on $B$ by the following lemma:

\textbf{Lemma 1:} If $\alpha$ is a right adjoint in $Hom_l(C, B)$, then the transformation $\alpha$ is strong. Consequently, if $\alpha^- \dashv \alpha$ is an adjoint equivalence, so that both $\alpha^- \dashv \alpha$ and $\alpha \dashv \alpha^-$, then $\alpha^- \dashv \alpha$ is a strong adjoint equivalence in $Hom_s(C, B)$.

\textbf{Proof:} Only the first statement requires proof. Given $r: c \to d$ in $C$, let $ev_c: Hom_l(C, B) \to B$ denote the 2-functor which evaluates at $c$ (keep in mind that the 1-cells in $Hom_l(C, B)$ are transformations which are oplax in the sense of B\'e{}nabou), and let $ev_r: ev_c \to ev_d$ denote the evident transformation; this is \emph{lax} in the sense of B\'e{}nabou. Then, by dualizing proposition 1, $ev_r(\alpha) = \alpha \cdot r$ is an isomorphism if $\alpha$ is a \emph{right} adjoint. Since $\alpha \cdot r$ is an isomorphism for all 1-cells $r$ in $C$, it follows that $\alpha$ is strong. $\Box$

This completes the argument that the symmetric monoidal structure on $Map(B)$ extends to $B$.

\hypertarget{comparison_with_carboniwalters}{}\subsubsection*{{Comparison with Carboni-Walters}}\label{comparison_with_carboniwalters}

Let us begin unpacking the terse definition of cartesian bicategory so that it becomes more recognizable. For the sake of notational convenience, we use the fact that as a monoidal bicategory, a cartesian bicategory may be strictified and replaced by a (monoidally biequivalent) $Gray$ monoid $B$. That is to say, if $\otimes_G$ denotes the tensor product of the symmetric monoidal closed category $Gray$, then there is firstly a biequivalence $B \times B \simeq B \otimes_G B$, and we may transfer the data of the cartesian structure across this biequivalence to get a $Gray$ monoid multiplication

\begin{displaymath}
\otimes: B \otimes_G B \to B
\end{displaymath}
together with a corresponding diagonal

\begin{displaymath}
B \overset{\Delta}{\to} B \times B \simeq B \otimes_G B
\end{displaymath}
which we again denote by $\Delta$. In that case, given a 1-cell $r: a \to b$ in $B$, we may write structure cells $\delta \cdot r$ for the transformation $\delta: 1_B \to \otimes \Delta$ in the form

\begin{displaymath}
\itexarray{
a & \overset{\delta a}{\to} & a \otimes a\\
r \downarrow & \overset{\delta \cdot r}{\Rightarrow} & \downarrow r \otimes r\\
b & \underset{\delta b}{\to} & b \otimes b
}
\end{displaymath}
where to be definite we make the convention that $r \otimes r := (r \otimes 1)(1 \otimes r)$.

An object $c$ of $B$, viewed as an object of a 2-category $Map(B)$ with 2-products, naturally carries a 2-comonoid (or pseudocomonoid) structure; the unit of the 2-adjunction $\Delta \dashv \otimes$ is the diagonal map

\begin{displaymath}
\delta c: c \to c \otimes c,
\end{displaymath}
i.e., the 2-comonoid comultiplication. The unit of the 2-adjunction $! \dashv I$ is the projection to the 2-terminal object

\begin{displaymath}
\varepsilon c: c \to I,
\end{displaymath}
i.e., the 2-comonoid counit. (It is more usual to denote a (2-)terminal object by the symbol $1$, and from here on we will follow that practice, writing the projection as $\varepsilon c: c \to 1$, and forget $I$.)

Spelling this out a little further, let us turn attention to the transformation $\pi: \Delta \otimes \to 1_{B \otimes_G B}$. The components of the transformation take the form

\begin{displaymath}
\pi (a, b) = \langle \pi_1, \pi_2 \rangle: (a \otimes b, a \otimes b) \to (a, b)
\end{displaymath}
where, as a consequence of how the 2-product $\otimes$ on $Map(B)$ is defined, we have the following formulas for the projections $\pi_1$, $\pi_2$:

\begin{displaymath}
\pi_1 = (a \otimes b \overset{1_a \otimes \varepsilon}{\to} a \otimes 1 \cong a); \qquad \pi_2 = (a \otimes b \overset{\varepsilon \otimes 1_b}{\to} 1 \otimes b \cong b
\end{displaymath}
Thus, the unit and counit data $\delta$, $\pi$ are expressible in terms of the symmetric monoidal 2-category structure and the comonoid structures on the objects therein.

Finally, for a given 1-cell $r: c \to d$ in $B$, the structure cells

\begin{displaymath}
\itexarray{
c & \overset{\delta c}{\to} & c \otimes c & & & & c & \overset{\varepsilon c}{\to} & 1\\
r \downarrow & \overset{\delta \cdot r}{\Rightarrow} & \downarrow r \otimes r & & & & r \downarrow & \overset{\varepsilon \cdot r}{\Rightarrow} & \downarrow id_1\\
d & \underset{\delta d}{\to} & d \otimes d & & & & d & \underset{\varepsilon d}{\to} & 1
}
\end{displaymath}
exhibit $r: c \to d$ as a colax morphism of 2-comonoids; if $r$ is a map, then $\delta \cdot r$ and $\varepsilon \cdot r$ are isomorphisms and $r$ becomes a strong morphism of 2-comonoids. This may be appreciated more fully by considering specific examples such as $B = Rel$ (where maps are functions, which become comonoid morphisms by virtue of naturality of diagonal and projection maps), and $B = Mod$.

Carboni and Walters define a cartesian bicategory to be a symmetric monoidal bicategory in which each object carries a 2-comonoid structure (for which the comultiplication and counit are \emph{maps}), and each 1-cell is a colax morphism between the corresponding comonoid structures. However, spelling this approach out in full detail leads to a rather largish definition; it seems more efficient to approach the definition by taking advantage of some high-level 2-categorical algebra as we have done here, and deriving the structures envisaged by Carboni and Walters as a consequence.

\hypertarget{local_cartesian_products}{}\subsubsection*{{Local cartesian products}}\label{local_cartesian_products}

The definition of cartesian structure \emph{a fortiori} involves \emph{lax} adjunctions (in the sense explained earlier)

\begin{displaymath}
\Delta \dashv_{lax} \otimes: B \times B \to B \qquad ! \dashv_{lax} I: \mathbf{1} \to B
\end{displaymath}
and by our earlier discussion of lax adjunctions, this means we have local 1-adjunctions of the form

\begin{displaymath}
(B(a, b \otimes c) \stackrel{\lambda}{\to} (B \times B)(\langle a, a \rangle, \langle b, c \rangle)) \dashv (B \times B)(\langle a, a \rangle, \langle b, c \rangle)) \stackrel{\rho}{\to} B(a, b \otimes c))
\end{displaymath}
Now let $b = c$, and use the fact that we have an adjunction

\begin{displaymath}
(b \stackrel{\delta b}{\to} b \otimes b) \dashv (b \otimes b \stackrel{\delta b^{\ast}}{\to} b)
\end{displaymath}
to obtain an adjoint pair where

\begin{displaymath}
B(a, b) \stackrel{B(a, \delta b)}{\to} B(a, b \otimes b) \stackrel{\lambda}{\to} B \times B(\langle a, a \rangle, \langle b, b \rangle)
\end{displaymath}
is left adjoint to

\begin{displaymath}
B \times B(\langle a, a \rangle, \langle b, b \rangle) \stackrel{\rho}{\to} B(a, b \otimes b) \stackrel{B(a, \delta b^\ast)}{\to} B(a, b).
\end{displaymath}
The first of these arrows is just the diagonal functor

\begin{displaymath}
B(a, b) \stackrel{\delta_{loc}}{\to} B(a, b) \times B(a, b)
\end{displaymath}
on the local hom-category $B(a, b)$. Therefore the second arrow, being right adjoint to the first, provides a product functor on $B(a, b)$. Similarly, each local hom-category carries a terminal object $1 \to \hom(a, b)$. We may summarize this by saying that cartesian bicategories are \emph{locally cartesian}.

\hypertarget{essential_uniqueness_of_cartesian_structure}{}\subsubsection*{{Essential uniqueness of cartesian structure}}\label{essential_uniqueness_of_cartesian_structure}

So far we have seen that for a cartesian bicategory $B$,

\begin{itemize}%
\item $Map(B)$ carries 2-products,


\item Local hom-categories carry products.



\end{itemize}
It is clear that 2-product data on $Map(B)$ and local product data on local hom-categories are uniquely determined up to appropriate notions of equivalence, since they are determined by appropriate universal properties. Now we show that these data actually determine the whole of the cartesian structure. We may therefore conclude that a cartesian structure on a bicategory must be essentially unique, if it exists.

To explain how this works, it helps to consider some simple examples of cartesian bicategories such as $Rel$. First, let us reconstruct

\begin{displaymath}
\otimes: B \times B \to B
\end{displaymath}
from the data above. Suppose given two 1-cells $r: a \to b$, $s: c \to d$ in $B$, e.g., relations between sets, or even just subsets $r \subseteq b$, $s \subseteq d$. The tensor product $r \otimes s$ is intuitively a ``rectangle'', like $r \times s \subseteq b \times d$ in the case of $Rel$, obtained by ``pulling back'' $r$ along the projection $\pi_1: b \times d \to b$, pulling back $s$ along the projection $\pi_2: b \times d \to d$, and taking the intersection -- more generally, taking a local product. By formalizing this procedure, we are led to the general formula

\begin{displaymath}
r \otimes s \cong (\pi_{1, b, d}^{\ast} r \pi_{1, a, c}) \times_{loc} (\pi_{2, b, d}^{\ast} s \pi_{2, a, c})
\end{displaymath}
where $r$ and $s$ play the role of mere placeholders.

It is a theorem (whose proof we defer) is that in a cartesian bicategory, we may reconstruct the functor $- \otimes -$ by the formula

\begin{displaymath}
(\pi_{1}^{\ast} (-) \pi_{1}) \times_{loc} (\pi_{2}^{\ast} (-) \pi_{2})
\end{displaymath}
where each of the displayed data is manifestly part of the 2-product structure on $Map(B)$ or the local cartesian structure.

The other data we are required to reconstruct are structure cells like $\delta r$, $\pi \langle r, s\rangle$ which pertain to the transformations $\delta$, $\pi$. As an example, consider $\delta r$. This is a 2-cell

\begin{displaymath}
\delta r: (\delta b)r \to (r \otimes r)(\delta a)
\end{displaymath}
which is mated to a 2-cell

\begin{displaymath}
r \to (\delta b)^\ast (r \otimes r) \delta = r \times_{loc} r.
\end{displaymath}
This 2-cell is precisely the local diagonal $r \to r \times r$, manifestly part of the local cartesian structure. Thus the structure cells for $\delta$ are uniquely determined, and similarly for the transformations $\pi$ and $\varepsilon$.

This completes the sketched proof of essential uniqueness.

\hypertarget{cartesian_bicategories_and_hyperdoctrines}{}\subsection*{{Cartesian bicategories and hyperdoctrines}}\label{cartesian_bicategories_and_hyperdoctrines}

Each cartesian bicategory $\mathbf{B}$ gives rise to a bifibration, or in other language a (weak) 2-functor

\begin{displaymath}
\mathbf{B}(i-, i-): Map(\mathbf{B})^{op} \times Map(\mathbf{B}) \to Cat
\end{displaymath}
or in other words a $Cat$-valued bimodule over $Map(\mathbf{B})$, for which each $\mathbf{B}(i f, i c): \mathbf{B}(i b, i c) \to \mathbf{B}(i a, i c)$ has a left adjoint

\begin{displaymath}
\mathbf{B}(f^\ast, i c): \mathbf{B}(i a, i c) \to \mathbf{B}(i b, i c)
\end{displaymath}
and similarly each $\mathbf{B}(i c, i f): \mathbf{B}(i c, i a) \to \mathbf{B}(i c, i b)$ has a right adjoint $\mathbf{B}(i c, f^\ast)$.

Thus, each cartesian bicategory gives rise to an $Ob(\mathbf{B})$-indexed family $\mathbf{B}(i-, c)$ of what we shall call (\emph{faute de mieux}) generalized coherent hyperdoctrines:

\begin{udef}
Let $C$ be a 2-category with 2-products. A \textbf{generalized coherent hyperdoctrine} over $C$ is a 2-functor

\begin{displaymath}
P: C^{op} \to FPCat
\end{displaymath}
to the 2-category of categories with finite products, such that for each 1-cell $f$ in $C$, the functor $P(f)$ has a left adjoint.

\end{udef}
This is called a generalized coherent hyperdoctrine because it deals with a generalized form of coherent logic (involving finite ``conjunctions'', i.e., local finite cartesian products and existential quantifiers $\exists_f \dashv P(f)$). It is actually a weak form of coherent logic because we have not included finite ``disjunctions'', and we have said nothing yet about appropriate Beck-Chevalley conditions. (More will be said on this in a \hyperlink{frobenius}{section to follow}.) It is generalized in the sense that the base category $C$ is actually a 2-category.

If the symmetric monoidal bicategory $\mathbf{B}$ is \emph{compact} (e.g., if $\mathbf{B}$ is of type $Rel_C$ for $C$ a regular category, or $Span_C$ for $C$ a finitely complete category, or the bicategory of small categories and profunctors between them), then without loss of generality, we may restrict attention to the single hyperdoctrine

\begin{displaymath}
\mathbf{B}(i-, 1): Map(\mathbf{B})^{op} \to FPCat
\end{displaymath}
\hypertarget{frobenius}{}\subsection*{{Frobenius conditions}}\label{frobenius}

A major class of examples of cartesian bicategories, including $Rel$, $Span$, and the bicategory of profunctors between groupoids, have the properties that

\begin{itemize}%
\item Each object is self-dual (in the sense of compact closed bicategories),


\item The bicategory of maps is locally groupoidal.



\end{itemize}
These arise as follows. In any cartesian bicategory and for each object $b$, there is a canonical 2-cell

\begin{displaymath}
Frob_b: (\delta b)(\delta b)^\ast \to (1_b \otimes \delta b^\ast)(\delta b \otimes 1_b)
\end{displaymath}
mated to the coassociativity isomorphism for $\delta$. We say the \textbf{Frobenius condition} holds if $Frob_b$ is an isomorphism for each $b$. This is equivalent to demanding that a similar canonical 2-cell

\begin{displaymath}
Frob_{b}': (\delta b)(\delta b)^\ast \to (\delta b^\ast \otimes 1_b)(1_b \otimes \delta b)
\end{displaymath}
be an isomorphism for each $b$.

[[!redirects cartesian bicategories]] [[!redirects Cartesian bicategory]] [[!redirects Cartesian bicategories]]



\end{document}