\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*{club in a 2-category}

\hypertarget{clubs_in_a_2category}{}\section*{{Clubs in a 2-category}}\label{clubs_in_a_2category}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak
\noindent\hyperlink{the_context}{The context}\dotfill \pageref*{the_context} \linebreak
\noindent\hyperlink{the_object_of_collections}{The object of collections}\dotfill \pageref*{the_object_of_collections} \linebreak
\noindent\hyperlink{the_substitution_product}{The substitution product}\dotfill \pageref*{the_substitution_product} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{clubs_on_cat}{Clubs on Cat}\dotfill \pageref*{clubs_on_cat} \linebreak
\noindent\hyperlink{double_clubs}{Double clubs}\dotfill \pageref*{double_clubs} \linebreak
\noindent\hyperlink{virtual_double_clubs}{Virtual double clubs}\dotfill \pageref*{virtual_double_clubs} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

We can generalize the notion of [[club]] over a [[cartesian monad]] on $Cat$ to a cartesian monad $S$ on an object $C$ of any [[2-category]] $K$.

Note that the $Cat$ \emph{on} which the cartesian monad lives does not generalize to the 2-category $K$; it generalizes to the [[object]] $C$. The 2-category $K$ generalizes the [[large category|larger]] 2-category $CAT$ that contains $Cat$ as an object.

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

\hypertarget{the_context}{}\subsubsection*{{The context}}\label{the_context}

Let $K$ be a 2-category and $C\in K$ an object that \emph{has representable finite limits}, meaning that each [[hom-category]] $K(X,C)$ has [[finite limits]] and the precomposition functors $(-\circ f) : K(X,C) \to K(Y,C)$ [[preserved limit|preserve]] finite limits.

Given morphisms $f,g:X\to C$, a 2-cell $\alpha:f\to g$ is called \textbf{cartesian} if for any $h,k:Y\to X$ and 2-cell $\beta:h\to k$, the commutative square

\begin{displaymath}
\itexarray{ f h & \overset{f \beta}{\to} & f k\\
  ^{\alpha h}\downarrow && \downarrow^{\alpha k}\\
  g h & \underset{g\beta}{\to} & g k }
\end{displaymath}
is a pullback in $K(Y,C)$. (Note that this is a different notion of ``cartesian 2-cell'' than the one involved in the notion of [[fibration in a 2-category]].)

A [[monad]] $s$ on $C$ (that is, a 1-morphism $s:C\to C$ equipped with 2-morphisms $\mu : s s\to s$ and $\eta : id_C \to s$ that are associative and unital) is \textbf{cartesian} if $\mu$ and $\eta$ are cartesian 2-cells, in the above sense, and $s$ preserves pullbacks in the sense that each functor $(s\circ -):K(X,C) \to K(X,C)$ preserves pullbacks.

\hypertarget{the_object_of_collections}{}\subsubsection*{{The object of collections}}\label{the_object_of_collections}

Now suppose that $K$ is [[cartesian closed category|cartesian closed]] --- the weak [[bicategory|bicategorical]] sense suffices, i.e. we have [[equivalences]] $K(X\times Y,Z) \simeq K(X,[Y,Z])$. Suppose further more that $K$ has a [[terminal object]] and [[comma objects]]. To avoid confusion, we will denote by $\mathbf{1}$ the terminal object of $K$, by $id$ the identity morphisms in $K$, and by $1\in K(X,C)$ the representable terminal object of $C$.

Now any monad $s$ transposes to a morphism $\mathbf{1}\to [C,C]$, and we can form the ``slice object'' $[C,C]/s$ by the following comma square:

\begin{displaymath}
\itexarray{ [C,C]/s & \to & [C,C] \\
  \downarrow & \swArrow & \downarrow \\
  \mathbf{1} & \underset{s}{\to} & [C,C] }
\end{displaymath}
This has the representable property that $K(X,[C,C]/s) \simeq K(X\times C,C)/s_X$, where $s_X$ is the composite $X\times C \overset{\pi_2}{\to} C \overset{s}{\to} C$.

Similarly, we have $s 1 : \mathbf{1} \to C$ (meaning the composite $\mathbf{1} \overset{1}{\to} C \overset{s}{\to} C$, where $1:\mathbf{1}\to C$ is the representable terminal object of $C$), and we can form the slice $C/s1$. Thus has the representable property $K(X,C/s1) \simeq K(X,C)/(s1)_X$, where $(s1)_X$ is the composite $X \overset{!}{\to} \mathbf{1} \overset{s1}{\to} C$. Now ``evaluate at 1'' yields a morphism $ev_1:[C,C]/s \to C/s1$, which can be defined representably in a straightforward way.

Given the assumption that $C$ has representable pullbacks as well, we claim that the morphism $ev_1$ has a right adjoint. This can be constructed representably as follows. A morphism $X\to C/s1$ is a morphism $a:X\to C$ together with a 2-cell $a \to (s1)_X$, and we want a morphism $b:X\times C\to C$ together with a 2-cell $b \to s_X$. We define $b$ to be the pullback

\begin{displaymath}
\itexarray{ b & \to & a \pi_1\\
  \downarrow && \downarrow\\
  s_X & \to & (s1)_{X\times C} = (s1)_X \pi_1 }
\end{displaymath}
It is straightforward to check that this defines a right adjoint whose [[counit]] is fully faithful. It commutes with precomposition (since the pullbacks in $S$ do), so it induces a right adjoint $C/s1 \to [C,C]/s$ whose counit is also fully faithful, i.e. $C/s1$ is a ``reflective subobject'' of $[C,C]/s$.

Moreover, by construction, a morphism $X\to [C,C]/s$ factors through $C/s1$ just when for the corresponding map $b:X\times C\to C$, the induced square

\begin{displaymath}
\itexarray{ b & \to & b (id\times 1) \pi_1\\
  \downarrow && \downarrow\\
  s_X & \to & (s1)_X \pi_1 }
\end{displaymath}
is a pullback. Now for any $h,k:Y\to X\times C$ and $\beta:h\to k$, consider the rectangle

\begin{displaymath}
\itexarray{b h &\to & b k & \to & b (id \times 1) \pi_1 h\\
  \downarrow && \downarrow && \downarrow\\
  s_X h & \to & s_X k & \to & (s1)_Y \pi_1 }
\end{displaymath}
The factorization property above says that the right-hand square and the outer rectangle are pullbacks, which by the pasting law for pullbacks implies that the left-hand square is also a pullback, i.e. that $b\to s_X$ is a cartesian 2-cell as defined above. On the other hand, if $b\to s_X$ is a cartesian 2-cell, then precomposing with the unique 2-cell $id_C \to 1$ yields the above square. Hence, $C/s1$ as a subobject of $[C,C]/s$ can be said to be the ``full subobject consisting of the cartesian transformations into $s$''. We may call it the object of \emph{collections} over $S$.

\hypertarget{the_substitution_product}{}\subsubsection*{{The substitution product}}\label{the_substitution_product}

Now, $[C,C]$ is always a [[pseudomonoid]] in $K$, and since $s$ is a monoid therein, the comma object $[C,C]/s$ inherits a pseudomonoid structure. We claim that if $s$ is cartesian, then $C/s1$ is closed under this pseudomonoid structure, i.e. $C/s1$ is a pseudomonoid and the inclusion is a pseudomonoid morphism.

Firstly, the unit of $[C,C]/s$ is the map $\mathbf{1} \to [C,C]/s$ corresponding to $id_C$ equipped with $\eta:id_C \to s$. Since part of $s$ being cartesian means that $\eta$ is a cartesian 2-cell, this certainly factors through $C/s1$.

Secondly, for the tensor product we again argue representably. Suppose given two maps $X\to [C,C]/s$, corresponding to $a,b:X\times C\to C$ equipped with cartetsian 2-cells to $s_X$. Their ``product'' induced by the pseudomonoid structure on $[C,C]/s$ is the composite

\begin{displaymath}
X\times C \overset{\Delta}{\to} X\times X\times C \overset{id\times b}{\to} X\times C \overset{a}{\to} C
\end{displaymath}
equipped with the 2-cell

\begin{displaymath}
a (id\times b) \Delta \to s_X(id\times b)\Delta \cong s b \to s s \overset{\mu}{\to} s.
\end{displaymath}
Then we have the composite rectangle

\begin{displaymath}
\itexarray{
  a (id\times b) \Delta & \to &
  s_X(id\times b)\Delta & \cong &
  s b & \to &
  s s_X & \to &
  s_X \\
  \downarrow && \downarrow && \downarrow && \downarrow && \downarrow \\
  a (id\times b) \Delta (id\times 1) \pi_1 & \to &
  s_X(id\times b)\Delta(id\times 1)\pi_1 & \cong &
  s b (id\times 1) \pi_1 & \to &
  s s_X (id \times 1) \pi_1 & \to &
  s 1
}
\end{displaymath}
The first square on the left is a pullback since $a\to s_X$ is cartesian. The second is an isomorphism, hence automatically a pullback. The third is a pullback since $b\to s_X$ is cartesian and $s$ preserves pullbacks. And the last is a pullback since $\mu:s s \to s$ is cartesian. Thus, the composite rectangle is also a pullback, showing that $a(id\times b)\Delta \to s_X$ is also cartesian.

Note that we did not actually need $C$ to have all representable pullbacks nor $s$ to preserve all of them: we only needed the existence of pullbacks of the form

\begin{displaymath}
\itexarray{ b & \to & a \pi_1\\
  \downarrow && \downarrow\\
  s_X & \to & (s1)_X \pi_1 }
\end{displaymath}
and $s$ to preserve these.

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

\hypertarget{clubs_on_cat}{}\subsubsection*{{Clubs on Cat}}\label{clubs_on_cat}

When $K=CAT$, we obtain the notion of club over a cartesian monad described at [[club]]. The usual subcase of interest is when $C=Cat$, and the simple case of clubs over $\mathbf{P}$ (the permutation category) is the further special case when $s$ is the free symmetric (strict) monoidal category monad.

\hypertarget{double_clubs}{}\subsubsection*{{Double clubs}}\label{double_clubs}

When $K=DBLCAT$ is the 2-category of (pseudo) [[double categories]], pseudo double functors, and vertical transformations, we obtain essentially the notion of \emph{double club} from \hyperlink{Garner}{(Garner)}. Representable pullbacks in $DBLCAT$ can be constructed ``levelwise'', by taking pullbacks in the category of objects and vertical arrows, and also in the category of (all) horizontal arrows and cells; except that in general such a pullback may not define a pseudo double functor (it may not preserve identities and composition up to isomorphism). The condition (hps) required by Garner ensures that the \emph{specific} pullbacks needed above do exist as pseudo double functors. Cartesianness of monads and transformations can also be tested levelwise.

\hypertarget{virtual_double_clubs}{}\subsubsection*{{Virtual double clubs}}\label{virtual_double_clubs}

When $K=VEQUIP$ is the 2-category of [[virtual equipments]] (or even just [[virtual double categories]] with units) and normal (unit-preserving) functors, we obtain a notion of \emph{virtual double club}. The units are necessary to have a cartesian closed 2-category (specifically, we need morphisms $\mathbf{1} \to C$, where $\mathbf{1}$ is the terminal object, to correspond to objects of $C$; and without units and normality such a morphism would instead be a monoid in $C$). However, we can do without requiring composites to exist or be preserved by functors.

This means that it suffices to assume Garner's condition (hps2) on units, but not necessarily his condition (hps1) on composites. This is nice because in many cases, such as the double category $Cat$ of categories, functors, and profunctors, (hps2) is automatically true for all monads $s$ by \hyperlink{Garner}{(Garner, Proposition 48)}.

On the other hand, in this context we only get that the ``inclusion'' $C/s1 \to [C,C]/s$ is a normal functor of virtual double categories, i.e. lax in the horizontal direction; whereas in Garner's context it is a strong functor.

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

\begin{itemize}%
\item [[Richard Garner]], \emph{Double clubs}, Cahiers de Topologie et Geometrie Differentielle Categoriques 47 (2006), no. 4, 261--317; \href{http://arxiv.org/abs/math/0606733}{arXiv}

\end{itemize}
[[!redirects double club]] [[!redirects double clubs]]



\end{document}