\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*{enriched derivator}

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

If a [[derivator]] is regarded as a ``shadow'' of an $(\infty,1)$-category, then an \emph{enriched derivator} is an analogous shadow of an [[enriched category|enriched]] $(\infty,1)$-category.

[[Peter LeFanu Lumsdaine]]: What does ``enriched $(\infty,1)$-category'' mean here? --- just one of the models for $(\infty,1)$-categories as (Top-, Kan-, SSet-)enriched categories, or actually some further idea of ``$(\infty,1)$-category enriched in something''? (The latter sounds an interesting idea, but I'm not quite sure how to imagine it!)

[[Mike Shulman]]: I had the latter in mind. Just as a 1-category can be enriched over a monoidal 1-category, an $(\infty,1)$-category should be enrichable over a monoidal $(\infty,1)$-category. The ``default'' enrichment will be over $\infty$-groupoids (which one could express in any particular model), just as the ``default'' enrichment for 1-categories is over sets.

\hypertarget{definitions}{}\subsection*{{Definitions}}\label{definitions}

There are several different things in which one could try to enrich a derivator. It would be nice to be able to remain completely in the world of derivators by enriching a derivator over a [[monoidal derivator]]. However, it seems unlikely that the naive notion of monoidal derivator (a [[pseudomonoid]] in the 2-category of derivators) contains enough information to make this feasible, so we either have to augment that notion somehow, or enrich over something else. At present, the latter is easier.

\hypertarget{enrichment_over_a_monoidal_category}{}\subsubsection*{{Enrichment over a monoidal $(\infty,1)$-category}}\label{enrichment_over_a_monoidal_category}

The following is tentative.

Let $V'$ be a bicomplete closed symmetric [[monoidal (∞,1)-category]], and let $V\subset V'$ be a [[reflective sub-(∞,1)-category]] which is a 1-category and which is closed under the monoidal structure and the [[internal-hom]]. For example:

\begin{itemize}%
\item $V'=\infty Gpd$ with cartesian [[product]], $V=Set$.
\item $V'= \infty Gpd_*$ (pointed $\infty$-groupoids) with [[smash product]], $V=Set_*$.

\end{itemize}
We can therefore talk about $V$-enriched categories. Moreover, since $V$ is bicomplete and closed, the category $V$-$Cat$ is again closed symmetric monoidal, and hence enriched over itself.

\begin{udefn}
A \textbf{$(V,V')$-enriched prederivator} is a $V CAT$-enriched functor

\begin{displaymath}
D\colon V Cat^{op} \to V CAT.
\end{displaymath}
(or replacing $V Cat$ by some subcategory of it.)

\end{udefn}
For instance, when $(V,V') = (Set, \infty Gpd)$ then this is precisely the ordinary notion of prederivator. We define this by reference to $V$, rather than $V'$, in order that the definition of prederivator can remain a purely 1-categorical notion, without referring explicitly to any $(\infty,1)$-category.

We now need to specify the axioms which an enriched prederivator should satisfy to be called an enriched derivator. Most of them are easy by analogy:

\begin{itemize}%
\item \textbf{(Der1)} $D$ takes [[coproducts]] to [[products]].


\item \textbf{(Der2)} If $1$ denotes the unit $V$-category, then for any $V$-category $A$ the family of functors $D(A) \to D(1)$ is jointly [[conservative functor|conservative]].


\item \textbf{(Der3)} For any $V$-functor $u\colon A\to B$, the $V$-functor $u^*\colon D(B) \to D(A)$ has a left and a right adjoint $u_!$ and $u_*$.


\item \textbf{(Der5)} For any object $x\in V$, let $I[x]$ denote the $x$-fattened [[interval category]], with two objects $0$ and $1$ and $hom(0,1)=x$. Then for any $V$-category $A$, the induced functor $D(A\times I[x]) \to D(A)^{I[x]}$ is essentially surjective and full.



\end{itemize}
The last, and most important, axiom, involves a characterization of the appropriate [[homotopy exact squares]] of $V$-categories. Here is finally where the larger $(\infty,1)$-category $V'$ enters the picture. If $A$ is a $V$-category and $F\colon A\to V$ and $G\colon A^{op}\to V$ are $V$-functors, then we can take their [[tensor product]] $G\otimes_A F \in V$, but we can also regard them as landing in $V'$ and take their homotopy tensor product $G \otimes^h_A F \in V'$, and these will generally give different results.

\begin{itemize}%
\item \textbf{(Der4)} Given any square\begin{displaymath}
\itexarray{ A & \overset{f}{\to} & B \\
 ^u\downarrow & & \downarrow ^v \\
 C & \underset{g}{\to} & D}
\end{displaymath}
of $V$-categories such that for any objects $c\in C$ and $b\in B$, the induced map

\begin{displaymath}
C(-,c) \otimes^h_A B(b,-) \to D(v(b),g(c))
\end{displaymath}
is an equivalence in $V'$, then the induced transformation

\begin{displaymath}
u_! f^* \to g^* v_!
\end{displaymath}
(and hence also its mate $v^* g_* \to f_* u^*$) is an isomorphism.



\end{itemize}
This should be compared with the characterizations of [[exact squares]] for ordinary (enriched) category theory and of [[homotopy exact squares]].

A $(V,V')$-enriched prederivator satisfying (Der1)--(Der5) is called a \textbf{$(V,V')$-enriched derivator}.

\hypertarget{enrichment_over_a_monoidal_homotopical_category}{}\subsubsection*{{Enrichment over a monoidal homotopical category}}\label{enrichment_over_a_monoidal_homotopical_category}

Note that all we really needed of $V'$ was a place for a well-behaved homotopy tensor product of $V$-profunctors to live. Thus, we could replace it by anything else sufficiently good, such as a [[monoidal model category]] or a [[closed monoidal homotopical category]]. In this case, the homotopy tensor product can be computed as a ``homotopy coend'' or more explicitly as a [[two-sided bar construction]].

Moreover, since the only dependence on $V'$ in the definition is via the homotopy tensor product of functors, the particular choice of model we make is essentially irrelevant for the resulting notion of derivator. In other words, the true input for a notion of enriched derivator is an ordinary monoidal category $V$, together with ``a homotopy theory in which $V$ is reflectively embedded.''

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

\begin{itemize}%
\item When $(V,V') = (Set,\infty Gpd)$, all the axioms of an enriched derivator are identical to those of an ordinary [[derivator]], except for (Der4). The usual axiom (Der4) asserts the conclusion only for [[comma squares]]. However, Cisinski's theorem characterizing [[homotopy exact squares]] shows that this implies the enriched version of (Der4) stated above (which is a priori stronger). To make this comparison with the way Cisinski's theorem is usually stated, one has to observe that $C(-,c) \otimes^h_A B(b,-)$ can be constructed as a [[two-sided bar construction]], which in turn can (in this case) be identified with the nerve of a particular category.


\item Conjecturally, $(Set_*, \infty Gpd_*)$-enriched derivators are the same as [[pointed derivators]] in the usual sense.


\item Also conjecturally, any $V'$-enriched $(\infty,1)$-category should have an underlying $(V,V')$-enriched derivator.



\end{itemize}
\hypertarget{properties}{}\subsection*{{Properties}}\label{properties}

Just as an ordinary derivator encodes a well-behaved notion of [[homotopy limits], an enriched derivator encodes a notion of homotopy [[weighted limit]]. In order to recover this, we need to represent [[profunctors]] by their [[cograph of a profunctor|collages]].

Specifically, let $H\colon A&#8696; B$ be a $V$-profunctor, and $A \overset{u}{\to} \bar{H} \overset{v}{\leftarrow} B$ its collage. Then homotopy $H$-weighted limits in an enriched derivator are computed by the composite $v^* u_*$, and similarly $H$-weighted colimits are computed by $u^* v_!$.

Note that unlike in the ordinary unenriched case, it is not possible to compute all limits by Kan extending along functors to the terminal category. This is because of the presence and importance of weighted limits.

\hypertarget{homotopy_kan_extensions_are_pointwise}{}\subsubsection*{{Homotopy Kan extensions are pointwise}}\label{homotopy_kan_extensions_are_pointwise}

Part of the intuition behind the usual axiom (Der4) is that it says that the homotopy Kan extensions which make up the structure of a derivator are all [[pointwise Kan extension|pointwise]]. For left Kan extensions along $u\colon A\to B$, pointwiseness means that each object $(Lan_u X)(b)$ is calculated as a suitable colimit, which in the unenriched case can be expressed as an ordinary colimit over the comma category $u/b$ -- hence why we assert that comma squares are exact.

In the enriched situation, the (co)limit involved in the notion of ``pointwise Kan extension'' is irreducibly a [[weighted limit]], and not constructible as a comma object. However, the Kan extensions in an enriched derivator are still pointwise in a suitable sense; we can see this as follows. Let $u\colon A\to B$ be a $V$-functor, let $b\in B$, let $B(u,b)\colon 1 &#8696; A$ denote the representable profunctor, and let $H$ be its collage. Then the square

\begin{displaymath}
\itexarray{ A & \to & A \\
\downarrow & & \downarrow^u\\
H & \to & B }
\end{displaymath}
satisfies the hypothesis of the enriched (Der4). (This is just the homotopical version of [[Yoneda reduction]]: $B(u,b) \otimes_A^h A \simeq B(u,b)$.) Therefore, if we left extend along $u$, then restrict to $H$ and further restrict to $b$, we get the same thing as if we just extended to $H$ and restricted to $b$ --- but the latter is exactly the process of taking the $B(u,b)$-weighted colimit. Thus, the evaluation of $u_! X$ at $b$ is computed as a weighted colimit, and hence the Kan extension is ``pointwise.''

[[!redirects enriched derivators]]



\end{document}