\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*{canonical model structure on Cat}

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

\hypertarget{model_category_theory}{}\paragraph*{{Model category theory}}\label{model_category_theory}

[[!include model category theory - contents]]

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

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

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

\noindent\hyperlink{the_canonical_model_structure_on_}{The canonical model structure on $Cat$}\dotfill \pageref*{the_canonical_model_structure_on_} \linebreak
\noindent\hyperlink{the_classical_version}{The classical version}\dotfill \pageref*{the_classical_version} \linebreak
\noindent\hyperlink{relation_with_bisimplicial_sets}{Relation with bisimplicial sets}\dotfill \pageref*{relation_with_bisimplicial_sets} \linebreak
\noindent\hyperlink{uniqueness_of_model_structure}{Uniqueness of model structure}\dotfill \pageref*{uniqueness_of_model_structure} \linebreak
\noindent\hyperlink{proof}{Proof}\dotfill \pageref*{proof} \linebreak
\noindent\hyperlink{without_choice}{Without choice}\dotfill \pageref*{without_choice} \linebreak
\noindent\hyperlink{the_projective_model_structure}{The projective model structure}\dotfill \pageref*{the_projective_model_structure} \linebreak
\noindent\hyperlink{the_injective_model_structure}{The injective model structure}\dotfill \pageref*{the_injective_model_structure} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak


\hypertarget{the_canonical_model_structure_on_}{}\subsection*{{The canonical model structure on $Cat$}}\label{the_canonical_model_structure_on_}

The [[canonical model structure]] on [[Cat]] is a [[model structure]] which encapsulates part of [[category theory]] as a version of [[homotopy theory]]. It is a special case of the general notion of [[canonical model structure]] on categorical structures, and is also called the \textbf{trivial model structure} or the \textbf{categorical model structure}. Its [[weak equivalences]] are the [[equivalences of categories]] and its [[homotopy category]] is [[Ho(Cat)]], the category obtained from the 1-category $Cat$ by identifying naturally isomorphic functors. See the \emph{[[joyalscatlab:Model structures on Cat|Catlab]]} for the theory of this structure.

Assuming the [[axiom of choice]], the canonical model is the \emph{unique} model structure on $Cat$ such that the weak equivalences are categorical equivalences (thus justifying the word `canonical'). It is different than the [[Thomason model structure]], where weak equivalences are functors that give a weak equivalence of simplicial sets when we take the [[nerve]].

On this page we give a concise construction of the canonical model structure, as well as two variants that make sense in the absence of the full [[axiom of choice]].

\noindent\hyperlink{the_canonical_model_structure_on_}{The canonical model structure on $Cat$}\dotfill \pageref*{the_canonical_model_structure_on_} \linebreak
\noindent\hyperlink{the_classical_version}{The classical version}\dotfill \pageref*{the_classical_version} \linebreak
\noindent\hyperlink{relation_with_bisimplicial_sets}{Relation with bisimplicial sets}\dotfill \pageref*{relation_with_bisimplicial_sets} \linebreak
\noindent\hyperlink{uniqueness_of_model_structure}{Uniqueness of model structure}\dotfill \pageref*{uniqueness_of_model_structure} \linebreak
\noindent\hyperlink{proof}{Proof}\dotfill \pageref*{proof} \linebreak
\noindent\hyperlink{without_choice}{Without choice}\dotfill \pageref*{without_choice} \linebreak
\noindent\hyperlink{the_projective_model_structure}{The projective model structure}\dotfill \pageref*{the_projective_model_structure} \linebreak
\noindent\hyperlink{the_injective_model_structure}{The injective model structure}\dotfill \pageref*{the_injective_model_structure} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak


\hypertarget{the_classical_version}{}\subsubsection*{{The classical version}}\label{the_classical_version}

For purposes of this page, [[Cat]] will denote the [[1-category]] of [[small categories]] and [[functors]], and our categories are all [[strict categories]] as in ordinary set-theoretic [[foundations]]. We write $C_0$ for the set of objects of a small category $C$. Define a functor to be:

\begin{itemize}%
\item a [[weak equivalence]] if it is an [[equivalence of categories]], or equivalently if it is [[fully faithful functor|fully faithful]] and [[essentially surjective functor|essentially surjective]].


\item a [[cofibration]] if it is injective on objects, i.e. an [[isocofibration]].


\item a [[fibration]] if it is an [[isofibration]].



\end{itemize}
We claim that this defines a model structure. It is easy to verify that the weak equivalences satisfy the [[2-out-of-3 property]]; thus it remains to show that (acyclic cofibrations, fibrations) and (cofibrations, acyclic fibrations) are [[weak factorization systems]].

Suppose given a square

\begin{displaymath}
\itexarray{A & \overset{f}{\to} & C\\
  ^i\downarrow && \downarrow^p\\
  B& \underset{g}{\to} & D}
\end{displaymath}
in which $i$ is a cofibration and $p$ a fibration.

Suppose first that $p$ is acyclic. It is easy to see that the acyclic fibrations are precisely the equivalences of categories that are surjective on objects. Thus, since (mono, epi) is a [[weak factorization system on Set]], we can define $h_0\colon B_0\to C_0$ filling the square, and then full-faithfulness of $p$ gives a unique definition of $h$ on arrows.

Now suppose that $i$ is acyclic, so that $i_0 \colon A_0 \to B_0$ is injective. Since $i$ is essentially surjective, we can choose, for each $b\in B_0 \setminus A_0$, an isomorphism $\phi_b\colon i(a_b) \cong b$. We then have $g(\phi_b)\colon p(f(a_b)) = g(i(a_b)) \cong g(b)$, so since $p$ is an isofibration, we can also choose, for each $b\in B_0$, an isomorphism $\psi_b\colon f(a_b) \cong c_b$ such that $p(\psi_b) = g(\phi_b)$. Define $h_0\colon B_0\to C_0$ to be $f_0$ on the image of $i_0$ and to take $b\in B_0 \setminus A_0$ to $c_b$. We can define $h$ on arrows by composing with the isomorphisms $\psi$ to make it a lifting.

It remains to prove the factorization axioms. Suppose given a functor $f\colon A\to B$. First, define $C_0 = A_0 + B_0$, and make $C$ into a category in the unique way such that the map $C\to B$ induced by $f$ and $1_B$ is fully faithful. Since it is surjective on objects, it is an acyclic fibration, and clearly the induced map $A\to C$ is injective on objects, i.e. a cofibration.

Next, define $D$ to be the category of triples $(a,b,\phi)$ where $\phi\colon f(a)\cong b$ is an isomorphism in $B$. In other words, it is the [[comma object|strict iso-comma category]] $(f/_\cong 1_b)$. The projection $D\to B$ is easily shown to be an isofibration, while the functor $A\to D$ defined by $a \mapsto (a, f(a), 1_{f(a)})$ is an injective equivalence.

This completes the proof. Note that the two factorizations constructed above are in fact functorial. This model structure is easily seen to be [[cofibrantly generated model category|cofibrantly generated]], although the above factorizations are not those constructed from the [[small object argument]] (though they are closely related to the [[algebraic weak factorization system]]s produced from Richard Garner's modified small object argument).

\hypertarget{relation_with_bisimplicial_sets}{}\paragraph*{{Relation with bisimplicial sets}}\label{relation_with_bisimplicial_sets}

Recall that Rezk's classifying diagram for a (small) category $C$ is the [[bisimplicial set]] $N (C)$ defined by $N (C)_{n, m} = Fun ([n] \times \mathbf{I}[m], C)$, where $[n]$ is the standard $n$-[[simplex]] considered as a category and $\mathbf{I}$ is the [[localization|groupoid completion]] functor (i.e. $D \mapsto D [D^{-1}]$). There is then an [[adjunction]]

\begin{displaymath}
\tau_1 \dashv N : Cat \to ssSet
\end{displaymath}
and it can be shown (see the following subsection) that the canonical model structure on Cat is the model structure obtained by [[transferred model structure|transferring]] the [[model structure on simplicial presheaves|projective model structure]] on $ssSet$.

\hypertarget{uniqueness_of_model_structure}{}\subsubsection*{{Uniqueness of model structure}}\label{uniqueness_of_model_structure}

A remarkable and perhaps surprising result (and surprisingly not better known!) is that there is just one model structure on $Cat$\footnote{Along similar lines, one can \href{https://www.matem.unam.mx/~omar/notes/modelcatsets.html}{prove} (assuming AC) that there are nine -- count `em, nine -- Quillen model structures on $Set$.}  whose equivalences are the usual categorical equivalences. This result justifies the term ``canonical''.

The proof we present below is adapted (with minor changes) from a \href{http://sbseminar.wordpress.com/2012/11/16/the-canonical-model-structure-on-cat/}{proof} given by [[Chris Schommer-Pries]]. See also this MathOverflow \href{http://mathoverflow.net/questions/18744/is-model-structure-on-catset-unique}{thread}, particularly the \href{http://mathoverflow.net/a/46471/2926}{answer} given by [[Steve Lack]] (with a pertinent comment by [[Denis-Charles Cisinski]]).

\hypertarget{proof}{}\paragraph*{{Proof}}\label{proof}

Let $\mathbf{M}$ denote any model structure on $Cat$ whose weak equivalences are categorical equivalences. We will prove that $\mathbf{M}$-fibrations are exactly canonical fibrations and that $\mathbf{M}$-cofibrations are exactly canonical cofibrations.

\begin{lemma}
\label{}\hypertarget{}{}
The terminal object $1$ is $\mathbf{M}$-cofibrant, i.e., the inclusion $0 \to 1$ in $Cat$ is an $\mathbf{M}$-cofibration.

\end{lemma}
\begin{proof}
Let $C$ be any noninitial category; by a standard result of model category theory, there is an $\mathbf{M}$-cofibrant replacement $\tilde{C} \to C$, a weak equivalence such that $0 \to \tilde{C}$ is a cofibration. This $\tilde{C}$ is noninitial and therefore has $1$ as a retract; thus $1$ is $\mathbf{M}$-cofibrant since cofibrant objects are closed under retracts.

\end{proof}
\begin{prop}
\label{canonical}\hypertarget{canonical}{}
Each acyclic $\mathbf{M}$-fibration is a canonical acyclic fibration.

\end{prop}
\begin{proof}
\end{proof}
Before giving the next result, we recall that the lifting relation on morphisms gives a [[Galois connection]]. Specifically, suppose $c: A \to B$ and $f: c \to d$ are functors, and define $c \perp f$ if for every morphism from $c$ to $f$ in the arrow category $Cat^\mathbf{2}$, i.e., for every commutative diagram

\begin{displaymath}
\itexarray{
A & \to & C \\ 
_\mathllap{c} \downarrow & & \downarrow_\mathrlap{f} \\ 
B & \to & D
}
\end{displaymath}
of functors, there is a lifting $B \to C$ filling in to make two commutative triangles. As any relation does, this lifting relation $\perp$ gives a Galois connection on subclasses of $Mor(Cat)$. General facts about Galois connections may then be applied.

\begin{cor}
\label{sub}\hypertarget{sub}{}
Every canonical cofibration is an $\mathbf{M}$-cofibration. Every $\mathbf{M}$-fibration is a canonical fibration.

\end{cor}
\begin{proof}
By the Galois connection induced by the lifting relation, Proposition \ref{canonical} implies that canonical cofibrations form a subset of $\mathbf{M}$-cofibrations, and therefore that canonical acyclic cofibrations are a subset of acyclic $\mathbf{M}$-cofibrations. Again by the Galois connection, this in turn implies that $\mathbf{M}$-fibrations form a subset of canonical fibrations.

\end{proof}
At this point, we would like to show conversely that every $\mathbf{M}$-cofibration is a canonical cofibration (i.e., is injective on objects); another appeal to Galois connections would then allow us to deduce that every canonical fibration is an $\mathbf{M}$-fibration, and we would be done. Let us suppose otherwise, that there exists an $\mathbf{M}$-cofibration that is not injective on objects, and derive a contradiction.

For a set $S$, let $K(S)$ be the category whose objects are the elements of $S$, with exactly one morphism $x \to y$ for any $x, y \in S$. This gives the \emph{codiscrete} (or \emph{chaotic}) functor $K: Set \to Cat$, which is right adjoint to the forgetful functor $U: Cat \to Set$ that takes a category to its underlying set of objects. For each inhabited set $S$, we have that $K(S)$ is equivalent to $1$, and conversely any category equivalent to $1$ is isomorphic to some $K(S)$.

\begin{prop}
\label{key}\hypertarget{key}{}
If there is any $\mathbf{M}$-cofibration $f: A \to B$ that is not injective on objects, then the map $K(2) \to 1$ ($2 = \{0, 1\}$) is an (acyclic) $\mathbf{M}$-cofibration.

\end{prop}
\begin{proof}
First we observe that for any category $E$, the unit map $\eta_E: E \to K U(E)$ for the adjunction $U \dashv K$ is an $\mathbf{M}$-cofibration. For, the map $\eta_E$ is an isomorphism on objects and therefore a canonical cofibration; it is an $\mathbf{M}$-cofibration by Corollary \ref{sub}.

By hypothesis, $f$ maps two objects $a, a'$ of $A$ to the same object $b$ of $B$, so there is a commutative diagram

\begin{displaymath}
\itexarray{
2 & \stackrel{(a, a')}{\hookrightarrow} & U A \\ 
\downarrow & & \downarrow_\mathrlap{f} \\ 
1 & \underset{b}{\to} & U B.
}
\end{displaymath}
Let $r: U A \to 2$ be a retraction of the injection $2 \to U A$. By the adjunction $U \dashv K$, the map $r$ corresponds to a map $s: A \to K(2)$. We form a pushout square

\begin{displaymath}
\itexarray{
A & \stackrel{s}{\to} & K(2) & & \\ 
_\mathllap{f} \downarrow & & \downarrow_\mathrlap{g} & & \\ 
B & \underset{h}{\to} & E & \underset{\eta_E}{\to} & K U(E)
}
\end{displaymath}
where $g$ is an $\mathbf{M}$-cofibration (being the pushout of a cofibration $f$). Thus we have a composite cofibration $t \coloneqq \eta_E \circ g: K(2) \to K U(E)$. It may be verified that $K(2) \to 1$ is a retract of $t$, i.e., there is a commutative square

\begin{displaymath}
\itexarray{
K(2) & \stackrel{id}{\to} & K(2) \\ 
_\mathllap{t} \downarrow & & \downarrow \\ 
K U(E) & \underset{j}{\leftarrow} & 1
}
\end{displaymath}
where $j = \eta_E \circ h \circ b$; this diagram commutes on objects by construction, and it commutes on morphisms because all diagrams commute in $K U(E)$. Thus $K(2) \to 1$, being a retract of an $\mathbf{M}$-cofibration, is also an $\mathbf{M}$-cofibration.

\end{proof}
The conclusion of Proposition \ref{key} now leads to a contradiction:

\begin{prop}
\label{}\hypertarget{}{}
If $K(2) \to 1$ is an acyclic $\mathbf{M}$-cofibration, then for any category $C$, every automorphism of $C$ is an identity (which is absurd!).

\end{prop}
\begin{proof}
The object $C$ of $Cat$ has an $\mathbf{M}$-fibrant replacement $\hat{C}$ equivalent to $C$. For any isomorphism $\phi$ of $\hat{C}$, let $e: K(2) \to \hat{C}$ be the unique functor taking $0 \to 1$ in $K(2)$ to $\phi$. Then we have a commutative diagram

\begin{displaymath}
\itexarray{
K(2) & \stackrel{e}{\to} & \hat{C} \\ 
_\mathllap{acyc.\; cof.} \downarrow & & \downarrow _\mathrlap{fib.} \\ 
1 & \to & 1
}
\end{displaymath}
and the existence of a lift $1 \to \hat{C}$ filling in this diagram means that $\phi$ is an identity. In particular, every automorphism of $\hat{C}$ is an identity; since $C \simeq \hat{C}$, the same is true of $C$.

\end{proof}
\hypertarget{without_choice}{}\subsubsection*{{Without choice}}\label{without_choice}

In the absence of the axiom of choice, one must distinguish between \emph{strong equivalences of categories}, which come with an inverse up to isomorphism, and \emph{weak equivalences of categories}, which are merely fully faithful and essentially surjective on objects. Since weak equivalences of categories still ``preserve all categorical information,'' we might hope to find a model structure on $Cat$ whose weak equivalences are the \emph{weak} equivalences of categories. The notion of [[anafunctor]] also suggests such an approach, since an anafunctor (the ``right'' replacement for a functor in the absence of choice) is a particular sort of [[generalized morphism]]: a span $A\leftarrow F \to B$ of functors in which $F\to A$ is a surjective equivalence.

If there is to be such a model structure, however, then since generalized morphisms between fibrant-and-cofibrant objects are all represented by ordinary ones, there must exist ``cofibrant categories'' and ``fibrant categories'' such that every anafunctor between fibrant-and-cofibrant categories is equivalent to an honest functor, and every category can be replaced by a fibrant and cofibrant one. It seems unlikely that this would be true without \emph{any} choice-like axioms, but notably weaker axioms than full AC do suffice.

\hypertarget{the_projective_model_structure}{}\paragraph*{{The projective model structure}}\label{the_projective_model_structure}

For the existence of the model structure in this case, we assume [[COSHEP]], aka the ``presentation axiom,'' namely that the category [[Set]] has enough [[projective objects]]. Define a functor $f\colon A\to B$ to be:

\begin{itemize}%
\item a [[weak equivalence]] if it is a weak equivalence of categories, i.e. [[fully faithful functor|fully faithful]] and [[essentially surjective functor|essentially surjective on objects]].


\item a [[cofibration]] if it is injective on objects, and $B_0\setminus f(A_0)$ is a projective object in $Set$.


\item a [[fibration]] if it is an [[isofibration]].



\end{itemize}
As before, the acyclic fibrations are precisely the weak equivalences that are literally surjective on objects. Now recall that assuming COSHEP, (monics with projective complement, epics) is a [[weak factorization system on Set]]. This supplies the lifting of cofibrations against acyclic fibrations. Likewise, the factorization of $f\colon A\to B$ into a cofibration followed by an acyclic fibration is given by first factoring $f_0$ as $A_0 \to A_0 + B_0' \to B_0$, where $B_0'\to B_0$ is a projective cover.

The other factorization works exactly as before, while for lifting acyclic cofibrations against fibrations, we notice that in the original proof, we only needed to apply choice for sets indexed by $B_0\setminus i(A_0)$, which we have assumed to be projective when $i\colon A\to B$ is a cofibration.

Weak equivalences of categories are easily seen to satisfy the 2-out-of-3 property, so we have a model category. Note that all categories are fibrant in this model structure, while the cofibrant categories are those whose set of objects is projective.

The existence of this model structure implies, in particular, that under COSHEP the category $Ana(C,D)$ is [[essentially small category|essentially small]], being in fact equivalent to the category $Fun(C',D)$ of ordinary functors where $C'$ is a cofibrant replacement for $C$.

\hypertarget{the_injective_model_structure}{}\paragraph*{{The injective model structure}}\label{the_injective_model_structure}

Is there a dual model structure in which all categories are cofibrant? This seemingly has to do with [[stack]] completion: the fibrant objects would be \emph{stacks} for the [[regular coverage]] of $Set$. (Without AC, not all small categories are stacks.) Is Makkai's [[axiom of small cardinality selection]] (which he uses, instead of COSHEP, to prove that $Ana(C,D)$ is essentially small) sufficient for the existence of an ``injective'' model structure on Cat?

\hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts}

\begin{itemize}%
\item [[canonical model structure]]


\item \textbf{canonical model structure on $Cat$}


\item [[canonical model structure on groupoids|canonical model structure on Grpd]]


\item [[canonical model structure on Operad]]



\end{itemize}
[[!redirects canonical model structure on Cat]] [[!redirects canonical model structure on categories]] [[!redirects natural model structure on Cat]] [[!redirects natural model structure on categories]] [[!redirects folk model structure on Cat]] [[!redirects folk model structure on categories]]



\end{document}