| Main Article
| Discussion
| Related Articles  [?]
| Bibliography  [?]
| External Links  [?]
| Citable Version  [?]

|
|
|
|
|
|
|
|

This editable Main Article is under development and subject to a disclaimer.

[edit intro]

In mathematics, and more specifically in topology, the notions of a uniform structure and a uniform space generalize the notions of a metric (distance function) and a metric space respectively. As a human activity, the theory of uniform spaces is a chapter of general topology. From the formal point of view, the notion of a uniform space is a sibling of the notion of a topological space. While uniform spaces are significant for mathematical analysis, the notion seems less fundamental than that of a topological space. The notion of uniformity is auxiliary rather than an object to be studied for its own sake (specialists on uniform spaces may disagree though).

For two points of a metric space, their distance is given, and it is a measure of how close each of the given two points is to another. The notion of uniformity catches the idea of two points being near one another in a more general way, without assigning a numerical value to their distance. Instead, given a subset  W ⊆ X × X {\displaystyle W\subseteq X\times X\ } , we may say that two points x , y ∈ X {\displaystyle x,y\in X\ } are W-near one to another, when  ( x , y ) ∈ W {\displaystyle \ (x,y)\in W} ; certain such sets  W ⊆ X × X {\displaystyle W\subseteq X\times X\ } are called entourages (see below), and then the mathematician Roman Sikorski would write suggestively:

d ( x , y ) < W {\displaystyle d(x,y)<W\ }

meaning that this whole mathematical phrase stands for:  W {\displaystyle W\ } is an entourage, and ( x , y ) ∈ W {\displaystyle \ (x,y)\in W} .  Thus we see that in the general case of uniform spaces, the distance between two points is (not measured but) estimated by the entourages to which the ordered pair of the given two points belongs.

## Contents

* 1 Historical remarks
* 2 Topological prerequisites
* 3 Definition
* 3.1 Auxiliary set-theoretical notation, notions and properties
* 3.2 Uniform space (definition)
* 3.3 Two extreme examples
* 4 Uniform base
* 4.1 The symmetric base
* 4.2 Example
* 4.3 Metric spaces
* 5 The induced topology
* 6 Separation properties
* 7 Uniform continuity and uniform homeomorphisms
* 8 Constructions and operations
* 8.1 Partial order of uniformities
* 8.2 The least upper bound
* 8.3 Preimage
* 8.4 Uniform subspace
* 8.5 Uniform (Cartesian) product
* 9 The category of the uniform spaces
* 10 Pointers
* 10.1 Neighbors
* 10.2 Clusters
* 10.3 Pointers
* 10.4 Equivalence of pointers, maximal and minimal pointers
* 10.5 Convergent pointers
* 11 Complete uniform spaces and completions

## Historical remarks[edit]

The uniform ideas, in the context of finite dimensional real linear spaces (Euclidean spaces), appeared already in the work of the pioneers of the precision in mathematical analysis (A.-L. Cauchy, E. Heine). Next, George Cantor constructed the real line by metrically completing the field of rational numbers, while Frechet introduced metric spaces. Then Felix Hausdorff extended the Cantor's completion construction onto arbitrary metric spaces. General uniform spaces were introduced by Andre Weil in a 1937 publication.

The uniform ideas may be expressed equivalently in terms of coverings. The basic idea of an abstract triangle inequality in terms of coverings has appeared already in the proof of the metrization Aleksandrov-Urysohn theorem (1923).

A different but equivalent approach was introduced by V.A. Efremovich, and developed by Y.M.Smirnov. Efremovich axiomatized the notion of two sets approaching one another (infinitely closely, possibly overlapping). In terms of entourages, two sets approach one another if for every entourage  W {\displaystyle W\ } there is an ordered pair of points  ( x , y ) ∈ W {\displaystyle \ (x,y)\in W} , one from each of the given two sets, i.e. for which the Sikorski's inequality holds:

d ( x , y ) < W {\displaystyle d(x,y)<W\ }

According to P.S.Aleksandrov, this kind of approach to uniformity, in the language of nearness, goes back to Riesz (perhaps F.Riesz).

## Topological prerequisites[edit]

This article assumes that the reader is familiar with certain elementary, basic notions of topology, namely:

* topology (as a family of open sets), topological space;
* neighborhoods (of points and sets), bases of neighborhoods;
* separation axioms:
* T 0 {\displaystyle T_{0}\ } (Kolmogorov axiom);
* T 1 {\displaystyle T_{1}\ }
* T 2 {\displaystyle T_{2}\ } (Hausdorff axiom);
* regularity axiom and T 3 {\displaystyle T_{3}\ }
* complete regularity (Tichonov axiom) and T 3 1 2 {\displaystyle \ T_{3{\frac {1}{2}}}} ;
* normal spaces and T 4 {\displaystyle T_{4}\ } ;
* continuous functions (maps, mappings);
* compact spaces (and compact Hausdorff spaces, i.e. compact  T 2 {\displaystyle \ T_{2}} -spaces);
* metrics and pseudo-metrics, metric and pseudo-metric spaces, topology induced by a metric or pseudo-metric.

## Definition[edit]

### Auxiliary set-theoretical notation, notions and properties[edit]

Given a set  X {\displaystyle \ X} , and  V , W ⊆ X × X {\displaystyle V,W\subseteq X\times X} , let's use the notation:

Δ X := { ( x , x ) : x ∈ X } {\displaystyle \Delta _{X}\ :=\ \\{(x,x):x\in X\\}}

and

V − 1 := { ( y , x ) : ( x , y ) ∈ V } {\displaystyle V^{-1}\ :=\ \\{(y,x):(x,y)\in V\\}}

and

W ∘ V := { ( x , z ) : ∃ y ∈ X ( ( x , y ) ∈ V , ( y , z ) ∈ W ) } {\displaystyle W\circ \,V:=\\{(x,z):\exists _{y\in X}\ \left((x,y)\in V,\ \ (y,z)\in W\right)\\}}

Theorem

* ( ( V ⊆ V ′ ) ∧ ( W ⊆ W ′ ) ) ⇒ ( W ∘ V ⊆ W ′ ∘ V ′ ) {\displaystyle \left(\left(V\subseteq V'\right)\land \left(W\subseteq W'\right)\right)\ \Rightarrow \ \left(W\circ V\subseteq W'\circ V'\right)}
* Δ X ∘ V = V ∘ Δ X = V {\displaystyle \Delta _{X}\circ V\ =\ V\circ \Delta _{X}\ =\ V}
* Δ X ⊆ V ⇒ W ∘ V ⊇ W {\displaystyle \Delta _{X}\subseteq V\ \Rightarrow W\circ V\supseteq W}
* Δ X ⊆ W ⇒ W ∘ V ⊇ V {\displaystyle \Delta _{X}\subseteq W\ \Rightarrow W\circ V\supseteq V}
* ( Δ X ⊆ V ∧ Δ X ⊆ W ) ⇒ W ∘ V ⊇ V ∪ W {\displaystyle (\Delta _{X}\subseteq V\ \land \ \Delta _{X}\subseteq W)\ \ \Rightarrow \ \ W\circ V\ \supseteq \ V\cup W}
* if  A {\displaystyle \ A} and  B {\displaystyle \ B} are  W {\displaystyle \ W} -sets, where  Δ X ⊆ W {\displaystyle \Delta _{X}\subseteq W} , and if  A ∩ B ≠ ∅ {\displaystyle \ A\cap B\neq \emptyset } , then  A ∪ B {\displaystyle \ A\cup B} is a  ( W ∘ W ) {\displaystyle \ (W\circ W)} -set; or in the Sikorski's notation:

A ∪ B ≠ ∅ ⇒ d i a m ( A ∪ B ) < W ∘ W {\displaystyle A\cup B\neq \emptyset \ \ \Rightarrow \ \ {\mathit {diam}}(A\cup B)\ <\ W\circ W}

for every V , V ′ , W , W ′ ⊆ X × X {\displaystyle \ V,V',W,W'\subseteq X\times X} , and  A , B ⊆ X {\displaystyle \ A,B\subseteq X} .

Definition A subset  A {\displaystyle \ A\ } of  X {\displaystyle \ X\ } is called a  V {\displaystyle \ V} -set if A × A ⊆ V {\displaystyle A\times A\subseteq V} , in which case we may also use Sikorski's notation:

d i a m ( A ) < V {\displaystyle {\mathit {diam}}(A)\ <\ V}

* Let  K {\displaystyle \ {\mathcal {K}}} be a family of sets such that the union of any two of them is a  V {\displaystyle \ V} -set (where  V ⊆ X × X {\displaystyle \ V\subseteq X\times X} ). The union  ⋃ K {\displaystyle \ \bigcup {\mathcal {K}}} is a  V {\displaystyle \ V} -set.

### Uniform space (definition)[edit]

An ordered pair  ( X , U ) {\displaystyle (X,{\mathcal {U}})} , consisting of a set  X {\displaystyle \ X} and a family  U {\displaystyle {\mathcal {U}}} of subsets of  X × X {\displaystyle \ X\times X} , is called a uniform space, and  U {\displaystyle {\mathcal {U}}} is called a uniform structure in  X {\displaystyle \ X} , if the following five properties (axioms) hold:

1. U ≠ ∅ {\displaystyle {\mathcal {U}}\neq \emptyset }
2. ∀ W ∈ U Δ X ⊆ W {\displaystyle \forall _{W\in {\mathcal {U}}}\ \Delta _{X}\subseteq W}
3. ∀ V ∈ U ∀ W ⊆ X × X ( V ⊆ W ⇒ W ∈ U ) {\displaystyle \forall _{V\in {\mathcal {U}}}\ \forall _{W\subseteq X\times X}\ (V\subseteq W\ \Rightarrow \ W\in {\mathcal {U}})}
4. ∀ V , W ∈ U V ∩ W − 1 ∈ U {\displaystyle \forall _{V,W\in {\mathcal {U}}}\ V\cap W^{-1}\in {\mathcal {U}}}
5. ∀ W ∈ U ∃ V ∈ U V ∘ V ⊆ W {\displaystyle \forall _{W\in {\mathcal {U}}}\exists _{V\in {\mathcal {U}}}\ V\circ V\subseteq W}

Members of  U {\displaystyle {\mathcal {U}}} are called entourages.

Instead of the somewhat long term uniform structure we may also use short term uniformity--it means exactly the same.

Example: X × X {\displaystyle X\times X\ } is an entourage of every uniform structure in  X {\displaystyle \ X} .

### Two extreme examples[edit]

The single element family  U := { X × X } {\displaystyle {\mathcal {U}}:=\\{X\times X\\}} is a uniform structure in  X {\displaystyle \ X} ; it is called the weakest uniform structure (in  X {\displaystyle \ X} ).

Family

U := { W ⊆ X × X : Δ X ⊆ W } {\displaystyle {\mathcal {U}}\ :=\ \\{W\subseteq X\times X:\Delta _{X}\subseteq W\\}}

is a uniform structure in  X {\displaystyle \ X} too; it is called the strongest uniform structure or the discrete uniform structure in  X {\displaystyle \ X} ; it contains every other uniform structure in  X {\displaystyle \ X} .

* U {\displaystyle \ {\mathcal {U}}} is the strongest uniform structure in  X {\displaystyle \ X} if and only if Δ X ∈ U {\displaystyle \ \Delta _{X}\in {\mathcal {U}}} .

## Uniform base[edit]

A family  B {\displaystyle {\mathcal {B}}} is called to be a base of a uniform structure U {\displaystyle {\mathcal {U}}} in  X {\displaystyle \ X} if U = U B {\displaystyle {\mathcal {U}}={\mathcal {U}}_{\mathcal {B}}} , where:

U B := { W ⊆ X × X : ∃ B ∈ B B ⊆ W } {\displaystyle {\mathcal {U}}_{\mathcal {B}}\ :=\ \\{W\subseteq X\times X:\exists _{B\in {\mathcal {B}}}\ B\subseteq W\\}}

Remark Uniform bases are also called fundamental systems of neighborhoods of the uniform structure (by Bourbaki).

Instead of starting with a uniform structure, we may begin with a family  B {\displaystyle {\mathcal {B}}} . If family  U B {\displaystyle {\mathcal {U}}_{\mathcal {B}}\ } is a uniform structure in  X {\displaystyle \ X} , then we simply say that  B {\displaystyle {\mathcal {B}}} is a uniform base (without mentioning explicitly any uniform structure).

Theorem A family  B {\displaystyle {\mathcal {B}}\ } of subsets of  X {\displaystyle X\ } is a uniform base if and only if the following properties hold:

1. B ≠ ∅ {\displaystyle {\mathcal {B}}\neq \emptyset }
2. ∀ W ∈ B Δ X ⊆ W {\displaystyle \forall _{W\in {\mathcal {B}}}\ \Delta _{X}\subseteq W}
3. ∀ V , W ∈ B V ∩ W − 1 ∈ U B {\displaystyle \forall _{V,W\in {\mathcal {B}}}\ V\cap W^{-1}\in {\mathcal {U}}_{\mathcal {B}}}
4. ∀ W ∈ B ∃ V ∈ B V ∘ V ⊆ W {\displaystyle \forall _{W\in {\mathcal {B}}}\exists _{V\in {\mathcal {B}}}\ V\circ V\subseteq W}

Remark Property 3 above features  U B {\displaystyle {\mathcal {U}}_{\mathcal {B}}\ } (it's not a typo!)--it's simpler this way.

### The symmetric base[edit]

Let  V ⊆ X × X {\displaystyle \ V\subseteq X\times X} . We say that  V {\displaystyle \ V\ } is symmetric if  V − 1 = V {\displaystyle \ V^{-1}=V} .

Let  V {\displaystyle \ V\ } be as above, and let  W := V ∩ V − 1 {\displaystyle \ W:=V\cap V^{-1}} . Then  W {\displaystyle \ W\ } is symmetric, i.e.

( V ∩ V − 1 ) − 1 = V ∩ V − 1 {\displaystyle (V\cap V^{-1})^{-1}=V\cap V^{-1}}

Now let  U {\displaystyle {\mathcal {U}}\ } be a uniform structure in  X {\displaystyle \ X} . Then

U S := { W ∈ U : W − 1 = W } {\displaystyle {\mathcal {U}}_{S}\ :=\ \\{W\in {\mathcal {U}}:W^{-1}=W\\}}

is a base of the uniform structure  U {\displaystyle \ {\mathcal {U}}} ; it is called the symmetric base of U {\displaystyle \ {\mathcal {U}}} .  Thus every uniform structure admits a symmetric base.

### Example[edit]

Notation: F i n ( X ) {\displaystyle Fin(X)\ } is the family of all finite subsets of  X {\displaystyle \ X} .

Let  X {\displaystyle \ X\ } be an infinite set. Let

W A := Δ X ∪ ( A × A ) {\displaystyle W_{A}\ :=\ \Delta _{X}\cup (A\times A)}

for every  A ⊆ X {\displaystyle \ A\subseteq X} , and

A := { W A : X ∖ A ∈ F i n ( X ) } {\displaystyle {\mathcal {A}}\ :=\ \\{W_{A}:X\backslash A\in Fin(X)\\}}

Each member of  A {\displaystyle {\mathcal {A}}\ } is symmetric. Let's show that  A {\displaystyle {\mathcal {A}}\ } is a uniform base:

Indeed, axioms 1-3 of uniform base obviously hold. Also:

W A ∘ W A = W A {\displaystyle W_{A}\circ W_{A}\ =\ W_{A}\ }

hence axiom 4 holds too. Thus  A {\displaystyle \ {\mathcal {A}}\ } is a uniform base.

The generated uniform structure  U A {\displaystyle \ {\mathcal {U}}_{\mathcal {A}}\ } is different both from the weakest and from the strongest uniform structure in  X {\displaystyle \ X} , (because  X {\displaystyle \ X\ } is infinite).

### Metric spaces[edit]

Let  ( X , d ) {\displaystyle \ (X,d)} be a metric space. Let

B t := { ( x , y ) : d ( x , y ) < t } {\displaystyle B_{t}\ :=\ \\{(x,y):d(x,y)<t\\}}

for every real  t > 0 {\displaystyle \ t>0} .  Define now

B d := { B t : t > 0 } {\displaystyle {\mathcal {B}}_{d}\ :=\ \\{B_{t}:t>0\\}}

and finally:

U d := { W : ∃ t B t ⊆ W ⊆ X × X } {\displaystyle {\mathcal {U}}_{d}\ :=\ \\{W:\exists _{t}\ B_{t}\subseteq W\subseteq X\times X\\}}

Then  U d {\displaystyle {\mathcal {U}}_{d}} is a uniform structure in  X {\displaystyle \ X} ; it is called the uniform structure induced by metric  d {\displaystyle \ d} (in  X {\displaystyle \ X} ).

Family  B d {\displaystyle {\mathcal {B}}_{d}\ } is a base of the structure  U d {\displaystyle {\mathcal {U}}_{d}\ } (see above). Observe that:

* Δ X ⊆ B t {\displaystyle \Delta _{X}\ \subseteq \ B_{t}}
* B t − 1 = B t {\displaystyle B_{t}^{-1}\ =\ B_{t}}
* B s ∩ B t = B min ( s , t ) {\displaystyle B_{s}\cap B_{t}\ =\ B_{\,\min(s,t)}}
* B t ∘ B t ⊆ B 2 ⋅ t {\displaystyle B_{t}\circ B_{t}\ \subseteq \ B_{2\cdot t}}

for arbitrary real numbers s , t > 0 {\displaystyle \ s,t>0} . This is why  B d {\displaystyle {\mathcal {B}}_{d}\ } is a uniform base, and  U d {\displaystyle {\mathcal {U}}_{d}} is a uniform structure (see the axioms of the uniform structure above).

Remark (!) Everything said in this text fragment is true more generally for arbitrary pseudo-metric space ( X , d ) {\displaystyle \ (X,d)} ; instead of the standard metric axiom:

d ( x , y ) = 0 ⇔ x = y {\displaystyle d(x,y)=0\ \Leftrightarrow x=y\ }

a pseudo-metric space is assumed to satisfy only a weaker axiom:

d ( x , x ) = 0 {\displaystyle d(x,x)=0\ }

(for arbitrary x , y ∈ X {\displaystyle \ x,y\in X} ).

## The induced topology[edit]

First another piece of auxiliary notation--given a set  X {\displaystyle \ X} , and  W ⊆ X × X {\displaystyle W\subseteq X\times X} , let

W ( x ) := { y : ( x , y ) ∈ W } = W ∩ ( { x } × X ) {\displaystyle W(x)\ :=\ \\{y:(x,y)\in W\\}=W\cap (\\{x\\}\times X)}

Let  ( X , U ) {\displaystyle (X,{\mathcal {U}})} be a uniform space. Then families

U x := { W ( x ) : W ∈ U } {\displaystyle {\mathcal {U}}_{x}\ :=\ \\{W(x):W\in {\mathcal {U}}\\}}

where  x {\displaystyle \ x} runs over  X {\displaystyle \ X} , form a topology defining system of neighborhoods in  X {\displaystyle \ X} . The topology itself is defined as:

T U := { G ⊆ X : ∀ x ∈ G G ∈ U x } {\displaystyle {\mathcal {T}}_{\mathcal {U}}\ :=\ \\{G\subseteq X:\forall _{x\in G}\ G\in {\mathcal {U}}_{x}\\}}

* The topology induced by the weakest uniform structure is the weakest topology. Furthermore, the weakest uniform structure is the only one which induces the weakest topology (in a given set).
* The topology induced by the strongest (discrete) uniform structure is the strongest (discrete) topology. Furthermore, the strongest uniform structure is the only one which induces the discrete topology in the given set if and only if that set is finite. Indeed, for any infinite set also the uniform structure  U A {\displaystyle \ {\mathcal {U}}_{\mathcal {A}}\ } (see Example above) induces the discrete topology. Thus different uniform structures (defined in the same set) can induce the same topology.
* The topology  T d {\displaystyle {\mathcal {T}}_{d}\ } induced by a metrics  d {\displaystyle \ d\ } is the same as the topology induced by the uniform structure induced by that metrics:

T U d = T d {\displaystyle {\mathcal {T}}_{{\mathcal {U}}_{d}}\ =\ {\mathcal {T}}_{d}}

Convention From now on, unless stated explicitly to the contrary, the topology considered in a uniform space is always the topology induced by the uniform structure of the given space. In particular, in the case of the uniform spaces the general topological operations on sets, like interior  I n t ( A ) {\displaystyle \ {\mathit {Int}}(A)} and closer  C l ( A ) {\displaystyle \ {\mathit {Cl}}(A)} , are taken with respect to the topology induced by the uniform structure of the respective uniform space.

Example Consider three metric functions in the real line  R {\displaystyle \ {\mathcal {R}}} :

* d ( x , y ) := | x − y | {\displaystyle d(x,y):=|x-y|\ }
* δ ( x , y ) := 2 ⋅ d ( x , y ) {\displaystyle \delta (x,y)\ :=\ 2\cdot d(x,y)\ }
* d c ( x , y ) := | x 3 − y 3 | {\displaystyle d_{c}(x,y):=|x^{3}-y^{3}|\ }

All these three metric functions induce the same, standard topology in  R {\displaystyle \ {\mathcal {R}}} .  Furthermore, functions  d {\displaystyle \ d\ } and  δ {\displaystyle \ \delta \ } induce the same uniform structure in  R {\displaystyle \ {\mathcal {R}}} . Thus different metric functions can induce the same uniform structure. On the other hand, the uniform structures induced by  d {\displaystyle \ d\ } and  d c {\displaystyle \ d_{c}\ } are different, which shows that different uniform structures, even when they are induced by metric functions, can induce the same topology.

Theorem Let  ( X , U ) {\displaystyle (X,{\mathcal {U}})} be a uniform space. The family of all entourages  U ∈ U {\displaystyle \ U\in {\mathcal {U}}} which are open in  X × X {\displaystyle \ X\times X} is a base of structure  U {\displaystyle {\mathcal {U}}}

Remark An equivalent formulation of the above theorem is:

* the interior of every entourage is an entourage.

Proof (of the theorem). Let  W ∈ U {\displaystyle \ W\in {\mathcal {U}}} be an arbitrary entourage. Let  V ∈ U {\displaystyle \ V\in {\mathcal {U}}} be a symmetric entourage such that  V ∘ V ∘ V ⊆ W {\displaystyle \ V\circ V\circ V\subseteq W} . It is enough to prove that entourage  V {\displaystyle \ V} is contained in the topological interior of  U {\displaystyle \ U} . Let's do it. Let  ( a , b ) ∈ V {\displaystyle \ (a,b)\in V} . Let  ( x , y ) ∈ V ( a ) × V ( b ) {\displaystyle \ (x,y)\in V(a)\times V(b)} .  Then, since  V {\displaystyle \ V} is symmetric, we have:

( x , a ) , ( a , b ) , ( b , y ) ∈ V {\displaystyle (x,a),\ (a,b),\ (b,y)\ \in \ V}

hence  ( x , y ) ∈ V ∘ V ∘ V ⊆ W {\displaystyle \ (x,y)\in V\circ V\circ V\subseteq W} . This proves that

V ( a ) × V ( b ) ⊆ W {\displaystyle V(a)\times V(b)\ \subseteq W}

Thus every point  ( a , b ) ∈ V {\displaystyle \ (a,b)\in V} belongs to the topological interior of  W {\displaystyle \ W} , i.e. the entire  V {\displaystyle \ V} is contained in the interior of  W {\displaystyle \ W} .

End of proof.

## Separation properties[edit]

Notation:

W ( A ) := ⋃ x ∈ A W ( x ) {\displaystyle W(A)\ :=\ \bigcup _{x\in A}\ W(x)}

for every entourage  W {\displaystyle \ W} and  A ⊆ X {\displaystyle \ A\subseteq X} (see above the definition of  W ( x ) {\displaystyle \ W(x)} ). Thus  W ( A ) {\displaystyle \ W(A)} is a neighborhood of  A {\displaystyle \ A} .

Warning { W ( A ) : W ∈ U } {\displaystyle \\{W(A):W\in {\mathcal {U}}\\}} does not have to be a base of neighborhoods of  A {\displaystyle \ A} , as shown by the following example (consult the section about metric spaces, above):

Example Let  R {\displaystyle \ {\mathcal {R}}} be the space of real numbers with its customary Euclidean distance (metric)

d ( x , y ) := | x − y | {\displaystyle d(x,y)\ :=\ |x-y|}

and the uniformity induced by this metric (see above)--this uniformity is called Euclidean. Let  N := { 1 , 2 , … } {\displaystyle \ {\mathcal {N}}:=\\{1,2,\dots \\}} be the set of natural numbers. Then the union of open intervals:

U := ⋃ n ∈ N ( n − 1 n ; n + 1 n ) {\displaystyle U\ :=\ \bigcup _{n\in {\mathcal {N}}}(n-{\frac {1}{n}};n+{\frac {1}{n}})}

is an open neighborhood of  N {\displaystyle \ {\mathcal {N}}} &nbsd in  R {\displaystyle \ {\mathcal {R}}} ,&nbsd but there does not exist any  t > 0 {\displaystyle \ t>0} such that  B t ( N ) ⊆ U {\displaystyle \ B_{t}({\mathcal {N}})\subseteq U} (see above). It follows that  U {\displaystyle \ U} does not contain any set  W ( N ) ∈ U {\displaystyle \ W({\mathcal {N}})\in {\mathcal {U}}} , where  U {\displaystyle \ {\mathcal {U}}} is the Euclidean uniformity in  R {\displaystyle \ {\mathcal {R}}} .

Definition Let  A , B ⊆ X {\displaystyle \ A,B\subseteq X} , and  W {\displaystyle \ W} be an entourage. We say that  A {\displaystyle \ A} and  B {\displaystyle \ B} are  W {\displaystyle \ W} -apart, if

( A × B ) ∩ W = ∅ {\displaystyle (A\times B)\ \cap W\ =\ \emptyset }

in which case we write

δ ( A , B ) > W {\displaystyle \delta (A,B)\ >\ W}

in the spirit of Sikorski's notation (it is an idiom, don't try to parse it).

* Let  A , B ⊆ X {\displaystyle \ A,B\subseteq X} be  W {\displaystyle \ W} -apart. Let  V {\displaystyle \ V} be another entourage, and let it be symmetric (meaning  V − 1 = V ) {\displaystyle \ V^{-1}=V)} and such that V ∘ V ∘ V ⊆ W {\displaystyle \ V\circ V\circ V\subseteq W} . Then  V ( A ) {\displaystyle \ V(A)} and  V ( B ) {\displaystyle \ V(B)} are  V {\displaystyle \ V} -apart:

δ ( V ( A ) , V ( B ) ) > V {\displaystyle \delta (V(A),V(B))\ >\ V}

We see that two sets which are apart (for an entourage) admit neighborhoods which are apart too. Now we may mimic Paul Urysohn by stating a uniform variant of his topological lemma:

Uniform Urysohn Lemma Let  A , B ⊆ X {\displaystyle \ A,B\subseteq X} be apart. Then there exists a uniformly continuous function  f : X -> [ 0 ; 1 ] {\displaystyle \ f:X\rightarrow [0;1]} such that  f ( x ) = 0 {\displaystyle \ f(x)=0} for every  x ∈ A {\displaystyle \ x\in A} , and  f ( x ) = 1 {\displaystyle \ f(x)=1} for every  x ∈ B {\displaystyle \ x\in B} .

It is possible to adopt the main idea of the Urysohn's original proof of his lemma to this new uniform situation by iterating the statement just above the Uniform Urysohn Lemma.

Proof (of the Uniform Urysohn Lemma)

Let  W {\displaystyle \ W} be an entourage. Let  A , B ⊆ X {\displaystyle \ A,B\subseteq X} be  W {\displaystyle \ W} -apart. Let  ( W n : n = 0 , 1 , … ) {\displaystyle \ (W_{n}:n=0,1,\dots )} be a sequence of entourages such that

* W 0 := W {\displaystyle W_{0}\ :=\ W}
* W n − 1 = W n {\displaystyle W_{n}^{-1}\ =\ W_{n}}
* W n ∘ W n ⊆ W n − 1 {\displaystyle W_{n}\circ W_{n}\subseteq W_{n-1}\ }

for every  n = 1 , 2 , … {\displaystyle \ n=1,2,\dots } .  Next, let  A r , B r ⊆ X {\displaystyle \ A_{r},B_{r}\subseteq X} for every  r := k 2 n {\displaystyle \ r:={\frac {k}{2^{n}}}} , where  n = 1 , 2 , … {\displaystyle \ n=1,2,\dots } and  k = 0 , 1 , … , 2 n {\displaystyle \ k=0,1,\dots ,2^{n}} , be defined, inductively on  n {\displaystyle \ n} , as follows:

* A 0 := A a n d A 1 := X {\displaystyle A_{0}:=A\quad {\mathit {and}}\quad A_{1}:=X}
* B 0 := X a n d B 1 := B {\displaystyle B_{0}:=X\quad {\mathit {and}}\quad B_{1}:=B}
* A 2 ⋅ k − 1 2 n := X ∖ W n ( B k 2 n − 1 ) {\displaystyle A_{\frac {2\cdot k-1}{2^{n}}}\ :=\ X\ \backslash \ W_{n}\left(B_{\frac {k}{2^{n-1}}}\right)}
* B 2 ⋅ k − 1 2 n := X ∖ W n ( A k − 1 2 n − 1 ) {\displaystyle B_{\frac {2\cdot k-1}{2^{n}}}\ :=\ X\ \backslash \ W_{n}\left(A_{\frac {k-1}{2^{n-1}}}\right)}

for every  n = 1 , 2 , … {\displaystyle \ n=1,2,\dots } and  k = 1 , … , 2 n − 1 {\displaystyle \ k=1,\dots ,2^{n-1}} . We see that

* A m − 1 2 n {\displaystyle \ A_{\frac {m-1}{2^{n}}}} and  B m 2 n {\displaystyle B_{\frac {m}{2^{n}}}} are  W n {\displaystyle \ W_{n}} -apart for every  n = 0 , 1 , … {\displaystyle \ n=0,1,\dots } and  m = 1 , … , 2 m {\displaystyle \ m=1,\dots ,2^{m}} ;
* A r ∪ B r = X {\displaystyle A_{r}\cup B_{r}\ =\ X} for every  r {\displaystyle \ r} ;
* the assignment  r ↦ A r {\displaystyle \ r\mapsto A_{r}} is increasing, while  r ↦ B r {\displaystyle \ r\mapsto B_{r}} is decreasing.

The required uniform function can be defined as follows:

f ( x ) := inf { r : x ∈ A r } {\displaystyle f(x)\ :=\ \inf \ \\{r:x\in A_{r}\\}}

for every  x ∈ X {\displaystyle \ x\in X} . Obviously,  f ( x ) = 0 {\displaystyle \ f(x)=0} for every  x ∈ A {\displaystyle \ x\in A} , and  f ( x ) = 1 {\displaystyle \ f(x)=1} for every  x ∈ B {\displaystyle \ x\in B} . Furthermore, let  ϵ > 0 {\displaystyle \ \epsilon >0} . Then

ϵ > 1 2 n − 1 {\displaystyle \epsilon \ >\ {\frac {1}{2^{n-1}}}}

for certain positive integer  n {\displaystyle \ n} . Let  x , y ∈ X {\displaystyle \ x,y\in X} be such that

f ( x ) + ϵ ≤ f ( y ) {\displaystyle f(x)+\epsilon \ \leq \ f(y)}

Then there exists  m ∈ { 1 , … , 2 n } {\displaystyle \ m\in \\{1,\dots ,2^{n}\\}} such that

f ( x ) < m − 1 2 n < m 2 n < f ( y ) {\displaystyle f(x)\ <\ {\frac {m-1}{2^{n}}}\ <\ {\frac {m}{2^{n}}}\ <\ f(y)}

Thus  x ∈ A m − 1 2 n {\displaystyle \ x\in A_{\frac {m-1}{2^{n}}}} , while  y ∉ A m 2 n {\displaystyle \ y\notin A_{\frac {m}{2^{n}}}} , hence  y ∈ B m 2 n {\displaystyle \ y\in B_{\frac {m}{2^{n}}}} . Thus points  x {\displaystyle \ x} and  y {\displaystyle \ y} are  W n {\displaystyle \ W_{n}} -apart.

We have proved that for every  ( x , y ) ∈ W n {\displaystyle \ (x,y)\in W_{n}} the images are less then  ϵ {\displaystyle \ \epsilon } -apart:

∀ ( x , y ) ∈ W n | f ( x ) − f ( y ) | < ϵ {\displaystyle \forall _{(x,y)\in W_{n}}\ |f(x)-f(y)|\ <\ \epsilon }

End of proof.

Now let's consider a special case of one of the two sets being a 1-point set.

* Let  p ∈ X {\displaystyle \ p\in X} , and let  G {\displaystyle \ G} be a neighborhood of  p {\displaystyle \ p} (with respect to the uniform topology, i.e. with respect to the topology induced by the uniform structure). Then  { p } {\displaystyle \ \\{p\\}} and  X ∖ G {\displaystyle \ X\backslash G} are apart.

Indeed, there exists an entourage  W ∈ U {\displaystyle \ W\in {\mathcal {U}}} such that  W ( p ) ⊆ G {\displaystyle \ W(p)\subseteq G} , which means that

( { p } × ( X ∖ G ) ) ∩ W = ∅ {\displaystyle \ (\\{p\\}\times (X\backslash G))\ \cap \ W\ \ =\ \ \emptyset }

i.e. { p } {\displaystyle \ \\{p\\}} and  X ∖ G {\displaystyle \ X\backslash G} are  W {\displaystyle \ W} -apart.

Thus we may apply the Uniform Urysohn Lemma:

Theorem Every uniform space is completely regular (as a topological space with the topology induced by the uniformity).

Remark This only means that there is a continuous function  f : X -> [ 0 ; 1 ] {\displaystyle \ f:X\rightarrow [0;1]} such that  f ( p ) = 0 {\displaystyle \ f(p)=0} and  f ( x ) = 1 {\displaystyle \ f(x)=1} for every  x ∈ X ∖ G {\displaystyle \ x\in X\backslash G} , whenever  G {\displaystyle \ G} is a neighborhood of  p {\displaystyle \ p} . However, it does not mean that uniform spaces have to be Hausdorff spaces. In fact, uniform space with the weakest uniformity has the weakest topology, hence it's never Hausdorff, not even T0, unless it has no more than one point.

On the other hand, when one of any two points has a neighborhood to which the other one does not belong then the two 1-point sets, consisting of these two points, are apart, hence they admit disjoint neighborhoods. Thus it is easy to prove the following:

Theorem The following three topological properties of a uniform space  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} are equivalent

* ( X , T U ) {\displaystyle \ (X,{\mathcal {T}}_{\mathcal {U}})} is a T0-space;
* ( X , T U ) {\displaystyle \ (X,{\mathcal {T}}_{\mathcal {U}})} is a T2-space (i.e. Hausdorff);
* ⋂ U = Δ X {\displaystyle \bigcap \ {\mathcal {U}}\ =\ \Delta _{X}} .

When a uniform structure induces a Hausdorff topology then it's called separating.

## Uniform continuity and uniform homeomorphisms[edit]

Let  ( X , U ) {\displaystyle (X,{\mathcal {U}})} and  ( Y , V ) {\displaystyle (Y,{\mathcal {V}})} be uniform spaces. Function  f : X -> Y {\displaystyle \ f:X\rightarrow Y} is called uniformly continuous if

∀ V ∈ V ( f × f ) − 1 ( V ) ∈ U {\displaystyle \forall _{V\in {\mathcal {V}}}\ (f\times f)^{-1}(V)\ \in \ {\mathcal {U}}}

A more elementary calculus δε-like equivalent definition would sound like this (UV play the role of δε respectively):

f {\displaystyle f\ } is uniformly continuous if (and only if) for every V ∈ V {\displaystyle V\in {\mathcal {V}}\ } there exists U ∈ U {\displaystyle U\in {\mathcal {U}}\ } such that for every x ′ , x ″ ∈ X {\displaystyle x',x''\in X\ } if  ( x ′ , x ″ ) ∈ U {\displaystyle (x',x'')\in {\mathcal {U}}\ } then  ( f ( x ′ ) , f ( x ″ ) ) ∈ V {\displaystyle (f(x'),f(x''))\in {\mathcal {V}}} .

Every uniformly continuous map is continuous with respect to the topologies induced by the ivolved uniform structures.

Example Every constant map from one uniform space to another is uniformly continuous.

A uniform map  f : X -> Y {\displaystyle \ f:X\rightarrow Y} of a uniform space  ( X , U ) {\displaystyle (X,{\mathcal {U}})} into a uniform space  ( Y , V ) {\displaystyle (Y,{\mathcal {V}})} is called a uniform homeomorphism of these two spaces) if it is bijective, and the inverse function  f − 1 : Y -> X {\displaystyle \ f^{-1}:Y\rightarrow X} is a uniform map of ( Y , V ) {\displaystyle (Y,{\mathcal {V}})} into  ( X , U ) {\displaystyle (X,{\mathcal {U}})} .

## Constructions and operations[edit]

Constructions of new uniform spaces based on already existing uniform spaces are called operations. Otherwise they are called simply constructions. Thus the uniformity induced by a metric (see above) is an example of a construction (of a uniformity).

A full conceptual appreciation of operations and constructions requires the theory of categories (see below).

### Partial order of uniformities[edit]

The set of uniform structures in a set  X {\displaystyle \ X} is (partially) ordered by the inclusion relation; given two uniformities  U {\displaystyle \ {\mathcal {U}}} and  V {\displaystyle \ {\mathcal {V}}} in  X {\displaystyle \ X} such that  U ⊆ V {\displaystyle \ {\mathcal {U}}\subseteq {\mathcal {V}}} we say that  U {\displaystyle \ {\mathcal {U}}} is weaker than  V {\displaystyle \ {\mathcal {V}}} and  V {\displaystyle \ {\mathcal {V}}} is stronger than  U {\displaystyle \ {\mathcal {U}}} . The set of all uniform structures in  X {\displaystyle \ X} has the weakest (smallest) and the strongest (largest) element (uniformity). We will see in the next section, that each set of uniform structures in  X {\displaystyle \ X} admits the least upper bound. Thus it follows that each set admits also the greatest lower bound--indeed, the weakest uniformity is one of the lower bounds of a set, and there exists the least upper bound of the set of all lower bounds, which is the required greatest lower bound. In short, the uniformities in arbitrary set  X {\displaystyle \ X} form a complete Birkhoff lattice.

### The least upper bound[edit]

Let  U , U ′ , W , W ′ ⊆ X × X {\displaystyle \ U,U',W,W'\subseteq X\times X} be such that:

U ∘ U ⊆ U ′ {\displaystyle U\circ U\subseteq U'} and  W ∘ W ⊆ W ′ {\displaystyle W\circ W\subseteq W'}

Then

( U ∩ W ) ∘ ( U ∩ W ) ⊆ U ′ ∩ W ′ {\displaystyle (U\cap W)\circ (U\cap W)\ \subseteq U'\cap W'}

The same holds not just for two but for any finite (or just arbitrary) family of pairs  ( U , U ′ ) {\displaystyle \ (U,U')} as above. In particular, let  A {\displaystyle \ A} be an arbitrary family of uniformities in  X {\displaystyle \ X} . We will construct the least upper bound of such a family:

For each  U ∈ U ∈ A {\displaystyle \ U\in {\mathcal {U}}\in {\mathcal {A}}} let entourage  U / U ∈ U {\displaystyle \ {\sqrt {U/{\mathcal {U}}}}\in {\mathcal {U}}} be such that:

U / U ∘ U / U ⊆ U {\displaystyle {\sqrt {U/{\mathcal {U}}}}\circ {\sqrt {U/{\mathcal {U}}}}\ \subseteq {\mathcal {U}}}

Then, whenever for a finite (or any) family  C ⊆ A {\displaystyle \ {\mathcal {C}}\subseteq {\mathcal {A}}} an entourage  U U {\displaystyle \ U_{\mathcal {U}}} is selected for each  U ∈ C {\displaystyle \ {\mathcal {U}}\in {\mathcal {C}}} , we obtain:

( ⋂ U ∈ C U U / U ) ∘ ( ⋂ U ∈ C U U / U ) ⊆ ⋂ U ∈ C U U {\displaystyle (\bigcap _{{\mathcal {U}}\in {\mathcal {C}}}{\sqrt {U_{\mathcal {U}}/{\mathcal {U}}}})\circ (\bigcap _{{\mathcal {U}}\in {\mathcal {C}}}{\sqrt {U_{\mathcal {U}}/{\mathcal {U}}}})\ \subseteq \ \bigcap _{{\mathcal {U}}\in {\mathcal {C}}}U_{\mathcal {U}}}

Now it is easy to see that the family

B := { ⋂ U ∈ C U U : C ∈ F i n ( A ) ∧ ∀ U ∈ C U U ∈ U } {\displaystyle {\mathcal {B}}\ :=\ \\{\bigcap _{{\mathcal {U}}\in {\mathcal {C}}}U_{\mathcal {U}}:{\mathcal {C}}\in {\mathit {Fin}}({\mathcal {A}})\ \land \ \forall _{{\mathcal {U}}\in {\mathcal {C}}}\ U_{\mathcal {U}}\in {\mathcal {U}}\\}}

is a uniform base. It is obvious that the uniformity  U B {\displaystyle \ {\mathcal {U}}_{\mathcal {B}}} , generated by  B {\displaystyle \ {\mathcal {B}}} , is the least upper bound of  A {\displaystyle {\mathcal {A}}} :

U B = l u b ( A ) {\displaystyle \ {\mathcal {U}}_{\mathcal {B}}\ =\ {\mathit {lub}}({\mathcal {A}})}

### Preimage[edit]

Let  X {\displaystyle \ X} be a set; let  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} be a uniform space; let  f : X -> Y {\displaystyle \ f:X\rightarrow Y} be an arbitrary function. Then

B f := { ( f × f ) − 1 ( V ) : V ∈ V } {\displaystyle {\mathcal {B}}_{f}\ :=\ \\{(f\times f)^{-1}(V):V\in {\mathcal {V}}\\}}

is a base of a uniform structure  U f {\displaystyle \ {\mathcal {U}}_{f}} in  X {\displaystyle \ X} . Uniformity  U f {\displaystyle \ {\mathcal {U}}_{f}} is called the preimage of uniformity  V {\displaystyle \ {\mathcal {V}}} under function  f {\displaystyle \ f} . Now  f {\displaystyle \ f} became a uniform map of the uniform space  ( X , U f ) {\displaystyle \ (X,{\mathcal {U}}_{f})} into  ( Y , Y ) {\displaystyle \ (Y,{\mathcal {Y}})} . Moreover, and that's the whole point of the preimage operation, uniformity  U f {\displaystyle \ {\mathcal {U}}_{f}} is the weakest in  X {\displaystyle \ X} , with respect to which function  f {\displaystyle \ f} is uniform.

* Let  X {\displaystyle \ X} be a set; let  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} be a uniform space; let  f : X -> Y {\displaystyle \ f:X\rightarrow Y} be an arbitrary surjection. Then for every uniform space  ( Z , W ) {\displaystyle \ (Z,{\mathcal {W}})} , and every function  g : Y -> Z {\displaystyle \ g:Y\rightarrow Z} such that  g ∘ f {\displaystyle \ g\circ f} is a uniform map of  ( X , U f ) {\displaystyle \ (X,{\mathcal {U}}_{f})} into  ( Z , W ) {\displaystyle \ (Z,{\mathcal {W}})} , the function  g {\displaystyle \ g} is a uniform map of  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} into  ( Z , W ) {\displaystyle \ (Z,{\mathcal {W}})} .

The preimage uniformity can be characterized purely in terms of function; thus the following theorem could be a (non-constructive) definition of the preimage uniformity:

Theorem Let  X {\displaystyle \ X} be a set; let  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} be a uniform space; let  f : X -> Y {\displaystyle \ f:X\rightarrow Y} be an arbitrary function. The preimage uniformity is the only uniform structure  U = U f {\displaystyle \ {\mathcal {U}}={\mathcal {U}}_{f}} which satisfies the following two conditions:

* f {\displaystyle \ f} is a uniform map of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} into  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} ;
* for every uniform space  ( E , S ) {\displaystyle (E,{\mathcal {S}})} , and for every function  c : E -> X {\displaystyle \ c:E\rightarrow X} , if  f ∘ c {\displaystyle \ f\circ c} is a uniform map of  ( E , S ) {\displaystyle (E,{\mathcal {S}})} , into  ( Y , V ) {\displaystyle (Y,{\mathcal {V}})} , then  c {\displaystyle \ c} is a uniform map of  ( E , S ) {\displaystyle \ (E,{\mathcal {S}})} into  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} .

Proof The first condition means that  U {\displaystyle \ {\mathcal {U}}} is stronger than the preimage  U f {\displaystyle \ {\mathcal {U}}_{f}} ; and the second condition, once we substitute  ( E , S ) := ( X , U f ) {\displaystyle (E,{\mathcal {S}}):=(X,{\mathcal {U}}_{f})} , and  c := I d X {\displaystyle \ c:={\mathit {Id}}_{X}} , tells us that  U {\displaystyle \ {\mathcal {U}}} is weaker than  U f {\displaystyle \ {\mathcal {U}}_{f}} . Thus  U = U f {\displaystyle \ {\mathcal {U}}={\mathcal {U}}_{f}} . Of course  U {\displaystyle \ {\mathcal {U}}} satisfies both conditions of the theorem.

End of proof.

### Uniform subspace[edit]

Let  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} be a uniform space; let  X {\displaystyle \ X} be a subset of  Y {\displaystyle \ Y} . Let uniformity  U {\displaystyle \ {\mathcal {U}}} be the primage of uniformity  V {\displaystyle \ {\mathcal {V}}} under the identity embedding  i : X -> Y {\displaystyle \ i:X\rightarrow Y} (where  ∀ x ∈ X i ( x ) := x {\displaystyle \ \forall _{x\in X}\ i(x):=x} ). Then  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} is called the uniform subspace of the uniform space  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} , and  U {\displaystyle \ {\mathcal {U}}} - the subspace uniformity. It is directly described by the equality:

U = { V ∩ ( X × X ) : V ∈ V } {\displaystyle {\mathcal {U}}\ =\ \\{V\cap (X\times X):\ V\in {\mathcal {V}}\\}}

The subspace uniformity is the weakest in  X {\displaystyle \ X} under which the embedding  i : X -> Y {\displaystyle \ i:X\rightarrow Y} is uniform.

The following theorem is a characterization of the subspace uniformity in terms of functions (it is a special case of the theorem about the preimage structure; see above):

Theorem Let  X ⊆ Y {\displaystyle \ X\subseteq Y} , where  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} is a uniform space. The subspace uniformity is the only uniform structure  U {\displaystyle \ {\mathcal {U}}} in  X {\displaystyle \ X} which satisfies the following two conditions:

* the identity embedding  i : X -> Y {\displaystyle \ i:X\rightarrow Y} is a uniform map of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} into  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} ;
* for every uniform space  ( E , S ) {\displaystyle (E,{\mathcal {S}})} , and for every function  c : E -> X {\displaystyle \ c:E\rightarrow X} , if  i ∘ c {\displaystyle \ i\circ c} is a uniform map of  ( E , S ) {\displaystyle (E,{\mathcal {S}})} into  ( Y , V ) {\displaystyle (Y,{\mathcal {V}})} , then  c {\displaystyle \ c} is a uniform map of  ( E , S ) {\displaystyle \ (E,{\mathcal {S}})} into  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} .

### Uniform (Cartesian) product[edit]

Let  X := ( ( X a , U a ) : a ∈ A ) {\displaystyle \ {\mathcal {X}}:=\left(\left(X_{a},{\mathcal {U}}_{a}\right):a\in A\right)} be an indexed family of uniform spaces. Let  π a : X -> X a {\displaystyle \ \pi _{a}:X\rightarrow X_{a}} be the standard projection of the cartesian product

X := ∏ a ∈ A X a {\displaystyle \ X:=\prod _{a\in A}\ X_{a}}

onto  X a {\displaystyle \ X_{a}} , for every  a ∈ A {\displaystyle \ a\in A} . Then the least upper bound of the preimage uniformities:

U := l u b { U π a : a ∈ A } {\displaystyle {\mathcal {U}}\ :=\ {\mathit {lub}}\,\\{{\mathcal {U}}_{\pi _{a}}:a\in A\\}}

is called the product uniformity in  X {\displaystyle \ X} , and  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} is called the product of the uniform family X {\displaystyle \ {\mathcal {X}}} . Thus the product uniformity is the weakiest under which the standard projections are uniform. It is characterized in terms of functions as follows:

Theorem The product uniformity  U {\displaystyle {\mathcal {U}}} (see above) is the only one in the Cartesian product  X {\displaystyle \ X} , which satisfies the following two conditions:

* each projection  p i a ( a ∈ A ) {\displaystyle \ pi_{a}\ (a\in A)} is a uniform map of  ( X a , U a ) {\displaystyle \ (X_{a},{\mathcal {U}}_{a})} into  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} ;
* for every uniform space  ( E , S ) {\displaystyle (E,{\mathcal {S}})} , and for every (indexed) family of uniform maps  c a : E -> X a {\displaystyle \ c_{a}:E\rightarrow X_{a}} , of  ( E , S ) {\displaystyle (E,{\mathcal {S}})} into  ( X a , U a ) {\displaystyle \ (X_{a},{\mathcal {U}}_{a})} (for  a ∈ A {\displaystyle \ a\in A} ) there exists exactly one uniform map  c : E -> X {\displaystyle \ c:E\rightarrow X} such that:

∀ a ∈ A c a = π a ∘ c {\displaystyle \forall _{a\in A}\ c_{a}\ =\ \pi _{a}\circ c}

Remark The theory of sets tells us that that unique uniform map  c {\displaystyle \ c} is, as a function, the diagonal product:

c = △ a ∈ A c a {\displaystyle c=\triangle _{a\in A}\ c_{a}}

Thus the above theorem really says that the diagonal product of uniform maps is uniform.

Remark In many texts the diagonal product, △ a ∈ A c a {\displaystyle \ \triangle _{a\in A}\ c_{a}} , is called incorrectly the Cartesian product of functions, ∏ a ∈ A c a {\displaystyle \prod _{a\in A}c_{a}} ; the correct terminology is used for instance in  "Outline of General Topology" by Ryszard Engelking.

## The category of the uniform spaces[edit]

The identity function  I X : X -> X {\displaystyle \ {\mathcal {I}}_{X}:X\rightarrow X} , which maps every point onto itself, is a uniformly continuous map of  ( X , U ) {\displaystyle (X,{\mathcal {U}})} onto itself, for every uniform structure  U {\displaystyle {\mathcal {U}}} in  X {\displaystyle \ X} .

Also, if  f : X -> Y {\displaystyle \ f:X\rightarrow Y\ } and  g : Y -> Z {\displaystyle \ g:Y\rightarrow Z\ } are uniformly continuous maps of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})\ } into  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})\ } , and of  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})\ } into  ( Z , W ) {\displaystyle \ (Z,{\mathcal {W}})\ } respectively, then  g ∘ f : X -> Z {\displaystyle \ g\circ f:X\rightarrow Z\ } is a uniformly continuous map of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} into  ( Z , W ) {\displaystyle \ (Z,{\mathcal {W}})} .

These two properties of the uniformly continuous maps mean that the uniform spaces (as objects) together with the uniform maps (as morphisms) form a category  U S {\displaystyle {\mathit {US}}\ } (for Uniform Spaces).

Remark A morphism in category  U S {\displaystyle {\mathit {US}}\ } is more than a set function; it is an ordered triple consisting of two objects (domain and range) and one set function (but it must be uniformly continuous). This means that one and the same function may serve more than one morphism in  U S {\displaystyle \ {\mathit {US}}} .

## Pointers[edit]

Pointers play a role in the theory of uniform spaces which is similar to the role of Cauchy sequences of points, and of the Cantor decreasing sequences of closed sets (whose diameters converge to 0) in mathematical analysis. First let's introduce auxiliary notions of neighbors and clusters.

### Neighbors[edit]

Let  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})\ } be a uniform space. Two subsets  A , B {\displaystyle \ A,B\ } of  X {\displaystyle \ X\ } are called neighbors - and then we write  A δ B {\displaystyle \ A\delta B} - if:

( A × B ) ∩ U ≠ ∅ {\displaystyle (A\times B)\ \cap \ U\ \neq \ \emptyset \ }

for arbitrary  U ∈ U {\displaystyle \ U\in {\mathcal {U}}} .

* Either  A δ B {\displaystyle \ A\delta B} or there exists an entourage  W {\displaystyle \ W} such that  A {\displaystyle \ A} and  B {\displaystyle \ B} are  W {\displaystyle \ W} -apart.

If more than one uniform structure is present then we write  A δ U B {\displaystyle \ A\delta _{\mathcal {U}}B\ } in order to specify the structure in question.

The neighbor relation enjoys the following properties:

* no set is a neighbor of the empty set;
* A δ B ⇒ B δ A {\displaystyle A\delta B\ \Rightarrow B\delta A}
* ( A ⊆ A ′ ∧ A δ B ) ⇒ A ′ δ B {\displaystyle (A\subseteq A'\ \land \ A\delta B)\ \Rightarrow \ A'\delta B}
* A δ ( B ∪ C ) ⇒ ( A δ B ∨ A δ C ) {\displaystyle A\,\delta \,(B\cup C)\ \Rightarrow \ (A\delta B\ \lor \ A\delta C)}
* { x } δ A ⇔ x ∈ C l ( A ) {\displaystyle \\{x\\}\,\delta \,A\ \Leftrightarrow \ x\in {\mathit {Cl}}(A)}
* C l ( A ) ∩ C l ( B ) ≠ ∅ ⇒ A δ B {\displaystyle {\mathit {Cl}}(A)\cap {\mathit {Cl}}(B)\ \neq \ \emptyset \ \ \Rightarrow \ \ A\delta B}

for arbitrary  A , A ′ , B ⊆ X {\displaystyle \ A,A',B\subseteq X} and x ∈ X {\displaystyle \ x\in X} .

Remark Relation  A δ B {\displaystyle \ A\delta B} , and a set of axioms similar to the above selection of properties of  δ {\displaystyle \ \delta } , was the start point of the Efremovich-Smirnov approach to the topic of uniformity.

Also:

* if W {\displaystyle \ W} is an entourage, A {\displaystyle \ A} and  B {\displaystyle \ B} are both  W {\displaystyle \ W} -sets, and  A {\displaystyle \ A} and  B {\displaystyle \ B} are neighbors, then the union  A ∪ B {\displaystyle \ A\cup B} is a  ( W ∘ V ∘ W ) {\displaystyle \ (W\circ V\circ W)} -set for every entourage  V {\displaystyle \ V} ; in particular, it is a  ( W ∘ W ∘ W ) {\displaystyle \ (W\circ W\circ W)} -set.

Furthermore, if  f : X -> Y {\displaystyle \ f:X\rightarrow Y\ } is a uniformly continuous map of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})\ } into  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} ,  then

* A δ U B ⇒ f ( A ) δ V f ( B ) {\displaystyle A\delta _{\mathcal {U}}B\ \Rightarrow \ f(A)\,\delta _{\mathcal {V}}f(B)}

for arbitrary  A , B ⊆ X {\displaystyle \ A,B\subseteq X} .

### Clusters[edit]

Let  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})\ } be a uniform space. A family  K {\displaystyle \ {\mathcal {K}}\ } of subsets of  X {\displaystyle \ X\ } is called a cluster if each two members of  K {\displaystyle \ {\mathcal {K}}\ } are neighbors.

* Every subfamily of a cluster is a cluster.
* If every member of a cluster is a  W {\displaystyle \ W} -set, then its union is a  W ∘ W ∘ W {\displaystyle \ W\circ W\circ W} -set.
* If  f : X -> Y {\displaystyle \ f:X\rightarrow Y\ } is a uniformly continuous map of ( X , U ) {\displaystyle (X,{\mathcal {U}})} into  ( Y , V ) {\displaystyle \ \ (Y,{\mathcal {V}})} ,  and  K {\displaystyle \ {\mathcal {K}}\ } is a cluster in  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} ,  then

{ f ( W ) : W ∈ K } {\displaystyle \\{f(W):W\in {\mathcal {K}}\\}}

is a cluster in  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} .

### Pointers[edit]

A cluster  K {\displaystyle \ {\mathcal {K}}\ } in a uniform space  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})\ } is called a pointer if for every entourage  U ∈ U {\displaystyle \ U\in {\mathcal {U}}\ } there exists a  U {\displaystyle \ U} -set  A {\displaystyle \ A} (meaning A × A ⊆ U {\displaystyle A\times A\subseteq U} )  such that

∀ K ∈ K A ∩ K ≠ ∅ {\displaystyle \forall _{K\in {\mathcal {K}}}\ A\cap K\ \neq \ \emptyset }

If  f : X -> Y {\displaystyle \ f:X\rightarrow Y\ } is a uniformly continuous map of ( X , U ) {\displaystyle (X,{\mathcal {U}})} into  ( Y , V ) {\displaystyle \ \ (Y,{\mathcal {V}})} ,  and  K {\displaystyle \ {\mathcal {K}}\ } is a pointer in  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} ,  then

{ f ( W ) : W ∈ K } {\displaystyle \\{f(W):W\in {\mathcal {K}}\\}}

is a pointer in  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} .

* Every base of neighborhoods of a point is a pointer. Thus the filter of all neighborhoods of a point is called the pointer of neighborhoods (of the given point).

### Equivalence of pointers, maximal and minimal pointers[edit]

Let the elunia of two families  K , L {\displaystyle \ {\mathcal {K}},{\mathcal {L}}} ,  be the family  K ⋓ L {\displaystyle \ {\mathcal {K}}\Cup {\mathcal {L}}} of the unions of pairs of elements of these two families, i.e.

K ⋓ L := { K ∪ L : K ∈ K , L ∈ L } {\displaystyle \ {\mathcal {K}}\Cup {\mathcal {L}}\ :=\ \\{K\cup L:K\in {\mathcal {K}},\ L\in {\mathcal {L}}\\}}

Definition Two pointers  K , L {\displaystyle \ {\mathcal {K}},{\mathcal {L}}} are called equivalent if their  K ⋓ L {\displaystyle \ {\mathcal {K}}\Cup {\mathcal {L}}} elunia is a pointer, in which case we write  K ∼ L {\displaystyle \ {\mathcal {K}}\sim {\mathcal {L}}} .

This is indeed an equivalence relation: reflexive, symmetric and transitive.

* Two pointers are equivalent if and only if their union is a pointer.

* The union of all pointers equivalent with a given one is a pointer from the same equivalence class. Thus each equivalent class of pointers has a pointer which contains every pointer of the given class. The following three properties of a pointer  P {\displaystyle \ {\mathcal {P}}} in a uniform space  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} are equivalent:
* if  A ⊆ X {\displaystyle \ A\subseteq X} is a neighbor of every member of  P {\displaystyle \ {\mathcal {P}}} then  A ∈ P {\displaystyle \ A\in {\mathcal {P}}} ;
* P {\displaystyle {\mathcal {P}}} is not contained in any pointer different from itself;
* P {\displaystyle {\mathcal {P}}} contains every pointer equivalent to itself.

* Let  P {\displaystyle \ {\mathcal {P}}} be a pointer in  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} . Let

P U := ⋃ { A ∈ P : A × A ⊆ U } {\displaystyle P_{U}\ :=\ \bigcup \ \\{A\in {\mathcal {P}}:A\times A\subseteq U\\}}

for every entourage  U ∈ U {\displaystyle \ U\in {\mathcal {U}}} . Then  P U {\displaystyle \ P_{U}} is a  U ∘ U ∘ U {\displaystyle U\circ U\circ U} -set. It follows that

Q := { P U : U ∈ U } {\displaystyle {\mathcal {Q}}\ :=\ \\{P_{U}:U\in {\mathcal {U}}\\}}

is a pointer equivalent to  P {\displaystyle \ {\mathcal {P}}} .

* Let's call a pointer  P {\displaystyle \ {\mathcal {P}}} upward full if it has every superset  B ⊆ X {\displaystyle \ B\subseteq X} of each of its members  A ∈ U {\displaystyle \ A\in {\mathcal {U}}} . If  P {\displaystyle \ {\mathcal {P}}} is an arbitrary pointer, then its upward fulfillment

P ′ := { B : ∃ A ∈ P A ⊆ B ⊆ X } {\displaystyle {\mathcal {P}}'\ :=\ \\{B:\exists _{A\in {\mathcal {P}}}\ A\subseteq B\subseteq X\\}}

is an upward full pointer equivalent to  P {\displaystyle \ {\mathcal {P}}} .

* Let  P {\displaystyle \ {\mathcal {P}}} be a pointer which is maximal in its equivalence class. Let \mathcal Q</math> be the pointer defined above. Let \mathcal Q'</math> be its upward fulfillment. Pointer \mathcal Q'</math> is the unique upward full pointer of its class, which is contained in any other upward full pointer of this class.

We see that each equivalent class of pointers has two unique pointers: one maximal in the whole class, and one minimal among all upward full pointers.

### Convergent pointers[edit]

A pointer  P {\displaystyle \ {\mathcal {P}}} in a uniform space is said to point to point  x {\displaystyle \ x} if it is equivalent to the pointer of the neighborhoods of  x {\displaystyle \ x} .  When a pointer points to a point then we say that such a pointer id convergent.

* A uniform space is Hausdorff (as a topological space) of and only if no pointer converges to more than one point.

## Complete uniform spaces and completions[edit]

A uniform space is called complete if each pointer of this space is convergent.

Remark In mathematical practice (so far) only Hausdorff complete uniform spaces play an important role; it must be due to the fact that in Hausdorff spaces each pointer points to at the most one point, and to exactly one in the case of a Hausdorff complete space.

For every uniform space  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} its completion is defined as a uniform map  c : X -> X ′ {\displaystyle \ c:X\rightarrow X'} of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} into a Hausdorff complete space  ( X ′ , U ′ ) {\displaystyle \ (X',{\mathcal {U}}')} , which has the following universality property:

for every uniform map  f : X -> Y {\displaystyle \ f:X\rightarrow Y} of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} into a Hausdorff complete space  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} there exists exactly one uniform map  f ′ : X ′ -> Y {\displaystyle \ f':X'\rightarrow Y} of  ( X ′ , U ′ ) {\displaystyle \ (X',{\mathcal {U}}')} into  ( Y , V ) {\displaystyle \ (Y,{\mathcal {V}})} such that  f = f ′ ∘ c {\displaystyle \ f=f'\circ c} .

Theorem For every uniform space ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} there exists a completion  c ′ : X -> X ′ {\displaystyle \ c':X\rightarrow X'} of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} into a Hausdorff complete space  ( X ′ , U ′ ) {\displaystyle \ (X',{\mathcal {U}}')} . Such a completion is unique up to a uniform homeomorphism, meaning that if  c ″ : X -> X ″ {\displaystyle \ c'':X\rightarrow X''} is another completion of  ( X , U ) {\displaystyle \ (X,{\mathcal {U}})} into a Hausdorff complete space  ( X ″ , U ″ ) {\displaystyle \ (X'',{\mathcal {U}}'')} . then there is exactly one uniform homeomorphism  h : X ′ -> X ″ {\displaystyle \ h:X'\rightarrow X''} such that  c ″ = h ∘ c ′ {\displaystyle \ c''=h\circ c'} .

Remark The second part of the theorem, about the uniqueness of the completion (up to a uniform homeomorphism) is an immediate consequence of the definition of the completion (it has a uniqueness statement as its part).