\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*{tube lemma}

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

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

[[!include topology - contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{StatementAndProofs}{Statements and proofs}\dotfill \pageref*{StatementAndProofs} \linebreak
\noindent\hyperlink{consequences}{Consequences}\dotfill \pageref*{consequences} \linebreak
\noindent\hyperlink{tychnoff_theorem}{Tychnoff theorem}\dotfill \pageref*{tychnoff_theorem} \linebreak
\noindent\hyperlink{exponentiability_of_the_compactopen_topology}{Exponentiability of the compact-open topology}\dotfill \pageref*{exponentiability_of_the_compactopen_topology} \linebreak
\noindent\hyperlink{converse_of_the_tube_lemma}{Converse of the tube lemma}\dotfill \pageref*{converse_of_the_tube_lemma} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

The \textbf{tube lemma} may refer to one of several fundamental lemmas in topology ([[general topology|point-set topology]] to be more exact\footnote{The use of the phrase ``point-set topology'' signals that the tube lemma proper does refer to \emph{points}, as opposed to the ``point-free'' or ``pointless'' topology as developed in the theory of [[locales]]. Point-free analogues of the main consequences of the tube lemma, such as the fact that the product of two compact topological spaces is again compact, are quite nontrivial and require a significantly different approach.} ) that underlie many arguments involving [[compact spaces]]. That is to say: much like the [[Yoneda lemma]] of pure [[category theory]], there are various closely related statements that can be said to fall under the rubric ``tube lemma''; we consider several examples here.

\hypertarget{StatementAndProofs}{}\subsection*{{Statements and proofs}}\label{StatementAndProofs}

\begin{prop}
\label{ProjectingOutCompactSpaceIsClosedMap}\hypertarget{ProjectingOutCompactSpaceIsClosedMap}{}
\textbf{([[closed-projection characterization of compactness]])}

If $X$ is any [[topological space|space]] and $Y$ is a [[compact topological space|compact]], then the [[projection map]] $p: X \times Y \to X$ out of the [[product topological space]] is a [[closed map]], i.e., under [[direct image]] (the [[left adjoint]] $\exists_p: P (X \times Y) \to P(X)$ to the [[inverse image]] map $p^\ast: P(X) \to P(X \times Y)$), [[closed sets]] in $X \times Y$ are mapped to closed sets in $X$.

\end{prop}
Assuming the [[principle of excluded middle]], the statement of prop. \ref{ProjectingOutCompactSpaceIsClosedMap} is equivalent to an alternative formulation:

\begin{prop}
\label{Alternative}\hypertarget{Alternative}{}
let $\forall_p: P(X \times Y) \to P(X)$ be the [[right adjoint]] to $p^\ast: P(X) \to P(X \times Y)$. (In [[classical logic]], $\forall_p = \neg \exists_p \neg$.) Then

\begin{itemize}%
\item If $Y$ is compact, then $\forall_p: P(X \times Y) \to P(X)$ takes [[open sets]] in $X \times Y$ to open sets in $X$. (Compare [[overt space]].)

\end{itemize}
\end{prop}
\begin{proof}
This alternative may be proven directly as follows. Let $W \subseteq X \times Y$ be an open set, and suppose $\{x\} \subseteq \forall_p(W)$. This means precisely that $p^\ast\{x\} = \{x\} \times Y \subseteq W$. We are required to show that there is a neighborhood $O$ of $x$ such that $O \subseteq \forall_p(W)$, which is to say $O \times Y \subseteq W$.

\end{proof}
This $O \times Y$ may be pictured as a little open ``tube'' around $\{x\} \times Y$ which fits inside $W$, thus explaining the name of the eponymous lemma.

\begin{lemma}
\label{tube}\hypertarget{tube}{}
\textbf{(Tube lemma)}

Let $X$ be a [[topological space]] and let $Y$ be a [[compact topological space]]. For a point $x \in X$ and $W$ open in $X \times Y$, if $\{x\} \times Y \subseteq W$, then there is an open neighborhood $O$ of $x$ such that the ``tube'' $O \times Y$ around $\{x \} \times Y$ is still contained: $O \times Y \subseteq W$.

\end{lemma}
\begin{proof}
Let $\mathcal{O}_x$ denote the set of open neighborhoods of $x$, and for $U \in \mathcal{O}_x$, let $U\multimap W$ be the largest open $V$ of $Y$ such that $U \times V \subseteq W$. The collection $\{U \multimap W: U \in \mathcal{O}_x\}$ is an open cover of $Y$; since $Y$ is compact, there is a finite subcover $U_1 \multimap W, U_2 \multimap W, \ldots, U_n \multimap W$. Then $O = U_1 \cap \ldots \cap U_n \in \mathcal{O}_x$ is the desired open. For, $O \subseteq U_i$ implies $(U_i \multimap W) \subseteq (O \multimap W)$, so that

\begin{displaymath}
Y = \bigcup_{i=1}^n (U_i \multimap W) \subseteq O \multimap W
\end{displaymath}
and this implies $O \times Y \subseteq O \times (O \multimap W) \subseteq W$.

\end{proof}
\begin{proof}
(of the tube lemma \ref{tube} via [[closed-projection characterization of compactness]])

Let

\begin{displaymath}
C \coloneqq (X \times Y) \backslash W
\end{displaymath}
be the [[complement]] of $W$. Since this is closed, by prop. \ref{ProjectingOutCompactSpaceIsClosedMap} also its projection $p_X(C) \subset X$ is closed.

Now

\begin{displaymath}
\begin{aligned}
    \{x\} \times Y \subset W
      & \;\Leftrightarrow\;
    \{x\} \times Y \; \cap \; C = \emptyset  
    \\
    & \;\Rightarrow\; 
    \{x\} \cap  p_X(C) = \emptyset
  \end{aligned}
\end{displaymath}
and hence by the closure of $p_X(C)$ there is (by \href{Introduction+to+Topology+--+1#UnionOfOpensGivesClosure}{this lemma}) an open neighbourhood $U_x \supset \{x\}$ with

\begin{displaymath}
U_x \cap p_X(C) = \emptyset
  \,.
\end{displaymath}
This means equivalently that $U_x \times Y \cap C = \emptyset$, hence that $U_x \times Y \subset W$.

\end{proof}
\hypertarget{consequences}{}\subsection*{{Consequences}}\label{consequences}

\hypertarget{tychnoff_theorem}{}\subsubsection*{{Tychnoff theorem}}\label{tychnoff_theorem}

\begin{cor}
\label{}\hypertarget{}{}
\textbf{(binary [[Tychonoff theorem]])}

The [[product topological space]] $X \times Y$ of two [[compact topological spaces]] $X, Y$ is itself compact.

\end{cor}
\begin{proof}
Let $\mathcal{U}$ be any open cover of $X \times Y$, and let $\mathcal{B}$ be the collection of opens of $X \times Y$ that are unions of finitely many elements of $\mathcal{U}$. For each $x \in X$, we have that $\{x\} \times Y$ is compact since $Y$ is, so there is $B \in \mathcal{B}$ such that $\{x\} \times Y \subseteq B$, whence there is $U \in \mathcal{O}_x$ with $U \times Y \subseteq B$ by the tube lemma.

It follows that the collection

\begin{displaymath}
\{U\; open\; in\; X: U \times Y \subseteq B \; for\; some\; B \in \mathcal{B}\}
\end{displaymath}
covers $X$, whence by compactness of $X$ there is a finite subcover $U_1, \ldots, U_n$ for which $U_i \times Y \subseteq B_i$ for some $B_i \in \mathcal{B}$, and then $B = B_1 \cup \ldots \cup B_n$ belongs to $\mathcal{B}$ and is all of $X \times Y$.

\end{proof}
\hypertarget{exponentiability_of_the_compactopen_topology}{}\subsubsection*{{Exponentiability of the compact-open topology}}\label{exponentiability_of_the_compactopen_topology}

The tube lemma may be used to show that the [[mapping space]] from a [[locally compact topological space]] to any topology spaces equipped with the [[compact-open topology]] is an [[exponential object]] in the [[category]] [[Top]] of topological spaces. See \href{compact-open+topology#Exponentiability}{there}.

\hypertarget{converse_of_the_tube_lemma}{}\subsection*{{Converse of the tube lemma}}\label{converse_of_the_tube_lemma}

As explained \hyperlink{StatementAndProofs}{above}, the three statements

\begin{enumerate}%
\item Tube lemma, Lemma \ref{tube}


\item $\forall_p: P(X \times Y) \to P(X)$ preserves openness if $X$ is compact


\item $\exists_p: P(X \times Y) \to P(X)$ preserves closedness if $X$ is compact (prop. \ref{ProjectingOutCompactSpaceIsClosedMap})



\end{enumerate}
are virtually tautologically equivalent, and in this sense any one of these forms may be referred to as the tube lemma. In this section, we indicate that the converse of the tube lemma holds, stated as follows.

\begin{theorem}
\label{converse}\hypertarget{converse}{}
\textbf{([[closed-projection characterization of compactness]])} If for all spaces $X$ the projection $p: X \times Y \to X$ is closed (form 3), then $Y$ is compact.

\end{theorem}
Various proofs may be given. If one likes the characterization of compactness that says every [[ultrafilter]] converges, then a neat conceptual proof runs as follows: given a space $Y$ satisfying the hypothesis, take $X$ to be the [[Stone-Cech compactification]] $\beta Y$ of the discrete space $Y_d$ on the underlying set of $Y$, and let $C \subseteq \beta Y \times Y$ be the convergence relation (i.e., $(U, y)$ belongs to $C$ iff the ultrafilter $U$ converges to $y$). One checks that $C$ is closed. Then the direct image $p(C)$ is closed by hypothesis. Notice also that $p(C)$ contains the set of principal ultrafilters $prin(y)$ ($prin(y)$ converges to $y$ after all), and this set may be identified with the dense set $Y_d \subset \beta Y$. Being closed and dense, $p(C)$ is all of $\beta Y$, but this simply says that every ultrafilter on $Y$ converges, so that $Y$ is compact.

The characterization of compactness via ultrafilter convergence has a slight drawback of relying on the [[ultrafilter theorem]], a kind of choice principle. If one doesn't like this, there are various workarounds that avoid it, but let it be said that all proofs (some of which are collected \hyperlink{Trim}{here}) have basically the same intuitive character. Given $Y$, one forms a space $X$ by adjoining one or more ideal points to the discrete space $Y_d$, where the open sets around an ideal point correspond to elements of some filter $F$ that we want to show clusters around, or converges to, some point $y$ (in order to show compactness of $Y$). Just as for the convergence relation in the proof sketched above, one passes to the closure $C$ of the diagonal $Y \to Y_d \times Y \hookrightarrow X \times Y$. The image $p(C)$ is closed and contains the dense subset $Y_d$, and so contains any ideal point $p$, and thus $(p, y) \in C$ for some $y$. This turns out to mean $F$ converges or clusters to $y$, as desired.

Here is a more precise enactment of one such proof.

\begin{proof}
Let $Y$ satisfy the hypothesis of Theorem \ref{converse}; to prove $Y$ is compact, suppose $\mathcal{C}$ is some collection of closed sets such that every finite intersection of elements of $\mathcal{C}$ is [[inhabited set|inhabited]]. Let $X = Y_d \sqcup \{\infty\}$, formed by adjoining an ideal point $\infty$ to the discrete space $Y_d$ on the underlying set of $Y$, and stipulating that whenever $K \in \mathcal{C}$, the set $K \sqcup \{\infty\}$ is an open neighborhood of $\infty$. The topology thus generated consists of arbitrary subsets $U \subseteq Y$ together with sets $F \sqcup \{\infty\}$ where $F$ belongs to the filter generated by $\mathcal{C}$. Note that the finite intersection property of $\mathcal{C}$ guarantees that the filter is \emph{proper}, meaning in particular $\infty$ is not an open point, equivalently that the closure of $Y_d$ in $X$ is all of $X$.

We have a diagonal embedding $Y \stackrel{\Delta}{\to} Y_d \times Y \hookrightarrow X \times Y$; let $C$ be the closure of $Y$ in $X \times Y$. Of course $p(C) \subseteq X$ contains $Y_d$, and is closed by hypothesis, so as we just observed, $p(C) = X$. So $\infty \in p(C)$; this means that $(\infty, y) \in C$ for some $y \in Y$. By closure of $C$, for each $K \in \mathcal{C}$ the neighborhood $(K \sqcup \{\infty\}) \times U$ of $(\infty, y)$ meets $\Delta(Y) \subseteq X \times Y$. This just says every open $U \in \mathcal{O}_y$ intersects $K$; since $K$ is closed in $Y$, this means $y \in K$. Thus

\begin{displaymath}
y \in \bigcap_{K \in \mathcal{C}} K
\end{displaymath}
and the non-emptiness of this intersection proves that $Y$ is compact.

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

\begin{itemize}%
\item Wikipedia, \emph{\href{https://en.wikipedia.org/wiki/Tube_lemma}{Tube lemma}}


\item [[Todd Trimble]], \emph{Characterizations of compactness}, \href{https://ncatlab.org/toddtrimble/published/Characterizations+of+compactness}{nLab link}.



\end{itemize}


\end{document}