\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*{transfinite construction of free algebras}

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

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

[[!include category theory - contents]]

\hypertarget{transfinite_constructions_of_free_algebras_etc}{}\section*{{Transfinite constructions of free algebras, etc.}}\label{transfinite_constructions_of_free_algebras_etc}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{basic_concepts}{Basic concepts}\dotfill \pageref*{basic_concepts} \linebreak
\noindent\hyperlink{free_algebras_for_wellpointed_endofunctors}{Free algebras for well-pointed endofunctors}\dotfill \pageref*{free_algebras_for_wellpointed_endofunctors} \linebreak
\noindent\hyperlink{free_algebras_for_pointed_endofunctors}{Free algebras for pointed endofunctors}\dotfill \pageref*{free_algebras_for_pointed_endofunctors} \linebreak
\noindent\hyperlink{free_algebras_for_unpointed_endofunctors}{Free algebras for unpointed endofunctors}\dotfill \pageref*{free_algebras_for_unpointed_endofunctors} \linebreak
\noindent\hyperlink{colimits_of_algebras_for_a_monad}{Colimits of algebras for a monad}\dotfill \pageref*{colimits_of_algebras_for_a_monad} \linebreak
\noindent\hyperlink{ColimitsOfMonads}{Colimits of monads}\dotfill \pageref*{ColimitsOfMonads} \linebreak
\noindent\hyperlink{algebraic_small_object_argument}{Algebraic small object argument}\dotfill \pageref*{algebraic_small_object_argument} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

In [[category theory]], there is a common problem of the construction of [[free objects]] in ``algebraic'' categories. The idea is that one has to start from some ``[[generators and relations|generators]]'' and repeatedly throw in the results of applying ``operations'', subject to some ``[[generators and relations|relations]]'', over and over again until the result ``converges''. In general, this convergence will require a [[ordinal number|transfinite]] iteration, and the fact that it converges at all requires some smallness/accessibility hypotheses.

If this construction is performed in sufficient generality, then it includes a large number of important special cases, such as the following (not mutually exclusive):

\begin{itemize}%
\item the [[free monad]] generated by an [[endofunctor]]
\item the [[free monad]] generated by a [[pointed endofunctor]]
\item the free [[monoid]] generated by an object of a [[monoidal category]]
\item the [[orthogonal factorization system]] generated by a set of morphisms
\item the [[reflective subcategory|reflectiveness]] of a [[orthogonality class|small-orthogonality class]]
\item the reflectiveness of [[enriched category|enriched]] [[presheaves]] preserving certain [[limits]]
\item the [[cocomplete category|cocompleteness]] of the category of [[algebra over a monad|algebras]] for a [[monad]]
\item the existence of [[left adjoints]] to functors between categories of algebras for monads
\item the existence of colimits for diagrams of monads
\item the existence of colimits in categories of monoids
\item the [[algebraic small object argument]] generating [[algebraic weak factorization systems]]
\item the existence of [[W-types]] and [[inductive types]] in categories
\item the existence of [[higher inductive types]] in categories

\end{itemize}
In 1980, [[Max Kelly]] \hyperlink{Kelly}{(Kelly)} wrote a very long paper detailing very precise and general conditions under which such constructions can be performed, and showing how they can all be reduced to the case of free algebras for \emph{well-pointed endofunctors}.

In what follows we will summarize Kelly's constructions, restricted to the special case of [[accessible functors]] on [[locally presentable categories]]. Much of the technical apparatus of Kelly's paper (including, among other things, two different ambient orthogonal factorization systems $(E,M)$ and $(E',M')$, and assumptions such as ``$T$ preserves the $E$-tightness of $(M',K)$-cones'') becomes unnecessary in this case, which also includes many if not most of the important examples.

\hypertarget{basic_concepts}{}\subsection*{{Basic concepts}}\label{basic_concepts}

Let $\mathcal{A}$ be a [[locally presentable category]]. All endofunctors of $\mathcal{A}$ which we consider will be [[accessible functor|accessible]], that is, they preserve $\kappa$-[[filtered colimits]] for some sufficiently large [[cardinal number]] $\kappa$. In fact, we will only need to know that they preserve sufficiently long [[transfinite compositions]].

\begin{defn}
\label{}\hypertarget{}{}
An endofunctor $S:\mathcal{A}\to \mathcal{A}$ is called \textbf{[[pointed endofunctor|pointed]]} if it is equipped with a natural transformation $\sigma:Id_\mathcal{A} \to S$. It is called \textbf{well-pointed} if $S\sigma = \sigma S$ (as natural transformations $S\to S^2$).

\end{defn}
Of course, a [[monad]] can be regarded as a pointed endofunctor where $\sigma$ is its unit. Such an endofunctor is well-pointed precisely when the monad is [[idempotent monad|idempotent]].

\begin{defn}
\label{}\hypertarget{}{}
If $H$ is an endofunctor, then an $H$-[[algebra for an endofunctor|algebra]] is an object $A$ together with a map $H A\to A$. If $(S,\sigma)$ is a pointed endofunctor, then an $S$-algebra is an object $A$ with a map $a:S A \to A$ such that $a \sigma_A = 1_A$.

\end{defn}
We have obvious categories of algebras of both sorts. Of course, any [[algebra for a monad]] is also an algebra for that monad \emph{qua} pointed endofunctor. The converse holds in the well-pointed/idempotent case. In fact, we have:

\begin{lemma}
\label{WellPointedAlgebras}\hypertarget{WellPointedAlgebras}{}
If $(S,\sigma)$ is well-pointed, then an object $A$ admits at most one $S$-algebra structure. This happens exactly when $\sigma_A$ is an isomorphism, in which case its inverse is that unique algebra structure.

\end{lemma}
\begin{proof}
Commutativity of the diagram

\begin{displaymath}
\begin{array}{ccc} 
S S A & \overset{S a}\to & S A \\
\mathllap{\scriptsize{\sigma_{S A}=S\sigma_A}}\uparrow && \;\;\;\;\uparrow\mathrlap{\scriptsize{\sigma_A}} \\
S A & \underset{a}\to & A
\end{array}
\end{displaymath}
gives that $\sigma_A\circ a= 1_{S A}$, which together with $a\sigma_A= 1_A$ gives the invertibility of $a\colon S A\to A$ and the uniqueness of the algebra structure.

\end{proof}
Thus, when $S$ is well-pointed, the category of $S$-algebras is a [[full subcategory]] of $\mathcal{A}$. Well-pointed endofunctors are important, so we mention a few other ways to obtain them.

\begin{lemma}
\label{WellPointedQuotient}\hypertarget{WellPointedQuotient}{}
If $(S,\sigma)$ is a well-pointed endofunctor and $\alpha\colon S\to T$ is a natural transformation whose components are [[epimorphisms]], then $T$ is also well-pointed.

\end{lemma}
\begin{proof}
The putative transformation $\eta\colon 1\to T$ is the composition $\alpha\circ \sigma$. First of all notice that $\sigma T\circ \alpha = S\eta$, since

\begin{displaymath}
\begin{array}{cc} 
S\eta_A &= S \alpha_A \circ  S\sigma_A \\
&= S\alpha_A \circ \sigma_{S A}\\
&= \sigma_{T A}\circ \alpha_A
\end{array}
\end{displaymath}
by naturality of the transformations involved. Now, it suffices to show that $\eta T \circ \alpha = T\eta \circ \alpha$: this follows, again, from

\begin{displaymath}
\begin{array}{ccc} 
(\eta T \circ \alpha)_A &=& \alpha_{T A}\circ \sigma_{T A}\circ \alpha_A \\
&=& \alpha_{T A} \circ S \eta_A\\
&=& T \eta_A \circ \alpha_A \\
&=& (T\eta \circ\alpha)_A\end{array}
\end{displaymath}
Now since $\alpha$ is an epimorphism, we can conclude.

\end{proof}
\begin{lemma}
\label{WellPointedCointersection}\hypertarget{WellPointedCointersection}{}
Suppose $(S_i,\sigma_i)$ is a family of (accessible) well-pointed endofunctors and let $\sigma:Id \to S$ be the [[wide pushout]] of all the points $\sigma_i:Id \to S_i$. Then $(S,\sigma)$ is (accessible and) well-pointed, and $S Alg = \bigcap_i (S_i Alg)$.

\end{lemma}
\begin{proof}
The last statement is almost obvious using Lemma 1 above. Well-pointedness for $S$ follows adapting Lemma 2 to the case of a jointly epimorphic family of arrows $\{S_i\to S\}$, like the colimiting cocone for $S$.

\end{proof}
\begin{lemma}
\label{WellPointedTransfer}\hypertarget{WellPointedTransfer}{}
Let $F:\mathcal{A} \rightleftarrows \mathcal{B} :G$ be an adjunction and $(S',\sigma')$ an (accessible) well-pointed endofunctor on $\mathcal{A}$. Let $(S,\sigma)$ be the pushout

\begin{displaymath}
\itexarray{ F G & \xrightarrow{F \sigma' G} & F S' G \\
  \downarrow && \downarrow \\
  Id & \xrightarrow{\sigma} & S. }
\end{displaymath}
Then $(S,\sigma)$ is (accessible and) well-pointed, and $B\in\mathcal{B}$ is an $S$-algebra exactly when $G B$ is an $S'$-algebra.

\end{lemma}
\begin{proof}
\end{proof}
\hypertarget{free_algebras_for_wellpointed_endofunctors}{}\subsection*{{Free algebras for well-pointed endofunctors}}\label{free_algebras_for_wellpointed_endofunctors}

The basic theorem to which all others can be reduced is the following.

\begin{theorem}
\label{WellPointedFreeAlgebras}\hypertarget{WellPointedFreeAlgebras}{}
If $\mathcal{A}$ is [[locally presentable category|locally presentable]] and $S$ is an accessible well-pointed endofunctor, then $S Alg$ is [[reflective subcategory|reflective]] in $\mathcal{A}$. Therefore, the algebraically-free monad on $S$ exists (and is accessible).

\end{theorem}
\begin{proof}
Given $A\in\mathcal{A}$, define [[induction|inductively]] the following transfinite sequence in $\mathcal{A}$:

\begin{displaymath}
A \to S A \to S^2 A \to S^3 A \to \cdots
\end{displaymath}
in which each transition map is a component of $\sigma$, and we take colimits at limit stages. If we continue this out to some $\kappa$-filtered ordinal $\alpha$, where $S$ is $\kappa$-accessible, then $S$ will preserve the relevant colimit, and hence we have an induced action $S(S^\alpha A) \to S^\alpha A$. It is easy to check that this makes $S^\alpha A$ into a reflection of $A$ into $S Alg$.

\end{proof}
Some important constructions are directly examples of this theorem.

\begin{example}
\label{}\hypertarget{}{}
Let $K$ be a set of morphisms in $\mathcal{A}$; recall that an object $A\in\mathcal{A}$ is said to be \emph{orthogonal} to $K$ if $\mathcal{A}(k,A)$ is a bijection for all $k\in K$, which is to say that each functor $\mathcal{A}(k,-):\mathcal{A}\to Set^{\mathbf{2}}$ takes $A$ to an isomorphism, where $Set^{\mathbf{2}}$ is the [[arrow category]] of [[Set]]. Now the subcategory of isomorphisms is reflective in $Set^{\mathbf{2}}$, hence is the algebras for a well-pointed endofunctor $R_k$. By Lemma \ref{WellPointedTransfer}, there is a well-pointed endofunctor $S_k$ on $\mathcal{A}$ whose algebras are the objects orthogonal to $k$. And by Lemma \ref{WellPointedCointersection}, there is a well-pointed endofunctor $S$ whose algebras are those objects orthogonal to all $k\in K$. Thus, by Theorem \ref{WellPointedFreeAlgebras}, the category of objects orthogonal to $K$ is reflective in $\mathcal{A}$.

\end{example}
\begin{example}
\label{}\hypertarget{}{}
Applying the previous example on [[slice categories]], we can construct [[orthogonal factorization systems]].

\end{example}
The rest of the constructions proceed by building, out of other data, a well-pointed endofunctor, and applying Theorem \ref{WellPointedFreeAlgebras}.

\hypertarget{free_algebras_for_pointed_endofunctors}{}\subsection*{{Free algebras for pointed endofunctors}}\label{free_algebras_for_pointed_endofunctors}

Now let $(T,\tau)$ be a general (accessible) pointed endofunctor, not necessarily well-pointed. Let $T/\mathcal{A}$ denote the [[comma category]], whose objects are triples $(A,B,a)$ where $a:T A \to B$. Then $T/\mathcal{A}$ is again locally presentable.

If $\alpha:T'\to T$ is a natural transformation, we have an adjunction $\alpha_! : T'/\mathcal{A} \rightleftarrows T/\mathcal{A}: \alpha^*$ in which $\alpha^*$ sends $(A,B,a)$ to $(A,B,a\circ \alpha_A)$ and $\alpha_!$ is defined by a pushout.

Note that if $\alpha$ is $\tau:Id \to T$, then $\tau^*(A,B,a)$ is the composite $A \xrightarrow{\tau_A} T A \xrightarrow{a} B$ in $\mathcal{A}^{\mathbf{2}} = Id/\mathcal{A}$.

\begin{lemma}
\label{PointedAlgebrasInComma}\hypertarget{PointedAlgebrasInComma}{}
The category $T Alg$ of $T$-algebras is a reflective full subcategory of $T/\mathcal{A}$.

\end{lemma}
\begin{proof}
It is easy to show that it is a full subcategory. Moreover, $(A,B,a)$ lies in $T Alg$ just when $\tau^*(A,B,a)$ is an isomorphism. The isomorphisms are a reflective subcategory of $\mathcal{A}^{\mathbf{2}}$, hence the algebras for a well-pointed endofunctor $R$. Now by Lemma \ref{WellPointedTransfer}, there is a well-pointed endofunctor $S$ of $T/\mathcal{A}$ whose algebras are precisely the $T$-algebras. Now apply Theorem \ref{WellPointedFreeAlgebras}.

\end{proof}
\begin{theorem}
\label{PointedAlgebras}\hypertarget{PointedAlgebras}{}
The category $T Alg$ is monadic over $\mathcal{A}$, and cocomplete. In particular, the [[algebraically-free monad]] on $T$ exists and is accessible.

\end{theorem}
\begin{proof}
A left adjoint to the forgetful functor $T Alg \to \mathcal{A}$ is supplied by reflecting the object $(A,T A,\tau_A)$ of $T/\mathcal{A}$ into $T Alg$. The [[monadicity theorem]] then applies. Colimits can be constructed in $T/\mathcal{A}$ and then reflected into $T Alg$.

\end{proof}
It is possible to [[beta-reduction|beta-reduce]] this proof and describe the resulting transfinite construction more explicitly. Given $(A,B,a)$, we define inductively a transfinite sequence

\begin{displaymath}
\itexarray{ && T X_0 & \to & T X_1 & \to & T X_2 & \to & \dots \\
&& \downarrow^{x_0} && \downarrow^{x_1} && \downarrow^{x_2} \\
X_0 & \to & X_1 & \to & X_2 & \to & X_3 & \to & \dots }
\end{displaymath}
such that $X_\beta \to X_{\beta+1}$ is equal to $x_\beta \circ \tau_{X_\beta}$.

We begin with $X_0=A$, $X_1=B$, and $x_0 = a$. Given $X_\beta$ and $X_{\beta+1}$, we define $x_{\beta+1}:T X_{\beta+1}\to X_{\beta+2}$ to be the coequalizer of the two composites

\begin{displaymath}
T X_\beta \;\underoverset{T \tau}{\tau T}{\rightrightarrows}\; T^2 X_\beta \xrightarrow{T x_\beta} T X_{\beta+1}.
\end{displaymath}
At limit ordinals $\alpha$ we take colimits, and at successors of limit ordinals we let $x_\alpha : T X_\alpha \to X_{\alpha+1}$ be the coequalizer of the two maps

\begin{displaymath}
\itexarray{ && \colim_{\beta\lt\alpha} X_{\beta+1} = X_\alpha \\
  & \nearrow && \searrow^{\tau} \\
  \colim_{\beta\lt\alpha} T X_\beta && \to && T X_\alpha.}
\end{displaymath}
\begin{example}
\label{}\hypertarget{}{}
The [[algebraic weak factorization system|algebraic]] [[small object argument]] consists of building the free monad on a pointed endofunctor.

\end{example}
\hypertarget{free_algebras_for_unpointed_endofunctors}{}\subsection*{{Free algebras for unpointed endofunctors}}\label{free_algebras_for_unpointed_endofunctors}

An algebra for an unpointed endofunctor $H$ is the same as an algebra for the pointed endofunctor $T \coloneqq Id + H$. Thus, Theorem \ref{PointedAlgebras} can be applied to unpointed endofunctors as well.

In this case, the transfinite sequence for the free $H$-algebra on $A\in\mathcal{A}$ is much simpler: we have $X_0 = A$ and $X_{\beta+1} = A + H X_\beta$.

\begin{example}
\label{}\hypertarget{}{}
A [[W-type]] in a category is an initial algebra for a [[polynomial functor]]. Equivalently, it is the free algebra on the initial object for that functor. Thus, we obtain the existence of W-types, and likewise of more general [[inductive types]].

\end{example}
\hypertarget{colimits_of_algebras_for_a_monad}{}\subsection*{{Colimits of algebras for a monad}}\label{colimits_of_algebras_for_a_monad}

Let $T$ be a monad on $\mathcal{A}$, and let $T Alg$ denote the category of $T$-algebras \emph{qua} monad.

\begin{theorem}
\label{MonadAlgebras}\hypertarget{MonadAlgebras}{}
The category $T Alg$ is a reflective subcategory of $T/\mathcal{A}$.

\end{theorem}
\begin{proof}
For $(A,B,a)\in T/\mathcal{A}$, consider the pushout

\begin{displaymath}
\itexarray{ T^2 A & \xrightarrow{\mu} & T A \\
  ^{T a}\downarrow && \downarrow\\
  T B & \xrightarrow{c} & D }
\end{displaymath}
Define $L:T/\mathcal{A}\to T/\mathcal{A}$ to take $(A,B,a)$ to $(B,D,c)$ in this pushout. Then $L$-algebras (\emph{qua} pointed endofunctor) are precisely $T$-algebras (\emph{qua} monad), and we have a pointwise epimorphism $S\to L$, where $S$ is the well-pointed endofunctor from the proof of Theorem \ref{PointedAlgebras} whose algebras are the $T$-algebras (\emph{qua} pointed endofunctor). Thus, by Lemma \ref{WellPointedQuotient}, $L$ is well-pointed; now apply Theorem \ref{WellPointedFreeAlgebras}.

\end{proof}
\begin{cor}
\label{}\hypertarget{}{}
$T Alg$ is locally presentable. Moreover, any functor $T Alg \to T' Alg$ induced by a monad morphism $T'\to T$ has a left adjoint.

\end{cor}
\begin{proof}
Since $T Alg$ is reflective in the cocomplete $T/\mathcal{A}$, it is cocomplete. Since it is [[accessible category|accessible]] by the \href{/nlab/show/accessible+category#Limits}{limit theorem}, it is locally presentable. For the second statement, the functor $T/\mathcal{A} \to T'/\mathcal{A}$ has an easily defined left adjoint; now compose it with the reflection into $T/\mathcal{A}$.

\end{proof}
\hypertarget{ColimitsOfMonads}{}\subsection*{{Colimits of monads}}\label{ColimitsOfMonads}

When speaking of colimits of monads, we are not interested merely in colimits in the category of monads, but \emph{algebraic colimits} in the following sense. Let $V:K\to Monad (\mathcal{A})$ be a diagram in the category of monads on $\mathcal{A}$, and define a \textbf{$V$-algebra} to be an object $A$ together with $V_k$-algebra structures which commute with the images of morphisms in $K$.

\begin{defn}
\label{}\hypertarget{}{}
An \textbf{algebraic colimit} of $V$ is a monad $P$ whose usual [[Eilenberg-Moore category]] $P Alg$ is equivalent, over $\mathcal{A}$, to the category of $V$-algebras.

\end{defn}
It follows, by arguments similar to those for [[algebraically-free monads]], that an algebraic colimit is also a colimit in the category of monads.

\begin{theorem}
\label{ColimitsOfMonads}\hypertarget{ColimitsOfMonads}{}
Algebraic colimits of (accessible) monads exist (and are accessible).

\end{theorem}
\begin{proof}
WLOG we may assume $K$ has an initial object; otherwise, give it a new initial object $0$ and define $V_0 = Id$. Let $T$ be the (pointwise) colimit of $V$ in the category of endofunctors of $\mathcal{A}$, with coprojections $r_k:V_k \to T$. Our assumption on $K$ gives $T$ a unique point $Id \to V_0 \to T$ such that each $r_k$ is a map of pointed endofunctors. Moreover, a $T$-algebra (\emph{qua} pointed endofunctor) is an object $A$ together with compatible pointed-endofunctor-algebra structures for each $V_k$. This clearly includes the $V$-algebras, as defined above, as a full subcategory.

We will show the category of $V$-algebras to be reflective in $T/\mathcal{A}$. Given $(A,B,a)$, let $c:T B \to D$ be the joint coequalizer of all the parallel pairs

\begin{displaymath}
\itexarray{ && V_k A \\
  & ^{\mu_k}\nearrow && \searrow^{V_k \tau_k}\\
  V_k^2 A && \xrightarrow{id} && V_k^2 A &
  \xrightarrow{V_k (a r_k)} & V_k B & \xrightarrow{r_k } T B. }
\end{displaymath}
Let $L(A,B,a) \coloneqq (B,D,c)$, defining an endofunctor of $T/\mathcal{A}$. Then $L$ is accessible, and an $L$-algebra is precisely a $V$-algebra.

Moreover, $L$ admits an epimorphic transformation from the well-pointed endofunctor $S$ defined as in Theorem \ref{PointedAlgebras} whose algebras are the $T$-algebras (\emph{qua} pointed endofunctor). Thus, by Lemma \ref{WellPointedQuotient}, $L$ is well-pointed; now apply Theorem \ref{WellPointedFreeAlgebras}.

\end{proof}
\begin{example}
\label{}\hypertarget{}{}
The categorical semantics of [[higher inductive types]] can be described using certain ``presentations'' of monads. See \hyperlink{LShits}{Lumsdaine-Shulman}.

\end{example}
\hypertarget{algebraic_small_object_argument}{}\subsection*{{Algebraic small object argument}}\label{algebraic_small_object_argument}

The [[algebraic small object argument]] is an enhancement of the [[small object argument]], based on a free monad construction, that produces [[algebraic weak factorization systems]].

[[!include algebraic model structures - table]]

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

\begin{itemize}%
\item [[Max Kelly]], \emph{A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on.} Bull. Austral. Math. Soc. 22 (1980), 1--83. doi:\href{http://dx.doi.org/10.1017/S0004972700006353}{10.1017/S0004972700006353}

\end{itemize}
\begin{itemize}%
\item [[Peter LeFanu Lumsdaine]] and [[Mike Shulman]], \emph{Semantics of higher inductive types}, \href{https://arxiv.org/abs/1705.07088}{arxiv}

\end{itemize}


\end{document}