Skip to article frontmatterSkip to article content

In 1916, Nikolai Lusin asked his student Mikhail Souslin to study a paper by Henri Lebesgue. Souslin found a number of errors, including a lemma that asserted that the projection of a Borel is again Borel. In this lecture we will study the behavior of Borel sets under continuous functions. We will see that on the one hand every Borel set is the continuous image of a closed set, but that on the other hand continuous images of Borel sets are not always Borel.

This gives rise to a new family of sets, the analytic sets, which form a proper superclass of the Borel sets with interesting properties.

Borel sets as continuous images of closed sets

We have seen earlier that every Polish space is the continuous image of Baire space NN\Baire. As we will see now, we can strengthen this result.

We have seen previously that every uncountable Polish space contains a homeomorphic embedding of Cantor space. This was achieved by means of a Cantor scheme. To prove Theorem 1, we take up this idea again and adapt it to Baire space.

To prove the theorem we devise a Lusin scheme on XX such that DD will be closed, and ff will be a surjection, too. This is ensured by the following additional properties.

  • (a) F=XF_\emptyset = X,
  • (b) Each FτF_\tau is Σ20\BS{2},
  • (c) For each τ{}\tau, diam(Fτ)1/2τ\diam(F_\tau) \leq 1/2^{|\tau|},
  • (d) Fτ=iNFτi=iNFτiF_\tau = \bigcup_{i \in \Nat} F_{\tau\Conc \Tup{i}} = \bigcup_{i \in \Nat} \Cl{F_{\tau\Conc \Tup{i}}}.

For this we have to show that every Σ20\BS{2} set FXF \subseteq X can be written, for given ε>0\eps > 0, as F=iNFiF= \bigcup_{i \in \Nat} F_i, where the FiF_i are pairwise disjoint Σ20\BS{2} sets of diameter <ε< \eps so that FiF\Cl{F_i} \subseteq F:

Let F=iNCiF= \bigcup_{i \in \Nat} C_i, where CiC_i is closed, and CiCi+1C_i \subseteq C_{i+1}. Then F=iN(Ci+1Ci)F= \bigcup_{i \in \Nat}(C_{i+1} \setminus C_i).

Let (Un)(U_n) be a covering of XX with open sets of diameter <ε< \eps. Put Dn(i)=Un(Ci+1Ci)D^{(i)}_n = U_n \cap (C_{i+1} \setminus C_i). Then Dn(i)D^{(i)}_n is Δ20\bDelta^0_2. Now let En(i)=Dn(i)(D1(i)Dn1(i))E^{(i)}_n = D^{(i)}_n \setminus (D^{(i)}_1 \cup \dots \cup D^{(i)}_{n-1}).

Then Ci+1Ci=nNEn(i)C_{i+1} \setminus C_i = \bigcup_{n \in \Nat} E^{(i)}_n where the Ej(i)E^{(i)}_j are Σ20\BS{2} sets of diameter <ε<\eps. Therefore,

F=i,nNEn(i)   and   En(i)Ci+1CiCi+1F.F = \bigcup_{i,n\in \Nat} E^{(i)}_n \; \text{ and } \; \Cl{E^{(i)}_n} \subseteq \Cl{C_{i+1} \setminus C_i} \subseteq C_{i+1} \subseteq F.

The mapping ff associated with this Lusin scheme is surjective due to (a) and (d).

Furthermore, the domain DD of ff is closed: Suppose αnD\alpha_n \in D, αnα\alpha_n \to \alpha. We claim f(αn)f(\alpha_n) is Cauchy. For ε>0\eps > 0, there exists NN with diam(FαN)<ε\diam(F_{\alpha\Rest{N}}) < \eps and n0n_0 such that αnN=αN\alpha_n\Rest{N} = \alpha\Rest{N} for all nn0n \geq n_0. Therefore, d(f(αn),f(αm))<εd(f(\alpha_n),f(\alpha_m)) < \eps whenever n,mn0n,m \geq n_0. Since XX is Polish f(αn)yf(\alpha_n) \to y for some yXy \in X. By (d), we have ynFαn=nFαny \in \bigcap_n \Cl{F_{\alpha\Rest{n}}} = \bigcap_n F_{\alpha\Rest{n}}, hence αD\alpha \in D and f(α)=yf(\alpha) = y.

It remains to show that we can extend ff to a continuous surjection g:NNXg: \Baire \to X. Say a closed subset CC of a topological space YY is a retract of YY if there exists a continuous surjection g:YCg: Y \to C such that gC=idg\Rest{C} = \Op{id}.

Proof

Let CNNC \subseteq \Baire be closed, and let TT be a pruned tree such that [T]=C[T] = C. We define a monotone mapping ϕ:N<NT\phi:\Nstr \to T such that ϕ(σ)=σ\phi(\sigma) = \sigma for all σT\sigma \in T. Then the induced (continuous) mapping ϕ:NNC\phi^*: \Baire \to C is the desired retract.

Define ϕ{}\phi by induction. Let ϕ()=\phi(\Estr) = \Estr. Given ϕ(τ)\phi(\tau), let

ϕ(τm)={τm if τmT,any ϕ(τ)kT otherwise.\phi(\tau\Conc\Tup{m}) = \begin{cases} \tau\Conc\Tup{m} & \text{ if } \tau\Conc\Tup{m} \in T,\\ \text{any } \phi(\tau)\Conc\Tup{k} \in T & \text{ otherwise}. \end{cases}

Note that kk must exist since TT is pruned.

If we combine the retract function with ff, we then obtain the desired surjection NNX\Baire \to X. This concludes the proof of Theorem 1.

Refining the topology, we can extend the result from Polish spaces to Borel sets.

Proof

Enlarge the topology O\mathcal{O} of XX to a topology OB\mathcal{O}_B for which BB is clopen. By Mazurkiewicz’s Theorem, (B,OBB)(B,\mathcal{O}_B\Rest{B}) is a Polish space. By the previous theorem, there exists a closed set FNNF \subset \Baire and a continuous bijection f:NN(B,OBB)f:\Baire \to (B,\mathcal{O}_B\Rest{B}). Since OOB\mathcal{O} \subseteq \mathcal{O}_B, f:FBf:F \to B is continuous for O\mathcal{O}, too.

This theorem can be reversed in the following sense.

For a proof (which uses facts about analytic sets), see Kechris (1995) (II.15.1).

Images of Borel sets under arbitrary continuous functions

As announced in the introduction, Borel sets are not closed under arbitrary continuous mappings.

Proof

Let UNN×NN×NNU \subseteq \Baire \times \Baire \times \Baire be NN\Baire-universal for Π10(NN×NN)\BP{1}(\Baire \times \Baire). Define

F:={(α,β) ⁣:γ  (α,γ,β)U}.F:= \{(\alpha,\beta) \colon \exists \gamma \; (\alpha,\gamma,\beta) \in U\}.

We claim that this set is NN\Baire-universal for the set of all continuous images of closed subsets of NN\Baire:

On the one hand FF is a projection of a closed set, and projections are continuous. This implies that all the sets Fβ={α ⁣:(α,β)F}F_\beta = \{ \alpha \colon (\alpha,\beta) \in F \} are continuous images of a closed set.

On the other hand, if f:CNNf: C \to \Baire is continuous with CNNC \subseteq \Baire closed (possibly empty) and f(C)=Af(C) = A, then

αA    γ  (γ,α)Graph(f)    γ  (α,γ)Graph(f1).\alpha \in A \iff \exists \gamma \; (\gamma,\alpha) \in \Op{Graph}(f) \iff \exists \gamma \; (\alpha,\gamma) \in \Op{Graph}(f^{-1}).

Since ff is continuous, Graph(f)\Op{Graph}(f) and hence also Graph(f1)\Op{Graph}(f^{-1}) are closed subsets of NN×NN\Baire \times \Baire. Thus, by the universality of UU, there exists β{}\beta such that

Graph(f1)=Uβ={(α,γ) ⁣:(α,γ,β)U},\Op{Graph}(f^{-1}) = U_\beta = \{ (\alpha,\gamma) \colon (\alpha,\gamma,\beta) \in U \},

and hence

A=Fβ.A = F_\beta.

FF cannot be Borel: Otherwise DF={α ⁣:(α,α)∉F}D_F = \{\alpha \colon (\alpha,\alpha) \not\in F \} were Borel. By Corollary 1, every Borel set is the image of a closed set under a continuous mapping. This implies that DF=FβD_F = F_\beta. But then

βDF    βFβ    (β,β)F    β∉DF,\beta \in D_F \iff \beta \in F_\beta \iff (\beta,\beta) \in F \iff \beta \not\in D_F,

contradiction.

References
  1. Kechris, A. S. (1995). Classical Descriptive Set Theory. Springer.