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

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

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

[[!include category theory - contents]]

\hypertarget{exhaustive_categories}{}\section*{{Exhaustive categories}}\label{exhaustive_categories}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{properties}{Properties}\dotfill \pageref*{properties} \linebreak
\noindent\hyperlink{related_pages}{Related pages}\dotfill \pageref*{related_pages} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

A [[category]] is \textbf{exhaustive} if it has [[colimits]] of (transfinite) sequences of [[monomorphisms]] which interact well with [[pullbacks]].

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

Given a transfinite sequence

\begin{displaymath}
A_0 \to A_1 \to \cdots
\end{displaymath}
(continuing through $A_\alpha$ for all $\alpha\lt\kappa$, where $\kappa$ is some limit [[ordinal]]) for which each transition map $A_\alpha \to A_\beta$ is a [[monomorphism]], if $A_\kappa$ is a colimit of this sequence (a [[transfinite composition]]) we call it a \textbf{transfinite union}.

A category $C$ is \textbf{exhaustive} if one, hence both, of the following two equivalent conditions hold.

\begin{enumerate}%
\item $C$ has transfinite unions which are stable under pullback and for which the coprojections $A_\alpha \to A_\kappa$ are also monomorphisms.


\item $C$ has transfinite unions, and given any diagram

\begin{displaymath}
\itexarray{
  B_0 & \to & B_1 & \to & \cdots & \to & B_\kappa\\
  \downarrow && \downarrow &&&& \downarrow\\
  A_0 & \to & A_1 & \to & \cdots & \to & A_\kappa\\
}
\end{displaymath}
in which the bottom row is a transfinite union and for each $\alpha\lt\beta\lt\kappa$, the square

\begin{displaymath}
\itexarray{ B_\alpha & \to & B_\beta \\
  \downarrow && \downarrow \\
  A_\alpha & \to & A_\beta }
\end{displaymath}
is a [[pullback]] (hence $B_\alpha \to B_\beta$ is also monic), then the top row is a transfinite union (i.e. a colimit diagram) if and only if for all $\alpha\lt\kappa$ the square

\begin{displaymath}
\itexarray{ B_\alpha & \to & B_\kappa \\
  \downarrow && \downarrow \\
  A_\alpha & \to & A_\kappa }
\end{displaymath}
is a pullback. (In other words, transfinite unions are [[van Kampen colimits]].)



\end{enumerate}
Note that half of the second condition is simply that the colimits in the first condition are stable under pullback. One may obtain various weaker notions by restricting the allowable values of $\kappa$.

We will prove the equivalence of these two characterizations in Propositions \ref{CoprojectionsMonic} and \ref{AlternativeCharacterization} below.

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

\begin{itemize}%
\item The category [[Set]] is easily verified to be exhaustive.


\item Since limits and colimits in [[category of presheaves|presheaf categories]] are pointwise, any presheaf category $[D^{op},Set]$ is also exhaustive.


\item Since the condition involves only colimits and finite limits, it is preserved by any [[reflective subcategory|left exact localization]]. Thus, every [[Grothendieck topos]] is exhaustive.



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

We first prove the equivalence of the above two definitions.

\begin{prop}
\label{CoprojectionsMonic}\hypertarget{CoprojectionsMonic}{}
In a category which satisfies the second definition above, given a transfinite union

\begin{displaymath}
A_0 \to A_1 \to \cdots \to A_\kappa
\end{displaymath}
(so that $A_\alpha \to A_\beta$ is monic for all $\alpha\lt\beta\lt\kappa$), the coprojections $A_\alpha\to A_\kappa$ are also monic.

\end{prop}
\begin{proof}
For a fixed $\alpha$, consider the diagram

\begin{displaymath}
\itexarray{
  A_0 & \to & A_1 & \to & \cdots & \to & A_\alpha & \to & A_\alpha & \to & \cdots & \to & A_\alpha\\
  \downarrow && \downarrow &&&& \downarrow && \downarrow &&&& \downarrow\\
  A_0 & \to & A_1 & \to & \cdots & \to & A_\alpha & \to & A_{\alpha+1} & \to & \cdots & \to & A_\kappa\\
}
\end{displaymath}
It is easy to see that each intermediate square is a pullback, and of course the top row is a colimit. Thus, in particular the square

\begin{displaymath}
\itexarray{ A_\alpha & \to & A_\alpha \\
  \downarrow && \downarrow\\
  A_\alpha & \to & A_\kappa}
\end{displaymath}
is a pullback, i.e. $A_\alpha\to A_\kappa$ is monic.

\end{proof}
\begin{prop}
\label{AlternativeCharacterization}\hypertarget{AlternativeCharacterization}{}
Suppose $C$ satisfies the first condition above, i.e. it has pullback-stable transfinite unions for which the coprojections are also monic. Then $C$ also satisfies the second condition above.

\end{prop}
\begin{proof}
It remains to show that given a diagram

\begin{displaymath}
\itexarray{
  B_0 & \to & B_1 & \to & \cdots & \to & B_\kappa\\
  \downarrow^{f_0} && \downarrow^{f_1} &&&& \downarrow^{f_\kappa}\\
  A_0 & \to & A_1 & \to & \cdots & \to & A_\kappa\\
}
\end{displaymath}
in which both rows are transfinite compositions of monomorphisms and the squares

\begin{displaymath}
\itexarray{ B_\alpha & \to & B_\beta \\
  \downarrow^{f_\alpha} && \downarrow^{f_\beta} \\
  A_\alpha & \to & A_\beta }
\end{displaymath}
are pullbacks, also the squares

\begin{displaymath}
\itexarray{ B_\alpha & \to & B_\kappa \\
  \downarrow^{f_\alpha} && \downarrow^{f_\kappa} \\
  A_\alpha & \to & A_\kappa }
\end{displaymath}
are pullbacks.

Fix an $\alpha\lt\kappa$, and suppose given $g\colon X\to B_\kappa$ such that $f_\kappa g$ factors through $A_\alpha$; we want to show that $g$ factors through $B_\alpha$. Pulling back the $B$-colimit along $g$ and the $A$-colimit along $f_\kappa g$, we obtain another morphism of transfinite unions:

\begin{displaymath}
\itexarray{
  g^*B_0 & \to & g^*B_1 & \to & \cdots & \to & X\\
  \downarrow && \downarrow &&&& \downarrow^{1_X}\\
  (f_\kappa g)^* A_0 & \to & (f_\kappa g)^* A_1 & \to & \cdots & \to & X\\
}
\end{displaymath}
and it is easy to verify, by the pasting law for pullbacks, that each square

\begin{displaymath}
\itexarray{ g^* B_\beta & \to & g^* B_\gamma \\
  \downarrow^{f_\beta} && \downarrow^{f_\gamma} \\
  (f_\kappa g)^* A_\beta & \to & (f_\kappa g)^* A_\gamma }
\end{displaymath}
is a pullback for $\beta\lt\gamma\lt\kappa$. However, since $f_\kappa g$ factors through $A_\alpha$, the morphism $(f_\kappa g)^* A_\beta \to (f_\kappa g)^* A_\gamma$ is split epic whenever $\alpha\lt\beta\lt\gamma$, hence (since it is also monic) an isomorphism. Thus, in this case so is its pullback $g^* B_\beta \to g^* B_\gamma$. Since the coprojections into a transfinite composite of a sequence that eventually consists of isomorphisms are also eventually isomorphisms, $g^* B_\alpha \to X$ is an isomorphism; hence $g$ factors through $B_\alpha$ as desired.

\end{proof}
Exhaustiveness also interacts well with other [[exactness properties]]:

\begin{prop}
\label{FinInfExtensive}\hypertarget{FinInfExtensive}{}
If an exhaustive category is also finitary [[extensive category|extensive]], then it is infinitary extensive.

\end{prop}
\begin{proof}
A coproduct of cardinality $\kappa$ can be constructed using transfinite compositions and finite coproducts:

\begin{displaymath}
\sum_{\alpha\lt 0} A_\alpha \to \sum_{\alpha\lt 1} A_\alpha \to \sum_{\alpha\lt 2} A_\alpha \to \cdots \to \sum_{\alpha\lt \kappa} A_\alpha
\end{displaymath}
Finitary extensivity implies that all the transition maps are monic, so that these transfinite composites exist in an exhaustive category. Pullback-stability of coproducts follows easily from pullback-stability of transfinite unions and of finite coproducts. Finally, it is known (see [[extensive category]]) that if finite coproducts exist and are disjoint, then any infinite coproducts which exist are also disjoint.

\end{proof}
Colimits in an exhaustive category preserve finite limits.

\begin{lemma}
\label{UnionsPreserveIntersections}\hypertarget{UnionsPreserveIntersections}{}
In an exhaustive category, if $X$ is the $\kappa$-indexed transfinite union of a sequence $(A_\alpha)_{\alpha\lt\kappa}$ and also a sequence $(B_\alpha)_{\alpha\lt\kappa}$, then it is also the transfinite union of the sequence $(A_\alpha\cap B_\alpha)_{\alpha\lt\kappa}$ (the [[intersection]] being taken as [[subobjects]] of $X$).

\end{lemma}
\begin{proof}
Since transfinite unions are stable under pullback, $X$ is the colimit of the $(\kappa\times\kappa)$-indexed diagram $(A_\alpha\cap B_\beta)_{\alpha\lt\kappa, \beta\lt\kappa}$. But $\kappa$ is a [[filtered category]], so its diagonal functor is [[final functor|final]].

\end{proof}
\begin{prop}
\label{UnionsPreservePullbacks}\hypertarget{UnionsPreservePullbacks}{}
In an exhaustive category, given a pullback diagram of $\kappa$-indexed transfinite sequences of monomorphisms:

\begin{displaymath}
\left(\itexarray{ A_\alpha & \to & B_\alpha \\
    \downarrow && \downarrow\\
    C_\alpha & \to & D_\alpha }\right)_{\alpha\lt\kappa}
\end{displaymath}
the induced square of colimits:

\begin{displaymath}
\itexarray{ A_\kappa & \to & B_\kappa \\
    \downarrow && \downarrow\\
    C_\kappa & \to & D_\kappa }
\end{displaymath}
is also a pullback.

\end{prop}
\begin{proof}
Define $P$ so that the following square is a pullback:

\begin{displaymath}
\itexarray{ P & \overset{f}{\to} & B_\kappa \\
    ^g\downarrow && \downarrow\\
    C_\kappa & \to & D_\kappa }
\end{displaymath}
Since pullbacks preserve transfinite unions, $P$ is the transfinite union of the sequnece $(f^* B_\alpha)_{\alpha\lt\kappa}$ and also the sequence $(g^* C_\alpha)_{\alpha\lt\kappa}$. Thus, by Lemma \ref{UnionsPreserveIntersections}, $P$ is also the transfinite union of $(f^* B_\alpha\cap g^* C_\alpha)_{\alpha\lt\kappa}$. However, using the fact that the inclusions $D_\alpha \to D_\kappa$ are monic, it is straightforward to verify that

\begin{displaymath}
f^* B_\alpha\cap g^* C_\alpha \cong B_\alpha \times_{D_\alpha} C_\alpha \cong A_\alpha.
\end{displaymath}
Thus, $P$ is the transfinite union of $(A_\alpha)_{\alpha\lt\kappa}$, hence $P\cong A_\kappa$.

\end{proof}
\begin{cor}
\label{UnionsPreserveMonos}\hypertarget{UnionsPreserveMonos}{}
In an exhaustive category, transfinite unions preserve monomorphisms. That is, given a transformation $(A_\alpha \to B_\alpha)_{\alpha\lt\kappa}$ of transfinite sequences of monomorphisms which is pointwise monic, also the induced map on colimits $A_\kappa\to B_\kappa$ is monic.

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

\begin{itemize}%
\item [[exactness property]]

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

\begin{itemize}%
\item The name ``exhaustive category'' is a coinage; there seems to be no established name in the literature for this exactness property. See \href{http://mathoverflow.net/questions/93567/exactness-for-sequential-unions-of-monomorphisms}{this MO question}.

\end{itemize}
[[!redirects exhaustive category]] [[!redirects exhaustive categories]]



\end{document}