\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*{model structure on algebraic fibrant objects}

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

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

[[!include model category theory - contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak
\noindent\hyperlink{details}{Details}\dotfill \pageref*{details} \linebreak
\noindent\hyperlink{the_left_adjoint}{The left adjoint}\dotfill \pageref*{the_left_adjoint} \linebreak
\noindent\hyperlink{Monadicity}{Monadicity of the forgetful functor}\dotfill \pageref*{Monadicity} \linebreak
\noindent\hyperlink{Solidity}{Solidity of the forgetful functor}\dotfill \pageref*{Solidity} \linebreak
\noindent\hyperlink{LimitsAndColimits}{Limits and colimits of algebraic objects}\dotfill \pageref*{LimitsAndColimits} \linebreak
\noindent\hyperlink{transferred_model_structure}{Transferred model structure}\dotfill \pageref*{transferred_model_structure} \linebreak
\noindent\hyperlink{LocalPresentability}{Local presentability and combinatoriality}\dotfill \pageref*{LocalPresentability} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{AlgebaicHigherCategories}{Algebraic $\infty$-groupoids}\dotfill \pageref*{AlgebaicHigherCategories} \linebreak
\noindent\hyperlink{algebraic_categories}{Algebraic $(\infty,1)$-categories}\dotfill \pageref*{algebraic_categories} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

An object in a [[model category]] is fibrant if all morphisms into it have extensions along acyclic cofibrations. An \textbf{algebraic fibrant object} is a fibrant object equipped with a \emph{choice} of such extensions.

Under mild conditions, the category $Alg C$ of algebraic fibrant objects in a model category $C$ forms itself naturally a model category which is [[Quillen equivalence|Quillen equivalent]] to $C$, and in which all objects are fibrant. Notably, $Alg C$ is always a [[category of fibrant objects]].

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

\begin{udefn}
Let $C$ be a [[cofibrantly generated model category]] such that

\begin{itemize}%
\item all acyclic cofibrations are [[monomorphism]]s.

\end{itemize}
Choose a set $\{A_j \to B_j\}_{j \in J}$ of acyclic cofibrations such that

\begin{itemize}%
\item the [[domain]]s $A_j$ are [[small object]]s;


\item an object $X \in C$ is fibrant precisely if it has the [[right lifting property]] against these morphisms.



\end{itemize}
An \textbf{algebraic fibrant object} in $C$ is a fibrant object of $C$ together with a choice of lifts (``fillers'') $\sigma_j : B_j \to X$ in

\begin{displaymath}
\itexarray{
    A_j &\to& X
    \\
    \downarrow & \nearrow_{\mathrlap{\sigma_j}}
    \\
    B_j
  }
\end{displaymath}
for each morphism $A_j \to X$, $j \in J$.

Write $Alg C$ for the category whose objects are algebraic fibrant objects in $C$ and whose morphisms are morphisms in $C$ that respect the chosen lifts.

\end{udefn}
\begin{uremark}
The set $J$ can be taken to be that of all generating acyclic cofibrations, if their domains are small. But often there are smaller subsets that still characterize all fibrant objects.

\end{uremark}
\begin{utheorem}
The [[forgetful functor]] [[adjunction]]

\begin{displaymath}
(F \dashv U) : Alg C \stackrel{\overset{F}{\leftarrow}}{\underset{U}{\to}} C
\end{displaymath}
induces the [[transferred model structure]] on $Alg C$: the fibrations and weak equivalences in $Alg C$ are those of the underlying morphisms in $C$.

In particular, every object in $Alg C$ is fibrant.

The [[Quillen adjunction]] $(F \dashv U)$ is a [[Quillen equivalence]].

\end{utheorem}
This is (\hyperlink{Nikolaus}{Nikolaus, theorem 2.20})

\begin{uremark}
Since fibrations in $Alg C$ are created in $C$, and any algebraically fibrant object is, in particular, fibrant, every object in the model category $Alg C$ is fibrant. Thus almost any model category is equivalent to one in which all objects are fibrant. However, in general not all objects in $Alg C$ will be cofibrant, even if this was true in $C$ itself.

\end{uremark}
\hypertarget{details}{}\subsection*{{Details}}\label{details}

We spell out the constructions and lemmas that yield the \hyperlink{ModelStructureTheorem}{theorem on the model structure}. In the course of this we also discuss a few results of interest in their own right, such as the monadicity, local presentability and combinatoriality of $Alg C$.

\hypertarget{the_left_adjoint}{}\subsubsection*{{The left adjoint}}\label{the_left_adjoint}

We describe explicitly the [[left adjoint]] $F : C \to Alg C$ to the [[forgetful functor]] $U : Alg C \to C$. This follows [[Richard Garner]]`s improved version of the [[small object argument]] (\hyperlink{Garner}{Garner}).

For $X \in C$ define a new object $X_\infty$ inductively as follows.

\begin{udefn}
$X_1$ is the [[pushout]] (in $C$)

\begin{displaymath}
\itexarray{
     \coprod A_j &\to& X
     \\
     \downarrow && \downarrow
     \\
     \coprod B_j &\to& X_1
  }
  \,,
\end{displaymath}
here the disjoint unition is taken over all $j$ and all morphisms $A_j \to X$.

\end{udefn}
\begin{udefn}
This pushout adds all possible ``[[horn]]'' fillers to $X$, given by the $B_j \to X_1$. However, after adding the new fillers there may also appear new horns. So we continue this procedure iteratively by filling these new horns.

Since $\coprod A_j \to \coprod B_j$ is an acyclic cofibration in $C$, so is its its pushout, hence by assumption the pushout $X \to X_1$ is a monomorphism. This implies that if an $A_j \to X_1$ factors through $X \to X_1$ then it does so uniquely.

\end{udefn}
\begin{udefn}
Let $X_2$ be the [[pushout]]

\begin{displaymath}
\itexarray{
     \coprod A_j &\to& X_1
     \\
     \downarrow && \downarrow
     \\
     \coprod B_j &\to& X_2
  }
  \,,
\end{displaymath}
where now the coproduct is over those morphisms $A_j \to X$ that do \emph{not} factor throuth $X \to X_1$.

Proceeding this way yields a sequence of acyclic cofibrations

\begin{displaymath}
X \to X_1 \to X_2 \to X_3 \to \cdots 
  \,.
\end{displaymath}
We set

\begin{displaymath}
X_\infty :=  \lim_\to (X \to X_1 \to X_2 \to X_3 \to \cdots )
\end{displaymath}
be the [[colimit]] over this sequence.

\end{udefn}
\begin{uobservation}
The object $X_\infty$ inherits canonical fillers: since by all $A_j$ are [[small object]]s we have that every morphism $A_j \to X_\infty$ factors through one of the intermediate $X_i$. Then for any of the morphisms $A_j \to B_j$ in $J$ the corresponding morphism $B_j \to X_{i+1} \to X_\infty$ provides a filler.

\end{uobservation}
\begin{uprop}
The assignment $F : X \to X_\infty$ with $X_\infty$ regarded as an algebraic fibrant objects as above constitutes a left [[adjoint functor]] $F : C \to Alg C$ to the [[forgetful functor]] $U : Alg C \to C$.

The unit of this [[adjunction]] is the inclusion $X \to X_\infty$ given by the above construction and is hence a weak equivalence.

\end{uprop}
\begin{proof}
We establish the hom-isomorphism of the [[adjunction]] and its construction by the unit of the adjunction: For any $Z \in Alg C$ and $\phi : X \to U(Z)$ any morphism in $C$, we need to show that there is a unique [[commuting diagram]]

\begin{displaymath}
\itexarray{
    X &\stackrel{\phi}{\to}& Z
    \\
    \downarrow & \nearrow_{\exists ! \phi_\infty}
    \\
    X_\infty
  }
  \,.
\end{displaymath}
Since by assumption $Z$ has all fillers we have commuting diagrams

\begin{displaymath}
\itexarray{
      A_j &\to& X 
     \\
     \downarrow && \downarrow^{\mathrlap{\phi}}
     \\
     B_j &\to& Z
  }
  \,.
\end{displaymath}
By the universality of the pushout these induce unique morphisms

\begin{displaymath}
\itexarray{
    X &\stackrel{\phi}{\to}& Z
    \\
    \downarrow & \nearrow_{\phi_1 }
    \\
    X_1
  }
  \,.
\end{displaymath}
By induction this induces morphisms $\phi_n : X_n \to Z$ that form a [[cocone]] under $(X \to X_1 \to X_2 \to \cdots )$. Therefore there is a unique morphusm $\phi_\infty$ as indicated.

\end{proof}
\begin{ucorollary}
The morphisms $F(j) : F A_j \to F B_j$ have [[retract]]s.

\end{ucorollary}
\begin{proof}
Since $F$ is [[left adjoint]] to $U$ the condition that $F A_j \to F B_j \stackrel{r}{\to} F A_j$ is the [[identity]] is equivalent to its [[adjunct]], the diagonal in

\begin{displaymath}
\itexarray{
    A_j &\stackrel{j}{\to}& B_j &\stackrel{r}{\to}& A_j
    \\
    \downarrow && \downarrow &\searrow^{\mathrlap{\tilde r}}& \downarrow
    \\
    U F A_j &\stackrel{U F (j)}{\to}& U F B_j &\stackrel{U F r}{\to} & U F A_j
  }
\end{displaymath}
being the unit of the adjunction $A_j \to U F A_j$. Take $\tilde r$ to be the (unique) filler for this morphism.

\end{proof}
\hypertarget{Monadicity}{}\subsubsection*{{Monadicity of the forgetful functor}}\label{Monadicity}

We now give a formal justification for calling the objects of $Alg C$ \emph{algebraic} objects by showing that $Alg C$ is the category of algebras over an [[algebraic theory]] in $C$, or more precisely that it is the category of [[algebras over a monad|algebra over the monad]] $F \circ U$ on $C$

\begin{utheorem}
The functor $U : Alg C \to C$ is [[monadic]].

\end{utheorem}
This is (\hyperlink{Nikolaus}{Nikolaus, prop. 24})

\begin{proof}
By one of the equivalent statements of [[Beck's monadicity theorem]] we have to check that

\begin{enumerate}%
\item $U$ has a [[left adjoint]],
\item $U$ reflects [[isomorphisms]] (i.e. it is [[conservative functor|conservative]]), and
\item $D$ has, and $U$ [[preserved limit|preserves]], coequalizers of $U$-split pairs.

\end{enumerate}
The first item we already checked above.

For the second item it is sufficient to observe that if $f : X \to Y$ is a morphism in $Alg C$ such that $U f$ has an inverse $g : U Y \to U X$, then it follows that $g$ must preserve fillers, hence itself constitutes the underlying morphism of an inverse if $f$ in $Alg C$.

For the third item, let $f,g : X \to Y$ be two morphisms in $Alg C$ such that the [[coequalizer]]

\begin{displaymath}
U X \stackrel{\overset{U f}{\to}}{\underset{U g}{\to}}
  U Y
  \stackrel{\pi}{\to}
  Q
\end{displaymath}
exists in $C$, together with [[section]]s $s$ of $\pi$ and $t$ of $U(f)$ such that $s \circ \pi = U(t) \circ t$. We need to equip $Q$ with fillers such that it becomes the coequalizer of $f,g$ in $Alg C$.

For $h : A_j \to Q$ a horn, declare that its filler is the the chosen filler of $s \circ h$

\begin{displaymath}
\itexarray{
    A_j &\stackrel{h}{\to}& Q 
    \\
    \downarrow && \downarrow^{\mathrlap{s}} & \searrow^{\mathrlap{Id}}
    \\
    B_j &\to& Y &\stackrel{\pi}{\to} & Q
  }
  \,.
\end{displaymath}
We check now that this choice indeed makes $Q$ the coequalizer in $Alg C$.

First of all we need to check that $\pi$ preserves the chosen fillers.

So given a filler

\begin{displaymath}
\itexarray{
    A_j &\stackrel{k}{\to}& Y
    \\
    \downarrow & \nearrow_{\mathrlap{\hat k}}
    \\
    B_j
  }
\end{displaymath}
it is sent by $\pi$ to the filler

\begin{displaymath}
\itexarray{
    A_j &\stackrel{k}{\to}& Y &\stackrel{\pi}{\to}& Q
    \\
    \downarrow & \nearrow && \nearrow_{\pi \hat k}
    \\
    B_j
  }
\end{displaymath}
of $\pi k$. This is supposed to be the same as

\begin{displaymath}
\itexarray{
    A_j &\stackrel{k}{\to}& Y &\stackrel{\pi}{\to}& Q &\stackrel{s}{\to}& Y &\stackrel{\pi}{\to}& Q
    \\ 
    \downarrow && && & \nearrow_{\hat r} && \nearrow_{\pi \hat r}
    \\
    B_j 
  }
  \,.
\end{displaymath}
Now use the relation $U(f) t = Id$ to rewrite the first diagram equivalently as

\begin{displaymath}
\itexarray{
    A_j &\stackrel{k}{\to}& Y &\stackrel{t}{\to}& X &\stackrel{U(f)}{\to}& 
    Y &\stackrel{\pi}{\to}& Q
    \\
    \downarrow &&&&&  \nearrow_{\mathrlap{\hat g}} &&  \nearrow_{\pi \hat k}
    \\
    B_j
  }
\end{displaymath}
and the relation $U(g) t =  s \pi$ to rewrite the second diagram equivalently as

\begin{displaymath}
\itexarray{
    A_j &\stackrel{k}{\to}& Y &\stackrel{t}{\to}& X &\stackrel{U(g)}{\to}& Y &\stackrel{\pi}{\to}& Q
    \\ 
    \downarrow && && & \nearrow_{\hat r} && \nearrow_{\pi \hat r}
    \\
    B_j 
  }
  \,.
\end{displaymath}
This show that the fillers $\hat k$ and $\hat r$ are images under $U(f)$ and $U(g)$, respectively, of a single filler in $X$. Since $\pi$ coequalizes, it follows that $\pi \hat k = \pi \hat r$.

Finally we need to show that the coequalizing morphism $\pi$ in $Alg C$ thus established is indeed universal with this property.

For $\phi : Y \to Z$ a coequalizing morphism in $Alc C$, the fact that $Q$ is a coequalizer in $C$ already gives a unique morphism $\phi_Q$ in

\begin{displaymath}
\itexarray{
    X & \stackrel{\overset{f}{\to}}{\underset{g}{\to}} & Y
    &\stackrel{\pi}{\to} & Q
    \\
    && {}^{\mathllap{\phi}}\downarrow & \swarrow_{\mathrlap{\exists ! \phi_Q}}
    \\
    && Z
  }
  \,.
\end{displaymath}
So it is sufficient to observe that $\phi_Q$ preserves chosen fillers. But this is true be the above construction, which says that the chosen fillers in $Q$ are the images of the chosen fillers in $Y$.

\end{proof}
\hypertarget{Solidity}{}\subsubsection*{{Solidity of the forgetful functor}}\label{Solidity}

\begin{uprop}
The [[forgetful functor]] $U : Alg C \to C$ is a [[solid functor]].

\end{uprop}
We discuss the proof for a slightly simpler statement, from which the full statement follows easily.

\begin{ulemma}
Let $Y$ be an algebraic fibrant object, $X$ an object in $C$ and

\begin{displaymath}
f : Y \to X
\end{displaymath}
a morphism in $C$ (really: $U(Y) \to X$). Then there is an algebraic fibrant object $X^f_\infty$ and a morphism $X \to X^f_\infty$ such that the composite

\begin{displaymath}
Y\to X \to X^f_{\infty}
\end{displaymath}
is a morphism of algebraic fibrant objects and it is [[initial object|initial]] with this property:

for every morphism $\phi : X \to Z$ in $C$ with $Z$ an algebraic fibrant object such that the composite $Y \to X \to Z$ preserves distinguished fillers, there exists a unique morphism $\phi_\infty : X^f_\infty \to Z$ such that we have a [[commutative diagram]]

\begin{displaymath}
\itexarray{
    Y 
    \\
    {}^{\mathllap{f}}\downarrow & \searrow^{\mathrlap{alg}}
    \\
    X &\stackrel{\phi}{\to}& Z
    \\
    \downarrow & \nearrow_{\mathrlap{\exists ! \phi_\infty}}
    \\
    X^f_\infty
  }
  \,.
\end{displaymath}
Moreover, if $f$ is a [[monomorphism]] in $C$, then $X \to X^f_\infty$ is an acyclic cofibration.

\end{ulemma}
This is (\hyperlink{Nikolaus}{Nikolaus, prop. 2.6}).

The naive idea would be to equip $X$ with distinguished fillers $f \hat k$

\begin{displaymath}
\itexarray{
    A_j &\stackrel{k}{\to}& Y &\stackrel{f}{\to}& X
    \\
    \downarrow & \nearrow_{\mathrlap{\hat k}} && \nearrow_{f \mathrlap{\hat k}}
    \\
    B_j
  }
\end{displaymath}
for each distinguished filler $\hat k$. But since the composite may factor through $Y$ in many ways, this will not give a unique notion of filler. Therefore we shall iteratively form colimits that equate these potentially different fillers.

\begin{proof}
Let $H$ be the set of morphisms of the form $h : A_j \to X$ that factor through $f : Y \to X$. For each $h \in H$ let $F_h$ be the set of images of distinuished fillers $B_j \to X$.

Set

\begin{displaymath}
X_H := \lim_\to
  \left(
     \itexarray{
       (B_j)_h && (B_{j'})_{h'} && \cdots
       \\
       & {}_{\mathllap{\phi \in F_h}}\searrow & \downarrow^{\mathrlap{\phi' \in F_{h'}}}
       & \cdots
       \\
       && X
     }
  \right)
\end{displaymath}
where on the right we take the [[colimit]] over the diagram with one object $(B_j)_h$ per morphism $h : A_j \to X$ that factors through $Y$, and one morphism $(B_j)_h \to X$ per induced distinguished filler obtained from a choice of factorization through $Y$.

This comes with a canonica [[cocone]]-morphism $X \to X_H$. Continue this way to build $X_{H'}$ by coequalizing the different ways morphisms into $X_H$ may factor through $X$, etc. to obtain a sequence

\begin{displaymath}
X \to X_H \to X_{H'} \to X_{H''} \to \cdots
\end{displaymath}
and set

\begin{displaymath}
X_0^f := \lim_\to (X \to X_H \to X_{H'} \to X_{H''} \to \cdots)
  \,.
\end{displaymath}
Notice that if $f$ is a [[monomorphism]] then all factorizations are unique and hence $X \to X_0^f$ is an [[isomorphism]].

The object $X_0^f$ can be seen to have the desired universal factorization property. But it may not yet be itself algebraically fibrant. So we conclude by essentially applying the construction of the left adjoint $F$. But we start with letting $X_1^f$ be the pushout

\begin{displaymath}
\itexarray{
    \coprod_j A_j &\to& X_0^f
    \\ 
    \downarrow && \downarrow
    \\
    \coprod_j B_j &\to& X_1^f
  }
\end{displaymath}
where now the coproduct is over all morphisms that do not factor through $Y$. After that we proceed exactly as we did for the construction for $F$ and obtain a sequence

\begin{displaymath}
X_0^f \to X_1^f \to X_2^f \to \cdots
  \,.
\end{displaymath}
Finally we set

\begin{displaymath}
X_\infty^f := \lim_\to(X_0^f \to X_1^f \to X_2^f \to \cdots)
  \,.
\end{displaymath}
One checks that this has the claimed properties (\ldots{}).

As before, the inclusion $X_0^f \to X_\infty^f$ is an acyclic cofibration. Hence by the above remarks in the case that $f$ is a monomorphism also $X \to X_\infty^f$ is an acyclic cofibration.

\end{proof}
By replacing in this proof factorization through a single $Y$ by factorization through a family of $Y$s one finds that $U$ is a [[solid functor]].

\hypertarget{LimitsAndColimits}{}\subsubsection*{{Limits and colimits of algebraic objects}}\label{LimitsAndColimits}

\begin{uprop}
The category $Alg C$ has all [[limit]]s and [[colimit]]s in $C$.

The limits and the [[filtered colimit]]s (but not the general colimit)s are [[created limit|created]] by $U$.

\end{uprop}
\begin{proof}
Consider first limits: for $K : J \to Alg C$ a [[diagram]] and $\lim_{\leftarrow} U K$ its limit in $C$, let $A_j \to \lim_{\leftarrow} U K$ be a horn. Since all the composite maps $A_J \to \lim_{\leftarrow} U K \to U K(j)$ have distinguished fillers and since the morphisms between these respect these fillers, we get a cone of fillers with tip $B_j$ over $U K$. The universal cone morphism $B_j \to \lim_{\leftarrow} U K$ provides then a distinguished filler for the limit. By the same argument, any cone $const_T \to \lim_{\leftarrow} U K$ in $Alg_C$ whose underlying cone in $C$ is a limiting cone is also limiting in $Alg C$.

Now consider [[filtered colimit]]s. By assumption the domains $A_j$ are [[small object]]s. Therefore for $K : I \to C$ a [[filtered diagram]] and $L := \lim_{\to} K$ its [[filtered colimit]], any morphism $A_j \to L$ factors through one of the $K_i$. This provides a filler $B_j \to K_i \to L$. Observe that while neither $i$ nor the filler $B_j \to K_i$ are uniquely determined, its image in $L$ is. This makes $L$ an object in $Alg C$. By the same argument one finds that it is the universal cocone under $K$ in $Alg C$.

Now for $K : J \to Alg C$ a general diagram with colimit $X := \lim_\to U K$ in $C$, we use the above fact that $U$ is a [[solid functor]] to deduce that $X_\infty^f$ is the colimit of $K$ in $Alg C$.

\end{proof}
While this gives a general prescription for computing colimits, the following lemma asserts a slightly simpler way for computing certain [[pushout]]s in $Alg C$. This will be needed for establishing the model category structure.

\begin{ulemma}
Let $i : A \to B$ be a morphism in $C$ and

\begin{displaymath}
\itexarray{
    F A &\to& Y
    \\
    {}^{\mathllap{F i}}\downarrow
    \\
    F B
  }
\end{displaymath}
a diagram in $Alg C$. Then

\begin{itemize}%
\item its [[pushout]] in $Alg C$ is $(B \coprod_A U Y)_\infty^f$, where $f : U Y \to B \coprod_A U Y$ is the canonical morphism;


\item if $i : A \to B$ is an acyclic cofibration then so is $Y\to (B \coprod_A U Y)_\infty^f$.



\end{itemize}
\end{ulemma}
This is (\hyperlink{Nikolaus}{Nikolaus, prop 2.14}).

\begin{proof}
First check that $(B \coprod_A U Y)_\infty^f$ has the universal property of the pushout: for any $Z \in Alg C$ we have by the \hyperlink{SolidityLemma}{above proposition} that morphisms $(B \coprod_A U Y)_\infty^f \to Z$ are in bijection to morphisms $B \coprod_A U Y \to U Z$ in $C$ such that the composition

\begin{displaymath}
U Y \stackrel{f}{\to} B \coprod_A U Y \to U Z
\end{displaymath}
preserves distinguished fillers.

This in turn is the same as a morphism $g_1 : Y \to Z$ in $Alg C$ and a morphism $g_2 : B \to U Z$ in $C$ that agree on $A$. By [[adjunction]] $(F \dashv U)$ this corresponds to an [[adjunct]] $\tilde g_2: F B \to Z$. This establishes the pushout property of $(B \coprod_A U Y)_\infty^f$.

To show that $Y \to (B \coprod_A U Y)_\infty^f$ is an acyclic cofibration of $i : A \to B$ is, recall that this morphism is the composite

\begin{displaymath}
Y \stackrel{f}{\to} B \coprod_A U Y \to (B \coprod_A U Y)_\infty^f
  \,.
\end{displaymath}
Here the first morphism $f$ is an acyclic cofibration because it is the [[pushout]] of the acyclic cofibration $i$. Therefore by assumption $f$ is a [[monomorphism]] and by the \hyperlink{SolidityLemma}{remarks in the solidity lemma} the morphism $B \coprod_A U Y \to (B \coprod_A U Y)_\infty^f$ is an acyclic cofibration. Hence so is the composite of the two.

\end{proof}
\hypertarget{transferred_model_structure}{}\subsubsection*{{Transferred model structure}}\label{transferred_model_structure}

\begin{utheorem}
Under the above conditions, $Alg C$ becomes a [[model category]] with the $U$-[[transferred model structure]]: weak equivalences and fibrations in $Alg C$ are those morphisms that are so in $C$.

\end{utheorem}
This appears as (\hyperlink{Nikolaus}{Nikolaus, def. 2.15}).

\begin{proof}
This follows from the \hyperlink{Solidity}{above result} that $U$ is a \emph{solid functor} as described in detail at [[solid functor]] by observing that the \emph{acyclicity condition} required there follows as in the discussion of the solidity of $U$ \hyperlink{SolidityLemma}{above}, using the assumption that all acyclic cofibrations in $C$ are [[monomorphism]]s.

We spell out the argument, following (\hyperlink{Nikolaus}{Nikolaus}).

By the conditions listed at [[transferred model structure]] it is sufficient to check that

\begin{enumerate}%
\item $U$ preserves [[small object]], which is the case in particular if it preserves [[filtered colimit]]s;


\item $U$ sends [[sequential colimit]]s of [[pushout]]s of images under $F$ of generating acyclic cofibrations to weak equivalences.



\end{enumerate}
The first item is true by the \hyperlink{LimitsAndColimits}{above discussion} of filtered colimits in $Alg C$.

That the second item holds follows from the above \hyperlink{PushoutLemma}{pushout lemma} which asserts that $U$-images of pushouts of $F$-images of generating acyclic cofibrations are acylic cofibrations, and again by the fact that $U$ preserves filtered colimits, which implies that it preserves the [[transfinite composition]] of these acyclic cofibrations.

\end{proof}
\begin{ucorllary}
The functor $U$ preserves acyclic cofibrations.

\end{ucorllary}
\begin{utheorem}
The [[Quillen adjunction]]

\begin{displaymath}
(F \dashv U) : Alg C \stackrel{\overset{F}{\leftarrow}}{\underset{U}{\to}}
  C
\end{displaymath}
is a [[Quillen equivalence]].

\end{utheorem}
This appears as (\hyperlink{Nikolaus}{Nikolaus, theorem 2.18})

\begin{proof}
We observe that the unit and counit of $(F \dashv U)$ are both weak equivalences:

the unit of the adjunction is $X \to X_\infty$ is by the \hyperlink{DefOfXInfty}{above construction} a [[transfinite composition]] of acyclic cofibrations (in fact a fibrant replacement) hence in particular a weak equivalence. Moreover, the unit is a [[section]] of the counit in that

\begin{displaymath}
\itexarray{
     X &\to& F X
     \\
     & {}_{\mathllap{Id}}\searrow & \downarrow
     \\
     && X
  }
  \,.
\end{displaymath}
Hence by [[category with weak equivalences|2-out-of-3]] also $X \to F X$ is a weak equivalence.

This implies that $(F \dashv U)$ induces an [[equivalence of categories]] on the [[homotopy categories]]. Since $R$ equals its total right [[derived functor]] (since every object in $Alg C$ is fibrant) this means that $(F \dashv)$ is a Quillen equivalence.

\end{proof}
\hypertarget{LocalPresentability}{}\subsubsection*{{Local presentability and combinatoriality}}\label{LocalPresentability}

\begin{uprop}
If $C$ is a [[locally presentable category]] then so is $Alg C$.

\end{uprop}
\begin{proof}
By the \hyperlink{Monadicity}{above} we know that $Alg C$ is the category of [[algebras over a monad]] $U\circ F : C \to C$.

We invoke the  discussed at [[locally presentable category]]. This says that it is sufficient to check that $U \circ F$ is an [[accessible functor]], hence that it preserves [[filtered colimit]]s. Now $F$ is a left adjoint and hence preserves all colimits, while we checked \hyperlink{LimitsAndColimits}{above} that $U$ preserves filtered colimits.

\end{proof}
\begin{ucorollary}
If $C$ is a [[combinatorial model category]] then so is $Alg C$.

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

\hypertarget{AlgebaicHigherCategories}{}\subsubsection*{{Algebraic $\infty$-groupoids}}\label{AlgebaicHigherCategories}

The standard [[model structure on simplicial sets]] $sSet_{Quillen}$ models the [[(∞,1)-category]] [[∞Grpd]] of [[∞-groupoid]]s: its fibrant objects are precisely the [[Kan complex]]es. But a Kan complex is a model for an $\infty$-groupoid in which composites and inverses of [[k-morphism]]s are only guaranteed to exist, but are not specifically \emph{chosen} .

An algebraic fibrant object in $sSet_{Quillen}$ is a [[Kan complex]] with a chosen filler for each [[horn]]: an \textbf{[[algebraic Kan complex]]} (see [[simplicial T-complex]] for a related but much stricter notion). This means precisely that all possible composites and all possible inverses are chosen. So the Quillen equivalence

\begin{displaymath}
sSet_{Quillen} \stackrel{\leftarrow}{\to} Alg sSet_{Quillen}
\end{displaymath}
induces an equivalence from an [[algebraic definition of higher category|algebraic definition of ∞-groupoids]] to a [[geometric definition of higher categories|geometric definition]].

\hypertarget{algebraic_categories}{}\subsubsection*{{Algebraic $(\infty,1)$-categories}}\label{algebraic_categories}

Similarly, the [[model structure for quasi-categories]] $sSet_{Joyal}$ models [[(∞,1)-categories]]: its fibrant objects are precisely the [[quasi-categories]]: an \textbf{[[algebraic quasi-category]]}. Again, these form a model for $(\infty,1)$-categories in which composition is only a relation, not an operation.

But equipping a quasi-category with the structure of an algebraic fibrant object precisely means choosing such composites. Accordingly, the [[Quillen equivalence]]

\begin{displaymath}
sSet_{Joyal} \stackrel{\leftarrow}{\to} Alg sSet_{Joyal}
\end{displaymath}
establishes an equivalence of an algebraic with the standard geometric model for $(\infty,1)$-categories.

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

\begin{itemize}%
\item [[algebraic model category]]

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

The model structure on algebraic fibrant objects was introduced and discussed in

\begin{itemize}%
\item [[Thomas Nikolaus]], \emph{Algebraic models for higher categories} (\href{http://arxiv.org/abs/1003.1342}{arXiv})

\end{itemize}
A survey is in

\begin{itemize}%
\item [[Thomas Nikolaus]] Talk on \emph{Algebraic models for higher categories} (\href{http://www.math.uni-hamburg.de/home/nikolaus/AlgMod.pdf}{here})

\end{itemize}
The refined [[small object argument]] that is being used in the construction of the left adjoint $F : C \to Alg C$ is along the lines of the discussion in

\begin{itemize}%
\item [[Richard Garner]], \emph{Understanding the small object argument} Applied Categorical Structures, 17(3):247--285, 2009 (\href{http://www.dpmms.cam.ac.uk/~rhgg2/CT07/CT07.pdf}{pdf})

\end{itemize}
[[!redirects algebraic fibrant object]] [[!redirects algebraically fibrant object]] [[!redirects algebraic fibrant objects]] [[!redirects algebraically fibrant objects]] [[!redirects model structure on algebraic fibrant objects]] [[!redirects model structure on algebraically fibrant objects]] [[!redirects model structures on algebraic fibrant objects]] [[!redirects model structures on algebraically fibrant objects]] [[!redirects model structure for algebraic fibrant objects]] [[!redirects model structure for algebraically fibrant objects]] [[!redirects model structures for algebraic fibrant objects]] [[!redirects model structures for algebraically fibrant objects]]



\end{document}