Bourbaki

Exercise 34, § 4

General Topology, IX, p. 110

Bourbaki marks this one as harder than the rest.

a) Let X be a metrizable space, R a closed equivalence relation in X, such that every equivalence class according to R is compact. Then X/R is metrizable (To apply the Nagata-Smirnov theorem (IX, p. 114, exerc. 32), consider a covering R=(Uλ)λ∈L\mathscr{R} = (U_\lambda)_{\lambda \in L} of X formed of open sets saturated for R; show that there exists a sequence (Sn)(\mathscr{S}_n) having the following properties: 1° each Sn\mathscr{S}_n is a locally finite family of open sets in X saturated for R; 2° S=⋃nSn\mathscr{S} = \bigcup_n \mathscr{S}_n is an open covering of X finer than R\mathscr{R}.

For this, provide L with a well ordered set structure; let d be a distance defining the topology of X; for every λ∈L\lambda \in L and every integer n>0n > 0, let Wn,λW_{n,\lambda} be the largest open set saturated for R contained in the set of the x∈Xx \in X such that d(x,X−Uλ)>2−nd(x, X - U_\lambda) > 2^{-n}, Fn,λF_{n,\lambda} the saturated for R of the set of the x∈Xx \in X such that d(x,X−Uλ)≥2−nd(x, X - U_\lambda) \geq 2^{-n}, Gn,λG_{n,\lambda} the set of the x∈Wn,λx \in W_{n,\lambda} such that x∉Fn+1,μx \notin F_{n+1,\mu} for μ<λ\mu < \lambda, Vn,λV_{n,\lambda} the largest open set saturated contained in the set of the y∈Xy \in X such that d(x,Gn,λ)<2−n−3d(x, G_{n,\lambda}) < 2^{-n-3}. Show that the set Sn\mathscr{S}_n of the Vn,λV_{n,\lambda} for λ∈L\lambda \in L answers the question.)

b) Extend the result of a) to the case where one supposes the relation R closed and the space X/R such that every point admits a countable fundamental system of neighbourhoods (cf. IX, p. 96, exerc. 23 b).

c) Let X be a topological space, (Fα)(F_\alpha) a locally finite closed covering of X. Show that if each of the subspaces FαF_\alpha is metrizable, X is metrizable (consider X as quotient space of the topological sum of the F).

d) Show that a paracompact space of which every point has a metrizable neighbourhood is metrizable (apply c)). (Cf. I, p. 114, exerc. 22 b) and IX, p. 113, exerc. 14 b).)

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-6-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.