Bourbaki

Proposition 8

Tag 021G, permanent. Cite it as [Bourbaki, Tag 021G].

Topologie algébrique, chapter IV, § 2. Groupes de Poincaré des espaces délaçables

Let P be a nonempty Polish topological space and let R be an equivalence relation in P whose graph is a meagre subset of P×PP\times P. There exists a continuous injective mapping of the set {0,1}N\{0,1\}^{\mathbf{N}}, endowed with the product topology of the discrete topologies, into P whose image meets each equivalence class with respect to R in at most one point.

Let the space P be endowed with a metric dd compatible with its topology for which it is complete. Let (An)n∈N(A_n)_{n\in\mathbf{N}} be an increasing sequence of closed subsets of P×PP\times P, with empty interiors, such that the graph ΓR\Gamma_R of the relation R is contained in the union of the AnA_n.

Let O\mathscr{O} be the set of nonempty open subsets of P. We shall construct by induction a sequence (fn)n∈N(f_n)_{n\in\mathbf{N}}, where for every nn, fnf_n is a mapping of {0,1}n\{0,1\}^n into O\mathscr{O}, satisfying the following properties :

(i) For every n⩾1n\geqslant 1, every x∈{0,1}n−1x\in \{0,1\}^{n-1} and every t∈{0,1}t\in \{0,1\}, the closure of the open set fn(x,t)f_n(x, t) is contained in fn−1(x)f_{n-1}(x);

(ii) For every x∈{0,1}nx\in \{0,1\}^n, one has diam(fn(x)f_n(x))⩽2−n\leqslant 2^{-n};

(iii) For every n⩾1n\geqslant 1 and every pair (x,x′)(x, x') of distinct elements of {0,1}n,fn(x)×fn(x′)\{0,1\}^n,f_n(x)\times f_n(x') does not meet An−1A_{n-1}.

Choose a nonempty open set U of X of diameter ⩽1\leqslant 1 and define f0f_0 as the constant mapping with image {U}\{U\}. Suppose that the mappings f0,...,fnf_0, . . . , f_n have been constructed.

Let p:{0,1}n+1→{0,1}np:\{0,1\}^{n+1}\rightarrow \{0,1\}^n be the mapping defined by p(x0,...,xn)=p(x_0, . . . , x_n) = (x0,...,xn−1)(x_0, . . . , x_{n-1}). By lemma 3 above, applied to the family of open sets (fn(p(x)))(f_n(p(x))) for x∈{0,1}n+1x\in \{0,1\}^{n+1} and to the dense open set ∁An\complement A_n of P×PP\times P, there exists a family (g(x))x∈{0,1}n+1(g(x))_{x\in \{0,1\}^{n+1}} of nonempty open sets of P such that g(x)⊂fn(p(x))g(x)\subset f_n(p(x)) for every xx and such that (g(x)×g(x′))∩An(g(x)\times g(x'))\cap A_n be empty for every pair (x,x′)(x, x') of distinct elements of {0,1}n+1\{0,1\}^{n+1}. One then defines the mapping fn+1f_{n+1} by choosing, for each element x∈{0,1}n+1x\in \{0,1\}^{n+1}, a nonempty open subset of g(x)g(x) whose diameter is ⩽2−n−1\leqslant 2^{-n-1} and whose closure is contained in g(x)g(x).

For every element x=(xn)n∈Nx= (x_n)_{n\in\mathbf{N}} of {0,1}N\{0,1\}^{\mathbf{N}}, the sequence of sets (fn(x0,...,xn−1))n∈N(f_n(x_0, . . . , x_{n-1}))_{n\in\mathbf{N}} is a decreasing sequence of open subsets of X each of which contains the closure of the next and whose diameter tends to 0; the intersection of this sequence of sets is therefore reduced to a point (TG, II, p. 15), which we denote by f(x)f(x). If two points x,x′x,x' of {0,1}N\{0,1\}^{\mathbf{N}} satisfy xi=xi′x_i=x'_i for i⩽ni\leqslant n, one has d(f(x),f(x′))⩽2−nd(f(x), f(x'))\leqslant 2^{-n}. Consequently, the mapping f:{0,1}N→Pf:\{0,1\}^{\mathbf{N}}\rightarrow P is continuous. Let xx and x′x' be distinct elements of {0,1}N\{0,1\}^{\mathbf{N}}. For n∈Nn\in \mathbf{N} such that (x0,...,xn)≠(x_0, . . . , x_n)=\not (x0′,...,xn′)(x'_0, . . . , x'_n), the open set fn+1(x0,...,xn)×fn+1(x0′,...,xn′)f_{n+1}(x_0, . . . , x_n)\times f_{n+1}(x'_0, . . . , x'_n) is disjoint from AnA_n, by definition of fn+1f_{n+1}, hence the pair (f(x),f(x′))(f(x), f(x')) does not belong to AnA_n. It follows that f(x)f(x) and f(x′)f(x') are not equivalent for the relation R. Consequently, ff is injective and its image meets each equivalence class for R in at most one point. The proposition is thus proved.

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Machine translation of the English, by gpt-5.4, against glossary version 34. Not checked by a person.