\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*{separation axioms in terms of lifting properties}

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

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

[[!include topology - contents]]

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

[[!include category theory - contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{background_and_notation}{Background and notation}\dotfill \pageref*{background_and_notation} \linebreak
\noindent\hyperlink{separation_conditions_in_terms_of_arrows}{Separation conditions in terms of arrows}\dotfill \pageref*{separation_conditions_in_terms_of_arrows} \linebreak
\noindent\hyperlink{separation_axioms_as_lifting_properties}{Separation axioms as lifting properties}\dotfill \pageref*{separation_axioms_as_lifting_properties} \linebreak
\noindent\hyperlink{merge_or_discard}{Merge or discard}\dotfill \pageref*{merge_or_discard} \linebreak
\noindent\hyperlink{normality}{$T_4$/Normality}\dotfill \pageref*{normality} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

In [[topology]], some of the [[separation axioms]] that may be considered on [[topological spaces]] may equivalently be refomrulated in terms of [[lifting properties]] (\hyperlink{MG}{Gavrilovich 14}).

\hypertarget{background_and_notation}{}\subsection*{{Background and notation}}\label{background_and_notation}

A [[topological space]] comes with a \emph{[[specialisation preorder]]} on its points: for points $x,y \in X$, $x \leq y$ iff $y \in cl x$ ($y$ is in the [[topological closure]] of $x$), or equivalently. The resulting [[preordered set]] may be regarded as a [[category]] whose [[objects]] are the points of ${X}$ and where there is a unique [[morphism]] $x{\searrow}y$ iff $y \in cl x$.

For a [[finite topological space]] $X$, the specialisation preorder or equivalently the corresponding category uniquely determines the space: a [[subset]] of ${X}$ is [[closed subset|closed]] iff it is [[downward closed subset|downward closed]], or equivalently, there are no morphisms going outside the subset.

The monotone maps (i.e. [[functors]]) are the [[continuous maps]] for this topology.

We denote a finite topological space by a list of the arrows (morphisms) in the corresponding category; `$\leftrightarrow$' denotes an [[isomorphism]] and `$=$' denotes the [[identity morphism]]. An arrow between two such lists denotes a [[continuous map]] (a functor) which sends each point to the correspondingly labelled point, but possibly turning some morphisms into identity morphisms, thus gluing some points.

With this notation, we may display continuous functions for instance between the [[discrete space]] on two points, the [[Sierpinski space]], the [[antidiscrete space]] and the [[point space]] as follows (where each point is understood to be mapped to the point of the same name in the next space):

\begin{displaymath}
\itexarray{
  \{a,b\}
     &\longrightarrow& 
  \{a{\searrow}b\}
     &\longrightarrow& 
  \{a\leftrightarrow b\}
    &\longrightarrow& 
  \{a=b\}
  \\
  \text{(discrete space)}
     &\longrightarrow& 
  \text{(Sierpinski space)}
    &\longrightarrow& 
  \text{(antidiscrete space)}
    &\longrightarrow& 
  \text{(single point)}
  }
\end{displaymath}
In $A \longrightarrow  B$, each object and each morphism in $A$ necessarily appears in \{B\} as well; we avoid listing the same object or morphism twice. Thus both

\begin{displaymath}
\{a\} \longrightarrow  \{a,b\}
  \phantom{AAA} \text{ and } \phantom{AAA} 
\{a\} \longrightarrow  \{b\}
\end{displaymath}
denote the same map from a single point to the discrete space with two points. Both

\begin{displaymath}
\{a{\swarrow}U{\searrow}x{\swarrow}V{\searrow}b\}\longrightarrow \{a{\swarrow}U=x=V{\searrow}b\}\text{ and }\{a{\swarrow}U{\searrow}x{\swarrow}V{\searrow}b\}\longrightarrow \{U=x=V\}
\end{displaymath}
denote the morphism gluing points $U,x,V$.

In $\{a{\searrow}b\}$, the point $a$ is open and point ${b}$ is closed.

\hypertarget{separation_conditions_in_terms_of_arrows}{}\subsection*{{Separation conditions in terms of arrows}}\label{separation_conditions_in_terms_of_arrows}

Fix two sets ([[subsets]]) $F$ and $G$ of $S$.

\begin{itemize}%
\item The sets $F$ and $G$ are \textbf{[[disjoint sets|disjoint]]} if their [[intersection]] is [[empty set|empty]]:

\begin{displaymath}
F \cap G = \empty 
  \,.
\end{displaymath}


\end{itemize}
In terms of arrows, the following map is well-defined: $S_{F,G}: S \longrightarrow  \{F\leftrightarrow G \leftrightarrow \bullet \}$ such that $S_{F,G}(x)=F$ for $x \in F$, $S_{F,G}(x)=G$ for $x \in G$, and $S_{F,G}(x)=\bullet$ for $x \notin F\cup G$.

\begin{itemize}%
\item They are \textbf{topologically disjoint} if there exists a [[neighbourhood]] of one set that is disjoint from the other set:

\begin{displaymath}
(\exists\; U \stackrel{\circ}\supseteq F,\; U \cap G = \empty) 
  \;\vee\; 
  (\exists\; V \stackrel{\circ}\supseteq G,\; F \cap V = \empty) 
  \,.
\end{displaymath}
In terms of arrows, $S_{F,G}: S \longrightarrow  \{F\leftrightarrow \bullet \leftrightarrow G \}$ factors either as

\begin{displaymath}
S_{F,G}: S \longrightarrow   \{F \leftrightarrow U  \searrow \bullet \leftrightarrow G\} \longrightarrow  \{F\leftrightarrow  U =\bullet \leftrightarrow G \}
\end{displaymath}
or

\begin{displaymath}
S_{F,G}
   \colon 
  S \longrightarrow  \{F \leftrightarrow \bullet \swarrow V  \leftrightarrow G \} 
    \longrightarrow
  \{F \leftrightarrow \bullet = V  \leftrightarrow G \}
\end{displaymath}
where $U$, $V$ maps to $\bullet$. Notice that topologically disjoint sets must be disjoint.


\item They are \textbf{separated} if each set has a neighbourhood that is disjoint from the other set:

\begin{displaymath}
(\exists\; U \stackrel{\circ}\supseteq F,\; U \cap G = \empty)    
     \;\wedge\; 
  (\exists\; V \stackrel{\circ}\supseteq G,\; F \cap V = \empty)
      \;\;\equiv\;\;
  \exists\; U \stackrel{\circ}\supseteq F,\; \exists\; V \stackrel{\circ}\supseteq G,\; U \cap G = \empty \;\wedge\; F \cap V = \empty 
  \,.
\end{displaymath}
In terms of arrows, $S_{F,G}: S \longrightarrow  \{F\leftrightarrow \bullet \leftrightarrow G \}$ factors both as

\begin{displaymath}
S_{F,G}
    \colon 
  S \longrightarrow  \{F \leftrightarrow U \searrow \bullet \leftrightarrow G\} \longrightarrow  \{F\leftrightarrow  U \stackrel{\circ}=\bullet \leftrightarrow G \}
\end{displaymath}
and as

\begin{displaymath}
S_{F,G}
    \colon 
  S \longrightarrow  \{F \leftrightarrow \bullet \swarrow V  \leftrightarrow G \} \longrightarrow \{F \leftrightarrow \bullet = V  \leftrightarrow G \}
\end{displaymath}
where $U$, $V$ maps to $\bullet$. Notice that separated sets must be topologically disjoint.


\item They are \textbf{separated by neighbourhoods} if they have disjoint neighbourhoods:

\begin{displaymath}
\exists\; U \stackrel{\circ}\supseteq F,\; \exists\; V \stackrel{\circ}\supseteq G,\; U \cap V = \empty .
\end{displaymath}
The arrow $S_{F,G}: S \longrightarrow  \{F\leftrightarrow \bullet \leftrightarrow G \}$ factors as $S \longrightarrow \{F \leftrightarrow  U  \searrow \bullet \swarrow  V \leftrightarrow G\}\longrightarrow \{F \leftrightarrow  U  = \bullet =  V \leftrightarrow G\}$ Notice that sets separated by neighbourhoods must be separated.


\item They are \textbf{separated by closed neighbourhoods} if they have disjoint closed neighbourhoods:

\begin{displaymath}
\exists\; U \stackrel{\circ}\supseteq F,\; \exists\; V \stackrel{\circ}\supseteq G,\; Cl(U) \cap Cl(V) = \empty .
\end{displaymath}
The arrow $S_{F,G}: S \longrightarrow  \{F\leftrightarrow \bullet \leftrightarrow G \}$ factors as

\begin{displaymath}
S \longrightarrow \{ F \leftrightarrow U \searrow U' \swarrow \bullet \searrow V' \searrow V \leftrightarrow G \}
\longrightarrow \{ F \leftrightarrow U = U' = \bullet = V' = V \leftrightarrow G \}
\end{displaymath}
Notice that sets separated by closed neighbourhoods must be separated by neighbourhoods.


\item They are \textbf{separated by a function} if there exists a continuous [[real number|real]]-valued [[function]] on the space that maps $F$ to $0$ and $G$ to $1$:

\begin{displaymath}
\exists\; f: S \to \mathbf{R},\; F \subseteq f^*(\{0\}) \;\wedge\; G \subseteq f^*(\{1\}) .
\end{displaymath}
The arrow $S_{F,G}: S \longrightarrow  \{F\leftrightarrow \bullet \leftrightarrow G \}$ factors as

\begin{displaymath}
S \longrightarrow   \{0'\} \cup [0,1] \cup \{1'\}  \longrightarrow  \{ 0'=F \leftrightarrow \bullet \leftrightarrow  1'=G\}
\end{displaymath}
where points $0',0$ and $1,1'$ are topologically indistinguishable, and $0'$ maps to $F$, and $1'$ maps to $G$, and $[0,1]$ maps to $\bullet$. Notice that sets separated by a function must be separated by closed neighbourhoods (the preimages of $[-\epsilon, \epsilon]$ and $[1-\epsilon, 1+\epsilon]$).


\item Finally, they are \textbf{precisely separated by a function} if there exists a continuous real-valued function on the space that maps precisely $F$ to $0$ and $G$ to $1$:

\begin{displaymath}
\exists\; f: S \to \mathbf{R},\; F = f^*(\{0\}) \;\wedge\; G = f^*(\{1\}) .
\end{displaymath}
The arrow $S_{F,G}: S \longrightarrow  \{F\leftrightarrow \bullet \leftrightarrow G \}$ factors as

\begin{displaymath}
S \longrightarrow   [0,1]  \longrightarrow  \{ 0=F \leftrightarrow \bullet\leftrightarrow  1=G\}
\end{displaymath}
where $0'$ maps to $F$, and $1'$ maps to $G$, and $(0,1)$ maps to $\bullet$. Notice that sets separated by a function must be separated by closed neighbourhoods (the preimages of $[-\epsilon, \epsilon]$ and $[1-\epsilon, 1+\epsilon]$). Notice that sets precisely separated by a function must be separated by a function.



\end{itemize}
Often $F$ and $G$ will be points (identified with their [[singleton]] subsets); in that case, one usually says \emph{distinct} in place of \emph{disjoint}.

Often $F$ or $G$ will be closed sets; notice that disjoint closed sets are automatically separated, while a closed set and a point, if disjoint, are automatically topologically disjoint.

\hypertarget{separation_axioms_as_lifting_properties}{}\subsection*{{Separation axioms as lifting properties}}\label{separation_axioms_as_lifting_properties}

In all of the following definitions, ${X}$ is a topological space.

\begin{itemize}%
\item ${X}$ is T0, or Kolmogorov, if any two distinct points in ${X}$ are topologically distinguishable. (It will be a common theme among the separation axioms to have one version of an axiom that requires T0 and one version that doesn't.) As a formula, this is expressed as

\begin{displaymath}
\{x\leftrightarrow y\} \longrightarrow  \{x=y\} \,\rightthreetimes\,  {X} \longrightarrow  \{*\}
\end{displaymath}

\item ${X}$ is R0, or symmetric, if any two topologically distinguishable points in $X$ are separated, i.e.

\begin{displaymath}
\{x{\searrow}y\} \longrightarrow  \{x\leftrightarrow y\} \,\rightthreetimes\,  {X} \longrightarrow  \{*\}
\end{displaymath}

\item $X$ is T1, or accessible or Frechet, if any two distinct points in $X$ are separated, i.e.

\begin{displaymath}
\{x{\searrow}y\} \longrightarrow  \{x=y\} \,\rightthreetimes\,  {X} \longrightarrow  \{*\}
\end{displaymath}
Thus, $X$ is T1 if and only if it is both T0 and R0. (Although you may say such things as ``T1 space'', ``Frechet topology'', and ``Suppose that the topological space $X$ is Frechet'', avoid saying ``Frechet space'' in this context, since there is another entirely different notion of Frechet space in functional analysis.)


\item $X$ is R1, or preregular, if any two topologically distinguishable points in X are separated by neighbourhoods. Every R1 space is also R0.


\item $X$ is weak Hausdorff, if the image of every continuous map from a compact Hausdorff space into $X$ is closed. All weak Hausdorff spaces are T1, and all Hausdorff spaces are weak Hausdorff.


\item $X$ is Hausdorff, or T2 or separated, if any two distinct points in $X$ are separated by neighbourhoods, i.e.

\begin{displaymath}
\{x,y\} \hookrightarrow  {X} \,\rightthreetimes\,  \{x{\searrow}X{\swarrow}y\} \longrightarrow  \{x=X=y\}
\end{displaymath}
Thus, $X$ is Hausdorff if and only if it is both T0 and R1. Every Hausdorff space is also T1.


\item $X$ is $T2\frac{1}{2}$, or Urysohn, if any two distinct points in $X$ are separated by closed neighbourhoods, i.e.

\begin{displaymath}
\{x,y\} \hookrightarrow  {X} \,\rightthreetimes\,  \{x{\searrow}x'{\swarrow}X{\searrow}y'{\swarrow}y\} \longrightarrow  \{x=x'=X=y'=y\}
\end{displaymath}
Every $T2\frac{1}{2}$ space is also Hausdorff.


\item $X$ is completely Hausdorff, or completely T2, if any two distinct points in X are separated by a continuous function, i.e.

\begin{displaymath}
\{x,y\} \hookrightarrow  {X} \,\rightthreetimes\,   [0,1]\longrightarrow \{*\}
\end{displaymath}
where $\{x,y\} \hookrightarrow  X$ runs through all injective maps from the discrete two point space $\{x,y\}$.



\end{itemize}
Every completely Hausdorff space is also $T2\frac{1}{2}$.

\begin{itemize}%
\item $X$ is regular if, given any point ${x}$ and closed subset $F$ in $X$ such that ${x}$ does not belong to $F$, they are separated by neighbourhoods, i.e.

\begin{displaymath}
\{x\} \longrightarrow  {X} \,\rightthreetimes\,  \{x{\searrow}X{\swarrow}U{\searrow}F\} \longrightarrow  \{x=X=U{\searrow}F\}
\end{displaymath}
(In fact, in a regular space, any such ${x}$ and ${F}$ will also be separated by closed neighbourhoods.) Every regular space is also R1.


\item $X$ is regular Hausdorff, or T3, if it is both T0 and regular.1 Every regular Hausdorff space is also $T2\frac{1}{2}$.


\item $X$ is completely regular if, given any point ${x}$ and closed set $F$ in $X$ such that ${x}$ does not belong to $F$, they are separated by a continuous function, i.e.

\begin{displaymath}
\{x\} \longrightarrow  {X} \,\rightthreetimes\,  [0,1] \cup \{F\} \longrightarrow  \{x{\searrow}F\}
\end{displaymath}
where points $F$ and $1$ are topologically indistinguishable, $[0,1]$ goes to $x$, and $F$ goes to $F$.



\end{itemize}
Every completely regular space is also regular.

\begin{itemize}%
\item $X$ is Tychonoff, or T3$\frac{1}{2}$, completely T3, or completely regular Hausdorff, if it is both T0 and completely regular.2 Every Tychonoff space is both regular Hausdorff and completely Hausdorff.


\item $X$ is normal if any two disjoint closed subsets of $X$ are separated by neighbourhoods, i.e.

\begin{displaymath}
\emptyset \longrightarrow {X} \,\rightthreetimes\,  \{x{\swarrow}x'{\searrow}X{\swarrow}y'{\searrow}y\} \longrightarrow  \{x{\swarrow}x'=X=y'{\searrow}y\}
\end{displaymath}
In fact, by Urysohn lemma a space is normal if and only if any two disjoint closed sets can be separated by a continuous function, i.e.

\begin{displaymath}
\emptyset \longrightarrow  {X} \,\rightthreetimes\,  \{0'\} \cup [0,1] \cup \{1'\} \longrightarrow  \{0=0'{\searrow}x{\swarrow}1=1'\}
\end{displaymath}
where points $0',0$ and $1,1'$ are topologically indistinguishable, $[0,1]$ goes to $x$, and both $0,0'$ map to point $0=0'$, and both $1,1'$ map to point $1=1'$.


\item $X$ is normal Hausdorff, or T4, if it is both T1 and normal. Every normal Hausdorff space is both Tychonoff and normal regular.


\item $X$ is completely normal if any two separated sets $A$ and $B$ are separated by neighbourhoods $U\supset A$ and $V\supset B$ such that $U$ and $V$ do not intersect, i.e.

\begin{displaymath}
\emptyset \longrightarrow  {X} \,\rightthreetimes\,  \{X{\swarrow}A\leftrightarrow U{\searrow}U'{\swarrow}W{\searrow}V'{\swarrow}V\leftrightarrow B{\searrow}X\} \longrightarrow  \{U=U',V'=V\}
\end{displaymath}
Every completely normal space is also normal.


\item $X$ is perfectly normal if any two disjoint closed sets are precisely separated by a continuous function, i.e.

\begin{displaymath}
\emptyset\longrightarrow {X} \,\rightthreetimes\,  [0,1]\longrightarrow \{0{\swarrow}X{\searrow}1\}
\end{displaymath}
where $(0,1)$ goes to the open point $X$, and $0$ goes to $0$, and $1$ goes to $1$.



\end{itemize}
Every perfectly normal space is also completely normal.

\hypertarget{remark}{}\paragraph*{{Remark.}}\label{remark}

Note that a standard proof of Uryhson lemma may be represented as follows: iterate the lifting property to prove

\begin{displaymath}
\emptyset \longrightarrow X\rightthreetimes \{x \swarrow x_1 \searrow ... \swarrow x_n \searrow y \} \longrightarrow  \{x \swarrow x_1 = ... = x_n \searrow y \}
\end{displaymath}
Then pass to the infinite limit to construct a map $X \longrightarrow  \mathbb{R}$.

\hypertarget{merge_or_discard}{}\subsection*{{Merge or discard}}\label{merge_or_discard}

\hypertarget{normality}{}\subsubsection*{{$T_4$/Normality}}\label{normality}

The [[Tietze extension theorem]] applies to [[normal spaces]].

Accordingly, a (Hausdorff) space $X$ is normal if and only if every function $f \colon A \to \mathbb{R}$ from a [[closed subspace]] $A \subset X$ admits an [[extension]] $\tilde{f}: X \to \mathbb{R}$,

\begin{displaymath}
\itexarray{
    A &\overset{f}{\longrightarrow}& \mathbb{R}
    \\
    \downarrow & \nearrow_{\mathrlap{\tilde f}}
    \\
    X
  }
\end{displaymath}
or what is the same, every [[regular monomorphism]] into $X$ in $Haus$ has the [[left lifting property]] with respect to the map $\mathbb{R} \to 1$.

\hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts}

\begin{itemize}%
\item \href{Tychonoff+theorem#ProofViaTaimanovTheoremAndLiftingProperties}{Tychonoff theorem -- Proof via lifting properties}

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

\begin{itemize}%
\item [[Misha Gavrilovich]], \emph{The unreasonable power of the lifting property in elementary mathematics} (\href{http://mishap.sdf.org/by:gavrilovich/expressive_power_of_the_lifting_property.pdf}{pdf})


\item [[Misha Gavrilovich]], \emph{Point set topology as diagram chasing computations} (\href{https://arxiv.org/abs/1408.6710}{arXiv:1408.6710}, \href{http://mishap.sdf.org/mints-lifting-property-as-negation-DMG_5_no_4_2014.pdf}{pdf})



\end{itemize}


\end{document}