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

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

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

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

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

\noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{weakenings}{Weakenings}\dotfill \pageref*{weakenings} \linebreak
\noindent\hyperlink{pseudo_double_categories}{Pseudo double categories}\dotfill \pageref*{pseudo_double_categories} \linebreak
\noindent\hyperlink{double_bicategories}{Double bicategories}\dotfill \pageref*{double_bicategories} \linebreak
\noindent\hyperlink{strictly_unital_weak_double_categories}{Strictly unital weak double categories}\dotfill \pageref*{strictly_unital_weak_double_categories} \linebreak
\noindent\hyperlink{cubical_bicategories}{Cubical bicategories}\dotfill \pageref*{cubical_bicategories} \linebreak
\noindent\hyperlink{Unbiased}{Unbiased composition and associativity}\dotfill \pageref*{Unbiased} \linebreak
\noindent\hyperlink{higher_categories_of_double_categories}{Higher categories of double categories}\dotfill \pageref*{higher_categories_of_double_categories} \linebreak
\noindent\hyperlink{related_pages}{Related pages}\dotfill \pageref*{related_pages} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

A \textbf{double category} $D$ is an [[internal category]] in [[Cat]]. Similarly, a \textbf{double groupoid} is an internal [[groupoid]] in [[Grpd]].

However, these definitions obscure the essential symmetry of the concepts. We think of a double category $D_1 \rightrightarrows D_0$ as having

\begin{itemize}%
\item \emph{[[objects]]}: the objects of $D_0$
\item \emph{[[vertical morphisms]]}: the morphisms of $D_0$
\item \emph{[[horizontal morphisms]]}: the objects of $D_1$
\item \emph{[[2-morphisms]]} or \emph{squares} or \emph{2-cells}: the morphisms of $D_1$.

\end{itemize}
We may picture a 2-cell in a double category as a square:

\begin{displaymath}
\begin{matrix}
    x_0 
    &\stackrel{f}{\to} &
    x_1  
    \\
    {}^{\mathllap{\alpha_0}}\downarrow
    &\Downarrow^{\mathrlap{\phi}}&
    \downarrow^{\mathrlap{\alpha_1}}
    \\
    y_0  
    &\underset{g}{\to} &
    y_1 
 \end{matrix}
\end{displaymath}
Here $x_i,y_i$ are objects, $f$ and $g$ are horizontal arrows, $\alpha_i$ are vertical arrows and $\phi$ is the 2-cell itself. This makes it clear why $\phi$ is called a `square'.

Alternatively one can apply [[Poincaré duality]] to obtain a [[string diagram]] representation for 2-cells, similar to the one obtained for [[2-category|2-categories]] (\hyperlink{Myers16}{Myers 16}):

$\backslash$begin\{centre\} $\backslash$begin\{tikzpicture\}scale=2 $\backslash$usetikzlibrary\{positioning,calc,decorations.pathmorphing,decorations.pathreplacing,decorations.markings,patterns\}

\begin{verbatim}    \tikzset{fwd/.style={decoration={markings,mark=at position 0.7 with {\arrow{>}}},postaction={decorate}}}
    \tikzset{bwd/.style={decoration={markings,mark=at position 0.5 with {\arrow{<}}},postaction={decorate}}}

    \path[fill={rgb,255:red,212; green,166; blue,204}] (0,0) rectangle (.5,.5);
    \path[fill={rgb,255:red,152; green,209; blue,162}] (.5,0) rectangle (1,.5);
    \path[fill={rgb,255:red,248; green,168; blue,156}] (0,.5) rectangle (.5,1);
    \path[fill={rgb,255:red,243; green,237; blue,155}] (.5,.5) rectangle (1,1);
    \draw[gray] (0,0) rectangle (1,1);
    \node[circle,draw,inner sep=1.5pt,fill=white] at (.5,.5) (alpha) {$\phi$};
    \draw[fwd] (0,.5) -- (alpha);
    \draw[fwd] (alpha) -- (1,.5);
    \draw[bwd] (.5,0) -- (alpha);
    \draw[bwd] (alpha) -- (.5,1);
    \node at (-.2,.5) {$\alpha_0$};
    \node at (1.2,.5) {$\alpha_1$};
    \node at (.5,1.2) {$f$};
    \node at (.5,-.2) {$g$};
    \node at (.25,.75) {$x_0$};
    \node at (.75,.75) {$x_1$};
    \node at (.25,.25) {$y_0$};
    \node at (.75,.25) {$y_1$};
\end{tikzpicture}\end{verbatim}
$\backslash$end\{centre\}

The vertical and horizontal arrows form categories (called \textbf{edge categories}), and the squares have two category structures which respect the edge category structures.

Vertical composition is given by the composition in the ordinary [[category|categories]] $D_0$ and $D_1$, while horizontal composition is given by the composition operation specified on $D_1 \stackrel{\to}{\to} D_0$ by virtue of it being a [[category]] [[internalization|internal to]] [[Cat]].

In particular, the \textbf{transpose} of a double category, which switches the vertical and horizontal arrows, is again a double category.

A double category is an important special case of an [[n-fold category]], namely the case where $n = 2$. There is more on $n$-fold categories in the paper by Brown and Higgins referenced below.

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

\begin{itemize}%
\item If $C$ is a [[2-category]], there is its \emph{[[double category of squares]]} $Sq(C)$ whose objects are those of $C$, both of whose types of morphisms are the morphisms in $C$, and whose squares are [[2-morphisms]] in $C$ with their source and target both decomposed as a composite of two morphisms. (These squares are sometimes called \emph{quintets} $(\alpha,f,g,h,k)$ where $\alpha\colon f g \to h k$, and so this double category is said to be a [[quintet construction]].)

(In this example, the two edge categories coincide. Double categories with this property are called \textbf{edge-symmetric}.)


\item Since any 1-category can be regarded as a 2-category with only identity 2-cells, for any 1-category $C$ we have a double category $Sq(C)$ whose squares are the commutative squares in $C$. We can also restrict the commutative squares considered, such as taking only [[pullback]] squares.


\item Any 2-category can also be made into a double category in two more ways, by defining the vertical or horizontal morphisms to consist only of identities. In this way 2-categories can be considered as a special case of double categories.

In the other direction, any double category has two underlying 2-categories, consisting of the objects, the vertical (resp. horizontal) arrows, and the squares whose horizontal-arrow (resp. vertical-arrow) source and target are identities. We call these its \textbf{vertical 2-category} and \textbf{horizontal 2-category}.


\item Finally, we can also make a 2-category $C$ into a double category with the same objects, whose horizontal arrows are the morphisms of $C$, whose vertical arrows are the [[adjunctions]] in $C$, and whose 2-cells are [[mate]]-pairs of 2-cells in $C$. Naturality properties of the mate correspondence are concisely expressed by the existence of this double category.


\item There is a double category $Prof$ whose objects are (small) categories, whose vertical arrows are functors, whose horizontal arrows are [[profunctors]], and whose squares are natural transformations. This double category is in fact an [[equipment]], as are many other similar ones (such as for [[enriched categories]]).


\item Any topological space has a ``homotopy double groupoid'' whose objects are points, whose morphisms of both types are paths (so it is edge-symmetric), and whose 2-cells are homotopies.


\item There is a double category $MonCat$ whose objects are [[monoidal categories]], whose horizontal arrows are [[lax monoidal functor]]s, whose vertical arrows are [[colax monoidal functor]]s, and whose 2-cells are generalized [[monoidal natural transformation]]s. An analogous double category can be constructed involving the algebras for any [[2-monad]]; see [[double category of algebras]].


\item There is a [[double category of model categories]] whose [[objects]] are [[model categories]], whose horizontal morp are right [[Quillen functor]]s, whose vertical arrows are left Quillen functors, and whose 2-cells are arbitrary natural transformations. Passage to [[derived functors]] is a functor on this double category. More generally, we can define a double category of [[homotopical categories]] and ``left derivable'' and ``right derivable'' functors.



\end{itemize}
\hypertarget{weakenings}{}\subsection*{{Weakenings}}\label{weakenings}

An internal category in the 1-category $Cat$ might more properly be called a \emph{strict} double category, since all its composition operations are strictly associative and unital. Since a double category is a 2-dimensional structure, it makes sense to allow these compositions to be weak as well.

\hypertarget{pseudo_double_categories}{}\subsubsection*{{Pseudo double categories}}\label{pseudo_double_categories}

A \textbf{pseudo double category} is a weakly internal category in the 2-category $Cat$. Here ``weakly internal category'' in a 2-category is interpreted as being associative and unital up to coherent isomorphism, just as a [[bicategory]] is a ``weakly enriched category.'' This makes the composition in one direction weak, but the composition in the other direction remains strict (it is the composition in the objects of $Cat$ that make up the pseudo double category). Many naturally occurring examples, such as $Prof$, are pseudo double categories.

Luckily, every pseudo double category is equivalent to a double category of the usual sort, where composition of arrows in both directions is strictly associative. This is Theorem 7.5 of Grandis and Par\'e{}`s paper \href{http://archive.numdam.org/ARCHIVE/CTGDC/CTGDC_1999__40_3/CTGDC_1999__40_3_162_0/CTGDC_1999__40_3_162_0.pdf}{Limits in double categories}.

\hypertarget{double_bicategories}{}\subsubsection*{{Double bicategories}}\label{double_bicategories}

One way to define a double category which is ``weak in both directions'' is a [[double bicategory]]. Double bicategories were defined in [[Dominic Verity]]`s thesis. The definition can also be found in Jeffrey Morton's paper \href{http://arxiv.org/abs/math/0611930}{Double bicategories and double cospans}.

The definition of double bicategory takes as given two ordinary [[bicategories]], representing the vertical and horizontal bicategories, together with a set of squares which is ``acted on'' by both of these. In the basic definition, there is no requirement that the 2-cells in the vertical (resp. horizontal) bicategory be exactly those squares whose vertical (resp. horizontal) 1-cell boundaries are identities, but such an axiom can easily be added.

The reason for stipulating the vertical and horizontal bicategories as a basic part of the structure is that if identities are strict in neither direction, then the vertically (resp. horizontally) ``globular'' 2-cells (those whose vertical or horizontal boundaries are identities) can't seemingly be composed vertically (resp. horizontally), so it's hard to state coherence axioms for the associativity and unit constraints.

\hypertarget{strictly_unital_weak_double_categories}{}\subsubsection*{{Strictly unital weak double categories}}\label{strictly_unital_weak_double_categories}

Another way around this difficulty is to require the \emph{units} to be strict, but not the associativity. This is not such a terrible thing, since units can usually be strictified much more easily than associativity. Thus, in this approach we assume as given

\begin{itemize}%
\item a set of objects,
\item two sets of vertical and horizontal arrows, equipped with identities and strictly unital (but not associative) composition operations,
\item a set of squares, equipped with identities and strictly unital composition in both directions, and
\item two sets of associativity squares, one with identity vertical boundary and one with identity horizontal boundary, satisfying the usual axioms, which are possible to state since identities are strict.

\end{itemize}
\hypertarget{cubical_bicategories}{}\subsubsection*{{Cubical bicategories}}\label{cubical_bicategories}

Yet another approach to doubly-weak double categories was proposed by [[Richard Garner]] in an email to the categories list on 5 Mar 2010, in response to a query of [[Ronnie Brown]]. This approach avoids the coherence problems by being completely ``unbiased.''

\begin{quote}%
A \textbf{cubical bicategory} is given by sets of objects, of vertical arrows, of horizontal arrows and of squares, satisfying the obvious source and target criteria, together with operations of identity and binary composition for vertical and horizontal arrows, satisfying no laws at all; and finally, for every $n \times m$ grid of squares (where possibly $n$ or $m$ are zero), and every way of composing up the horizontal and vertical boundaries using the nullary and binary compositions, a composite square with those boundaries. The coherence axioms which this structure must satisfy say that any two ways of composing up a diagram of squares must give the same answer.


\end{quote}
He then commented:

\begin{quote}%
I would be very interested to know if anyone can extract from this definition a finite collection of composition operations on squares, and a finite collection of equations between them, which together generate all the others. The key obstable seems to be problem that identity 1-cells are not strict in either direction.


\end{quote}
It also seems that a ``cubical bicategory'' in this sense need not have underlying horizontal or vertical bicategories, for the same reason. This presents something of an obstacle to practical applications.

\hypertarget{Unbiased}{}\subsection*{{Unbiased composition and associativity}}\label{Unbiased}

It is natural to ask what the ``unbiased'' notion of composition and associativity is for squares in a double category. The natural thing to take as input for an ``unbiased composition'' is a dissection of a rectangle into smaller rectangles, the smaller rectangles representing squares that we want to ``compose up'' in a double category. As usual, we can try to build up such a composite by means of the ``biased'' binary composites that are given in the definition of double category.

It can be shown that if a given such dissection can be composed up in \emph{some} way using binary composites, then any two ways to compose it up must give the same result. See

\begin{itemize}%
\item Dawson and Par\'e{}, \emph{General associativity and general composition for double categories} , \href{http://www.numdam.org/item/CTGDC_1993__34_1_57_0/}{link}

\end{itemize}
Also of interest is ``Characterizing tileorders'' by the same authors, in which they characterize such rectangle-dissections, called [[tileorders]], in purely combinatorial terms.

However, there are dissections which admit \emph{no} composition in a general double category, foremost among which is the ``pinwheel:''

[[double-category-pinwheel.png:pic]]

It is shown in the paper

\begin{itemize}%
\item Dawson, \emph{A forbidden-suborder characterization of binarily-composable diagrams in double categories} , \href{http://www.tac.mta.ca/tac/volumes/1995/n7/1-07abs.html}{TAC}

\end{itemize}
that this is the \emph{only obstacle} in the same sense that $K_5$ and $K_{3,3}$ are the only obstacles to [[planar graph|planarity]] of a [[graph]]. Namely, if a diagram is not composable in a double category, then every ``attempt'' to compose it by a sequence of binary compositions will eventually result in a diagram which ``contains'' a pinwheel in a suitable sense (specifically, as a sub-[[tileorder]]).

In many double categories, however, arbitrary arrangements of squares, even pinwheels, can be composed. By this we mean that given a pinwheel diagram in such a double category (for example), there is a natural square with the same boundary which it makes sense to regard as ``the composite'' of that pinwheel. For example:

\begin{itemize}%
\item In the double category $Sq(C)$ of squares/quintets in a 2-category, the general pasting theorem for 2-categories shows that any arrangement of squares can be composed. In particular, this applies to commutative squares in a 1-category. The same is true for double categories of adjunctions.


\item If all the squares in a pinwheel are pullback squares in a 1-category, so is the whole thing. The same is true for more general arrangements in a double category of pullback squares.


\item Arbitrary arrangements can also be composed in $Model$ and its variants, again by the pasting theorem for 2-categories, since its 2-cells are just ordinary natural transformations.


\item Pinwheels and more general arrangements can also be composed in the double category $MonCat$, along with its relatives $T Alg$. The proof of this is not quite as trivial, but fairly straightforward.


\item In any [[fibrant double category]], all arrangements can be composed.



\end{itemize}
This last example is due to a factorization property: if we can factor the two long vertical rectangles in the pinwheel into two squares, then we can compose it. The cartesian cells in a fibrant double category certainly allow such a factorization. One can also axiomatize more precisely what factorization properties are necessary; this is done in the above paper of Dawson and Par\'e{}.

In fact, it seems hard to find a naturally occurring double category in which pinwheels and more general arranguments \emph{cannot} be composed, although such composability definitely does not follow from the double-category axioms. This suggests that perhaps the usual definition of double category is too naive, and we should actually require all ``unbiased'' composites to exist, including the pinwheel. There is probably a monad of some sort on a suitable category whose algebras are ``double categories with generalized composites'' in this sense.

(It is tempting to try to axiomatize such a structure finitely by adding a basic ``pinwheel-composition'' operation, but although every non-composable arrangement reduces to one ``containing'' a pinwheel, the containment is not necessarily of a sort to which such an operation could be applied. So it is not clear whether there is any finitary axiomatization of such ``augmented'' double categories.)

\hypertarget{higher_categories_of_double_categories}{}\subsection*{{Higher categories of double categories}}\label{higher_categories_of_double_categories}

There are notions of [[double functor|functor]] and of [[vertical transformation|transformation]] between double categories, which make them into a [[2-category]]. In fact, due to the vertical-horizontal symmetry, there are two such 2-categories, depending on the direction we choose the transformations to go in. Moreover, we can also take the functors to be strict, pseudo, lax, or colax in either direction, so there are many possible 2-categories of double categories (although for some choices one has to worry about compatibility).

Probably the most useful such 2-categories are where we choose one direction to be the ``arrow'' direction and the other the ``proarrow'' direction, we take functors which are lax, colax, or pseudo in the proarrow direction and strict in the arrow direction, and transformations that go in the arrow direction. This is natural when considering double categories such as [[proarrow equipments]]. If we allow the functors and transformations to be only pseudo in the arrow direction as well, and add in [[modifications]] in the arrow direction, we obtain a [[3-category]] instead. In some situations, such as the study of [[generalized multicategories]], this 3-category is a natural place in which to work (or an enlargement of it to include [[virtual equipments]] as well).

We can also combine the horizontally lax and colax functors, together with a general notion of vertical transformation, into a large double category of double categories. This is a special case of the double category of $T$-algebras for a particular 2-monad $T$ mentioned above; see [[double category of algebras]].

In some contexts, a natural observation is that the 1-category $DblCat$ is [[cartesian closed category|cartesian closed]], and thus enriched over itself--thus it forms a [[locally double bicategory]], i.e. a category enriched over double categories. This can be regaded as a structure like a [[3-category]], except that it has two different kinds of 2-cells (in this case, the vertical and horizontal transformations).

In any of these higher categories, we can apply the notions and methods of higher category theory. For instance, we automatically obtain a notion of [[monoidal double category]], namely a [[pseudomonoid]] in $DblCat$. Likewise we have \emph{cartesian double categories}, which are [[cartesian objects]] in $DblCat$. If the double category in question is [[fibrant double category|fibrant]], then monoidal structures can be lifted to the horizontal bicategory; many naturally occurring [[cartesian bicategories]] can be obtained in this way.

Finally, if we want to discuss [[weighted limits]] and colimits in double categories, or construct [[generalized multicategories]] based on double categories, we may want to [[2-category equipped with proarrows|equip DblCat with proarrows]]. There is a notion of [[double profunctor]], but they do not compose associatively, and hence do not form a proarrow equipment in the usual sense; but they do form a [[virtual equipment]], which is sufficient for many purposes.

\hypertarget{related_pages}{}\subsection*{{Related pages}}\label{related_pages}

\begin{itemize}%
\item [[2-category equipped with proarrows]], [[framed bicategory]]


\item [[double functor]], [[double pseudofunctor]]


\item [[vertical transformation]], [[horizontal transformation]]


\item [[double profunctor]]


\item [[monoidal double category]], [[locally double bicategory]]


\item [[triple category]], [[intercategory]]



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

The concept goes back to

\begin{itemize}%
\item [[Charles Ehresmann]], \emph{Catégories structurées}, Annales scientifiques de l'École Normale Supérieure. Vol. 80. No. 4. Elsevier, 1963 (\href{https://eudml.org/doc/urn:eudml:doc:81794}{EUDML:81794})

\end{itemize}
See also

\begin{itemize}%
\item [[The Catsters]], Double Categories (\href{http://www.youtube.com/watch?v=kiCZiSA2W3Q&feature=channel_page}{YouTube}).


\item Tom Fiore, \href{http://www-personal.umd.umich.edu/~tmfiore/1/CT2006Fioreslides.pdf}{Double categories and pseudo algebras}.


\item Marco Grandis and Robert Par\'e{}, \href{http://www.numdam.org/article/CTGDC_1999__40_3_162_0.pdf}{Limits in double categories}, \emph{Cahiers de Topologie et G\'e{}om\'e{}trie Diff\'e{}rentielle Cat\'e{}goriques} \textbf{40} (1999), 162--220.


\item Marco Grandis and Robert Par\'e{}, \href{http://www.numdam.org/article/CTGDC_2004__45_3_193_0.pdf}{Adjoints for double categories}, \emph{Cahiers de Topologie et G\'e{}om\'e{}trie Diff\'e{}rentielle Cat\'e{}goriques} \textbf{45} (2004), 193--240.


\item Jeffrey C. Morton, \href{http://arxiv.org/abs/math/0611930}{Double bicategories and double cospans}.


\item [[Ronnie Brown]] and C.B. Spencer, \href{http://www.numdam.org/item/CTGDC_1976__17_4_343_0}{Double groupoids and crossed modules}, \emph{Cahiers de Topologie et G\'e{}om\'e{}trie Diff\'e{}rentielle Cat\'e{}goriques} \textbf{17} (1976), 343--362.


\item [[Ronnie Brown]] and [[Philip Higgins]], \href{http://archive.numdam.org/ARCHIVE/CTGDC/CTGDC_1981__22_4/CTGDC_1981__22_4_371_0/CTGDC_1981__22_4_371_0.pdf}{The equivalence of $\infty$-groupoids and crossed complexes,} \emph{Cah. Top. G\'e{}om. Diff}. 22 (1981) 371-386.


\item [[Mike Shulman]], \href{http://nyjm.albany.edu/j/2011/17-5v.pdf}{Comparing composites of left and right derived functors}, \emph{New York J. Math.} \textbf{17} (2011) 75--125. \href{http://arxiv.org/abs/0706.2868}{arXiv:0706.2868}


\item David Jaz Myers, \emph{String Diagrams For Double Categories and (Virtual) Equipments} (\href{https://arxiv.org/abs/1612.02762}{arXiv:1612.02762})



\end{itemize}
[[!redirects double categories]] [[!redirects double groupoid]] [[!redirects double groupoids]] [[!redirects vertical 2-category]] [[!redirects horizontal 2-category]] [[!redirects pseudo double category]] [[!redirects pseudo double categories]] [[!redirects strict double category]] [[!redirects strict double categories]]



\end{document}