Bourbaki

Definition 2

Tag 0BD2, permanent. Cite it as [Bourbaki, Tag 0BD2].

General Topology, chapter II, § 1. Uniform spaces

A fundamental system of entourages of a uniformity is any set B\mathfrak{B} of entourages such that every entourage contains a set belonging to B\mathfrak{B}.

Axiom (U_{III}) shows that if nn is any integer >0> 0 and VV runs through a fundamental system of entourages, then the sets V‾n\overline{V}^n again form a fundamental system of entourages.

Entourages VV such that V=V‾1V = \overline{V}^1 are called symmetric. If VV is any entourage, then V∩V‾1V \cap \overline{V}^1 and V∪V‾1V \cup \overline{V}^1 are symmetric entourages, and axioms (F_{II}) and (U_{II}) show that the symmetric entourages form a fundamental system of entourages.

A set B\mathfrak{B} of subsets of X×XX \times X is a fundamental system of entourages of a uniformity on XX if and only if B\mathfrak{B} satisfies axiom (B_I) of Chapter I, § 6, no. 3, and also satisfies the following axioms:

(U'_I) Every set of B\mathfrak{B} contains the diagonal Δ\Delta.

(U'_II) For each V∈BV \in \mathfrak{B} there exists V′∈BV' \in \mathfrak{B} such that V′⊂V‾1V' \subset \overline{V}^1.

(U'_III) For each V∈BV \in \mathfrak{B} there exists W∈BW \in \mathfrak{B} such that W‾2⊂V\overline{W}^2 \subset V.

If XX is not empty, a fundamental system of entourages of a uniform structure on XX is a base of the filter formed by the entourages of this structure (Chapter I, § 6, no. 3, Proposition 3).

(*) We recall (Set Theory, R, § 3, nos. 4 and 10) that if VV and WW are two subsets of X×XX \times X, then the set of pairs (x,y)∈X×X(x, y) \in X \times X, such that (x,z)∈W(x, z) \in W and (z,y)∈V(z, y) \in V for some z∈Xz \in X, is denoted by V∘WV \circ W or VWVW, and that the set of pairs (x,y)∈X×X(x, y) \in X \times X such that (y,x)∈V(y, x) \in V is denoted by V‾1\overline{V}^1.

Examples of uniformities. \* 1) On the set R\mathbf{R} of real numbers we can define a uniformity, called the additive uniformity, as follows: for each α>0\alpha > 0 let VαV_\alpha be the subset of R×R\mathbf{R} \times \mathbf{R} consisting of all pairs (x,y)(x, y) such that ∣x−y∣<α|x - y| < \alpha; as α\alpha runs through the set of all real numbers >0> 0, the VαV_\alpha form a fundamental system of entourages for the additive uniformity on R\mathbf{R}. Similarly we can define a uniformity (again called the additive uniformity) on the set Q\mathbf{Q} of rational numbers; we shall study these structures, and analogous uniform structures on groups, in Chapters III and IV. \* 2) Let XX be a set and let RR be an equivalence relation on XX; let CC be the graph of RR in X×XX \times X. Then Δ⊂C\Delta \subset C and C2=C−1=C\overset{2}{C} = \overset{-1}{C} = C; (Set Theory, R, § 5, no. 1); the set of subsets of X×XX \times X which consists of the set CC alone is therefore a fundamental system of entourages of a uniformity on XX. In particular, if we take RR to be the relation of equality, then C=ΔC = \Delta and the entourages of the corresponding uniformity are all the subsets of X×XX \times X which contain Δ\Delta; this uniformity is called the discrete uniformity on XX, and the set XX endowed with this uniformity is called a discrete uniform space. 3) On the set Z\mathbf{Z} of rational integers we can define a uniformity, important in the theory of numbers, as follows: given a prime number pp, let WnW_n be the set of all pairs (x,y)∈Z×Z(x, y) \in \mathbf{Z} \times \mathbf{Z} such that x≡y(modpn)x \equiv y \pmod{p^n}, for each integer n>0n > 0. It is easily verified that the sets WnW_n (for a fixed pp) form a fundamental system of entourages of a uniformity on Z\mathbf{Z}, called the pp-adic uniformity (cf. Chapter III, § 6, Exercises 23 ff., and Chapter IX, § 3, no. 2).

In accordance with the general definitions (Set Theory, R, § 8, no. 5), if XX and X′X' are two sets each endowed with uniformities whose sets of entourages are UU and U′U' respectively, then a bijection ff of XX onto X′X' is an isomorphism of the uniformity of XX onto that of X′X' if g(U)=U′g(U) = U', where g=f×fg = f \times f.

For example, if XX and X′X' are two equipotent sets, then every bijection of XX onto X′X' is an isomorphism of the discrete uniformity of XX onto the discrete uniformity of X′X'.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed volume. Not translated.