uniformities on a set form a complete lattice
Theorem.
The collection of uniformities on a given set ordered by set inclusion forms a complete lattice
.
Proof.
Let be a set. Let denote the collection of uniformities on . The coarsest uniformity on is , and the finest is the discrete uniformity:
Hence is bounded. To show that is complete
, we must prove that it has the least upper bound property.
Suppose is a nonempty family of uniformities on . Let consist of all finite intersections of elements of the . Let us check that is a fundamental system of entourages for a uniformity on .
(B1) Let , . Each of and is a finite intersection of elements of the , so their intersection is as well. Hence .
(B2) Every element of is a finite intersection of subsets of containing . So every element of contains the diagonal.
(B3) Let . Without loss of generality, , where and . Since , . Similarly, . Since the process of taking the inverse of a relation
commutes with taking finite intersections, .
(B4) Let . Again suppose with and . Then there exist and such that and . The set is in , and since is a subset of both and , it is a subset of .
The fundamental system generates a uniformity . By construction, is an upper bound of the . But any upper bound of the would have to contain all finite intersections of elements of the . So .∎
This theorem is useful because it allows us to assert the existence of the coarsest uniform space satisfying a particular property.
Corollary.
Let be a set and let be a family of uniform spaces. Then for any family of functions , there is a coarsest uniformity on making all the uniformly continous.
The coarsest uniformity making a family of functions uniformly continuous is called the initial uniformity or weak uniformity.
References
- 1 Nicolas Bourbaki, Elements of Mathematics: General Topology: Part 1, Hermann, 1966.