\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*{uniform convergence space}

\hypertarget{uniform_convergence_spaces}{}\section*{{Uniform convergence spaces}}\label{uniform_convergence_spaces}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{motivation}{Motivation}\dotfill \pageref*{motivation} \linebreak
\noindent\hyperlink{definitions}{Definitions}\dotfill \pageref*{definitions} \linebreak
\noindent\hyperlink{terminology_warning}{Terminology warning}\dotfill \pageref*{terminology_warning} \linebreak
\noindent\hyperlink{subsidiary_concepts}{Subsidiary concepts}\dotfill \pageref*{subsidiary_concepts} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

Uniform convergence spaces are simultaneously a generalisation of [[uniform spaces]] and a specialisation with [[extra structure]] of [[convergence spaces]]. That is, we have [[functors]]

\begin{displaymath}
Unif \to Unif Conv \to Conv ,
\end{displaymath}
both [[faithful functor|faithful]] and with $Unif \to Unif Conv$ also [[full functor|full]]. (Here we take the [[morphisms]] of $Unif Conv$ and $Unif$ to be the [[uniformly continuous maps]], while $Conv$ must use the [[continuous maps]].)

\hypertarget{motivation}{}\subsection*{{Motivation}}\label{motivation}

The [[uniform property|uniform properties]] of a [[metric space]] $X$ are determined entirely by the [[equivalence relation]] between [[infinite sequences]] through which sequences $a$ and $b$ are related iff the distance between them tends to zero:

\begin{displaymath}
\lim_{n \to \infty} {\|a_n - b_n\|} = 0 .
\end{displaymath}
An analogous holds for a [[uniform space]] $X$ if one generalises from sequences to [[nets]]. However, the relevant equivalence relation is not (directly) between two arbitrary nets but rather between two nets with the same [[directed set]] as [[domain]]. (This is because the limit above refers to a single index $n$; if we changed this to the limit as $m, n \to \infty$ of ${\|a_m - b_n\|}$, then we would get a [[partial equivalence relation]] that applies only to [[Cauchy sequences]], and this would recover only the [[Cauchy structure]] and not the entire [[uniform structure]].)

Rather than speak of two nets with the same domain, let us speak equivalently of a single net in the [[cartesian square]] $X \times X$. Then for a more manifestly [[size issue|small]] definition, let us speak of a [[filter]] on $X \times X$. So a uniform convergence structure on a [[set]] $X$ will be a collection of filters on $X \times X$. We will require this collection to satisfy certain properties; if we imposed enough properties, we could recover a definition of uniform space (or even of [[metrisable]] [[uniform space]]), but some less stringent requirements yield the definition of uniform convergence space below.

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

Let $X$ be an [[abstract set]], and let $U$ be a collection of [[filters]] on the [[cartesian square]] $X \times X$, called the \textbf{asymptotic filters}. We will consider various properties of such a structure below.

A collection that satisfies all of (1--6) below is a \textbf{uniform convergence structure}. If it satisfies at least (2--6), then it is is a \textbf{[[base]]} for a uniform convergence structure; if it satisfies at least (4--6), then it is a \textbf{[[subbase]]} for a uniform convergence structure. That said, we could start with a perfectly arbitrary collection and generate a subbase, then a base, then an entire structure.

If we use (6$\prime$) instead of (6), then this is a \textbf{pointwise uniform convergence structure}. If we drop (4), then we have a \textbf{quasiuniform convergence structure}. These also can have bases and subbases and be generated from an arbitrary collection of asymptotic filters.

A (pointwise) (quasi)-\textbf{uniform convergence space} is a set $X$ equipped with such a structure.

Here are the relevant properties:

\begin{enumerate}%
\item \emph{Isotone}: If $F \subseteq G$ (as filters on $X \times X$) and $F$ is asymptotic, then $G$ is asymptotic.


\item \emph{Proper}: There is an asymptotic filter. If (1) also holds, then we may equivalently say that the [[improper filter]] on $X \times X$ is asymptotic. This is automatic if (6) holds but is independent of the other conditions; it \emph{almost} follows from (6$\prime$), but only if $X$ is [[inhabited set|inhabited]].


\item \emph{Filtered}: If $F$ and $G$ are asymptotic filters, then there is an asymptotic filter contained in both $F$ and $G$. If (1) also holds, then we may equivalently say that the [[intersection]] $F \cap G$ is asymptotic.


\item \emph{Symmetric}: If $F$ is an asymptotic filter, then there is an asymptotic filter $G$ with the property that, whenever $R \in G$, its [[inverse relation|inverse]] (as a [[binary relation]] on $X$) $R^{-1}$ belongs to $F$. If (1) also holds, then we may equivalently say that the filter $\{ R^{-1} \;|\; R \in F \}$ is asymptotic.


\item \emph{Transitive}: If $F$ and $G$ are asymptotic filters, then there is an asymptotic filter $H$ with the property that, whenever $R \in H$, there are a [[natural number]] $n$, an $n$-[[tuple]] $(S_1, \ldots, S_n) \in F^n$, and an $n$-tuple $(T_1, \ldots, T_n) \in G^n$ such that $R \supseteq (S_1 \circ T_1) \cap \cdots \cap (S_n \circ T_n)$ (where $\circ$ indicates [[composition]] of [[binary relations]] on $X$). If (1) also holds, then we may equivalently say that the filter generated by $\{ S \circ T \;|\; S \in F,\; T \in G \}$ is asymptotic.


\item \emph{Reflexive}: There is an asymptotic filter $F$ with the property that each $R \in F$ is [[reflexive relation|reflexive]] as a binary relation on $X$. If (1) also holds, then we may equivalently say that the collection of all reflexive relations (which is a filter) is asymptotic.



\end{enumerate}
Although (6) as given here is in the original definition and is the proper nullary analogue of the binary (5), a weaker version is now more popular:

\begin{itemize}%
\item (6$\prime$). \emph{Pointwise reflexive}: For every point $a$ of $X$, there is an asymptotic filter $F$ with the property that each $R \in F$ satisfies $(a,a) \in R$ (so that $R$ is reflexive at $a$). If (1) also holds, then we may equivalently say that the collection of all relations reflexive at $a$ (which is a filter, indeed the [[principal ultrafilter]] at $(a,a)$) is asymptotic.

\end{itemize}
One reason for this is apparently to render the [[category]] of uniform convergence spaces [[cartesian closed category|cartesian closed]]. So presumably there are uniform convergence spaces $X$ and $Y$ satisfying (6) such that the set of [[uniformly continuous maps]] from $X$ to $Y$ can be given only a pointwise uniform convergence structure.

For the purposes of [[constructive mathematics]], we can also consider another condition:

\begin{itemize}%
\item (7). \emph{Comparison}: If $F$ is an asymptotic filter, then there is an asymptotic filter $G$ with the property that, whenever $R \in G$, there is some $S \in F$ such that $\neg{R} \cup S = X \times X$. Assuming [[excluded middle]], we may take $G$ to be $F$ itself (and take $S$ to be $R$), rendering this condition trivial in [[classical mathematics]].

\end{itemize}
A (pointwise) (quasi)-uniform convergence structure/space that satisfies (7) may be called (quasi)-\textbf{uniformly regular space|uniformly regular} (although `(quasi)-uniformly [[locally decomposable space|locally decomposable]]' would be more proper, since there is no reason why such a space should be [[regular space|regular]], even in the symmetric case).

It is traditional to consider only \emph{[[proper filter|proper]]} asymptotic filters (or equivalently to consider only asymptotic [[nets]]), which allows one to leave out (2); but in that case (5) and (6) must be modified to apply only when the generated filters are proper: (5) applies only when each element of $F$ [[intersection|meets]] each element of $G$, and (6), if used, applies only when $X$ is [[inhabited set|inhabited]]. So really, it is simpler to include the improper filter among the asymptotic filters.

The conditions (1,2,3,4,5,6,7) correspond respectively to the conditions (6,4,5,2,3,1,0) at [[uniform space]] (as of 2013-02-22, in case the latter are ever renumbered). However, (6$\prime$) has no direct analogue.

\hypertarget{terminology_warning}{}\subsection*{{Terminology warning}}\label{terminology_warning}

Among the terms defined (in boldface) above, I ([[Toby Bartels]]) invented `asymptotic filter' and those involving `pointwise' and `quasi', because no appropriate terms appeared in the reference that I used. Possibly other terms appear in the literature (besides the fact that `pointwise' may simply be left out). That said, my use of `quasi' follows [[quasimetric]] and [[quasiuniform space]], so it at least is probably correct. On the other hand, `asymptotic' conflicts with the meaning of [[asymptotic function]] in [[complexity theory]] (which is weaker, and in fact says that functions are asymptotic when their [[logarithms]] are asymptotic in our sense), although it matches the meaning of [[asymptote]] in elementary [[analytic geometry]]. Finally, `pointwise' was `weak' in earlier versions of this page, until I changed it to have a more transparent meaning and avoid potential conflicts. (People say `weak uniform convergence' in various contexts, but nobody ever says `pointwise uniform convergence'.)

\hypertarget{subsidiary_concepts}{}\subsection*{{Subsidiary concepts}}\label{subsidiary_concepts}

Let $X$ and $Y$ be pointwise uniform convergence spaces. A [[function]] $f$ from $X$ to $Y$ is \textbf{[[uniformly continuous function|uniformly continuous]]} if $f \times f\colon X \to Y$ takes asymptotic filters only to asymptotic filters. Then $f$ is a \textbf{uniform homeomorphism} if $f$ is a [[bijection]] whose [[inverse function|inverse]] is also uniformly continuous. We take the uniformly continuous functions to be the [[morphisms]] of a [[category]] $Unif Conv$ whose [[objects]] are the uniform convergence spaces; then the uniform homeomorphisms are the [[isomorphisms]] of this category.

Now let $X$ and $Y$ be pointwise quasiuniform spaces. The definitions above may be repeated with `quasiuniform' instead of `uniform'. If we ever use `uniform' with pointwise quasiuniform convergence spaces, this means to use the pointwise uniform convergence structure generated by the given pointwise quasiuniform convergence structure. (The pointwise uniform convergence structure generated by a quasiuniform convergence structure will be a uniform convergence structure, so we may leave `pointwise' out of this paragraph entirely if so desired.)

Let $X$ be a pointwise uniform convergence space. A filter $F$ on $X$ is \textbf{[[Cauchy filter|Cauchy]]} if it is [[proper filter|proper]] and $F \times F$ (which is a filter on $X \times X$) is asymptotic. Then the Cauchy filters on $X$ form a Cauchy structure that makes $X$ into a [[Cauchy space]]. If $X$ is a pointwise quasiuniform convergence space, then we may use the same definition. In any case, the result depends only on the generated uniform convergence structure.

Let $X$ be a pointwise uniform convergence space. A filter $F$ on $X$ \textbf{[[convergence|converges]]} to a point $a$ in $X$ if $F \times U_a$, where $U_a$ is the principal ultrafilter at $a$ (the collection of all subsets of $X$ to which $a$ belongs), is asymptotic; we may use $U_a \times F$ instead and get the same result. Then this relation of convergence is a convergence structure that makes $X$ into a [[convergence space]], and this convergence space will be [[reciprocal space|reciprocal]] ($R_1$). If $X$ is a pointwise quasiuniform convergence space, then we may use the same definition, but the result may no longer be reciprocal, and using $U_a \times F$ instead will give a different convergence structure (and where $U_a$ converges to $b$ one way, $U_b$ converges to $a$ the other way). Nevertheless, the result depends only on the generated quasiuniform convergence structure.

The convergence space structure induced by the Cauchy structure induced by a pointwise uniform convergence space is the same as the convergence structure induced directly by the pointwise uniform convergence space. This fails for (pointwise) quasiuniform convergence spaces, but it remains true that every convergent filter is Cauchy. A pointwise qausiuniform convergence space is \textbf{[[complete space|complete]]} if, conversely, every Cauchy filter converges to at least one point. Also, the space is \textbf{[[Hausdorff space|Hausdorff]]} if every Cauchy filter (and hence every filter) converges to at \emph{most} one point. The complete Hausdorff uniform convergence spaces form a [[reflective subcategory]] of $Unif Conv$, so every uniform convergence space has a \textbf{[[Hausdorff completion]]}.

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

Let $X$ be a [[metric space]] and call an [[infinite sequence]] in $X \times X$ \emph{asymptotic} if, when viewed as a [[pairing|pair]] $(a,b)$ of infinite sequences in $X$, these sequences satisfy the relation given in the Motivation above:

\begin{displaymath}
\lim_{n \to \infty} {\|a_n - b_n\|} = 0 .
\end{displaymath}
The [[eventuality filters]] of the asymptotic sequences in $X \times X$ form a base for a uniform convergence structure. The same holds even if $X$ is only a [[pseudometric space]] or an [[extended metric space]]; but if $X$ is only a [[quasimetric space]], then we get only a base for a quasiuniform convergence structure.

Now let $X$ be a [[uniform space]] and let a filter be \emph{asymptotic} if every [[entourage]] belongs to it. Indeed, if $E$ is the collection of entourages, then $E$ is itself a filter on $X \times X$ and $\{E\}$ is already a base for this uniform convergence structure. If $X$ is the underlying uniform space of a metric space, then this is the same uniform convergence structure as in the previous paragraph. If $X$ is only a [[quasiuniform space]], then we get only a quasiuniform convergence structure.

Now let $X$ be a [[Cauchy space]] and let a filter $F$ on $X 
\times X$ be \emph{subbasic asymptotic} if $F = G \times G$ for some Cauchy filter $G$ on $X$. Then the subbasic asymptotic filters form a subbase for a uniform convergence structure, and the Cauchy structure induced by this uniform convergence structure agrees with the original Cauchy structure on $X$.

Now let $X$ be a [[convergence space]] and let a filter $F$ on $X \times X$ be \emph{subbasic asymptotic} if $F = G \times G$ for some convergent filter $G$ on $X$. Then the subbasic asymptotic filters form a subbase for a quasiuniform convergence structure, which is a (pointwise) uniform convergence structure iff $X$ is [[reciprocal space|reciprocal]] ($R_1$). In any case, the convergence structure induced by this quasiuniform convergence structure agrees with the original convergence structure on $X$.

If $X$ is a [[group object]] in the category $Conv$ of convergence spaces (that is, $X$ is both a convergence space and a [[group]] such the group operations are [[continuous function|continuous]]), then there are two other ways to make $X$ into a uniform convergence space (left and right, which agree if $X$ is an [[abelian group]]), analogous to the ways in which a [[topological group]] becomes a [[uniform space]]. Specifically, let a [[net]] in $X \times X$ be \emph{asymptotic} if, when viewed as a [[pairing|pair]] $(a,b)$ of nets (with common domain) in $X$, these sequences satisfy a relation analogous to that for asymptotic sequences in a metric space above:

\begin{displaymath}
\lim_{n \to \infty} a_n b_n^{-1} = 1
\end{displaymath}
(on one side) or

\begin{displaymath}
\lim_{n \to \infty} a_n^{-1} b_n = 1
\end{displaymath}
(on the other side). The [[eventuality filters]] of the asymptotic nets in $X \times X$ form a base for a uniform convergence structure; indeed, they are precisely the proper asymptotic filters. The convergence structure induced by this uniform convergence structure agrees with the original convergence structure on $X$ (which must be reciprocal, for essentially the same reason that the topology of a topological group must be). Probably one can get a quasiuniform convergence structure or four out of a [[monoid object]] in $Conv$, but I haven't thought that through.

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

Pages 72--76 (in Part I) in

\begin{itemize}%
\item Jan Harm van der Walt (2009); \emph{Generalized solutions of systems of nonlinear partial differential equations} (PhD thesis); \href{http://upetd.up.ac.za/thesis/available/etd-05242009-122628/}{web}.

\end{itemize}
(This dissertation is not really about uniform convergence spaces, but it has the advantage of being free online.)

[[!redirects uniform convergence space]] [[!redirects uniform convergence spaces]]

[[!redirects uniform convergence structure]] [[!redirects uniform convergence structures]]

[[!redirects pointwise uniform convergence space]] [[!redirects pointwise uniform convergence spaces]] [[!redirects weak uniform convergence space]] [[!redirects weak uniform convergence spaces]]

[[!redirects pointwise uniform convergence structure]] [[!redirects pointwise uniform convergence structures]] [[!redirects weak uniform convergence structure]] [[!redirects weak uniform convergence structures]]

[[!redirects quasiuniform convergence space]] [[!redirects quasiuniform convergence spaces]]

[[!redirects quasiuniform convergence structure]] [[!redirects quasiuniform convergence structures]]

[[!redirects pointwise quasiuniform convergence space]] [[!redirects pointwise quasiuniform convergence spaces]] [[!redirects weak quasiuniform convergence space]] [[!redirects weak quasiuniform convergence spaces]]

[[!redirects pointwise quasiuniform convergence structure]] [[!redirects pointwise quasiuniform convergence structures]] [[!redirects weak quasiuniform convergence structure]] [[!redirects weak quasiuniform convergence structures]]



\end{document}