\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{mathbbol}
\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*{uniform space}

[[!redirects uniform space draft]]

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

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

[[!include topology - contents]]

\hypertarget{uniform_spaces}{}\section*{{Uniform spaces}}\label{uniform_spaces}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{definitions}{Definitions}\dotfill \pageref*{definitions} \linebreak
\noindent\hyperlink{ent}{Entourage uniformities}\dotfill \pageref*{ent} \linebreak
\noindent\hyperlink{ucov}{Covering uniformities}\dotfill \pageref*{ucov} \linebreak
\noindent\hyperlink{further_definitions}{Further definitions}\dotfill \pageref*{further_definitions} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{basic_results}{Basic Results}\dotfill \pageref*{basic_results} \linebreak
\noindent\hyperlink{variations}{Variations}\dotfill \pageref*{variations} \linebreak
\noindent\hyperlink{motivation_for_the_axioms}{Motivation for the axioms}\dotfill \pageref*{motivation_for_the_axioms} \linebreak
\noindent\hyperlink{categorical_interpretation}{Categorical interpretation}\dotfill \pageref*{categorical_interpretation} \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}

Uniform spaces were invented by [[André Weil]], to capture a general notion of [[space]] for which it makes sense to speak of [[uniformly continuous map]]s. Such spaces include (pseudo)[[metric spaces]] and [[topological groups]].

A \emph{uniform structure} or \emph{uniformity} on a [[set]] $X$ consists of a collection of global binary [[relations]] $\varepsilon$ which allow us to say when one point $x$ is ``$\varepsilon$-close'' to another $y$. For a metric space, we have for instance relations expressed by the formula $d(x, y) \lt \varepsilon$, where $\varepsilon$ is a [[positive number]]. For a [[topological group]], we have relations $x y^{-1} \in \varepsilon$, where $\varepsilon$ is a [[neighborhood]] of the identity.

\hypertarget{definitions}{}\subsection*{{Definitions}}\label{definitions}

The definition described above is based on [[entourages]]; it was the original one published in [[Bourbaki]] and is still most commonly seen today. There is an equivalent definition based on [[uniform covers]], although it is more difficult to generalize in some ways (e.g. to [[quasiuniform spaces]]). The relationship with [[gauge spaces]] (defined below) also allows for another definition. The original definition in [[Bourbaki]] \hyperlink{naive_tame_topology}{can be seen} as describing a contravariant functor from the category of finite sets to a category of [[filters]] of subsets.

\hypertarget{ent}{}\subsubsection*{{Entourage uniformities}}\label{ent}

A \textbf{uniform structure}, or \textbf{uniformity}, on a set $X$ consists of a collection of [[binary relations]] $U \subseteq X \times X$ (called \textbf{entourages} or \textbf{vicinities}) satisfying some conditions. Write $x \approx_U y$ if $x$ is related to $y$ through $U$; then the conditions are the following:

\begin{enumerate}%
\item The [[equality relation]] $\Delta = \{(x, x): x \in X\}$ is contained in every entourage. That is,\begin{displaymath}
\forall U,\; \forall x,\; x \approx_U x .
\end{displaymath}

\item For every entourage $U$, there exists an entourage $V$ such that $V \circ V \subseteq U$, where $\circ$ is the ordinary operation of [[relation|relational composition]]. That is,\begin{displaymath}
\forall U,\; \exists V,\; \forall x, y, z,\; x \approx_V y \approx_V z \;\Rightarrow x \approx_U z .
\end{displaymath}

\item For every entourage $U$, there exists an entourage $V$ such that $V^op \subseteq U$, where $V^\op$ is the [[opposite relation]] to $V$. That is,\begin{displaymath}
\forall U,\; \exists V,\; \forall x, y,\; y \approx_V x \;\Rightarrow\; x \approx_U y .
\end{displaymath}
In light of axiom (6), it follows that $U^op$ itself is an entourage.


\item There exists an entourage; in light of axiom (6), it follows that the universal relation $X \times X$ is an entourage.
\item If $U, V$ are entourages, so is some subset of $U \cap V$. In light of axiom (6), it follows that $U \cap V$ is an entourage.
\item If $U$ is an entourage and $U \subseteq V \subseteq X \times X$, then $V$ is an entourage.

\end{enumerate}
A set equipped with a uniform structure is called a \textbf{uniform space}.

A collection of entourages satisfying (1--5) is a \textbf{[[base]]} for a uniformity; a base is precisely what generates a uniformity by taking the upward closure. A collection satisfying (1--3) is a \textbf{preuniformity}; slightly more generally, we can replace each $V$ in the statement of these axioms with a finite [[intersection]] $V_1 \cap \cdots \cap V_n$ of entourages to get the concept of a \textbf{[[subbase]]} for a uniformity. A subbase is precisely what generates a base by closing up under finite intersections and precisely what generates a uniformity by closing up under finite intersections and taking the upward closure.

\hypertarget{ucov}{}\subsubsection*{{Covering uniformities}}\label{ucov}

An equivalent way to characterize a uniform space is by its collection of \emph{[[uniform covers]]}. Here a \textbf{cover} of a set $X$ is a collection $C \subseteq P(X)$ with [[union]] $X$. For covers $C_i$, we define:

\begin{itemize}%
\item $C_1$ \textbf{refines} $C_2$, written $C_1 \prec C_2$, if every element of $C_1$ is a subset of some element of $C_2$.


\item $C_1 \wedge C_2 \coloneqq \{ A \cap B \;|\; A \in C_1, B \in C_2 \}$; this is also a cover.


\item For $A \subseteq X$, $C[A] \coloneqq \bigcup \{ B \in C \mid A \cap B\text{ is [[inhabited set|inhabited]] }\}$.


\item $C^* \coloneqq \{ C[A] \;|\; A \in C\}$.



\end{itemize}
We now define a \textbf{covering uniformity} on $X$ to be a collection of covers, called \textbf{uniform covers}, such that

\begin{enumerate}%
\item If $C$ is a uniform cover, there exists a uniform cover $C'$ such that $(C')^* \prec C$.


\item There exists a uniform cover; in light of axiom (4), it follows that the cover $\{X\}$ is a uniform cover.


\item If $C_1, C_2$ are uniform covers, so is some cover that refines $C_1 \wedge C_2$. In light of axiom (4), it follows that $C_1 \wedge C_2$ is a uniform cover.


\item If $C$ is a uniform cover and $C \prec C'$, then $C'$ is a uniform cover.



\end{enumerate}
The axioms (2--4) here roughly correspond (respectively) to the axioms (4--6) in the entourage definition. Axiom (1) takes on all of the real work; any collection of covers that satisfies it may be called a \textbf{[[subbase]]} (but not corresponding directly to a subbase in the previous definition), and then anything satisfying (1--3) is a \textbf{[[base]]}.

If $X$ is a uniform space defined in terms of entourages, we give it a covering uniformity by declaring a cover to be uniform if it is refined by $\{ U[x] \;|\; x \in X\}$ for some entourage $U$, where $U[x] \coloneqq \{ y \;|\; x \approx_U y \}$. Note that this does not mean that a uniform cover ``consists of $U$-sized sets'' but only that it contains a subcover consisting of sets ``no smaller than $U$''.

Conversely, given a covering uniformity, we define a base of entourages to consist of sets of the form $\bigcup \{ A \times A \;|\; A \in C\}$ for $C$ a uniform cover. That is, for each cover $C$, we have a basic entourage $\approx_C$ such that $x \approx_C y$ iff $x, y \in A$ for some $A \in C$. This defines a bijection between entourage uniformities and covering uniformities.

\hypertarget{further_definitions}{}\subsubsection*{{Further definitions}}\label{further_definitions}

We give these in terms of entourages, but they could also be given directly in terms of uniform covers if desired.

The \textbf{uniform topology} induced by a uniformity is defined by taking the [[neighborhoods]] of a point $x$ to be sets of the form

\begin{displaymath}
U[x] \coloneqq \{ y \;|\; x \approx_U y \}
\end{displaymath}
where $U$ is an entourage. (Recall that a subset is [[open subset|open]] iff it is a neighborhood of every point that it contains.) We point out that different uniformities may give rise to the same topology (just as different metrics, even uniformly inequivalent ones, may give rise to the same topology).

In [[classical mathematics]], the uniform topology is always [[regular space|regular]] and indeed [[completely regular space|completely regular]]. In [[constructive mathematics]] this is not necessarily true, and to reproduce classical results it is often useful or necessary to assume that uniform spaces are regular, completely regular, or satisfy an intermediate condition called [[uniformly regular space|uniform regularity]].

Given uniform spaces $X$ and $Y$, a [[function]] $f\colon X \to Y$ is said to be \textbf{[[uniformly continuous map|uniformly continuous]]} if for every entourage $V$ of $Y$, $(f \times f)^{-1}(V)$ is an entourage of $X$. Clearly, uniformly continuous functions are [[continuous map|continuous]] with respect to the corresponding uniform topologies, but the converse is false (although see below the discussion in the case where $X$ is [[compact space|compact]]). There is an obvious [[concrete category]] $Unif$ of uniform spaces and uniformly continuous maps.

One feature of uniform space theory which is not available for general topological spaces is the possibility of taking (Cauchy) completions. The relevant definitions are straightforward:

\begin{itemize}%
\item A \textbf{[[Cauchy net]]} in a uniform space $X$ consists of a [[directed set]] $D$ and a function $f\colon D \to X$ such that for every entourage $U$, there exists $N \in D$ such that $f(m) \approx_U f(n)$ whenever $m, n \geq N$. (One can similarly define a \textbf{Cauchy filter}. This definition makes a uniform space into a [[Cauchy space]].)


\item A Cauchy net $f\colon D \to X$ \textbf{[[convergence|converges]]} to $x\colon X$ if for every entourage $U$, there exists $N \in D$ such that $n \geq N \;\Rightarrow\; x \approx_U f(n)$. (This makes sense for arbitrary [[nets]] or [[filters]], but it can be proved that any convergent net is Cauchy. This definition makes a uniform space into a [[convergence space]].)


\item A uniform space $X$ is \textbf{[[complete space|complete]]} if every Cauchy net/filter in $X$ converges (not necessarily to a unique point).


\item A uniform space $X$ is \textbf{[[Hausdorff space|Hausdorff]]} or \textbf{separated} if every convergent net/filter converges to a unique point, or equivalently if $x = y$ whenever $x \approx_U y$ for every entourage $U$. (This is a purely topological concept.)



\end{itemize}
Every uniform space $X$ admits a Hausdorff completion $\overline{X}$, i.e., there is a uniformly continuous map $X \to \overline{X}$ (an [[embedding]] if $X$ is Hausdorff, [[dense map|dense]] in any case), characterized by the following universal property:

\begin{itemize}%
\item Every uniformly continuous map $f\colon X \to Y$ to a complete Hausdorff uniform space $Y$ extends uniquely to a uniformly continuous map $\overline{f}\colon \overline{X} \to Y$.

\end{itemize}
In short, the category of complete Hausdorff uniform spaces is a [[reflective subcategory]] of $Unif$.

One can also define a (not necessarily Hausdorff) completion of $X$ by replacing the image of $X$ in $\overline{X}$ by $X$ itself, but this does not have as nice properties; in particular, complete uniform spaces do not form a reflective subcategory of $Unif$.

Every uniform space also has an underlying [[proximity]] (defined there), and the resulting functor $Unif \to Prox$ has a fully faithful right adjoint which identifies proximity spaces with uniform spaces that are [[totally bounded space|totally bounded]].

Uniform spaces can also be identified with [[syntopogenous spaces]] that are both \emph{perfect} and \emph{symmetric}; see [[syntopogenous space]].

Every uniform space $X$ has a [[inequality relation]] (an [[irreflexive]] [[symmetric relation]]) where ``$x # y$'' means that there exists an entourage $U$ such that $x \mathbin{&#8777;}_U y$. If $X$ is [[uniformly regular space|uniformly regular]], then this is an [[apartness relation]], i.e. it is also a [[comparison]]. This inequality is tight exactly when the uniform space is Hausdorff.

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

Every [[metric space]] (or more generally any pseudometric space) is a uniform space, with a base of uniformities indexed by positive numbers $\epsilon$. (You can even get a countable base, for example by using only those $\epsilon$ equal to $1/n$ for some integer $n$.) Define $x \approx_\epsilon y$ to mean that $d(x,y) \lt \epsilon$ (or $d(x,y) \leq \epsilon$ if you prefer). Then axiom (2) may be proved by using $\epsilon/2$; similarly, every metric space is [[uniformly regular space|uniformly regular]] in constructive mathematics, which may be proved by using any positive number less than $\epsilon$ and applying the [[comparison]] law. (The other axioms are easy.) Every quasi(pseudo)metric space is a quasiuniform space in the same way. We can also generalise from metric spaces to [[gauge spaces]]; see under Variations below.

Every [[topological group]] is a uniform space, with a base of uniformities indexed by neighbourhoods $U$ of the identity element, in two ways: left and right. (These two ways agree for [[abelian groups]], of course; they also agree for [[compact group]]s, by the general theorem below for uniformities on [[compact spaces]]. I wonder if that has anything to do with [[Haar measure]]?) In particular, any [[Banach space]] or [[Lie group]] is a uniform space. Define $x \approx _U y$ to mean that $x \in y U$ (or $y \in x U$ for the other way). Then axiom (2) may be proved by invoking the continuity of multiplication; constructively, we cannot prove that every topological group is uniformly regular, although this can be proved for the classical examples of Lie groups and [[topological vector spaces]] (TVSs).

These are in a way the motivating examples. The theory of uniformly continuous maps was developed first for metric spaces, but it was noticed that, for a [[metrisable]] TVS, it could be described entirely in terms of the topology and the addition, which immediately generalised to non-metrisable TVSs. The theory of uniform spaces covers both of these (and their generalisations to pseudometric spaces and topological groups) at once.

We can also form certain uniformities on function spaces. For instance, if $Y$ is a uniform space and $X$ is any set, then the set of functions $Y^X$ has a ``uniformity of [[uniform convergence]]''; this is generated by a base of entourages consisting of, for each entourage $U$ of $Y$, the generating entourage

\begin{displaymath}
\tilde{U} = \{ (f,g) \mid \forall x\in X, (f(x),g(x))\in U \}.
\end{displaymath}
This can be defined for any set $X$, but it is best-behaved when $X$ has some [[compact space|compactness]] properties. For instance, in [[constructive mathematics]], to prove uniform regularity of $X$ from uniform regularity of $Y$ we seem to need a condition such as that $X$ is a [[covert set]].

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

A first wave of results concerns [[separation axioms]]:

\begin{itemize}%
\item Considered as topological spaces, uniform spaces are [[regular space|regular]] and (more profoundly) [[completely regular space|completely regular]].

\end{itemize}
As a matter of fact, a significant theorem is that a topology (on a given set) is the uniform topology for some uniformity if and only if it is completely regular. See also the discussion below on the relation with metric and pseudometric spaces.

\begin{itemize}%
\item For a uniform space, the following separation conditions are equivalent: $T_0$ (the topology distinguishes points), $T_1$ (points are closed), $T_2$ ([[Hausdorff space|Hausdorff]]), $T_3$ (regular Hausdorff), $T_{3\frac1{2}}$ (completely regular Hausdorff). Of course, this follows from the fact that it is completely regular.


\item The category $Unif$ of uniform spaces admits arbitrary small [[products]] (which are preserved by the forgetful functors to [[Top]] and to [[Set]]). Hence it is not generally true that uniform spaces are [[normal space|normal]] (so that separated ones would be $T_4$), because for instance an uncountable power of the [[real line]] (with its usual topology) is not a normal space.



\end{itemize}
A second wave of results relates uniform spaces to [[pseudometric spaces]] (like metric spaces, but dropping the separation axiom that $d(x, y) = 0$ implies $x = y$):

\begin{itemize}%
\item Every uniform space embeds uniformly in a product of pseudometric spaces. A uniform space whose uniformity admits a countable subbase is uniformly isomorphic to a pseudometric space (and hence to a metric space if the uniform space is separated, in which case the uniform space is called \textbf{metrisable}).

\end{itemize}
By this result, the results mentioned above on completions of uniform spaces may be proved by appeal to similar results for (pseudo)metric spaces.

We also mention the special case of compact spaces:

\begin{itemize}%
\item A [[compact Hausdorff space]] $X$ admits a unique uniformity whose corresponding topology is the topology of $X$. The entourages of this uniformity are precisely the neighborhoods of the diagonal in $X \times X$.

\end{itemize}
It follows then that if $X, Y$ are uniform spaces with $X$ compact Hausdorff and if $f\colon X \to Y$ is continuous, then $f$ is uniformly continuous.

Finally, uniform spaces and uniformly continuous maps form a [[category]] $Unif$. This category admits a [[closed monoidal category|closed monoidal structure]] in which the function-space $[X,Y]$ is the set of uniformly continuous maps $X\to Y$ with the uniformity of [[uniform convergence]] (mentioned above). The corresponding tensor product is called the ``semi-uniform product'', and is \emph{not} [[symmetric monoidal category|symmetric]], because the evaluation map $X \to [[X,Y],Y]$ is not generally uniformly continuous. See \hyperlink{Isbell}{Isbell, Chapter III, particularly Theorem 26 p46}

On the other hand, $Unif$ also has a different closed \emph{symmetric} monoidal structure in which the internal-hom $\{X,Y\}$ is the space of uniformly continuous functions with the uniformity of \emph{pointwise} convergence, i.e. the subspace uniformity induced by the product uniformity on $Y^X$. See \hyperlink{Isbell}{Isbell, exercise III.7, p53}

\hypertarget{variations}{}\subsection*{{Variations}}\label{variations}

Some authors insist that a uniform space must be separated; this can be arranged directly in the definition (that is without reference to the uniform topology or to the concept of convergent net/filter) by adding the following axiom, a sort of converse axiom (1):

\begin{itemize}%
\item If $x \approx_U y$ for every entourage $U$, then $x = y$.

\end{itemize}
This makes the discussion of completions slightly simpler.

If the symmetry axiom (3) in the entourage definition is dropped, then the result is a \textbf{quasiuniform space}. Quasiuniform spaces are related to quasi(pseudo)metrics in the same way as uniform spaces are related to (psuedo)metrics. Perhaps surprisingly, \emph{every} topological space is quasiuniformisable. (It is rather triciker to define quasiuniform spaces in terms of covers, but technically possible using covers by pairs of sets; see \hyperlink{GS72}{Gantner and Steinlage}.)

A \textbf{[[gauge space]]} consists of a set $X$ and a collection $\mathcal{D}$ of pseudometrics on $X$; one usually requires $\mathcal{D}$ to be a [[filter]]. A gauge space defines a uniform space (necessarily uniformly regular) by taking one basic entourage for each pseudometric in $\mathcal{D}$ and each positive number $\epsilon$; conversely, every uniform space arises in this way, with the pseudometrics in the gauge being those that are uniformly continuous as maps on the product space. However, gauge spaces form a category with a stricter notion of morphism, in which the categories $Met$ (of [[metric spaces]] and short maps) and $Unif$ (of uniform spaces and uniformly continuous maps) are both [[full subcategories]]. A \textbf{quasigauge space} consists of a set and a collection of quasipseudometrics; every quasiuniform space arises from a quasigauge space.

In weak [[foundations]] of mathematics, the theorems above may not be provable. In particular, the theorem that every uniform space arises from a gauge space is equivalent (internal to an arbitrary [[topos]] with a [[natural numbers object]]) to [[dependent choice]] (plus [[excluded middle]] if you don't require the uniform space to be uniformly regular). If the concept is to be applied to analysis, then it may be best to define a uniform space as a gauge space satisfying a saturation condition.

There is also a ``pointless'' notion of uniform space, called a [[uniform locale]].

\hypertarget{motivation_for_the_axioms}{}\subsection*{{Motivation for the axioms}}\label{motivation_for_the_axioms}

The really critical axioms are (1--3): a collection of binary relations which satisfies those three axioms is a subbase (although not every subbase takes this form), from we can generate a uniform structure straightforwardly. Indeed, (4--6) simply state that the entourages form a [[filter]], so generating a uniformity from a base or subbase is simply the usual generation of a filter from a base or subbase.

We draw particular attention to axiom (2), which may be called an ``$\frac{\varepsilon}{2}$'' principle. It generalizes a principle familiar from analysis in metric spaces, where one establishes $d(x, z) \lt \varepsilon$ by showing there exists $y$ such that $d(x, y) \lt \frac{\varepsilon}{2}$ and $d(y, z) \lt \frac{\varepsilon}{2}$, and applying the triangle inequality. The utility of this principle for metric spaces, extrapolated in this way, gives uniform spaces much of their power.

For full power in [[constructive mathematics]], we also need [[uniformly regular space|uniform regularity]], which may similarly be called a ``something less than $\varepsilon$'' principle. (That is, for any $\varepsilon$ there is an $\varepsilon'$ such that any two points are either $\varepsilon$-close or $\varepsilon'$-far; classically we may take $\varepsilon'$ to be $\varepsilon$, but constructively it's better to think of $\varepsilon' \lt \varepsilon$.) This can actually be combined with axiom (2) into a single statement, as you might expect since $\frac{\varepsilon}{2} \lt \varepsilon$, but that makes the intuition less clear.

Axiom (1) is a nullary version of axiom (2); together they prove that, given any entourage $U$ and any integer $n \geq 0$, there exists an entourage $V$ whose $n$-fold composite is contained in $U$. The symmetry axiom (3) then allows one to take the opposite of $V$ at any point in the composite as well.

Altogether, these may be seen as axiomatising the notion of \emph{approximate} [[equivalence relation|equivalence]]. If $\approx$ is an approximate equivalence relation, then we might expect it to be

\begin{itemize}%
\item [[reflexive relation|reflexive]]: $x \approx x$ and
\item [[symmetric relation|symmetric]]: $x \approx y$ iff $y \approx x$, but
\item NOT [[transitive relation|transitive]]: $x \approx y \approx z$ does not necessarily mean that $x \approx z$.

\end{itemize}
One could stop there, but this is not a very useful notion of approximation. Instead we generalise to a \emph{family} of approximate equivalence relations and impose the $\frac{\varepsilon}{2}$ principle to allow them to be used. This is nearly the definition of uniform space; in particular, the axiom (1) states precisely that each entourage is reflexive. The symmetry axiom (3) in the standard definition is weaker than requiring each individual entourage to be symmetric, but that is not an essential change; every uniformity has a base consisting of its symmetric entourages. The final three axioms have already been explained as a closure condition; they force equivalent uniformities on a given set (in the sense that the [[identity function]] on the set is uniformly continuous either way) to be equal.

\hypertarget{categorical_interpretation}{}\subsection*{{Categorical interpretation}}\label{categorical_interpretation}

The idea that a uniformity is an ``approximate equivalence relation'' can be made precise as follows. A [[preorder]] is the same as a category [[enriched category|enriched]] over the poset $\mathbb{2}$ of [[truth values]], and it is an equivalence relation if and only if this category is symmetric. In fancier language, a preorder is a [[monoid]] (or [[monad]]) in the [[bicategory]] $Rel = \mathbb{2} Mat$. A quasi-uniform space can then be identified with a monoid in the bicategory $Pro Rel$, whose hom-categories are the categories of [[pro-objects]] in the hom-categories of $Rel$, aka [[filters]]. Of course, it is a uniform space just when it is also symmetric. See also [[prometric space]].

In all these cases, in order to recover the correct notion of morphism abstractly, we must consider monoids in a [[double category]] or [[equipment]] rather than merely a bicategory.

With a uniform structure on a set $X$ associate a contravariant functor from the category of finite sets to a category of filters of subsets as follows. Call a subset $P$ of $X^S$ \emph{big} iff there is an entourage $U$ such that $x\in X
^S$ provided $(x(s'),x(s''))\in U$ for each $s',s''\in S$. For a metric space, this is the filter of $\epsilon$-neighbourhoods of the diagonal. This defines a contravariant functor $F_X$ from the category of finite sets to the category of filters of subsets. Axiom 1 says that there is a unique big subset in $F_X(\{\bullet\})$. Axiom 2 says that the filter on $F_X(\{1,2,3\})$ is the pullback of the obvious maps $F_X(\{1,2,3\})\rightarrow F_X(\{1,2\})\rightarrow F_X(\{2\})\leftarrow F_X(\{2,3\})\leftarrow F_X(\{1,2,3\})$. To give a uniformly continuous map (morphism) $f:X\rightarrow Y$ of uniform structures is the same as to give a natural transformation $F_X \Rightarrow F_Y$. Indeed, such a natural transformation is determined by the function $f_{\{\bullet\}}:F_X(\{\bullet\})\rightarrow F_Y(\{\bullet\})$, and continuity of $F_X(\{1,2\})\rightarrow F_Y(\{1,2\})$ mean uniform continuity.

With a filter $F$ on $X$ associate the functor $E_F$ as follows: $E_F(S)$ is $F^S$. A filter $F$ on $X$ is Cauchy iff the obvious map $E_F\rightarrow F_X$ is well-defined.

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

\begin{itemize}%
\item [[uniform locale]]


\item [[equicontinuous family of functions]]


\item [[complete uniform space]] and uniform completion


\item [[uniform convergence]]


\item [[uniformly continuous map]]



\end{itemize}
[[!include generalized uniform structures - table]]

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

\begin{itemize}%
\item A. Weil, \emph{Sur les espaces \`a{} structure uniforme et sur la topologie g\'e{}n\'e{}rale}, Actualit\'e{}s Sci. Ind. 551, Paris, (1937).


\item John Kelley, \emph{General Topology}, GTM 27, 1955.


\item Eric Schechter, \emph{[[Handbook of Analysis and its Foundations]]}.


\item Warren Page, \emph{Topological Uniform Structures}, Dover


\item I.M. James, \emph{Topologies and Uniformities}, Springer


\item Norman Howes, \emph{Modern analysis and topology}, Springer


\item P. Samuel, \emph{Ultrafilters and compactifications of uniform spaces}, Trans. Amer. Math. Soc. \textbf{64} (1948) 100--132


\item J. R. Isbell, \emph{Uniform spaces}, Math. Surveys \textbf{12}, Amer. Math. Soc. 1964


\item T. E. Gantner and R. C. Steinlage, \emph{Characterizations of quasi-uniformities}, J. London Math Soc (2) 5 (1972) (defines quasi-uniformities using covers)



\end{itemize}
\begin{itemize}%
\item M. Gavrilovich, \href{http://mishap.sdf.org/by:gavrilovich/mintsGE.pdf#3.1.6}{\emph{A naive diagram-chasing approach to formalisation of tame topology}}, arXiv:\href{https://arxiv.org/abs/1807.06986}{1807.06986}, Sections 3.1.2, 3.1.6.

\end{itemize}
category: topology

[[!redirects uniform space]] [[!redirects uniform spaces]] [[!redirects uniform structure]] [[!redirects uniform structures]] [[!redirects uniformity]] [[!redirects uniformities]]

[[!redirects quasiuniform space]] [[!redirects quasiuniform spaces]] [[!redirects quasi-uniform space]] [[!redirects quasi-uniform spaces]] [[!redirects quasiuniform structure]] [[!redirects quasiuniform structures]] [[!redirects quasi-uniform structure]] [[!redirects quasi-uniform structures]] [[!redirects quasiuniformity]] [[!redirects quasiuniformities]] [[!redirects quasi-uniformity]] [[!redirects quasi-uniformities]]

[[!redirects uniformity space]] [[!redirects uniformity spaces]]



\end{document}