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

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

\hypertarget{homotopy_theory}{}\paragraph*{{Homotopy theory}}\label{homotopy_theory}

[[!include homotopy - contents]]

\hypertarget{category_theory}{}\paragraph*{{$(\infty,1)$-Category theory}}\label{category_theory}

[[!include quasi-category theory contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{motivation}{Motivation}\dotfill \pageref*{motivation} \linebreak
\noindent\hyperlink{as_a_compromise_notion}{As a compromise notion}\dotfill \pageref*{as_a_compromise_notion} \linebreak
\noindent\hyperlink{as_a_motivation_for_categories}{As a motivation for $(\infty,1)$-categories}\dotfill \pageref*{as_a_motivation_for_categories} \linebreak
\noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak
\noindent\hyperlink{prederivators}{Prederivators}\dotfill \pageref*{prederivators} \linebreak
\noindent\hyperlink{derivators}{Derivators}\dotfill \pageref*{derivators} \linebreak
\noindent\hyperlink{SemiDerivators}{Semiderivators}\dotfill \pageref*{SemiDerivators} \linebreak
\noindent\hyperlink{historical_remarks}{Historical remarks}\dotfill \pageref*{historical_remarks} \linebreak
\noindent\hyperlink{computing_homotopy_kan_extensions}{Computing homotopy Kan extensions}\dotfill \pageref*{computing_homotopy_kan_extensions} \linebreak
\noindent\hyperlink{equivalences}{$D$-equivalences}\dotfill \pageref*{equivalences} \linebreak
\noindent\hyperlink{ExactSquares}{Exact squares}\dotfill \pageref*{ExactSquares} \linebreak
\noindent\hyperlink{2CategoryOfDerivators}{The 2-category of derivators}\dotfill \pageref*{2CategoryOfDerivators} \linebreak
\noindent\hyperlink{free_cocompletions}{Free cocompletions}\dotfill \pageref*{free_cocompletions} \linebreak
\noindent\hyperlink{constructions_of_derivators}{Constructions of derivators}\dotfill \pageref*{constructions_of_derivators} \linebreak
\noindent\hyperlink{from_homotopy_theory}{From homotopy theory}\dotfill \pageref*{from_homotopy_theory} \linebreak
\noindent\hyperlink{FromInfinityCategories}{From $(\infty,1)$-categories}\dotfill \pageref*{FromInfinityCategories} \linebreak
\noindent\hyperlink{exotic_examples}{Exotic examples}\dotfill \pageref*{exotic_examples} \linebreak
\noindent\hyperlink{properties}{Properties}\dotfill \pageref*{properties} \linebreak
\noindent\hyperlink{PresentableDerivatorsAndCombinatorialModelCategories}{Presentable derivators and combinatorial model categories}\dotfill \pageref*{PresentableDerivatorsAndCombinatorialModelCategories} \linebreak
\noindent\hyperlink{related_pages}{Related pages}\dotfill \pageref*{related_pages} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

An [[(∞,1)-category]] $C$ can be flattened into a [[1-category]] $ho(C)$, called its [[homotopy category of an (∞,1)-category|homotopy category]], by forgetting higher morphisms. A \emph{derivator} is a refinement of $ho(C)$, in the sense that it retains enough information about $C$ for many purposes, like computing [[homotopy colimits]] and [[homotopy limits]]. Roughly speaking, the idea is to retain the data of the [[homotopy category of an (∞,1)-category|homotopy categories]] of all categories of [[diagrams]] in $C$, together with the induced [[functors]] between them. Since derivators can be studied using only ordinary [[2-category]] theory, they are often practical in situations when one requires more information than the [[homotopy category of an (∞,1)-category|homotopy category]] retains, but not the whole [[(∞,1)-category]] $C$.

Very similar structures were invented independently by [[Grothendieck]] (who introduced the name ``derivator''), [[Alex Heller]] (who called his version ``homotopy theories''), and Franke (who considered only the [[stable derivator|stable]] case and called his version a ``system of triangulated diagram categories''). The definition given below combines elements from the work of all three.

\hypertarget{motivation}{}\subsection*{{Motivation}}\label{motivation}

The notion of derivator can be motivated in several ways.

\hypertarget{as_a_compromise_notion}{}\subsubsection*{{As a compromise notion}}\label{as_a_compromise_notion}

Suppose we start from the perspective that what we really study in [[homotopy theory]] are [[(∞,1)-categories]]. The [[homotopy category of an (∞,1)-category]] (the 1-category obtained by setting all equivalent 1-morphisms equal) is a fairly coarse invariant, but for some purposes it is sufficient. On the other hand, sometimes we need more than merely the homotopy category, but doing everything with $(\infty,1)$-categories can be technically daunting. Frequently, all we need from an $(\infty,1)$-category that is not present in its homotopy category is to know that we have well-behaved constructions of [[homotopy limit]]s and [[homotopy colimit]]s.

A \emph{derivator} is thus a compromise notion, containing more information than a homotopy category, but being easier to work with than an $(\infty,1)$-category. It consists of a homotopy category together with extra structure that enables one to compute with homotopy limits and colimits. Any $(\infty,1)$-category with sufficiently many limits and colimits has an underlying derivator, and working with these derivators suffices for a surprising number of things we may want to do with $(\infty,1)$-categories. However, derivators are an essentially 1-categorical notion, so we can study them using ordinary [[2-category]] theory. Thus derivators provide a ``truncated'' version of [[higher category theory]], which gives us the language to characterize higher category theory using only usual [[category theory]], without any emphasis on any particular model (in fact, without assuming we even know any such model).

For instance, it turns out that we can also express many convenient [[universal properties]] in terms of derivators. A striking example is the theory of [[triangulated category|triangulated categories]]: if $A$ is an [[abelian category]], its (bounded) [[derived category]] $D^b(A)$ is not defined by a universal property. A natural statement would be that, given a triangulated category, the category of additive functors $A\to T$ which send [[short exact sequence]]s to distinguished triangles is equivalent to the category of triangulated functors $D^b(A)\to T$, but this statement is false, and in fact, does not even make sense (unless $A$ is [[semisimple category|semi-simple]]). But, in practice, everything behaves as if the above statement were meaningful and true. The `reason' why this does not work is that the [[mapping cone|cone]] of a map in a triangulated category is not defined by a universal property. On the other hand, the cone of a morphism of complexes $X\to Y$ is canonically defined: this is the [[homotopy colimit]] of the diagram $0\leftarrow X \to Y$. In the world of derivators, we can remedy this situation and recover a suitable universal property.

\hypertarget{as_a_motivation_for_categories}{}\subsubsection*{{As a motivation for $(\infty,1)$-categories}}\label{as_a_motivation_for_categories}

On the other hand, we may ask: Why do we take for granted that the [[homotopy theory]] of [[topological space|spaces]] provides a good notion (among others) of [[∞-groupoid]]? And why should we expect everything to be [[enriched category|enriched]] in higher groupoids anyway? A priori this may seem arbitrary (although it certainly works very well). Instead we might ask: what is the mathematical structure over which everything is canonically enriched? How can we even correctly formulate such a question?

The notion of \emph{derivator} provides a way to correctly formulate such a question, and the answer turns out to be mostly what we expect. Every type of ``category theory'' (at least, category theory without an \emph{a priori} given [[enriched category|enrichment]]) that we might want to do is automatically and uniquely enriched in [[homotopy types]], i.e. in the homotopy category of [[CW-complexes]] or [[Kan complexes]]. (For ordinary 1-category theory, this enrichment is trivial, i.e. factors through sets considered as discrete homotopy types.) A derivator is simply a structure with the characteristics of ordinary [[category theory]]: [[category|categories]], [[functor]]s, [[natural transformation]]s, [[Kan extension]]s, [[Grothendieck fibration]]s. We can then show that any derivator acquires such an enrichment, so that homotopy types are a canonical enriching place for ``category theories.''

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

\hypertarget{prederivators}{}\subsubsection*{{Prederivators}}\label{prederivators}

Let [[Cat]] denote the [[2-category]] of [[large category|large]] [[categories]] (not necessarily even [[locally small category|locally small]]), and let $Dia$ be some 2-category of [[small categories]], thought of as \textbf{[[diagram]]s}. One common choice is the 2-category of \emph{all} small categories (which generates $Cat$), but we might also choose the 2-category of finite categories. A \textbf{prederivator} with domain $Dia$ is a strict [[2-functor]]

\begin{displaymath}
Dia^{op} \overset{D}{\to} Cat
\end{displaymath}
As usual, $(-)^{op}$ denotes the 1-cell dual of a 2-category. Thus, a prederivator is a ``$Cat$-valued [[presheaf]]'' on $Dia$. Prederivators form a 2-category $PDer$ whose morphisms are [[pseudonatural transformations]] and whose 2-cells are [[modification]]s.

Another common convention is to use the double dual $Dia^{coop}$ which reverses both 1-cells and 2-cells, although confusingly sometimes in the literature this double dual is still denoted ``$Dia^{op}$''. The motivation for the latter choice seems to be that then $D(A)$ is the category of ``[[presheaves]] on $A$ with values in $D$'' instead of the category of ``[[diagrams]] of shape $A$ in $D$.'' We have chosen the convention above since the main purpose of a derivator is a calculus of homotopy limits and colimits, and it is more usual to take limits and colimits of covariant functors. However, since $Dia^{coop}$ is isomorphic to $Dia^{op}$ via the 2-functor $(-)^{op}$ (as long as $Dia$ is closed under opposite categories in $Cat$), there is really very little difference.

There are two main motivating examples. Firstly, any category $C$ defines a ``representable'' prederivator by the assignation $A\mapsto Hom(A,C)$, sending $A\in Dia$ to the category of functors $A\to C$. This defines an embedding of $Cat$ into $PDer$.

Secondly, if $C$ is any [[category with weak equivalences]], there is a prederivator $Ho(C)$ which sends $A\in Dia$ to the [[localization]]/[[homotopy category]] $Ho(C)(A)$ of $Hom(A,C)$ relative to the [[model structure on functors|objectwise weak equivalences]] (as we allowed categories in $Cat$ to have large [[hom-set]]s, these localization exist). In general, this is a non-representable prederivator, although of course if the weak equivalences are just the [[isomorphism]]s, it reduces to the representable case. Note that to construct it, we don't need anything besides ordinary [[2-category|(2-)]][[category theory]].

\hypertarget{derivators}{}\subsubsection*{{Derivators}}\label{derivators}

A \textbf{derivator} is a prederivator $D$ which satisfies a list of axioms. These axioms are of two sorts.

The first set of axioms says that there exist well-behaved homotopy limits and colimits, and more generally [[homotopy Kan extension]]s. Specifically, we require the following.

\begin{itemize}%
\item \textbf{(Der3)}  For any functor $u : X\to Y$ in $Dia$, the [[inverse image]] functor $u^*:D(Y)\to D(X)$ admits a [[left adjoint]] $u_!$ and a [[right adjoint]] $u_*$. These can be understood as [[homotopy Kan extension]]s

\begin{displaymath}
(u_! \dashv u^* \dashv u_*) 
  :
  D(X)
    \stackrel{
    \overset{u_!}{\to}
    }
    {
      \stackrel{
    \overset{u^*}{\leftarrow}
      }{
    \underset{u_*}{\to}
      }
    }
  D(Y)
\end{displaymath}

\item \textbf{(Der4)} For any [[comma square]]

\begin{displaymath}
\itexarray{A & \overset{g}{\to} & B \\
^f\downarrow &\swArrow& \downarrow^v\\
C& \underset{u}{\to} & E}
\end{displaymath}
in $Dia$, the [[Beck-Chevalley transformation]]s

\begin{displaymath}
f_! g^* \to u^* v_! \quad \text{and} \quad v^* u_* \to g_* f^*
\end{displaymath}
are [[isomorphism]]s. Intuitively, this says that the Kan extensions in question are \emph{\href{http://ncatlab.org/nlab/show/Kan+extension#Pointwise}{pointwise}}. In the presence of the second set of axioms, it suffices to require this when $C$ is the [[terminal category]] (for the first case) and when $B$ is so (for the second).



\end{itemize}
The second set of axioms are ``[[sheaf]]'' conditions. Of course, we cannot assert that $D$ is exactly a sheaf (in the appropriate [[stack|2-categorical sense]]), since the terminal category in $Dia$ is 2-categorically dense and so any sheaf on it is representable (and represented by $D(1)$), whereas we want to also allow non-representable derivators. But we do need some sheaf-like properties in order to do [[category theory]]. All of the following axioms can be understood as asserting that for some [[cover|covering family]] $\{Y_i \to X\}$ in $Dia$, the canonical map $D(X) \to Desc(D,\{Y_i\})$ from $D(X)$ to the category of [[descent]] data for the covering, while not an [[equivalence of categories|equivalence]], has some weaker good properties. They can also be understood as 2-categorical [[sketch]] conditions.

The standard axioms are:

\begin{itemize}%
\item \textbf{(Der1)} $D\colon Dia^{coop} \to Cat$ takes [[coproduct]]s to products. Sometimes we require this only for finite coproducts. In particular, we have $D(\emptyset) = 1$.


\item \textbf{(Der2)} For any $X\in Dia$, consider the family of functors $x\colon 1\to X$ determined by the objects of $X$. Then the induced functor

\begin{displaymath}
D(X) \overset{(x^*)}{\to} \prod_x D(1)
\end{displaymath}
is [[conservative functor|conservative]] (though not generally faithful). This in turn implies that the same is true for any jointly [[essentially surjective functor|essentially surjective]] family of functors.


\item \textbf{(Der5)} For any $X\in Dia$, if $I$ denotes the [[interval category]], then the induced functor

\begin{displaymath}
D(X\times I) \to Hom(I,D(X))
\end{displaymath}
is [[essentially surjective functor|essentially surjective]] and [[full functor|full]] (though again, it is not generally faithful). Sometimes it is convenient to assume this property when $I$ is any (perhaps finite) [[free category]]. Since this functor is also conservative by (Der2), it is then a [[weakly smothering functor]].



\end{itemize}
[[Mike Shulman]]: It's clear to me that these are desirable requirements, which are moreover satisfied by all derivators of the form $Ho(C)$, but I would really like a conceptual explanation for why these axioms are \emph{sufficient}.

It is easy to see that if $C$ has pointwise left and right Kan extensions along all functors in $Dia$, then its representable prederivator is a derivator. Somewhat more difficult to prove is that if $C$ is a [[model category]] (or more generally, has well-behaved homotopy Kan extensions), then the prederivator $Ho(C)$ is also a derivator. Thus the derivator encodes the notions of [[homotopy colimit]] and of [[homotopy limit]]. Note again that this way of seeing homotopy (co)limits does not use anything besides usual (2-)category theory.

\hypertarget{SemiDerivators}{}\subsubsection*{{Semiderivators}}\label{SemiDerivators}

It may sometimes be useful to consider prederivators which are like derivators, but which ``do not have \emph{all} limits and colimits.'' Let us say that a \textbf{semiderivator} is a prederivator satisfying (Der1), (Der2), and (Der5).

If $D$ is a semiderivator, $x\in D(B)$ is a $B$-shaped diagram, and $v\colon B\to C$ is a functor in $Dia$, then a \textbf{pointwise left extension} of $x$ along $v$ is an object ``$v_! x$'' in $D(C)$, together with a morphism $x \to v^* v_! x$ which is [[initial object|initial]] in the [[comma category]] $(x / v^*)$ (this says that $v_! x$ is a ``local'' or ``partial'' value of the left adjoint $v_!$ at $x$, although the entire functor $v_!$ may not exist) which additionally satisfies the \href{/nlab/show/Beck-Chevalley+condition#Local}{local Beck-Chevalley condition} for any comma square as above. We have a dual notion of \textbf{pointwise right extension}.

We say a semiderivator is \textbf{complete} (resp. \textbf{cocomplete}) if it admits all pointwise right (resp. left) extension. Clearly a semiderivator is a derivator just when it is both complete and cocomplete.

\hypertarget{historical_remarks}{}\subsubsection*{{Historical remarks}}\label{historical_remarks}

\begin{itemize}%
\item Grothendieck's definition of a \emph{derivator} included only axioms (Der1), (Der2), (Der3), and (Der4).


\item [[Alex Heller]]`s definition of a \emph{homotopy theory} included axioms (Der1), (Der2), (Der3), a weaker form of (Der4), and (Der5) for finite free categories. His \emph{pointed homotopy theories} add the axiom of a [[pointed derivator]], and his \emph{stable homotopy theories} include a weaker version of the axiom now used for a [[stable derivator]].


\item Franke's definition of a \emph{system of triangulated diagram categories} was irreducibly [[pointed derivator|pointed]], taking $Dia$ to consist of categories enriched over pointed sets. (See [[pointed derivator]] for the relationship of this approach to that of adding a ``pointedness'' axiom to an unpointed notion of derivator.) In this context, he assumed axioms analogous to (Der1), (Der2), (Der3), (Der4), and (Der5) for the interval category, plus the [[stable derivator|stability]] axiom. He also observed that if $Dia$ consists entirely of posets, then (Der4) follows from the other axioms.



\end{itemize}
Axioms (Der1)--(Der4) are clearly the easiest to motivate and the most obviously necessary. Axiom (Der5) is used in order to do things with morphisms in $D(*)$, by first lifting them to objects of $D(I)$. In particular, it is necessary to conclude that a stable derivator gives a [[triangulated category]].

\hypertarget{computing_homotopy_kan_extensions}{}\subsection*{{Computing homotopy Kan extensions}}\label{computing_homotopy_kan_extensions}

We now describe an ``omnibus'' theorem which is the main thing enabling us to compute with [[homotopy Kan extension]]s in a derivator.

\hypertarget{equivalences}{}\subsubsection*{{$D$-equivalences}}\label{equivalences}

For any functor $u\colon I\to J$ in $Dia$, we say it is a $D$-\textbf{equivalence} if the induced transformation $(\pi_I)_! (\pi_I)^* \to (\pi_J)_!(\pi_J)^*$ is an isomorphism, where $\pi_I\colon I\to *$ is the projection to the [[terminal category]], and similarly for $\pi_J$. This means that homotopy colimits of \emph{constant} diagrams of shapes $I$ and $J$ are equivalent. By the [[Yoneda lemma]], this is equivalent to saying that

\begin{displaymath}
D(*)((\pi_J)_!(\pi_J)^* X , Y) \to D(*)((\pi_I)_!(\pi_I)^* X , Y)
\end{displaymath}
is an isomorphism for all $X,Y\in D(*)$, and by adjunction this is equivalent to saying that

\begin{displaymath}
D(J)((\pi_J)^* X , (\pi_J)^*Y) \to D(I)((\pi_I)^* X , (\pi_I)^*Y)
\end{displaymath}
is an isomorphism---i.e. that $u^*$ is fully faithful when restricted to the image of $\pi_J^*$. In particular, if $u^*$ is fully faithful, then $u$ is a $D$-equivalence.

In a representable derivator (i.e. in ordinary category theory), the colimit of a constant diagram of shape $I$ is a [[copower]] with the set of connected components of $I$. Thus, in a representable derivator, any functor that induces an isomorphism on sets of connected components will be a $D$-equivalence, and the converse is true as long as the category in question is not a [[preorder]].

By contrast, in the derivator coming from a model category or $(\infty,1)$-category, the colimit of a constant diagram of shape $I$ is a copower with the [[nerve]] of $I$ regarded as an $\infty$-groupoid, so in this case any functor that induces a homotopy equivalence of nerves (a stronger condition) will be a $D$-equivalence. In fact, one can show:

\begin{theorem}
\label{NerveEquiv}\hypertarget{NerveEquiv}{}
\textbf{([[Alex Heller]], Cisinski)} A functor which induces a homotopy equivalence of nerves is a $D$-equivalence for any derivator $D$.

\end{theorem}
This was proven by \hyperlink{Heller}{Heller} using the canonical [[enriched derivator|enrichment]] of any derivator over $\infty$-groupoids. It also follows from Cisinski's theorem that the nerve equivalences are the smallest [[basic localizer]], once we verify that the $D$-equivalences are in fact a basic localizer---as we will now proceed to do.

\begin{lemma}
\label{}\hypertarget{}{}
Any functor in $Dia$ with a fully faithful left or right adjoint is a $D$-equivalence.

\end{lemma}
\begin{proof}
If $f\dashv g$ in $Dia$, then $g^* \dashv f^*$, and if $f$ is fully faithful, then the unit $1 \to g f$ is an isomorphism, and thus so is the unit $1\to f^* g^*$. Hence $g^*$ is also fully faithful and so $g$ is a $D$-equivalence. The other case is dual.

\end{proof}
\begin{lemma}
\label{}\hypertarget{}{}
Let $W_D$ denote the class of $D$-equivalences in $Dia$. Then $W_D$ is saturated, in the sense that if $u\colon I\to J$ is a morphism in $Dia$ which becomes an isomorphism in $Dia[W_D^{-1}]$, then $u$ is a $D$-equivalence.

\end{lemma}
\begin{proof}
Fix some $X,Y\in D(*)$ and consider the functor $\Phi\colon Dia \to Set^{op}$ which sends $I$ to $D(I)(\pi_I^*X, \pi_I^*Y)$. Since $\Phi$ inverts $D$-equivalences, it factors through $Dia[W_D^{-1}]$. But if $u$ becomes an isomorphism in $Dia[W_D^{-1}]$, then it must be inverted by $\Phi$, but that is the definition of being a $D$-equivalence (as $X$ and $Y$ vary).

\end{proof}
\begin{lemma}
\label{}\hypertarget{}{}
For any $D$, the class of $D$-equivalences is a [[basic localizer]].

\end{lemma}
\begin{proof}
Saturation gives 2-out-of-3 property and closure under retracts. If $A$ has a terminal object, then $A\to 1$ has a fully faithful right adjoint and hence is a $D$-equivalence. Finally, given a triangle

\begin{displaymath}
\itexarray{ A & & \overset{u}{\to} & & B\\ & _v \searrow & & \swarrow_w \\ & & C, }
\end{displaymath}
to show that $u$ is a $D$-equivalence, it suffices to show that the transformation $v_! \pi_A^* \to w_! \pi_B^*$ is an isomorphism. By (Der2) it suffices to check this for any $c\in C$. We can then form the comma objects

\begin{displaymath}
\itexarray{v/c & \overset{g}{\to} & A\\
  ^f\downarrow && \downarrow^v\\
  *& \underset{}{\to} & C} \quad\text{and}\quad
\itexarray{w/c & \overset{k}{\to} & B\\
  ^h\downarrow && \downarrow^w\\
  * & \underset{}{\to} & C}
\end{displaymath}
and the transformation $c^* v_! \pi_A^* \to c^* w_! \pi_B^*$ factors as

\begin{displaymath}
c^* v_! \pi_A^* \cong f_! g^* \pi_A^* \cong f_! \pi_{v/c}^* \to h_! \pi_{w/c}^* \cong c^* w_! \pi_B^*
\end{displaymath}
using the analogous map for the functor $v/c \to w/c$. Therefore, if $v/c \to w/c$ is a $D$-equivalence, this composite is an isomorphism, and if this holds for all $c$, then by (Der2), $u$ is a $D$-equivalence.

\end{proof}
Therefore, since the nerve equivalences are the smallest basic localizer, every nerve equivalence is a $D$-equivalence for any derivator $D$.

\hypertarget{ExactSquares}{}\subsubsection*{{Exact squares}}\label{ExactSquares}

Now suppose given any square

\begin{displaymath}
\itexarray{L & \overset{p}{\to} & I\\
  ^q\downarrow & \Downarrow^\mu & \downarrow^u\\
  J & \underset{v}{\to} & K}
\end{displaymath}
in $Dia$ which commutes up to a specified 2-cell $\mu$. Given a derivator $D$, we say that this square is $D$-\textbf{exact} if the [[Beck-Chevalley transformation]]s

\begin{displaymath}
q_! p^* \to v^* u_! \quad \text{and} \quad u^* v_* \to p_* q^*
\end{displaymath}
are isomorphisms. (In fact, if one of these is an isomorphism, so is the other, since they are [[mate|mates]].) Thus, the derivator axioms say that all comma squares are exact.

Like the notion of [[exact square]] in ordinary category theory, this is a ``functional'' definition, but we can also give a more explicit characterization, using more or less the same argument. Given such a square as above and $i\in I$, $j\in J$, we write $(i/L/j)$ for the category whose objects are triples

\begin{displaymath}
\big(\ell\in L,\, i\overset{\alpha}{\to} p(\ell),\, q(\ell)\overset{\beta}{\to} j\big).
\end{displaymath}
The morphisms of $(i/L/j)$ are morphisms $\gamma\colon \ell \to \ell'$ in $L$ which make the evident triangles commute. Now there is a functor $r\colon (i/L/j) \to K(u(i),v(j))$ (the latter considered as a discrete category), which sends the above triple to the composite

\begin{equation}
u(i) \overset{u(\alpha)}{\to} u(p(\ell)) \overset{\mu}{\to} v(q(\ell)) \overset{v(\beta)}{\to} v(j)
\label{commacomp}\end{equation}
in $K$.

\begin{theorem}
\label{}\hypertarget{}{}
A square as above is $D$-exact if and only if for all $i\in I$ and $j\in J$, the functor $(i/L/j) \to K(u(i),v(j))$ is a $D$-equivalence.

\end{theorem}
\begin{proof}
It is easy to verify that the horizontal or vertical pasting composite of exact squares is exact; hence if the given square is exact, then so is the composite

\begin{displaymath}
\itexarray{(L/j) & \overset{}{\to} & L & \overset{p}{\to} & I \\
  \downarrow & \Downarrow & \downarrow^q & \Downarrow & \downarrow^u\\
  * & \underset{j}{\to} & J & \underset{v}{\to} & K}
\end{displaymath}
for any $j\in J$, where the left-hand square is a comma square. Conversely, if all of these squares are exact, then so is the given one, by (Der2). We play the same game by composing with comma squares on the top to conclude that the given square is exact if and only if all the induced squares

\begin{equation}
\itexarray{(i/L/j) & \overset{f}{\to} & *\\
  ^g\downarrow & \Downarrow & \downarrow^{\mathrlap{u(i)}}\\
  * & \underset{v(j)}{\to} & K}
\label{ijsquare}\end{equation}
are exact. But the square

\begin{displaymath}
\itexarray{K(u(i),v(j)) & \overset{s}{\to} & *\\
  ^t\downarrow & \Downarrow & \downarrow^{\mathrlap{u(i)}}\\
  * & \underset{v(j)}{\to} & K}
\end{displaymath}
is exact, since it is a comma square, and by the universal property of a comma square, the square \eqref{ijsquare} factors uniquely through this one by a functor $r\colon (i/L/j) \to K(u(i),v(j))$, which is precisely the functor $r$ defined above. Specifically, we have $f = s r$ and $g = t r$. Therefore, the Beck-Chevalley transformation $g_! f^* \to (v j)^* (u i)^*$ is equal to the composite

\begin{displaymath}
g_! f^* = t_! r_! r^* s^* \to t_! s^* \to (v j)^* (u i)^*
\end{displaymath}
where the second map is the Beck-Chevalley transformation for the comma square, which is an isomorphism. Thus, \eqref{ijsquare} is exact just when $t_! r_! r^* s^* \to t_! s^*$ is an isomorphism. But this says exactly that $r$ is a $D$-equivalence.

\end{proof}
A square is said to be [[homotopy exact square|homotopy exact]] if it is $D$-exact for all derivators $D$ (or, equivalently, for all $(\infty,1)$-categories, or for all model categories, or simplicially enriched categories).

\begin{cor}
\label{}\hypertarget{}{}
A square is homotopy exact if and only if for all $i\in I$ and $j\in J$, the functor $(i/L/j) \to K(u(i),v(j))$ induces a weak homotopy equivalence of nerves.

\end{cor}
\begin{proof}
``If'' follows directly from Theorem \ref{NerveEquiv} and the previous theorem. Conversely, we can take $D$ to be the derivator of spaces ($\infty$-groupoids), where the $D$-equivalences are precisely the nerve equivalences.

\end{proof}
\begin{cor}
\label{}\hypertarget{}{}
For each $i\in I$, $j\in J$, and $\varphi\colon u(i) \to v(j)$ in $K$, let $(i/L/j)_\varphi$ denote the subcategory of $(i/L/j)$ consisting of those triples for which the composite \eqref{commacomp} is equal to $\varphi$. Then the square is homotopy exact if and only if each category $(i/L/j)_\varphi$ has a contractible nerve.

\end{cor}
This gives a convenient way to compute many homotopy limits and colimits, which works in any derivator, and \emph{a fortiori} in any $(\infty,1)$-category or model category. Example applications can be found at [[homotopy exact square]].

\hypertarget{2CategoryOfDerivators}{}\subsection*{{The 2-category of derivators}}\label{2CategoryOfDerivators}

We can consider now the 2-category of derivators. Actually, there are several different ways to define such a 2-category, depending on whether we require morphisms to preserve homotopy colimits, limits, both, or neither. Let us write $Der_!$ for the 2-category whose morphisms preserve colimits. Thus:

\begin{itemize}%
\item its [[object]]s are derivators,


\item its 1-[[morphism]]s are [[pseudonatural transformations]] $F:D\to D'$ which commute with the functors $u_!$ (i.e. the canonical comparison maps for these are isomorphisms),


\item its 2-cells are the [[modifications]] between these.



\end{itemize}
We write $Hom_!(D,D') = Der_!(D,D')$ for hom-categories in this 2-category.

\hypertarget{free_cocompletions}{}\subsubsection*{{Free cocompletions}}\label{free_cocompletions}

Now, given a small category $X$, there is a $2$-functor, defined by evaluating at $X$

\begin{displaymath}
Der_!\to Cat \quad , \qquad D\mapsto D(X).
\end{displaymath}
Note that, for any (pre)derivator $D$, the category $D(X)$ is canonically equivalent to the category $Hom(X,D)$ of morphisms of \emph{prederivators} from $X$ to $D$ (considering $X$ as a representable prederivator). Of course, $X$ will usually not itself be a derivator, but nevertheless this $2$-functor is \emph{representable} in the 2-category $Der_!$.

Thus, there exists a derivator $\widehat{X}$, endowed with a morphism of prederivators $h:X\to \widehat{X}$ (called the Yoneda embedding), such that, for any derivator $D$, composing with h defines an equivalence of categories

\begin{displaymath}
Hom_!(\widehat{X},D)\simeq Hom(X,D)=D(X).
\end{displaymath}
In other words, the map $h:X\to \widehat{X}$ is the ``free completion of $X$ by homotopy colimits'' in the sense of derivators.

Furthermore, $\widehat{X}$ can be described rather explicitly: it is the derivator associated to the [[model structure on simplicial presheaves|model category of simplicial presheaves]] on $X$. In particular, the usual [[model structure on simplicial sets|homotopy theory of simplicial sets]] gives rise to the derivator $\widehat{*}$, where $*$ stands for the [[terminal object|terminal]] category. Note that in order to conclude this, we didn't take for granted that [[homotopy type]]s should be important: its universal property is formulated purely with ordinary category theory.

From there, you can see that any derivator is canonically enriched in the derivator $\widehat{*}\simeq Ho(SSet)$: as $*$ acts uniquely on any prederivator, $\widehat{*}\simeq Ho(SSet)$ acts uniquely on any derivator (as far as we ask compatibility with homotopy colimits). Thus the [[homotopy hypothesis]] might be reformulated vaguely as: is there an algebraic model of $\widehat{*}$? Then one may guess that some notion of higher groupoid might do the job.

\hypertarget{constructions_of_derivators}{}\subsection*{{Constructions of derivators}}\label{constructions_of_derivators}

Viewing a derivator as a partway point between an $(\infty,1)$-category and its homotopy category, and recalling that $(\infty,1)$-categories are often presented by [[categories with weak equivalences]] and in particular [[model categories]], we can construct derivators in two general ways.

\hypertarget{from_homotopy_theory}{}\subsubsection*{{From homotopy theory}}\label{from_homotopy_theory}

If $(C,W)$ is a [[category with weak equivalences]], then the representable prederivator defined by $D_C(X) = Cat(X,C) = C^X$ comes equipped with weak equivalences $W^X$ on each category $C^X$. We define the \emph{homotopy prederivator} $Ho(C)$ by inverting these weak equivalences in each diagram category:

\begin{displaymath}
Ho(C)(X) = Ho(C^X,W^X) = C^X[(W^X)^{-1}]
\end{displaymath}
\begin{theorem}
\label{}\hypertarget{}{}
If $C$ is a [[homotopical category]] with a functorial [[three-arrow calculus]], then $Ho(C)$ is a prederivator satisfying axioms (Der1), (Der2), and (Der5).

\end{theorem}
Actually, it is enough to assume that, for every small category $X$, $C^X$ admits a (not necessarily functorial) three-arrow calculus, but in practice this only happens when we have a functorial three-arrow calculus for $C$.

\begin{theorem}
\label{}\hypertarget{}{}
If $C$ is a [[model category]] (complete and cocomplete, but possibly without functorial factorisations), then $Ho(C)$ is a derivator (except possibly for axiom (Der5)).

\end{theorem}
Axioms (Der1) is easy to check, and when $C$ has functorial factorisations, we have a functorial three-arrow calculus. Axiom (Der3) is also easy, since [[homotopy limits]] and colimits in categories with weak equivalences are [[derived functor]]s of the usual limits and colimits, and so they supply left and right adjoints to derived pullback functors. (This shows moreover that homotopy limits and Kan extensions in a model category coincide with the notions of homotopy limit and Kan extension in its homotopy derivator, so that by working in $Ho(C)$ we really are studying the things we want to study.) Axiom (Der4) requires a bit of work; there is a proof for combinatorial model categories using the [[injective model structure]] in \hyperlink{Groth}{(Groth)}.

Note that if $C$ is any complete and cocomplete 1-category, we can equip it with its [[trivial model structure]] in which the only weak equivalences are isomorphisms. Then the above derivator $Ho(C)$ is the same as the representable prederivator $D_C(X)$, which can easily be proven to be a derivator directly.

In this connection, it is interesting to point out that a given homotopy category can admit multiple ``enrichments'' to a derivator. For instance, the homotopy category of the model category of chain complexes over a field is equivalent to the category of graded modules over that field, which is itself complete and cocomplete. Thus we have two distinct derivators, which have equivalent underlying homotopy categories $D(*)$.

\hypertarget{FromInfinityCategories}{}\subsubsection*{{From $(\infty,1)$-categories}}\label{FromInfinityCategories}

If $C$ is an [[(∞,1)-category]], it has a [[homotopy category of an (∞,1)-category|homotopy category]] $Ho(C)$ obtained by identifying equivalent [[1-morphisms]]. If our $(\infty,1)$-categories are modeled by [[quasicategories]], then $Ho(-)$ is the [[left adjoint]] of the [[nerve]], often denoted $\tau_1$.

Since categories are in particular $(\infty,1)$-categories, for any category $X$ we have a [[functor (∞,1)-category]] $C^X$, and thus a homotopy category $Ho(C^X)$. We define the \emph{homotopy prederivator} of $C$ by

\begin{displaymath}
Ho(C)(X) = Ho(C^X).
\end{displaymath}
If $C$ has [[limit in an (∞,1)-category|limits]] and colimits in the $(\infty,1)$-categorical sense, then $Ho(C)$ should be a derivator.

\hypertarget{exotic_examples}{}\subsubsection*{{Exotic examples}}\label{exotic_examples}

There are also examples of derivators not satisfying (Der5) that do not arise from homotopy theory or higher category theory in this way. For instance, see Remark 5.4 and Example 5.5 in \hyperlink{LN16}{Lagkas-Nikolos}.

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

\hypertarget{PresentableDerivatorsAndCombinatorialModelCategories}{}\subsubsection*{{Presentable derivators and combinatorial model categories}}\label{PresentableDerivatorsAndCombinatorialModelCategories}

We discuss precise versions of the idea that derivators indeed constitute a model of [[(∞,1)-category theory]].

\begin{theorem}
\label{}\hypertarget{}{}
The sub-[[2-category]] of ``[[locally presentable category|locally presentable]]'' derivators with left adjoints as morphisms between them, among the [[2-category]] of all derivators (see \hyperlink{2CategoryOfDerivators}{above}), is [[equivalence of 2-categories|equivalent]] to the [[2-localization]] of the 2-category of [[combinatorial model categories]] at the [[Quillen equivalences]].

\end{theorem}
This is shown in (\hyperlink{Renaudin}{Renaudin}). See at [[Ho(CombModCat)]] for more.

Notice every [[locally presentable (∞,1)-category]] are precisely the [[(∞,1)-categories]] that arise, up to [[equivalence of (∞,1)-categories]] as [[simplicial localizations]] of [[combinatorial model categories]]. Hence this theorem suggests that there is, at least, an [[equivalence of 2-categories]] between the [[2-category]] of presentable derivators and the [[homotopy 2-category]] of the [[(∞,2)-category]] [[Pr(∞,1)Cat]] However, an actual proof of this seems to be missing.

As a corollary, we obtain a canonical comparison [[functor]]

\begin{displaymath}
Ho(PrDer)
  \longrightarrow
  Ho(Pr(\infty,1)Cat)
\end{displaymath}
from the homotopy category presentable derivators with left adjoint morphisms, to the [[homotopy category of an (∞,1)-category]] of [[Pr(∞,1)Cat]].

This is induced by the [[universal property]] of the [[2-localization of a 2-category|2-localization]] from the fact that the functor $L^H$ that forms [[simplicial localizations]]

\begin{displaymath}
L^H \;\colon\; CombModCat \longrightarrow Ho(Pr(\infty,1)Cat)
\end{displaymath}
sends [[Quillen equivalences]] to [[equivalence of (∞,1)-categories]] (see thereresentable infinity-category\#PresentedByCombinatorialSimplicialModelCategories)).

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

Special kinds of derivators:

\begin{itemize}%
\item [[pointed derivator]]
\item [[stable derivator]]
\item [[monoidal derivator]]
\item [[enriched derivator]]
\item [[finitely complete prederivator]]
\item [[regular derivator]]

\end{itemize}
The calculus of homotopy Kan extensions used in derivators:

\begin{itemize}%
\item [[homotopy exact square]]

\end{itemize}
Special limits and structures in derivators:

\begin{itemize}%
\item [[pullback in a derivator]]
\item [[monomorphism in a derivator]]
\item [[coend in a derivator]]
\item [[orthogonal factorization system in a derivator]]

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

The term \emph{derivator} is originally due to [[Grothendieck]], introduced in \emph{[[Pursuing Stacks]]} . The first fifteen chapters of a 2000 page manuscript of Grothendieck (in French) about derivators can be found at:

\begin{itemize}%
\item [[Alexander Grothendieck]], \emph{\href{http://people.math.jussieu.fr/~maltsin/groth/Derivateurs.html}{Les D\'e{}rivateurs}}

\end{itemize}
Independently, there is a version due to [[Alex Heller]] (who called them ``homotopy theories''):

\begin{itemize}%
\item [[Alex Heller]], \emph{Homotopy theories} , Memoirs of the American Mathematical Society, Vol. 71, No 383 (1988).

\end{itemize}
\begin{itemize}%
\item Alex Heller, \emph{Stable homotopy theories and stabilization} , \href{http://www.ams.org/mathscinet-getitem?mr=1431157}{MR} -- see [[pointed derivator]] and [[stable derivator]]

\end{itemize}
Apparently also independent is the development by Franke, who takes an enriched approach to the pointed case and also assumes stability:

\begin{itemize}%
\item Jens Franke, \emph{Uniqueness theorems for certain triangulated categories with an Adams spectral sequence}, \href{http://www.math.uiuc.edu/K-theory/0139/}{K-theory archive}

\end{itemize}
Georges Maltsiniotis has written an introduction to the topic (in French):

\begin{itemize}%
\item [[Georges Maltsiniotis]], \emph{Introduction \`a{} la th\'e{}orie des d\'e{}rivateurs, d'apr\`e{}s Grothendieck} , Preprint (2001) \href{http://www.math.jussieu.fr/~maltsin/ps/m.ps}{ps}

\end{itemize}
He also gave a \href{http://congreso.us.es/htag09/php/index.php?carga=courses}{course} (in English) in Seville, Sep 2010, and part 3 is on derivators:

\begin{itemize}%
\item [[Georges Maltsiniotis]]

\begin{itemize}%
\item \href{http://people.math.jussieu.fr/~maltsin/Seville/Lecture_I_Localizers.pdf}{Lecture I (Localizers)}

\href{http://people.math.jussieu.fr/~maltsin/Seville/Lecture_II_Model_Categories.pdf}{Lecture II (Model Categories)}

\href{http://people.math.jussieu.fr/~maltsin/Seville/Lecture_III_Derivators.pdf}{Lecture III (Derivators)}

\href{http://people.math.jussieu.fr/~maltsin/Seville/Summary_on_Derivators.pdf}{Summary on Derivators}



\end{itemize}


\end{itemize}
Part of the above material is adapted from

\begin{itemize}%
\item [[Denis-Charles Cisinski]], \emph{\href{http://golem.ph.utexas.edu/category/2010/03/a_perspective_on_higher_catego.html#c032227}{blog comment on derivators}}

\end{itemize}
Cisinski has also written a number of papers on the subject (in French), which can be found at \href{http://www.math.univ-toulouse.fr/~dcisinsk/publications.html}{his homepage}.

\begin{itemize}%
\item --- Images directes cohomologiques dans les cat\'e{}gories de mod\`e{}les. \emph{Ann. Math. Blaise Pascal}, 10(2):195--244, 2003.

\end{itemize}
Derivators were also recently used by [[Gonçalo Tabuada]] in a universal characterization of higher [[algebraic K-theory]]:

\begin{itemize}%
\item [[Gonçalo Tabuada]], ``Higher K-theory via universal invariants'' \href{http://arxiv.org/abs/0706.2420}{arXiv}.

\end{itemize}
An introduction to some of the theory of pointed and stable derivators, in English, can be found in the paper:

\begin{itemize}%
\item [[Denis-Charles Cisinski]] and [[Amnon Neeman]], \emph{Additivity for derivator K-theory} , \href{http://www.ams.org/mathscinet-getitem?mr=2382732}{MR}

\end{itemize}
An brief informal discussion of derivators as a 2-categorical tool for studying $(\infty,1)$-categories is contained in

\begin{itemize}%
\item [[Mike Shulman]], \emph{Squeezing Higher Categories out of Lower Categories} (\href{http://golem.ph.utexas.edu/category/2010/05/squeezing_higher_categories_ou.html}{blog})

\end{itemize}
In the paper

\begin{itemize}%
\item [[Olivier Renaudin]], \emph{Theories homotopiques de Quillen combinatoires et derivateurs de Grothendieck}, \href{http://arxiv.org/abs/math/0603339}{arxiv}

\end{itemize}
it is proven that the 2-category of ``[[locally presentable category|locally presentable]]'' derivators is equivalent to the [[localization]] of the 2-category of [[combinatorial model categories]] at the [[Quillen equivalences]]. Thus in some sense derivators capture ``all the information'' about a combinatorial model category, hence also about a [[locally presentable (∞,1)-category]].

Along somewhat similar lines, in

\begin{itemize}%
\item Kevin Carlson, \emph{On the ∞-categorical Whitehead theorem and the embedding of quasicategories in prederivators}, \href{https://arxiv.org/abs/1612.06980}{arxiv}

\end{itemize}
it is shown that $(\infty,1)$-categories can be literally embedded in ``prederivators'' as long as we allow \emph{strict morphisms} between the latter (which is arguably somewhat against the spirit of derivators, but still interesting), and that at the 2-categorical level the embedding is conservative but generally fails to be full on large $(\infty,1)$-categories. This is developed further in

\begin{itemize}%
\item Daniel Fuentes-Keuthan, Magdalena Kedziorek, Martina Rovelli, \emph{A model structure on prederivators for (∞,1)-categories}, \href{https://arxiv.org/abs/1810.06496}{arxiv}, 2018

\end{itemize}
An introductory discussion aimed towards [[stable derivator]]s is also in

\begin{itemize}%
\item [[Moritz Groth]], \emph{Monoidal derivators and additive derivators}, \href{http://arxiv.org/abs/1203.5071}{arxiv/1203.5071}; \emph{Derivators, pointed derivators, and stable derivators} (\href{http://www.math.uni-bonn.de/~mgroth/groth_derivators.pdf}{pdf})

\end{itemize}
Other references include:

\begin{itemize}%
\item Ioannis Lagkas-Nikolos, \emph{Levelwise modules over separable monads on stable derivators}, \href{https://arxiv.org/abs/1608.06340}{arXiv:1608.06340}, 2016

\end{itemize}
[[!redirects derivators]] [[!redirects prederivator]] [[!redirects prederivators]] [[!redirects derivateur]] [[!redirects dérivateur]] [[!redirects derivateurs]] [[!redirects dérivateurs]] [[!redirects semiderivator]] [[!redirects semiderivators]]



\end{document}