\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*{transferred model structure}

\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{right_transfer}{Right transfer}\dotfill \pageref*{right_transfer} \linebreak
\noindent\hyperlink{left_transfer}{Left transfer}\dotfill \pageref*{left_transfer} \linebreak
\noindent\hyperlink{existence}{Existence}\dotfill \pageref*{existence} \linebreak
\noindent\hyperlink{constructing_factorizations}{Constructing factorizations}\dotfill \pageref*{constructing_factorizations} \linebreak
\noindent\hyperlink{verifying_acyclicity}{Verifying acyclicity}\dotfill \pageref*{verifying_acyclicity} \linebreak
\noindent\hyperlink{properties}{Properties}\dotfill \pageref*{properties} \linebreak
\noindent\hyperlink{general}{General}\dotfill \pageref*{general} \linebreak
\noindent\hyperlink{Enrichment}{Enrichment}\dotfill \pageref*{Enrichment} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

For $C$ a [[category]] with the structure of a [[model category]] and $U:D\to C$ a functor having an [[adjoint]], under certain conditions it is possible to \emph{transfer} the model structure from $C$ to a model structure on $D$ by declaring the weak equivalences, and the fibrations (if $U$ is a right adjoint) or cofibrations (if $U$ is a left adjoint), in $D$ to be precisely those morphisms whose images under $U$ are such in $C$. If $U$ is a right adjoint this is called the \textbf{right transferred}, \textbf{right induced}, or \textbf{right lifted} model structure, and dually in the left case.

Typically this arises in situations where $D$ consist of the ``same'' objects as $C$ but equipped with extra [[stuff, structure, property]], and $U$ is the corresponding [[forgetful functor]] sending objects in $D$ to their underlying objects in $C$. Then a left adjoint $F$ of $U$ is the corresponding [[free functor]], while a right adjoint $G$ is a [[cofree functor]].

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

\hypertarget{right_transfer}{}\subsubsection*{{Right transfer}}\label{right_transfer}

\begin{defn}
\label{}\hypertarget{}{}
Let $C$ be a [[model category]] and

\begin{displaymath}
(F \dashv U )\; : \; D \stackrel{\overset{F}{\leftarrow}}{\underset{U}{\to}} C
\end{displaymath}
an [[adjunction]] with [[right adjoint]] $U$. Define a morphism in $D$ to be

\begin{itemize}%
\item a \textbf{fibration} or \textbf{weak equivalence} precisely if its image under $U$ is, respectively, in $C$.
\item a \textbf{cofibration} precisely if it has the left lifting property with respect to the fibrations that are weak equivalences.

\end{itemize}
If these classes of maps define a model structure on $D$, it is called the \textbf{right transferred model structure} (or sometimes \textbf{right induced model structure} or \textbf{right lifted model structure}) from $C$.

\end{defn}
Of course, in the above situation by a \textbf{trivial fibration} in $D$ we mean a morphism that is both a fibration and a weak equivalence, or equivalently whose image under $U$ is a trivial fibration in $C$. The term ``trivial cofibration'', however, is \emph{a priori} ambiguous: for the nonce let us call a morphism in $D$ a \textbf{cofibration weak equivalence} if it is both a cofibration and a weak equivalence and an \textbf{anodyne map} if it has the left lifting property with respect to all fibrations. Of course, if the transferred model structure exists, then these two classes of maps coincide. Conversely we have:

\begin{theorem}
\label{NeccSuff}\hypertarget{NeccSuff}{}
Necessary and sufficient conditions for the existence of the transferred model structure are:

\begin{enumerate}%
\item Every morphism in $D$ factors as a cofibration followed by a trivial fibration, and as an anodyne map followed by a fibration.
\item Every anodyne map is a weak equivalence.

\end{enumerate}
\end{theorem}
\begin{proof}
Clearly the conditions are necessary. For the converse, the weak equivalences have the 2-out-of-3 property, all the classes of maps are closed under retracts, the lifting properties hold by definition (for the anodyne maps), and we have assumed the factorization properties (for the anodyne maps), so it remains to show that every cofibration weak equivalence is anodyne. This follows by the standard retract argument: if $f:A\to B$ is a cofibration weak equivalence, factor it as $f = p i$ with $i$ anodyne and $p$ a fibration. Then since anodyne maps are weak equivalences and weak equivalences satisfy 2-out-of-3, $p$ is a trivial fibration. Thus $f$ has the left lifting property against $p$, hence $f$ is a retract of $i$ and thus also anodyne.

\end{proof}
\hypertarget{left_transfer}{}\subsubsection*{{Left transfer}}\label{left_transfer}

Dually, if $C$ is a model category and we have an adjunction

\begin{displaymath}
(U \dashv G )\; : \; D \stackrel{\overset{F}{\leftarrow}}{\underset{U}{\to}} C
\end{displaymath}
with $U$ left adjoint, we define a morphism in $D$ to be

\begin{itemize}%
\item a \textbf{cofibration} or \textbf{weak equivalence} precisely if its image under $U$ is, respectively, in $C$.
\item a \textbf{fibration} precisely if it has the right lifting property with respect to the cofibrations that are weak equivalences.

\end{itemize}
If these classes of maps define a model structure on $D$, it is called the \textbf{left transferred model structure} (or sometimes \textbf{left induced model structure} or \textbf{left lifted model structure}) from $C$.

The above necessary and sufficient conditions dualize directly.

\hypertarget{existence}{}\subsection*{{Existence}}\label{existence}

\hypertarget{constructing_factorizations}{}\subsubsection*{{Constructing factorizations}}\label{constructing_factorizations}

The most traditional way to obtain the factorization properties in the right-transferred case is to assume that $C$ is [[cofibrantly generated]].

\begin{prop}
\label{SufficientConditions}\hypertarget{SufficientConditions}{}
In the right-transferred situation, suppose that

\begin{enumerate}%
\item $C$ is [[cofibrantly generated]], and


\item The functor $F$ preserves [[small objects]] (which is the case in particular when $U$ preserves [[filtered colimits]]).



\end{enumerate}
Then every morphism in $D$ factors as a cofibration followed by a trivial fibration, and as an anodyne map followed by a fibration. Moreover, if every anodyne map is a weak equivalence so that the transferred model structure on $D$ exists, then it is is cofibrantly generated, and for $I$ (resp. $J$) a set of generating cofibrations (resp. trivial cofibrations) in $C$, the image set $F(I)$ (resp. $F(J)$) forms a set of generating cofibrations (resp. trivial cofibrations) in $D$.

\end{prop}
\begin{proof}
By the adjunction $F\dashv U$, a morphism $f$ is a fibration (resp. trivial fibration) if and only if it has the right lifting property against the maps in $F(I)$ (resp. $F(J)$). Since $F$ preserves small objects, the sets $F(I)$ and $F(J)$ permit the small object argument in $D$, which therefore yields (cofibration, trivial fibration) and (anodyne, fibration) factorizations.

\end{proof}
Another way to produce these factorizations is to generate them by a functorial factorization.

\begin{lemma}
\label{AlgebraicLift}\hypertarget{AlgebraicLift}{}
Suppose $F: C \rightleftarrows D : U$ is an adjunction, where $D$ has [[pushouts]], and that

\begin{itemize}%
\item $C$ has a [[functorial factorization]] $(L,R)$ with a [[right weak composition law for factorizations]] (e.g. if it is [[awfs|algebraic]]).
\item The induced functorial factorization on $D$ permits Garner's [[small object argument]] (e.g. if $C$ and $D$ are locally presentable and all functors are accessible).

\end{itemize}
Then there is an induced ([[awfs|algebraic]]) weak factorization system on $D$ whose right class consists precisely of those maps whose $U$-image admits an $R$-algebra structure.

\end{lemma}
\begin{proof}
Given a morphism $f:A\to B$ in $D$, factor it as follows, where the upper commutative square is a pushout:

\begin{displaymath}
\itexarray{
  F U A & \to & A \\
  ^{F ((U f)_L)}\downarrow & & \downarrow \\
  F E (U f) & & E f \\
  ^{F ((U f)_R)}\downarrow & & \downarrow \\
  F U B & \to & B
}
\end{displaymath}
This yields a functorial factorization $(L',R')$ on $D$. By the universal property of pushout, an $R'$-algebra structure on $f$ is determined by a diagonal lifting in the square

\begin{displaymath}
\itexarray{
  F U A & \to & A \\
  ^{F ((U f)_L)}\downarrow & & \downarrow^f \\
  F E (U f) & \xrightarrow{F ((U f)_R)} & B }
\end{displaymath}
which corresponds by adjunction to precisely an $R$-algebra structure on $U f$. Thus, the right weak composition law for $R$-algebras lifts to a right weak composition law for $R'$-algebras. Garner's small object argument applied to $(L',R')$ then produces a monad over $cod$ with a right strong composition law, which is therefore an [[algebraic weak factorization system]] whose algebraic right maps are the $R'$-algebras, and in particular whose underlying right chlass is as desired those maps whose $U$-image is in $R$.

\end{proof}
In particular, therefore, the factorizations of any [[accessible model structure]] right-lift along any adjunction between locally presentable model categories, whether or not they are cofibrantly generated. But the cofibrantly generated case can also be subsumed, by taking $(L,R)$ to be the one-step factorization produced by the generating left maps.

Left-lifting is generally rather trickier. But by invoking fancier categorical machinery, one can show more generally:

$\backslash$begin\{lemma\} Suppose given a functor $U:D\to C$ between locally presentable categories and an [[accessible weak factorization system]] $(L,R)$ on $C$.

\begin{enumerate}%
\item If $U$ has a left adjoint $F$, then $(L,R)$ right-lifts along $U$ to an accessible wfs on $D$.
\item If $U$ has a right adjoint $G$, then $(L,R)$ left-lifts along $U$ to an accessible wfs on $D$.

\end{enumerate}
Moreover, if $(L,R)$ is cofibrantly generated, so are the lifted wfs.

$\backslash$end\{lemma\} $\backslash$begin\{proof\} See \hyperlink{HKRS15}{HKRS15} and \hyperlink{GKR18}{GKR18} for the lifting of accessible wfs. Cofibrant generation of a right-lifted wfs follows as in Theorem \ref{SufficientConditions} above, while in the left-lifted case it is Remark 3.8 of \hyperlink{MR13}{MR13}. $\backslash$end\{proof\}

This sort of result seems to be necessary for the case of left-lifting; the simpler cofibrantly-generated argument does not dualize as directly.

\hypertarget{verifying_acyclicity}{}\subsubsection*{{Verifying acyclicity}}\label{verifying_acyclicity}

The ``acyclicity condition'' that anodyne maps are weak equivalences is usually the most difficult to check. Sometimes useful is the observation that for right-lifting in the cofibrantly generated case, it suffices to show that [[sequential colimit]] of [[pushouts]] of images under $F$ of the generating trivial cofibrations in $C$ (i.e. an $F(J)$-[[cell complex]]) yields a weak equivalence in $D$. This is because the small object actually factors any map as such an $F(J)$-cell complex followed by a fibration; hence by the retract argument every anodyne map is a retract of an $F(J)$-cell complex.

Another useful sufficient condition is the following, going back roughly to section II.4 of (\hyperlink{Quillen}{Quillen}).

\begin{prop}
\label{PathObjects}\hypertarget{PathObjects}{}
In the situation of right transfer, where $U:C\to D$ is a right adjoint, suppose that

\begin{itemize}%
\item $D$ has a [[fibrant replacement functor]] (in fact it suffices for individual objects and morphisms to have fibrant replacements; functoriality is not required).


\item $D$ has [[path objects]] for fibrant objects, i.e. a factorization of the [[diagonal]] $\Delta : A \to A \times A$ as a weak equivalence followed by a fibration $\Delta : A \stackrel{\simeq}{\to} P(A) \stackrel{fib}{\to} A \times A$.



\end{itemize}
Then any anodyne map in $D$ is a weak equivalence. Thus, if the two factorizations exist in $D$, then the transferred model structure exists.

\end{prop}
\begin{proof}
The notation here is mostly that of \hyperlink{Rezk02}{Rezk 02, Lemma 7.6}. Let $R$ be a fibrant replacement functor, with natural weak equivalence $j : Id \to R$, suppose $f:X\to Y$ is anodyne, and consider the following diagram: $\backslash$begin\{center\} $\backslash$begin\{tikzcd\} X $\backslash$ardr,``i'' description $\backslash$arr,``f'' $\backslash$ard,``\{(1,f)\}''' \& Y $\backslash$arr,``\{j\_Y\}'' \& R Y $\backslash$ard $\backslash$ X$\backslash$times Y $\backslash$ardr,``\{j\_X $\backslash$times j\_Y\}''' \& P R f $\backslash$arr $\backslash$ard \& P R Y $\backslash$ard$\backslash$ \& R X $\backslash$times R Y $\backslash$ard,``\{$\backslash$mathrm\{pr\}\_1\}''' $\backslash$arr,``\{R f $\backslash$times 1\}''' \& R Y $\backslash$times R Y $\backslash$ard,``\{$\backslash$mathrm\{pr\}\_1\}''' $\backslash$ \& R X $\backslash$arr,``R f''' \& R Y $\backslash$end\{tikzcd\} $\backslash$end\{center\} Both squares are pullbacks, defining the object $P R f$ and the morphism $i$ making the following square commute: $\backslash$begin\{center\} $\backslash$begin\{tikzcd\} X $\backslash$ard,``f''' $\backslash$arr,``i'' \& P R f $\backslash$arr,``$\backslash$pi'' $\backslash$ard \& R X$\backslash$ Y $\backslash$arr,``\{j\_Y\}''' $\backslash$arur,dashed,``g'' \& R Y. $\backslash$end\{tikzcd\} $\backslash$end\{center\} The morphism $\pi$ is the composite $P R f\to R X \times R Y \to R X$ at the top, which is a pullback of $P R Y \to R Y$; but the latter is a fibration (as the composite $P R Y \to R Y \times R Y \to R Y$) and a weak equivalence (as a retraction for $R Y \to P R Y$), so it and hence also $\pi$ are acyclic fibrations. Moreover, since $\pi i = j_X$, by [[2-out-of-3]] $i$ is also a weak equivalence.

Now the projection $P R f\to P Y$ is a fibration, so since $f$ is anodyne there is a lift $g$ in the second square as shown. Since $i$ and $j_Y$ are weak equivalences, by [[2-out-of-6]] it follows that $f$ is a weak equivalence.

\end{proof}
Note that this condition also dualizes straightforwardly to the left-transferred case.

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

\hypertarget{general}{}\subsubsection*{{General}}\label{general}

\begin{lemma}
\label{}\hypertarget{}{}
If $C$ carries the structure of a [[right proper model category]], then also a right-transferred model structure on $D$ is right proper.

\end{lemma}
\begin{proof}
Let

\begin{displaymath}
\itexarray{
     A \times_C B &\stackrel{f}{\to}& B
     \\
     \downarrow && \downarrow^{\mathrlap{\in Fib}}
     \\
     A &\stackrel{\simeq}{\to}& C
  }
\end{displaymath}
be a [[pullback]] diagram in $D$, with the bottom morphism a weak equivalence and the right morphism a fibration. We need to show that then also the top morphism $f$ is a weak equivalence. By definition of transfer, this is equivalent to $U(f)$ being a weak equivalence in $C$.

Since $U$ is a [[right adjoint]] it preserves pullbacks, so that also

\begin{displaymath}
\itexarray{
     U(A \times_{C} B) &\stackrel{U(f)}{\to}& U(B)
     \\
     \downarrow && \downarrow^{\mathrlap{\in Fib}}
     \\
     U(A) &\stackrel{\simeq}{\to}& U(C)
  }
\end{displaymath}
is a pullback diagram in $C$. Since by definition of the transferred model strucure this is still the pullback of a weak equivalence along a fibration, and since $C$ is assumed to be right proper, it follows that $U(f)$ is a weak equivalence in $C$, hence that $f$ is a weak equivalence in $D$.

\end{proof}
\hypertarget{Enrichment}{}\subsubsection*{{Enrichment}}\label{Enrichment}

Often the underlying model category $C$ is an [[enriched model category]] over some [[monoidal model category]] $S$ and one wishes to transfer also the model enrichment.

\begin{prop}
\label{}\hypertarget{}{}
Assume the adjunction

\begin{displaymath}
(F \dashv U )\; : \; D \stackrel{\overset{F}{\leftarrow}}{\underset{U}{\to}} C
\end{displaymath}
satisfies the conditions of the above proposition for right transfer, so that the model structure on $C$ is transferred to $D$. Consider the case that $C$ is moreover an $S$-[[enriched model category]] and that $D$ can be equipped with the structure of a $S$-[[enriched category]] that is also $S$-[[power]]ed and [[copower]]ed.

Assume now that the $S$-powering of $D$ is taken by $U$ to the $S$-powering of $C$, in that $U(d^{(s_1 \to s_2)}) = U(d)^{(s_1 \to s_2)}$.

Then the transferred model structure and the $S$-enrichment on $D$ are compatible and make $D$ an $S$-enriched model category.

\end{prop}
\begin{proof}
By the axioms of [[enriched model category]] one sufficient condition to be checked is that for $s \to t$ any cofibration in $S$ and for $X \to Y$ any fibration in $D$, we have that the induced morphism

\begin{displaymath}
X^t \to X^s \times_{Y^s} Y^{t}
\end{displaymath}
is a fibration, which is a weak equivalence if at least one of the two input morphisms is. By the induced model structure, this is checked by applying $U$. But by assumption $U$ commutes with the powering, and since $U$ is a [[right adjoint]] it commutes with taking the pullback, so that under $U$ the morphism is

\begin{displaymath}
U(X)^t \to U(X)^s \times_{U(Y)^s} U(Y)^{t}
\end{displaymath}
which is the morphism induced from $U(X) \to U(Y)$. That this is indeed an (acyclic) fibration follows now from the fact that $C$ is an $S$-enriched model category.

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

\begin{itemize}%
\item The [[projective model structure on functors]] $M^D$ is right-transferred from the product model structure on $M^{ob D}$. Dually, the [[injective model structure on functors]], when it exists, is left-transferred from $M^{ob D}$.


\item The [[model structure on algebraic fibrant objects]] is right-transferred from the underlying model category by forgetting the choice of fillers.


\item If $T$ is an [[accessible functor|accessible]] [[strict 2-monad]] on a [[locally finitely presentable category|locally finitely presentable 2-category]] $K$. then the category $T Alg_s$ of strict $T$-[[algebra over a monad|algebras]] admits a right-transferred model structure from the [[2-trivial model structure]] on $K$. The acyclicity condition is proved by using [[pseudolimits]] of arrows for path objects, and the (cofibration, trivial fibration) factorization is constructed using a version of the construction of Lemma \ref{AlgebraicLift} (since the 2-trivial model structure on $K$ may not be cofibrantly generated).


\item A non-example is provided as Example 3.7 of (\hyperlink{GoerssShemm}{GoerssSchemmerhorn}). Let $k$ be a field of characteristic 2 and consider the adjunction

\begin{displaymath}
(S \dashv U )\; : \; CGA_k \stackrel{\overset{S}{\leftarrow}}{\underset{U}{\to}} Ch_*k
\end{displaymath}
of the symmetric algebra functor and the forgetful functor between graded commutative DGAs and chain complexes. One sees that $S$ does not preserve the weak equivalence between 0 and the complex with one copy of $k$ in degrees $n$ and $n-1$. Since all chain complexes are cofibrant this means that $(S \dashv U )$ cannot be upgraded to a Quillen adjunction.


\item A more category-theoretic non-example is that the [[Reedy model structure]] on [[directed graphs]] internal to [[Cat]] does not right-transfer to the category [[DblCat]] of [[double categories]] along the free-forgetful adjunction. One of the generatic trivial cofibrations for the Reedy model structure ``transports'' a horizontal arrow (in double-category terminology) along two vertical isomorphisms, which is a levelwise equivalence. But upon pushing out the free double category generated by this along a map into some other double category, new composite horizontal arrows may be generated in the codomain that are not isomorphic to the image of anything in the domain; thus the pushout is no longer a levelwise equivalence. So, the acyclicity condition fails.



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

The arguments for (right-)transfer of model structures go back to

\begin{itemize}%
\item [[Dan Quillen]], \emph{Homotopical Algebra} , Lecture Notes in Math. 43, Springer-Verlag, Berlin-eidelberg-New York, 1967.

\end{itemize}
Proofs can be found in

\begin{itemize}%
\item [[Paul Goerss]], Jardine, J. F., \emph{Simplicial homotopy theory} , Progress Mathematics 174, Birkhäuser Verlag, Basel, 1999.

\end{itemize}
The explicit study of (right-)transfer of model structures (on categories of sheaves) is apperently originally due to

\begin{itemize}%
\item [[Sjoerd Crans]], \emph{Quillen closed model structure for sheaves} (\href{http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.7459}{web})

\end{itemize}
See also prop. 1.4.23 of

\begin{itemize}%
\item [[Denis-Charles Cisinski]], \emph{[[joyalscatlab:Les préfaisceaux comme type d'homotopie]]}, Ast\'e{}risque, Volume 308, Soc. Math. France (2006), 392 pages (\href{http://www.math.univ-toulouse.fr/~dcisinsk/ast.pdf}{pdf})

\end{itemize}
The above proof of acyclicity in the presence of path objects is taken from

\begin{itemize}%
\item [[Charles Rezk]], Every homotopy theory of simplicial algebras admits a proper model. Topology Appl. 119 (2002), no. 1, 65--94, \href{https://arxiv.org/abs/math/0003065}{arxiv:math/0003065}

\end{itemize}
A summary of the result is on \href{http://arxiv.org/PS_cache/math/pdf/0609/0609537v2.pdf#page=20}{p. 20} of

\begin{itemize}%
\item [[Paul Goerss]], [[Kristen Schemmerhorn]], \emph{Model Categories and Simplicial Methods} (\href{http://arxiv.org/abs/math.AT/0609537}{arXiv})

\end{itemize}
and on p. 6 of

\begin{itemize}%
\item [[Clemens Berger]], [[Ieke Moerdijk]], \emph{Axiomatic homotopy theory for operads} (\href{http://www.math.uu.nl/publications/preprints/1242.pdf}{pdf})

\end{itemize}
Left transfer in the accessible case is studied in

\begin{itemize}%
\item Marzieh Bayeh, [[Kathryn Hess]], Varvara Karpova, Magdalena Kdziorek, [[Emily Riehl]], [[Brooke Shipley]], \emph{Left-induced model structures and diagram categories} (\href{http://arxiv.org/abs/1401.3651}{arXiv:1401.3651})


\item [[Kathryn Hess]], Magdalena Kdziorek, [[Emily Riehl]], [[Brooke Shipley]], \emph{A necessary and sufficient condition for induced model structures} (\href{http://arxiv.org/abs/1509.08154}{arXiv:1509.08154}). This paper contains an error, corrected by:


\item [[Richard Garner]], Magdalena Kedziorek, [[Emily Riehl]], \emph{Lifting accessible model structures}, \href{https://arxiv.org/abs/1802.09889}{arXiv:1802.09889}



\end{itemize}
while in the combinatorial (cofibrantly generated) case it is studied in

\begin{itemize}%
\item [[Higher Topos Theory]], Appendix A


\item [[M. Makkai]], [[J. Rosický]], \emph{Cellular categories}, 2013, \href{https://arxiv.org/abs/1304.7572}{arXiv:1304.7572}



\end{itemize}
The right-transferred model structure on algebras for a 2-monad is from

\begin{itemize}%
\item [[Steve Lack]], \emph{Homotopy-theoretic aspects of 2-monads}, \href{http://arxiv.org/abs/math.CT/0607646}{arXiv}

\end{itemize}
[[!redirects transferred model category]] [[!redirects transferred model categories]] [[!redirects transferred model category structure]] [[!redirects transferred model category structures]] [[!redirects transferred model structure]] [[!redirects transferred model structures]]

[[!redirects induced model category]] [[!redirects induced model categories]] [[!redirects induced model category structure]] [[!redirects induced model category structures]] [[!redirects induced model structure]] [[!redirects induced model structures]]

[[!redirects lifted model category]] [[!redirects lifted model categories]] [[!redirects lifted model category structure]] [[!redirects lifted model category structures]] [[!redirects lifted model structure]] [[!redirects lifted model structures]]

[[!redirects right-transferred model category]] [[!redirects right-transferred model categories]] [[!redirects right-transferred model category structure]] [[!redirects right-transferred model category structures]] [[!redirects right-transferred model structure]] [[!redirects right-transferred model structures]]

[[!redirects right-induced model category]] [[!redirects right-induced model categories]] [[!redirects right-induced model category structure]] [[!redirects right-induced model category structures]] [[!redirects right-induced model structure]] [[!redirects right-induced model structures]]

[[!redirects right-lifted model category]] [[!redirects right-lifted model categories]] [[!redirects right-lifted model category structure]] [[!redirects right-lifted model category structures]] [[!redirects right-lifted model structure]] [[!redirects right-lifted model structures]]

[[!redirects left-transferred model category]] [[!redirects left-transferred model categories]] [[!redirects left-transferred model category structure]] [[!redirects left-transferred model category structures]] [[!redirects left-transferred model structure]] [[!redirects left-transferred model structures]]

[[!redirects left-induced model category]] [[!redirects left-induced model categories]] [[!redirects left-induced model category structure]] [[!redirects left-induced model category structures]] [[!redirects left-induced model structure]] [[!redirects left-induced model structures]]

[[!redirects left-lifted model category]] [[!redirects left-lifted model categories]] [[!redirects left-lifted model category structure]] [[!redirects left-lifted model category structures]] [[!redirects left-lifted model structure]] [[!redirects left-lifted model structures]]



\end{document}