\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*{colimits of paracompact Hausdorff spaces}

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

\hypertarget{topology}{}\paragraph*{{Topology}}\label{topology}

[[!include topology - contents]]

\hypertarget{limits_and_colimits}{}\paragraph*{{Limits and colimits}}\label{limits_and_colimits}

[[!include infinity-limits - contents]]

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

\noindent\hyperlink{introduction}{Introduction}\dotfill \pageref*{introduction} \linebreak
\noindent\hyperlink{basic_results}{Basic results}\dotfill \pageref*{basic_results} \linebreak
\noindent\hyperlink{michaels_selection_characterization_of_paracompactness}{Michael's selection characterization of paracompactness}\dotfill \pageref*{michaels_selection_characterization_of_paracompactness} \linebreak
\noindent\hyperlink{applications_to_colimits_of_paracompacta}{Applications to colimits of paracompacta}\dotfill \pageref*{applications_to_colimits_of_paracompacta} \linebreak
\noindent\hyperlink{related_entries}{Related entries}\dotfill \pageref*{related_entries} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


\hypertarget{introduction}{}\subsection*{{Introduction}}\label{introduction}

In this article we collect some results on [[colimits]] of [[paracompact Hausdorff spaces]] as computed in the category of [[topological spaces]] [[Top]], and particular conditions under which the colimit is again paracompact and Hausdorff.

The account is designed to be parallel to that given in [[colimits of normal spaces]], centering particularly on how paracompactness may be reformulated in terms of an extension or selection property. The relevant result, due to Ernest Michael, is particularly well-adapted to the study of colimits.

In the sequel, a \emph{paracompactum} (pl. \emph{paracompacta}) is a paracompact Hausdorff space, just as [[compactum]] is a compact Hausdorff space.

\hypertarget{basic_results}{}\subsection*{{Basic results}}\label{basic_results}

\begin{prop}
\label{coproduct}\hypertarget{coproduct}{}
The [[coproduct]] in $Top$ of a small family of paracompacta is a paracompactum.

\end{prop}
The proof is very easy. See \href{https://ncatlab.org/nlab/show/paracompact+topological+space#ParacompactnessPreservedByDisjointUnion}{here}.

\begin{prop}
\label{}\hypertarget{}{}
A [[closed subspace]] $A$ of a paracompactum $X$ is also a paracompactum.

\end{prop}
\begin{proof}
Let $U_\alpha$ be an [[open cover]] of $A$; note $\neg A \cup U_\alpha$ is the maximal open $V_\alpha$ in $X$ such that $U_\alpha = V_\alpha \cap A$. The $V_\alpha$ cover $X$. If $\mathcal{V}$ is a locally finite open refinement of this cover (via paracompactness of $X$), then the family $\{V \cap A: V \in \mathcal{V}\}$ is a locally finite open refinement of the family of sets $U_\alpha$. Finally, $A$ is Hausdorff because Hausdorffness is a [[hereditary property]].

\end{proof}
\begin{lemma}
\label{poclosed}\hypertarget{poclosed}{}
In $Top$, the pushout $j$ of a (closed/open) embedding $i$ along any continuous map $f$,

\begin{displaymath}
\itexarray{
A & \stackrel{i}{\hookrightarrow} & B \\ 
\mathllap{f} \downarrow & po & \downarrow \mathrlap{g} \\ 
C & \underset{j}{\hookrightarrow} & D,
}
\end{displaymath}
is again a (closed/open) embedding.

\end{lemma}
\begin{proof}
For the sake of convenience, we reproduce the proof given \href{/nlab/show/subspace+topology#pushout}{here}.

Since $U = \hom(1, -): Top \to Set$ is [[faithful functor|faithful]], we have that monos are reflected by $U$; also monos and pushouts are preserved by $U$ since $U$ has both a [[left adjoint]] and a [[right adjoint]]. In $Set$, the pushout of a mono along any map is a mono, so we conclude $j$ is monic in $Top$. Furthermore, such a pushout diagram in $Set$ is also a pullback, so that we have the [[Beck-Chevalley condition|Beck-Chevalley equality]] $\exists_i \circ f^\ast = g^\ast \exists_j \colon P(C) \to P(B)$ (where $\exists_i \colon P(A) \to P(B)$ is the [[direct image]] map between [[power sets]], and $f^\ast: P(C) \to P(A)$ is the [[inverse image]] map).

To prove that $j$ is a subspace, let $U \subseteq C$ be any open set. Then there exists open $V \subseteq B$ such that $i^\ast(V) = f^\ast(U)$ because $i$ is a subspace inclusion. If $\chi_U \colon C \to \mathbf{2}$ and $\chi_V \colon B \to \mathbf{2}$ are the maps to [[Sierpinski space]] that classify these open sets, then by the universal property of the pushout, there exists a unique continuous map $\chi_W \colon D \to \mathbf{2}$ which extends the pair of maps $\chi_U, \chi_V$. It follows that $j^{-1}(W) = U$, so that $j$ is a subspace inclusion.

If moreover $i$ is an open inclusion, then for any open $U \subseteq C$ we have that $j^\ast(\exists_j(U)) = U$ (since $j$ is monic) and (by Beck-Chevalley) $g^\ast(\exists_j(U)) = \exists_i(f^\ast(U))$ is open in $B$. By the definition of the topology on $D$, it follows that $\exists_j(U)$ is open, so that $j$ is an open inclusion. The same proof, replacing the word ``open'' with the word ``closed'' throughout, shows that the pushout of a closed inclusion $i$ is a closed inclusion $j$.

\end{proof}
\hypertarget{michaels_selection_characterization_of_paracompactness}{}\subsection*{{Michael's selection characterization of paracompactness}}\label{michaels_selection_characterization_of_paracompactness}

(See also [[Michael's theorems]].)

It is well-known (see [[paracompact Hausdorff spaces equivalently admit subordinate partitions of unity|here]]) that a $T_1$ space $X$ is a paracompactum iff every open cover of $X$ \href{/nlab/show/paracompact+Hausdorff+spaces+equivalently+admit+subordinate+partitions+of+unity}{admits a subordinate partition of unity}. Michael's innovation was in working out how the partition of unity characterization may be recast in terms of existence of continuous sections of suitable projection maps.

From here on out, all spaces will be assumed to be $T_1$ ([[singletons]] are [[closed subset|closed]]); see [[separation property]].

Recall that a [[relation]] in a [[category]] is a jointly monic [[span]]

\begin{displaymath}
\itexarray{
 & & R & & \\ 
 & \mathllap{p} \swarrow & & \searrow \mathrlap{q} & \\ 
X & & & & Y
}
\end{displaymath}
and that the relation is [[entire relation|entire]] if $p$ is an [[epimorphism]]. We will be working in the category $Top$, where epimorphisms are the same as surjective continuous functions. A \emph{selection} for such a relation is by definition a [[section]] of $p$, where of course in $Top$ this means a continuous section. (In the category $Set$, the [[axiom of choice]] may be equivalently stated as saying that every entire relation admits a selection, a formulation which is sometimes credited to [[Charles Sanders Peirce|Peirce]].)

If $X$ is a space, let $\mathcal{O} X$ denote its topology, considered as a subset of the power set $P X$. Adapting the terminology of Michael, we will say a relation $X \stackrel{p}{\leftarrow} R \stackrel{q}{\to} Y$ is \emph{lsc} (``lower semi-continuous'') if the composite

\begin{displaymath}
P Y \stackrel{q^\ast}{\to} P R \stackrel{\exists_p}{\to} P X
\end{displaymath}
restricts to a map $\exists_p q^\ast: \mathcal{O} Y \to \mathcal{O} X$. (In more down-to-earth terms, if we consider $R$ as a subspace of $X \times Y$, this says the [[image]] $\pi_X(R \cap (X \times V))$ under the projection $\pi_X: X \times Y \to X$ is open in $X$ whenever $V$ is open in $Y$.)

Let $B$ be a [[Banach space]] (for an example relevant to paracompactness concerns, $B$ could be $L^1(S)$, the Banach space freely generated by a set $S$ that indexes an open cover $\{U_s\}_{s \in S}$ of a given space $X$). We will say an (entire) relation $(R, p, q)$ from $X$ to $B$ in $Top$ is \emph{closed and convex} if for each $x \in X$ the fiber $R_x = \exists_q p^\ast(x)$ is a closed [[convex set|convex]] subset of $B$.

\begin{theorem}
\label{Michael}\hypertarget{Michael}{}
\textbf{(E. Michael's selection theorem)} A $T_1$ space $X$ is a paracompactum iff the condition

\begin{itemize}%
\item for every [[Banach space]] $B$, every entire, lsc, closed and convex relation $(R, p, q)$ from $X$ to $B$ admits a selection

\end{itemize}
is satisfied.

\end{theorem}
For now we omit giving the proof (given in \hyperlink{Michael56}{Michael}).

Before applying this theorem, we need a few lemmas that play supporting roles.

\begin{lemma}
\label{pullback}\hypertarget{pullback}{}
If $(R, p, q): X \nrightarrow B$ is entire, lsc, closed and convex, and $f: A \to X$ is a continuous map, then the pullback relation $(f^\ast R, r, q g): A \nrightarrow Y$ (as in the pullback diagram)

\begin{displaymath}
\itexarray{
 & & f^\ast R & \stackrel{g}{\to} & R & & \\ 
 & \mathllap{r} \swarrow & (pb) & \swarrow \mathrlap{p} & & \searrow \mathrlap{q} & \\ 
A & \underset{f}{\to} & X & & & & B
}
\end{displaymath}
is also entire, lsc, closed and convex.

\end{lemma}
\begin{proof}
Clearly $r$ is surjective (being a pullback of a surjection), so the relation $f^\ast R$ is entire, and for $a \in A$ we have $(f^\ast R)_a = R_{f(a)}$ so that $f^\ast R$ is closed and convex if $R$ is. We also have

\begin{displaymath}
\exists_r (q g)^\ast = \exists_r g^\ast q^\ast = f^\ast \exists_p q^\ast
\end{displaymath}
where the second equation follows from a Beck-Chevalley equation (induced by the pullback square). The map $\exists_p q^\ast$ preserves openness since $R$ is lsc, and $f^\ast$ preserves openness by continuity, so $\exists_r (q g)^\ast$ preserves openness, which proves $f^\ast R$ is lsc.

\end{proof}
The next result is an important observation about extending continuous selections.

\begin{lemma}
\label{extension}\hypertarget{extension}{}
If $X$ satisfies the condition $\bullet$ of Theorem \ref{Michael} and $f: A \hookrightarrow X$ is a closed embedding, then for every $(R, p, q): X \to B$, every selection $\sigma: A \to f^\ast R$ of $(f^\ast R, r, q g)$ can be extended to a selection of $(R, p, q)$.

\end{lemma}
\begin{proof}
Replace the relation $R$ by the relation $S$ from $X$ to $B$ where $S_{f(x)} = \{\sigma(x)\}$ if $x \in A$, and $S_x = R_x$ if $x \notin f(A)$. Clearly every fiber $S_x$ is closed, convex, and inhabited, so $S$ is closed and convex and entire. We check that $S$ is lsc. Let $V$ be open in $Y$; we must verify that every point $x$ of $\pi_X(S \cap (X \times V))$ is an interior point of that set. If $x \in \neg A$, this is clear since

\begin{displaymath}
\neg A \cap \pi_X(S \cap (X \times V)) = \neg A \cap \pi_X(R \cap (X \times V)
\end{displaymath}
is open. If $x \in A$, then by continuity of $\sigma$ there is open neighborhood $U$ of $x$ such that $\sigma(x') \in V$ for all $x' \in U \cap A$, and then one may easily check that

\begin{displaymath}
U \cap \pi_X(R \cap (X \times V)) \subseteq \pi_X(S \cap (X \times V))
\end{displaymath}
so that the left side is an open neighborhood of $x$ contained within the right side. Thus $S$ is lsc.

Since hypothesis $\bullet$ holds for $X$, we conclude that $S$ admits a selection $\tau$; by construction of $S$ we must have that $\tau |_A = \sigma$, and this completes the proof.

\end{proof}
\hypertarget{applications_to_colimits_of_paracompacta}{}\subsection*{{Applications to colimits of paracompacta}}\label{applications_to_colimits_of_paracompacta}

Now we put Michael's selection theorem to use in developing colimits of paracompacta.

\begin{theorem}
\label{ClosedEmbeddingsOfParacompactaClosedUnderPushout}\hypertarget{ClosedEmbeddingsOfParacompactaClosedUnderPushout}{}
If $X, Y, Z$ are paracompacta and $h: X \to Z$ is a closed embedding and $f: X \to Y$ is a continuous map, then in the pushout diagram in $Top$

\begin{displaymath}
\itexarray{
X & \stackrel{h}{\to} & Z \\ 
\mathllap{f} \downarrow & & \downarrow \mathrlap{g} \\ 
Y & \underset{k}{\to} & W,
}
\end{displaymath}
the space $W$ is a paracompactum (and $k: Y \to W$ is a closed embedding, by Lemma \ref{poclosed}).

\end{theorem}
(Compare a similar result for normal spaces, \href{https://ncatlab.org/nlab/show/colimits+of+normal+spaces#attach}{here}.)

\begin{proof}
Let $W \stackrel{p}{\leftarrow} R \stackrel{q}{\to} B$ be an entire, lsc, closed and convex relation to a Banach space $B$; by Michael's selection criterion, it suffices to show that $W$ is $T_1$ and $p$ admits a section. That $W$ is $T_1$ is easy: a point $x \in W$ either belongs to the closed subspace $Y \hookrightarrow W$ or it doesn't. If it does, then because $Y$ is Hausdorff, it is a closed point in a closed subspace, so it is a closed point in $W$. If it doesn't, then $k^{-1}(x) = \emptyset$ and $g^{-1}(x)$ is a singleton in $Z$ and thus closed in $Z$ since $Z$ is Hausdorff, i.e., the inverse image of $x$ under the quotient map $(k, g): Y + Z \to W$ is the closed subset $\emptyset + g^{-1}(x)$, so $x$ must be closed in $W$ by definition of quotient topology.

Thus we have only to prove $p$ admits a section. Using Lemma \ref{pullback}, we pull back $(R, p, q)$ to entire, lsc, closed and convex relations to $B$ from $Y$ and from $Z$:

\begin{displaymath}
\itexarray{
X & \stackrel{h}{\to} & Z & & \\ 
\mathllap{f} \downarrow & & \downarrow \mathrlap{g} & \nwarrow & \\ 
Y & \underset{k}{\to} & W & & g^\ast R \\ 
 & \nwarrow & & \nwarrow \mathrlap{p} & \downarrow \\ 
 & & k^\ast R & \to & R.
}
\end{displaymath}
By paracompactness of $Y$ and the selection criterion, there is a section $s$ of $k^\ast R \to Y$. The composite $s f: X \to k^\ast R$ in turn induces a selection $t: X \to f^\ast k^\ast R \cong h^\ast g^\ast R$. By Lemma \ref{extension}, the selection $t$ may be extended to a selection $u: Z \to g^\ast R$. The two maps

\begin{displaymath}
Y \stackrel{s}{\to} k^\ast R \to R, \qquad Z \stackrel{u}{\to} g^\ast R \to R
\end{displaymath}
may be pasted together (i.e., their respective composites with $f$ and $h$ agree) to give a map out of the pushout, $i: W \to R$, which is easily checked to be a section of $p$.

\end{proof}
\begin{prop}
\label{ColimitsOfSequencesOfParacompacta}\hypertarget{ColimitsOfSequencesOfParacompacta}{}
If $(i_n: X_n \to X_{n+1})_{n \in \mathbb{N}}$ is a countable sequence of closed embeddings between paracompacta, then the colimit $X = colim_n X_n$ is also a paracompactum.

\end{prop}
\begin{proof}
Clearly $X$ is $T_1$: for any $x \in X$, the intersection $\{x\} \cap X_n$ is closed in $X_n$ for all $n$, so $x$ must a closed point of $X$.

Let $j_n: X_n \to X$ denote a component of the colimit cocone. Let $(R, p, q)$ from $X$ to a Banach space $B$ be an entire, lsc, closed and convex relation. Pulling this back to $X_0$, by paracompactness we have a selection $X_0 \to j_0^\ast R$. Given a selection $X_n \to j_n^\ast R$, we may extend along $i_n$ to a selection $X_{n+1} \to j_{n+1}^\ast R$ using paracompactness and Lemma \ref{extension}. These selections, being compatible with the inclusions $i_n$, paste together to give a selection $X \to R$.

\end{proof}
In particular this may be used to see that \emph{[[CW-complexes are paracompact Hausdorff spaces]]}.

\hypertarget{related_entries}{}\subsection*{{Related entries}}\label{related_entries}

\begin{itemize}%
\item [[colimits of normal spaces]]

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

\begin{itemize}%
\item [[Ernest Michael]], \emph{Continuous Selections I}, The Annals of Mathematics, 2nd Series, Vol. 63 No. 2. (March 1956), 361-382. \href{http://www.jstor.org/stable/1969615?seq=1#page_scan_tab_contents}{stable URL}, (\href{http://www.renyi.hu/~descript/papers/Michael_1.pdf}{pdf})

\end{itemize}
[[!redirects colimits of paracompact spaces]]



\end{document}