1 Introduction
There are three classical results in the theory of selection theorems that we would like to focus on. The first one is due to Michael [Reference Michael22].
Zero-dimensional Michael selection theorem. Let
$X$
be a paracompact Hausdorff space with
$\operatorname{dim}(X)=0$
,
$Y$
a completely metrizable space and
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{Y}\setminus \{\emptyset \}$
a lower semicontinuous multifunction such that
$\unicode[STIX]{x1D6F7}(x)$
is a closed subset of
$Y$
for all
$x\in X$
. Then there exists a continuous
$\unicode[STIX]{x1D719}:X\rightarrow Y$
such that
$\unicode[STIX]{x1D719}(x)\in \unicode[STIX]{x1D6F7}(x)$
for all
$x\in X$
.
The second theorem is due to Kuratowski and Ryll-Nardzewski [Reference Kuratowski and Ryll-Nardzewski17], and we can think of it as the measurable version of Michael’s zero-dimensional theorem.
Kuratowski–Ryll-Nardzewski selection theorem. Let
$(X,\unicode[STIX]{x1D6F4})$
be a measurable space,
$Y$
a Polish space and
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{Y}\setminus \{\emptyset \}$
a multifunction such that
$\{x\in X:\unicode[STIX]{x1D6F7}(x)\cap U\neq \emptyset \}$
belongs to
$\unicode[STIX]{x1D6F4}$
for each
$U\subseteq Y$
open and
$\unicode[STIX]{x1D6F7}(x)$
is a closed subset of
$Y$
for all
$x\in X$
. Then there exists a
$\unicode[STIX]{x1D6F4}$
-measurable
$\unicode[STIX]{x1D719}:X\rightarrow Y$
such that
$\unicode[STIX]{x1D719}(x)\in \unicode[STIX]{x1D6F7}(x)$
for all
$x\in X$
.
The third theorem (for the purpose of this paper it will be called the selection theorem for hyperspaces), which is a solution to the so-called hyperspace selection problem, was proved independently by Choban [Reference Choban4] and Engelking, Heath and Michael [Reference Engelking, Heath and Michael9].
Selection theorem for hyperspaces. Let
$X$
be a completely metrizable space with
$\operatorname{dim}(X)=0$
and
${\mathcal{F}}(X)$
the family of all non-empty closed subsets of
$X$
equipped with the Vietoris topology. Then there exists a continuous
$\unicode[STIX]{x1D719}:{\mathcal{F}}(X)\rightarrow X$
such that
$\unicode[STIX]{x1D719}(A)\in A$
for all
$A\in {\mathcal{F}}(X)$
.
This result, as Michael [Reference Michael20] first observed, yields a selection theorem for continuous multifunctions (for more details see §6.3).
So, roughly speaking, these three selection theorems cover three basic types of “measurability” in multifunctions: lower semicontinuous, measurable, and continuous multifunctions. The purpose of this paper is to provide a unified approach, based on methods of descriptive set theory, that gives new proofs of those three theorems.
There have been other unified approaches: Maitra and Rao [Reference Maitra and Rao19] and Mägerl [Reference Mägerl18] proved general theorems that include as special cases the zero-dimensional Michael selection theorem and the Kuratowski–Ryll-Nardzewski selection theorem. They also share the same strategy with the original proofs of Michael and Kuratowski–Ryll-Nardzewski; that is, the selection is defined as the uniform limit of an appropriate sequence of functions.
In our approach we follow a different strategy. There is a standard technique in descriptive set theory by which we can embed every compact metrizable zero-dimensional space in the Cantor space
$\{0,1\}^{\unicode[STIX]{x1D714}}$
, or every Polish zero-dimensional space in the Baire space
$\unicode[STIX]{x1D714}^{\unicode[STIX]{x1D714}}$
(see, for example, [Reference Kechris16, Theorems 7.4 and 7.7]). Arvanitakis [Reference Arvanitakis3], combining elements of this technique with ideas from the study of regular averaging and regular extension operators (see [Reference Argyros and Arvanitakis2, Reference Ditor6, Reference Ditor and Haydon7, Reference Haydon13, Reference Haydon14]), gave a simultaneous selection theorem, which could be seen in the context of convex-valued selection theorems (see also [Reference Valov27, Reference Yamauchi29]). In this paper, using the aforementioned language and ideas of descriptive set theory (Kechris [Reference Kechris16]), we adjust the approach of Arvanitakis [Reference Arvanitakis3] in order to provide another unified method of constructing continuous and measurable selections.
Let us outline our approach. Assume for simplicity that space
$Y$
is the Cantor space
$\{0,1\}^{\unicode[STIX]{x1D714}}$
. Let also
$\{V_{t}:t\in \{0,1\}^{{<}\unicode[STIX]{x1D714}}\}$
be the usual clopen base for the topology of
$\{0,1\}^{\unicode[STIX]{x1D714}}$
. There are two well-known useful facts concerning the structure of
$\{V_{t}:t\in \{0,1\}^{{<}\unicode[STIX]{x1D714}}\}$
. The first is that
The second is that for each
$b\in \{0,1\}^{\unicode[STIX]{x1D714}}$
we have
Assume now that
$X$
is a non-empty set,
$\unicode[STIX]{x1D6F4}$
a family of subsets of
$X$
and
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{Y}\setminus \{\emptyset \}$
a multifunction such that
$\{x\in X:\unicode[STIX]{x1D6F7}(x)\cap U\neq \emptyset \}\in \unicode[STIX]{x1D6F4}$
for each
$U\subseteq Y$
open and
$\unicode[STIX]{x1D6F7}(x)$
is a closed subset of
$Y$
for all
$x\in X$
. If we set
it is easy to see that
$U_{t}\in \unicode[STIX]{x1D6F4}$
for all
$t\in \{0,1\}^{{<}\unicode[STIX]{x1D714}}$
and, moreover,
In our method the existence of a
$\unicode[STIX]{x1D6F4}$
-measurable selection (a map
$\unicode[STIX]{x1D719}:X\rightarrow Y$
such that
$\unicode[STIX]{x1D719}(x)\in \unicode[STIX]{x1D6F7}(x)$
for all
$x\in X$
and
$\unicode[STIX]{x1D719}^{-1}(V)\in \unicode[STIX]{x1D6F4}$
for all
$V\subseteq Y$
open) relies on the ability of constructing a family
$\{G_{t}:t\in \{0,1\}^{{<}\unicode[STIX]{x1D714}}\}$
such that for all
$t$
:
(i)
$G_{t}\in \unicode[STIX]{x1D6F4}$
;(ii)
$G_{\emptyset }=X$
and
$\{G_{s}:s\text{ successor of }t\}$
is a pairwise disjoint cover of
$G_{t}$
;(iii)
$G_{t}\subseteq U_{t}$
.
In this situation, (ii) gives that for each
$x\in X$
there is a unique
$b_{x}\in \{0,1\}^{\unicode[STIX]{x1D714}}$
such that
$x\in \bigcap _{n\in \unicode[STIX]{x1D714}}G_{b_{x}|n}$
. Then
$\unicode[STIX]{x1D719}:X\rightarrow Y$
defined by
$\{\unicode[STIX]{x1D719}(x)\}=\bigcap _{n\in \unicode[STIX]{x1D714}}V_{b_{x}|n}=\{b_{x}\}$
is a selection of
$\unicode[STIX]{x1D6F7}$
, since from (iii) we have
$\unicode[STIX]{x1D6F7}(x)\cap V_{b_{x}|n}\neq \emptyset$
for all
$n\in \unicode[STIX]{x1D714}$
. Moreover, if
$\unicode[STIX]{x1D6F4}$
is closed under countable unions, then the fact that
$\{V_{b|n}:n\in \unicode[STIX]{x1D714}\}$
is a neighborhood base at
$b$
for each
$b\in \{0,1\}^{\unicode[STIX]{x1D714}}$
implies that
$\unicode[STIX]{x1D719}$
is
$\unicode[STIX]{x1D6F4}$
-measurable.
This approach is presented in a general form in Theorem 4.2. With this theorem we give new proofs of the zero-dimensional Michael selection theorem (§6.1) and the Kuratowski–Ryll-Nardzewski selection theorem (§6.2). Along with these proofs we give new characterizations for the existence of continuous and measurable selections. The core of Theorem 4.2 is also used to obtain an elementary proof of the selection theorem for hyperspaces (§6.3).
Finally, we would like to mention that, to the best of our knowledge, our approach shares some similar ideas with [Reference Choban4, Reference Gutev10, Reference Michael23] in the context of multivalued selection theorems.
2 Preliminaries and notation
2.1 Some topological terminology
We begin by fixing some topological terminology; for reference see [Reference Engelking8, Reference Willard28]. Let
$X$
be a topological space and
$A\subseteq X$
. The closure of
$A$
in
$X$
will be denoted by
$\overline{A}$
or
$\operatorname{cl}_{X}(A)$
, whereas the interior of
$A$
in
$X$
will be denoted by
$\text{int}_{X}(A)$
.
Let
$\{W_{i}\}_{i\in I}$
be a cover of
$X$
. We say that
$\{G_{i}\}_{i\in I}$
is a precise refinement of
$\{W_{i}\}_{i\in I}$
(or that
$\{W_{i}\}_{i\in I}$
has a precise refinement
$\{G_{i}\}_{i\in I}$
), if
$\{G_{i}\}_{i\in I}$
is a cover of
$X$
and
$G_{i}\subseteq W_{i}$
for all
$i\in I$
;
$\{G_{i}\}_{i\in I}$
is a disjoint precise refinement of
$\{W_{i}\}_{i\in I}$
if, in addition,
$\{G_{i}\}_{i\in I}$
is a pairwise disjoint family.
$X$
will be called zero-dimensional, if there exists a base for the topology of
$X$
consisting of clopen sets;
$\operatorname{dim}(X)=0$
concerns the covering dimension of a normal space.
2.2 Multifunctions
Secondly we fix the notation and terminology about multifunctions; many of them can be found in [Reference Aliprantis and Border1, Reference Denkowski, Migórski and Papageorgiou5, Reference Hu and Papageorgiou15, Reference Repovs̆ and Semenov25].
Let
$X$
,
$Y$
be non-empty sets. By
$2^{Y}$
we denote the set of all subsets of
$Y$
and by
$2^{Y}\setminus \{\emptyset \}$
the set of all non-empty subsets of
$Y$
. A function
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{Y}$
will be called multifunction.
If
$Y$
is equipped with a topology, we denote by
${\mathcal{F}}(Y)$
the set of all non-empty closed subsets of
$Y$
and by
${\mathcal{K}}(Y)$
the set of all non-empty compact subsets of
$Y$
. A multifunction
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
will be called closed-valued; if
${\mathcal{K}}(Y)$
is instead of
${\mathcal{F}}(Y)$
, then the multifunction will be called compact-valued.
We say that
$\unicode[STIX]{x1D719}:X\rightarrow Y$
is a selection of
$\unicode[STIX]{x1D6F7}$
, if
$\unicode[STIX]{x1D719}(x)\in \unicode[STIX]{x1D6F7}(x)$
for all
$x\in X$
. In the case where there exists such a
$\unicode[STIX]{x1D719}$
, we also say that
$\unicode[STIX]{x1D6F7}$
admits a single-valued selection (we often use the term “single-valued” to make a distinction from selections that are multifunctions).
Let
$W$
be a subset of
$Y$
. The lower inverse image of
$W$
under
$\unicode[STIX]{x1D6F7}$
is defined as
whereas the upper inverse image of
$W$
under
$\unicode[STIX]{x1D6F7}$
is defined as
If
$X$
and
$Y$
are equipped with a topology, we say that
$\unicode[STIX]{x1D6F7}$
is lower semicontinuous (and we use the abbreviation “lsc”) if
$\unicode[STIX]{x1D6F7}^{l}(U)$
is open in
$X$
for every
$U\subseteq Y$
open. Respectively,
$\unicode[STIX]{x1D6F7}$
is upper semicontinuous (and we use the abbreviation “usc”) if
$\unicode[STIX]{x1D6F7}^{u}(U)$
is open in
$X$
for every
$U\subseteq Y$
open, equivalently, if
$\unicode[STIX]{x1D6F7}^{l}(F)$
is closed in
$X$
for every
$F\subseteq Y$
closed. Finally,
$\unicode[STIX]{x1D6F7}$
is continuous if and only if it is both lsc and usc.
More generally, let
$\unicode[STIX]{x1D6F4}\subseteq 2^{X}$
and
$Y$
be a topological space. We say that
$\unicode[STIX]{x1D6F7}$
is
$\unicode[STIX]{x1D6F4}$
-measurable if
$\unicode[STIX]{x1D6F7}^{l}(U)\in \unicode[STIX]{x1D6F4}$
for every
$U\subseteq Y$
open. Similarly, a function
$\unicode[STIX]{x1D719}:X\rightarrow Y$
is
$\unicode[STIX]{x1D6F4}$
-measurable if
$\unicode[STIX]{x1D719}^{-1}(U)\in \unicode[STIX]{x1D6F4}$
for every
$U\subseteq Y$
open. Obviously, semicontinuous multifunctions and continuous selections are special cases of measurable multifunctions and measurable selections respectively, so the term “measurable” will often be used in general.
2.3 Trees
Trees are the basic tool in our method of constructing single-valued selections. In this subsection we mainly follow [Reference Kechris16] for the necessary terminology.
Let
$A$
be a non-empty set. We set
$A^{{<}\unicode[STIX]{x1D714}}=\bigcup _{n<\unicode[STIX]{x1D714}}A^{n}$
and
$A^{{\leqslant}\unicode[STIX]{x1D714}}=\bigcup _{n\leqslant \unicode[STIX]{x1D714}}A^{n}$
and we follow the convention
$A^{0}=\{\emptyset \}$
. We define a partial order
$\sqsubseteq$
on
$A^{{\leqslant}\unicode[STIX]{x1D714}}$
as follows:
$t\sqsubseteq s$
if and only if there exists
$n\leqslant \unicode[STIX]{x1D714}$
so that
$t=s|n$
, where
$s|n=(s(0),\ldots ,s(n-1))$
denotes the restriction of the function
$s$
on the domain
$n=\{0,1,\ldots ,n-1\}$
; we also make the convention that
$s|0=\emptyset$
for all
$s\in A^{{\leqslant}\unicode[STIX]{x1D714}}$
. The corresponding strict partial order is denoted by
$\sqsubset$
. For
$t,s\in A^{{<}\unicode[STIX]{x1D714}}$
with
$t\sqsubseteq s$
, we say that
$t$
is a predecessor of
$s$
or
$s$
is a successor of
$t$
. The height of
$t\in A^{{\leqslant}\unicode[STIX]{x1D714}}$
, denoted by
$|t|$
, is defined as the
$n\leqslant \unicode[STIX]{x1D714}$
such that
$t\in A^{n}$
.
Let
$T$
be a non-empty subset of
$A^{{<}\unicode[STIX]{x1D714}}$
. We say that
$T$
is a tree (on
$A$
of
$\unicode[STIX]{x1D714}$
height), if it is closed under predecessors. Since a tree
$T$
is by definition non-empty and closed under predecessors, we have
$\emptyset \sqsubseteq t$
for all
$t\in A^{{<}\unicode[STIX]{x1D714}}$
, and thus,
$\emptyset \in T$
; in the present setting
$T$
is always a rooted tree. Moreover, we say that
$T^{\prime }$
is a subtree of
$T$
, if
$T^{\prime }\subseteq T$
and
$T^{\prime }$
is a tree (on
$A$
).
For
$n\leqslant \unicode[STIX]{x1D714}$
the
$n$
-level of
$T$
is defined as
$T^{n}=\{t\in T:|t|=n\}$
. The height of
$T$
, denoted by
$ht(T)$
, is defined as the least ordinal
$n\leqslant \unicode[STIX]{x1D714}$
such that
$T^{n}=\emptyset$
.
For each
$t\in T$
we define the set of all immediate successors of
$t$
as
If
$k$
is a cardinal, we say that
$T$
is
$k$
-branching if the cardinality of
$\operatorname{succ}(t)$
, denoted by
$|\text{succ}(t)|$
, is strictly less than
$k$
for all
$t\in T$
; an
$\aleph _{1}$
-branching tree will be called countably branching; an
$\aleph _{0}$
-branching tree will be called finitely branching.
We say that
$T$
is pruned, if
$\operatorname{succ}(t)\neq \emptyset$
for all
$t\in T$
; it is easy to observe that a pruned tree
$T$
has height equal to
$\unicode[STIX]{x1D714}$
.
Finally, the body of a pruned tree
$T$
is defined as
which is obviously non-empty.
2.4 Topology on the bodies of trees
Finally, we are going to briefly recall the usual topology on the bodies of pruned trees.
First of all, if
$T$
is a pruned tree on
$A$
, for each
$t\in T$
we define
We assume that
$A$
is equipped with the discrete topology and
$A^{\unicode[STIX]{x1D714}}$
with the product topology.
$[T]$
is equipped with the relative topology induced by
$A^{\unicode[STIX]{x1D714}}$
and
$\{V_{t}:t\in T\}$
is a base for
$[T]$
consisting of clopen sets.
Evidently
$[T]$
is completely metrizable;
$[T]$
is Polish in the case where
$T$
is countably branching. It is easy to see that
$\operatorname{dim}([T])=0$
(thus,
$[T]$
is also zero-dimensional). Moreover, it is known that a non-empty
$F\subseteq A^{\unicode[STIX]{x1D714}}$
is closed if and only if there exists a pruned tree
$T$
on
$A$
such that
$F=[T]$
; a non-empty
$K\subseteq A^{\unicode[STIX]{x1D714}}$
is compact if and only if there exists a finitely branching pruned tree
$T$
on
$A$
such that
$K=[T]$
. For more details we refer to [Reference Kechris16, Chs. I-2 and I-4].
3 Tree schemes
Considering the notions of Cantor and Lusin schemes in descriptive set theory (see [Reference Kechris16, Definitions 6.1 and 7.5]), we give the following definitions.
Definition 3.1. A tree scheme on a non-empty set
$X$
is a family
$(W_{t})_{t\in T}$
of subsets of
$X$
such that:
(i)
$T$
is a pruned tree;(ii)
$W_{\emptyset }=X$
and
$W_{t}=\bigcup \{W_{s}:s\in \operatorname{succ}(t)\}$
for all
$t\in T$
.
Definition 3.2. Let
$(W_{t})_{t\in T}$
be a tree scheme on a non-empty set
$X$
.
(i) If
$\unicode[STIX]{x1D6F4}\subseteq 2^{X}$
and
$(W_{t})_{t\in T}\subseteq \unicode[STIX]{x1D6F4}$
, then we say that
$(W_{t})_{t\in T}$
is a
$\unicode[STIX]{x1D6F4}$
tree scheme.In the case where
$X$
is a topological space, we use the following alternative terminology: if
$\unicode[STIX]{x1D6F4}$
is the family of open subsets of
$X$
, we say that
$(W_{t})_{t\in T}$
is an open tree scheme; if
$\unicode[STIX]{x1D6F4}$
is the family of closed subsets of
$X$
, we say that
$(W_{t})_{t\in T}$
is a closed tree scheme; if
$\unicode[STIX]{x1D6F4}$
is the family of clopen subsets of
$X$
, we say that
$(W_{t})_{t\in T}$
is a clopen tree scheme.If
${\mathcal{A}}\subseteq 2^{\unicode[STIX]{x1D6F4}}$
and
$\{W_{s}:s\in \operatorname{succ}(t)\}\in {\mathcal{A}}$
for all
$t\in T$
, then we say that
$(W_{t})_{t\in T}$
is an
${\mathcal{A}}$
tree scheme. For example,
${\mathcal{A}}$
could stand for the collection of point-finite families of open subsets of
$X$
.(ii)
$(W_{t})_{t\in T}$
is said to be disjoint, if
$\{W_{s}:s\in \operatorname{succ}(t)\}$
is a pairwise disjoint family for all
$t\in T$
.(iii)
$(W_{t})_{t\in T}$
is said to be point-finite, if
$\{W_{s}:s\in \operatorname{succ}(t)\}$
is point-finite in
$W_{t}$
for each
$t\in T$
.(iv) We say that
$(G_{t})_{t\in T}$
is a precise refinement of
$(W_{t})_{t\in T}$
(or that
$(W_{t})_{t\in T}$
has a precise refinement
$(G_{t})_{t\in T}$
), if
$(G_{t})_{t\in T}$
is a tree scheme on
$X$
and
$\{G_{t}:|t|=n\}$
is a precise refinement of
$\{W_{t}:|t|=n\}$
for each
$n\in \unicode[STIX]{x1D714}$
.(v) If
$X$
is a topological space, then
$(W_{t})_{t\in T}$
is said to be locally finite, if
$\{W_{s}:s\in \operatorname{succ}(t)\}$
is locally finite in the subspace
$W_{t}$
for each
$t\in T$
.
In the next lemma we prove some basic properties concerning tree schemes, which reveal their convenient structure; roughly speaking, a tree scheme decomposes the space in a “uniform” way.
Lemma 3.3. Let
$(W_{t})_{t\in T}$
be a tree scheme on a non-empty set
$X$
. Then the following conditions are satisfied.
(i)
$W_{s}\subseteq W_{t}$
for all
$t\sqsubseteq s$
.(ii) For every
$x\in X$
there exists
$b_{x}\in [T]$
such that
$x\in \bigcap _{n\in \unicode[STIX]{x1D714}}W_{b_{x}|n}$
. Moreover, if
$(W_{t})_{t\in T}$
is disjoint, then
$b_{x}$
is unique.(iii)
$\{W_{t}:|t|=n\}$
is a cover of
$X$
for all
$n\in \unicode[STIX]{x1D714}$
. Moreover, if
$(W_{t})_{t\in T}$
is disjoint, then
$\{W_{t}:|t|=n\}$
is a pairwise disjoint cover of
$X$
for all
$n\in \unicode[STIX]{x1D714}$
.(iv)
$(W_{t})_{t\in T}$
is point-finite if and only if
$\{W_{t}:|t|=n\}$
is point-finite in
$X$
for all
$n\in \unicode[STIX]{x1D714}$
.(v) If
$X$
is a topological space and
$(W_{t})_{t\in T}$
is closed, then
$(W_{t})_{t\in T}$
is locally finite if and only if
$\{W_{t}:|t|=n\}$
is locally finite in
$X$
for all
$n\in \unicode[STIX]{x1D714}$
.
Proof. (i) We are going to proceed by induction. Obviously
$W_{s}\subseteq W_{t}$
for all
$t\sqsubset s$
with
$|s|=|t|$
. By definition of the tree scheme we have that
$W_{s}\subseteq W_{t}$
for all
$t\sqsubset s$
with
$|s|=|t|+1$
. Suppose that for
$n\in \unicode[STIX]{x1D714}$
we have
$W_{s}\subseteq W_{t}$
for all
$t\sqsubset s$
with
$|s|=|t|+n$
. Let
$t\sqsubset s$
with
$|s|=|t|+n+1$
. There is
$r\in T$
such that
$t\sqsubset r\sqsubset s$
,
$|r|=|t|+n$
and
$|s|=|r|+1$
, and thus,
$W_{r}\subseteq W_{t}$
and
$W_{s}\subseteq W_{r}$
, and this completes the inductive step.
(ii) Let
$x\in X$
. We set
$t_{x}^{0}=\emptyset$
. Suppose that there is
$t_{x}^{n}\in T^{n}$
with
$x\in W_{t_{x}^{n}}$
. There is
$s\in \operatorname{succ}(t_{x}^{n})$
such that
$x\in W_{s}$
. We set
$t_{x}^{n+1}=s$
. Thus, we can recursively define an increasing (with respect to
$\sqsubset$
) sequence
$\{t_{x}^{n}\}_{n\in \unicode[STIX]{x1D714}}$
such that
$|t_{x}^{n}|=n$
and
$x\in W_{t_{x}^{n}}$
for all
$n\in \unicode[STIX]{x1D714}$
. We conclude the result by defining
$b_{x}=\bigcup _{n\in \unicode[STIX]{x1D714}}t_{x}^{n}$
.
Now let us examine the uniqueness of
$b_{x}$
in the case where
$(W_{t})_{t\in T}$
is disjoint. Suppose that there exist
$b_{x}\neq b_{x}^{\prime }\in [T]$
such that
$x\in \bigcap _{n\in \unicode[STIX]{x1D714}}W_{b_{x}|n}$
and
$x\in \bigcap _{n\in \unicode[STIX]{x1D714}}W_{b_{x}^{\prime }|n}$
. There is a minimum
$n\in \unicode[STIX]{x1D714}$
such that
$b_{x}|n\neq b_{x}^{\prime }|n$
, so
$W_{b_{x}|n}\cap W_{b_{x}^{\prime }|n}=\emptyset$
, which is a contradiction.
(iii) Follows easily from (ii).
(iv) Let
$(W_{t})_{t\in T}$
be point-finite; the inverse direction is obvious. We are going to proceed by induction. Firstly,
$\{W_{t}:|t|=0\}$
is point-finite in
$X$
. Suppose that
$\{W_{t}:|t|=n\}$
is point-finite in
$X$
for some
$n\in \unicode[STIX]{x1D714}$
. If
$x$
belongs to infinitely many elements of
$\{W_{t}:|t|=n+1\}$
, then there should be
$t\in T^{n}$
such that
$x\in W_{t}$
and
$x\in W_{s}$
for infinitely many
$s\in \operatorname{succ}(t)$
, which is a contradiction. Thus,
$\{W_{t}:|t|=n+1\}$
is point-finite in
$X$
.
(v) Let
$(W_{t})_{t\in T}$
be a closed tree scheme on
$X$
. Assume that
$(W_{t})_{t\in T}$
is locally finite; the inverse direction is obvious. First of all,
$\{W_{t}:|t|=0\}$
is locally finite in
$X$
. We assume that
$\{W_{t}:|t|=n\}$
is locally finite in
$X$
and we will show that
$\{W_{t}:|t|=n+1\}$
is locally finite in
$X$
. Let
$x\in X$
. By the inductive hypothesis there exists
$U_{x}$
, an open neighborhood of
$x$
, such that the set,
is finite. Let also
which is finite as a subset of
$T_{U_{x}}^{n}$
. We observe that
is an open (since
$\{W_{t}:t\in T_{U_{x}}^{n}\setminus T_{x}^{n}\}$
is a finite family of closed subsets) neighborhood of
$x$
which intersects
$W_{t}$
with
$|t|=n$
if and only if
$t\in T_{x}^{n}$
.
$\{W_{s}:s\in \operatorname{succ}(t)\}$
is locally finite in the subspace
$W_{t}$
for all
$t\in T$
, so for each
$t\in T_{x}^{n}$
there exists an open (with respect to the relative topology of
$W_{t}$
) neighborhood
$U_{t}(x)$
of
$x$
, such that the set,
is finite. Since
$U_{t}(x)$
is open in
$W_{t}$
, there exists an open (with respect to the topology of
$X$
) neighborhood
$V_{t}(x)$
of
$x$
such that
$U_{t}(x)=V_{t}(x)\cap W_{t}$
. Observe that the set
is equal to
Thus, the set
is an open (with respect to the topology of
$X$
) neighborhood of
$x$
that intersects finitely many elements of
$\{W_{t}:|t|=n+1\}$
.◻
Definition 3.4. We say that a tree scheme
$(W_{t})_{t\in T}$
on a topological space
$X$
is complete, if the following are satisfied:
(i) for each
$b\in [T]$
such that
$W_{b|n}\neq \emptyset$
for all
$n\in \unicode[STIX]{x1D714}$
there exists
$x_{b}\in X$
with
$\bigcap _{n\in \unicode[STIX]{x1D714}}W_{b|n}=\{x_{b}\}$
;(ii) if
$\{x\}=\bigcap _{n\in \unicode[STIX]{x1D714}}W_{b|n}$
, then
$\{W_{b|n}:n\in \unicode[STIX]{x1D714}\}$
is a neighborhood base at
$x$
.
Remark 3.5. Let
$(W_{t})_{t\in T}$
be a complete open tree scheme on
$X$
. By Lemma 3.3(ii) for each
$x\in X$
there is
$b_{x}\in [T]$
such that
$x\in \bigcap _{n\in \unicode[STIX]{x1D714}}W_{b_{x}|n}$
. Now since
$(W_{t})_{t\in T}$
is complete, we have
$\{x\}=\bigcap _{n\in \unicode[STIX]{x1D714}}W_{b_{x}|n}$
. Therefore, for each
$x\in X$
there is
$b_{x}\in [T]$
such that
$\{x\}=\bigcap _{n\in \unicode[STIX]{x1D714}}W_{b_{x}|n}$
and
$\{W_{b_{x}|n}:n\in \unicode[STIX]{x1D714}\}$
is a neighborhood base at
$x$
.
The next proposition asserts that we can obtain complete tree schemes on completely metrizable spaces with “nice” properties. These results are somehow well-known in descriptive set theory (see, for example, [Reference Kechris16, Theorem 6.2]), but here are stated in a form that fits our definitions and would be useful for our purposes. First, let us prove a useful lemma.
Lemma 3.6. Let
$Y$
be a metrizable space and
$(U_{t})_{t\in T}$
an open tree scheme on
$Y$
. Then
$(U_{t})_{t\in T}$
has a closed precise refinement
$(F_{t})_{t\in T}$
, which in turn has an open precise refinement
$(W_{t})_{t\in T}$
and, moreover,
$\{F_{t}:|t|=n\}$
and
$\{W_{t}:|t|=n\}$
are both locally finite in
$Y$
for all
$n<\unicode[STIX]{x1D714}$
.
Proof. We are going to define the desirable tree schemes recursively. Set
$F_{\emptyset }=Y$
and suppose that
$F_{t}$
is closed in
$Y$
and
$F_{t}\subseteq U_{t}$
. Since
$F_{t}$
is paracompact Hausdorff, as a subspace of a metrizable space, and
$\{F_{t}\cap U_{s}:s\in \operatorname{succ}(t)\}$
is an open cover of
$F_{t}$
in the relative topology, it has a locally finite open precise refinement
$\{D_{s}:s\in \operatorname{succ}(t)\}$
such that
$\operatorname{cl}_{F_{t}}(D_{s})\subseteq F_{t}\cap U_{s}$
for all
$s\in \operatorname{succ}(t)$
. We define
$F_{s}=\operatorname{cl}_{F_{t}}(D_{s})$
, which is closed in
$Y$
, and we observe that
What is more, since
$\{D_{s}:s\in \operatorname{succ}(t)\}$
is locally finite in
$F_{t}$
, the same holds for
$\{F_{s}:s\in \operatorname{succ}(t)\}$
and
$\{\text{int}_{F_{t}}(F_{s}):s\in \operatorname{succ}(t)\}$
. The recursively constructed locally finite closed tree scheme
$(F_{t})_{t\in T}$
is a precise refinement of
$(U_{t})_{t\in T}$
; by Lemma 3.3(v), it follows that
$\{F_{t}:|t|=n\}$
is locally finite in
$Y$
for all
$n<\unicode[STIX]{x1D714}$
.
Now set
$W_{\emptyset }=Y$
and suppose that
$W_{t}$
is open in
$Y$
and
$W_{t}\subseteq F_{t}$
. Observe that
and
Hence,
$\{W_{t}\cap \,\text{int}_{X}(F_{s}):s\in \operatorname{succ}(t)\}$
is an open cover of
$W_{t}$
in the relative topology. Following the same argument as above, there is a locally finite open precise refinement
$\{W_{s}:s\in \operatorname{succ}(t)\}$
. Thus, the recursively constructed open tree scheme
$(W_{t})_{t\in T}$
is a precise refinement of
$(F_{t})_{t\in T}$
, which implies that
$\{W_{t}:|t|=n\}$
is locally finite in
$Y$
for all
$n<\unicode[STIX]{x1D714}$
.◻
Proposition 3.7. Let
$Y$
be a completely metrizable space.
(i) There exists a complete open tree scheme
$(W_{t})_{t\in T}$
on
$Y$
such that
$\{W_{t}:|t|=n\}$
is locally finite in
$Y$
for all
$n<\unicode[STIX]{x1D714}$
.(ii) If
$Y$
is separable, then
$T$
in (i) could be countably branching.(iii) If
$\operatorname{dim}(Y)=0$
, then there exists a complete clopen disjoint tree scheme
$(W_{t})_{t\in T}$
on
$Y$
.
Proof. (i) First we are going to construct a complete open tree scheme on
$Y$
. Let
$d$
be a complete compatible bounded metric on
$Y$
and
$\{U_{i}:i\in I\}$
a base for the topology of
$Y$
consisted of non-empty sets. For each
$i\in I$
we define
and we observe that
$U_{i}=\bigcup _{j\in I(i)}U_{j}=\bigcup _{j\in I(i)}\overline{U_{j}}$
. Then we define the pruned tree
$T\subseteq I^{{<}\unicode[STIX]{x1D714}}$
as follows:
and
We set
$U_{\emptyset }=Y$
and
$U_{t}=U_{i_{n}}$
for every
$t=(i_{1},\ldots ,i_{n})\in T$
. We will show that
$(U_{t})_{t\in T}$
is a complete open tree scheme on
$Y$
. Let
$t=(i_{1},\ldots ,i_{n})\in T$
. If
$s\in \operatorname{succ}(t)$
, then, according to the definition of
$T$
, there exists
$i_{n+1}\in I(i_{n})$
so that
$s=t^{\frown }i_{n+1}=(i_{1},\ldots ,i_{n},i_{n+1})$
, which implies that
$\overline{U_{s}}=\overline{U_{i_{n+1}}}\subseteq U_{i_{n}}=U_{t}$
. Thus,
On the other hand, let
$y\in U_{t}$
, where
$t=(i_{1},\ldots ,i_{n})\in T$
. There is
$\unicode[STIX]{x1D700}>0$
such that
$2\unicode[STIX]{x1D700}<\frac{1}{2}\operatorname{diam}_{d}(U_{i_{n}})$
and
$\overline{B_{d}(y,\unicode[STIX]{x1D700})}\subseteq U_{t}=U_{i_{n}}$
. Since
$\{U_{i}:i\in I\}$
is a base for the metric topology, there exists
$j\in I$
such that
$y\in U_{j}\subseteq B_{d}(y,\unicode[STIX]{x1D700})$
. Hence,
$\overline{U_{j}}\subseteq U_{i_{n}}$
and
$\operatorname{diam}_{d}(U_{j})\leqslant 2\unicode[STIX]{x1D700}<\frac{1}{2}\operatorname{diam}_{d}(U_{i_{n}})$
, which implies
$j\in I(i_{n})$
. So
$y\in U_{s}$
, where
$s=(i_{1},\ldots ,i_{n},j)\in \operatorname{succ}(t)$
, and thus,
So
$(U_{t})_{t\in T}$
is an open tree scheme. It remains to show that
$(U_{t})_{t\in T}$
is complete. Let
$b\in [T]$
. We observe that
$\bigcap _{n\in \unicode[STIX]{x1D714}}U_{b|n}=\bigcap _{n\in \unicode[STIX]{x1D714}}\overline{U_{b|n}}$
and that
$\{\overline{U_{b|n}}:n\in \unicode[STIX]{x1D714}\}$
is a decreasing sequence of non-empty closed subsets with vanishing diameter; therefore, since
$d$
is complete, it follows that there is
$y_{b}\in Y$
so that
$\bigcap _{n\in \unicode[STIX]{x1D714}}U_{b|n}=\{y_{b}\}$
. Moreover,
$\{U_{b|n}:n\in \unicode[STIX]{x1D714}\}$
is a neighborhood base at
$y_{b}$
, since, as we observed above,
$\operatorname{diam}(U_{b|n})\rightarrow 0$
.
Now, by applying Lemma 3.6,
$(U_{t})_{t\in T}$
has an open precise refinement
$(W_{t})_{t\in T}$
such that
$\{W_{t}:|t|=n\}$
is locally finite in
$Y$
for all
$n<\unicode[STIX]{x1D714}$
. It is easy to see that
$(W_{t})_{t\in T}$
is also complete.
(ii) If
$Y$
is separable, then the initial base
$\{U_{i}:i\in I\}$
in the proof of (i) can be chosen to be countable, and thus,
$T$
in (i) would be countably branching.
(iii) From (i) we get a complete open tree scheme
$(W_{t})_{t\in T}$
on
$Y$
such that
$\{W_{t}:|t|=n\}$
is locally finite in
$Y$
for all
$n<\unicode[STIX]{x1D714}$
. We are going to define recursively a clopen disjoint precise refinement of
$(W_{t})_{t\in T}$
. We set
$G_{\emptyset }=X$
. Let
$G_{t}\subseteq W_{t}$
be clopen and observe that
$G_{t}=\bigcup _{s\in \operatorname{succ}(t)}(G_{t}\cap W_{s})$
. Since
$G_{t}$
is normal with
$\operatorname{dim}(G_{t})=0$
and
$\{G_{t}\cap W_{s}:s\in \operatorname{succ}(t)\}$
is locally finite in
$G_{t}$
, there exists a clopen precise refinement
$\{U_{s}:s\in \operatorname{succ}(t)\}$
. We consider a strict well-order
${<}$
on
$\operatorname{succ}(t)$
and we define
$G_{s}=U_{s}\setminus \bigcup _{s^{\prime }<s}U_{s^{\prime }}$
, which is clopen since
$\{U_{s}:s\in \operatorname{succ}(t)\}$
is locally finite in
$G_{t}$
. So the recursively defined
$(G_{t})_{t\in T}$
is a clopen disjoint tree scheme, and it is easy to see that, as a precise refinement of
$(W_{t})_{t\in T}$
, is also complete.◻
4 A general selection theorem
In Theorem 4.2 we present the main idea of this paper: a unified method of constructing continuous and measurable single-valued selections. Proposition 4.3 provides measurable multifunctions with range a body of a tree that are either closed-valued or compact-valued. Such multifunctions will be used in §6, where we characterize the structure of the domain in terms of tree schemes. Let us first begin with a simple lemma. Both the lemma and Proposition 4.3 are essentially based on [Reference Arvanitakis3, Proposition 2.2, Lemma 2.4].
Lemma 4.1.
(i) If
$X,Y$
are non-empty sets,
$(W_{t})_{t\in T}$
a tree scheme on
$Y$
and
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{Y}\setminus \{\emptyset \}$
a multifunction, then
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
is a tree scheme on
$X$
.(ii) If, in addition to (i),
$\unicode[STIX]{x1D6F4}\subseteq 2^{X}$
,
$Y$
is a topological space,
$\unicode[STIX]{x1D6F7}$
is
$\unicode[STIX]{x1D6F4}$
-measurable and
$(W_{t})_{t\in T}$
is open, then
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
is a
$\unicode[STIX]{x1D6F4}$
tree scheme on
$X$
.(iii) If, in addition to (ii),
$\unicode[STIX]{x1D6F4}$
is a topology,
$\unicode[STIX]{x1D6F7}$
is continuous and
$(W_{t})_{t\in T}$
is clopen, then
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
is a clopen tree scheme on
$X$
.
Proof. For (i) it suffices to observe that
$\unicode[STIX]{x1D6F7}^{l}(Y)=X$
and that the lower inverse image under
$\unicode[STIX]{x1D6F7}$
preserves arbitrary unions; (ii) and (iii) follow immediately from the definition of
$\unicode[STIX]{x1D6F4}$
-measurable or continuous multifunction respectively.◻
Theorem 4.2. Let
$X$
be a non-empty set,
$\unicode[STIX]{x1D6F4}\subseteq 2^{X}$
,
$Y$
a topological space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a multifunction.
(i) If there exists a complete open tree scheme
$(W_{t})_{t\in T}$
on
$Y$
such that
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
has a disjoint precise refinement
$(G_{t})_{t\in T}$
, then
$\unicode[STIX]{x1D6F7}$
admits a single-valued selection
$\unicode[STIX]{x1D719}$
.(ii) If
$\unicode[STIX]{x1D6F4}$
is a topology on
$X$
and
$(G_{t})_{t\in T}$
in (i) is, in addition, a
$\unicode[STIX]{x1D6F4}$
tree scheme, then
$\unicode[STIX]{x1D719}$
in (i) is continuous.(iii) If
$\unicode[STIX]{x1D6F4}$
is closed under countable unions and
$(G_{t})_{t\in T}$
in (i) is, in addition, a
$\unicode[STIX]{x1D6F4}$
tree scheme where
$T$
is countably branching, then
$\unicode[STIX]{x1D719}$
in (i) is
$\unicode[STIX]{x1D6F4}$
-measurable.
Proof. (i) Let
$(W_{t})_{t\in T}$
be a complete open tree scheme on
$Y$
and
$(G_{t})_{t\in T}$
a disjoint precise refinement of
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
. By Lemma 3.3(iii), for each
$x\in X$
there exists a unique
$b_{x}\in [T]$
such that
$x\in \bigcap _{n\in \unicode[STIX]{x1D714}}G_{b_{x}|n}$
. Notice that
$W_{b_{x}|n}\neq \emptyset$
for all
$n\in \unicode[STIX]{x1D714}$
and
$(W_{t})_{t\in T}$
is complete, therefore we can define
$\unicode[STIX]{x1D719}:X\rightarrow Y$
by
$\{\unicode[STIX]{x1D719}(x)\}=\bigcap _{n\in \unicode[STIX]{x1D714}}W_{b_{x}|n}$
. We will show that
$\unicode[STIX]{x1D719}$
is a selection of
$\unicode[STIX]{x1D6F7}$
. Let
$x\in X$
. Since
$\unicode[STIX]{x1D6F7}$
is closed-valued, it suffices to show that
$\unicode[STIX]{x1D719}(x)\in \overline{\unicode[STIX]{x1D6F7}(x)}$
. But this follows immediately from the fact that
$\{W_{b_{x}|n}:n\in \unicode[STIX]{x1D714}\}$
is a neighborhood base at
$\unicode[STIX]{x1D719}(x)$
and
$\unicode[STIX]{x1D6F7}(x)\cap W_{b_{x}|n}\neq \emptyset$
for all
$n\in \unicode[STIX]{x1D714}$
.
(ii) Let
$W$
be an open subset of
$Y$
. For each
$x\in \unicode[STIX]{x1D719}^{-1}(W)$
there exists
$n_{x}\in \unicode[STIX]{x1D714}$
such that
$\unicode[STIX]{x1D719}(x)\in W_{b_{x}|n_{x}}\subseteq W$
. Then for each
$x\in \unicode[STIX]{x1D719}^{-1}(W)$
we have that
$x\in G_{b_{x}|n_{x}}\subseteq \unicode[STIX]{x1D719}^{-1}(W_{b_{x}|n_{x}})\subseteq \unicode[STIX]{x1D719}^{-1}(W)$
, and thus,
$\unicode[STIX]{x1D719}^{-1}(W)=\bigcup _{x\in \unicode[STIX]{x1D719}^{-1}(W)}G_{b_{x}|n_{x}}$
, which is an open subset of
$Y$
since each
$G_{b_{x}|n_{x}}$
is open.
(iii) As we proved in (ii) for each
$W\subseteq Y$
open we have
$\unicode[STIX]{x1D719}^{-1}(W)=\bigcup _{x\in \unicode[STIX]{x1D719}^{-1}(W)}G_{b_{x}|n_{x}}$
. Moreover,
$\unicode[STIX]{x1D6F4}$
is closed under countable unions,
$\{b_{x}|n_{x}:x\in \unicode[STIX]{x1D719}^{-1}(W)\}$
is countable (
$T$
is countably branching) and each
$G_{b_{x}|n_{x}}$
belongs to
$\unicode[STIX]{x1D6F4}$
, and thus,
$\unicode[STIX]{x1D719}^{-1}(W)\in \unicode[STIX]{x1D6F4}$
.◻
Proposition 4.3. Let
$X$
be a non-empty set,
$\unicode[STIX]{x1D6F4}\subseteq 2^{X}$
,
$(U_{t})_{t\in T}$
a
$\unicode[STIX]{x1D6F4}$
tree scheme on
$X$
and
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{[T]}\setminus \{\emptyset \}$
defined by
$\unicode[STIX]{x1D6F7}(x)=\{b\in [T]:x\in \bigcap _{n\in \unicode[STIX]{x1D714}}U_{b|n}\}$
.
(i) If
$\unicode[STIX]{x1D6F4}$
is a topology, then
$\unicode[STIX]{x1D6F7}$
is lsc.(ii) If
$T$
is countably branching and
$\unicode[STIX]{x1D6F4}$
is closed under countable unions, then
$\unicode[STIX]{x1D6F7}$
is
$\unicode[STIX]{x1D6F4}$
-measurable.(iii)
$\unicode[STIX]{x1D6F7}$
is closed-valued.(iv) If
$(U_{t})_{t\in T}$
is point-finite, then
$\unicode[STIX]{x1D6F7}$
is compact-valued.(v) If
$\unicode[STIX]{x1D6F4}$
is a topology and
$(U_{t})_{t\in T}$
is locally finite and clopen, then
$\unicode[STIX]{x1D6F7}$
is continuous.
Proof. (i) It suffices to observe that
$\{V_{t}:t\in T\}$
is a base for the topology of
$[T]$
, the lower inverse image under
$\unicode[STIX]{x1D6F7}$
preserves arbitrary unions and finally
$\unicode[STIX]{x1D6F7}^{l}(V_{t})=U_{t}\in \unicode[STIX]{x1D6F4}$
for all
$t\in T$
.
(ii) Let
$V$
be an open subset of
$[T]$
and
$S\subseteq T$
such that
$V=\bigcup _{t\in S}V_{t}$
. Obviously
$T$
is countable and
$\unicode[STIX]{x1D6F7}^{l}(V)=\bigcup _{t\in S}\unicode[STIX]{x1D6F7}^{l}(V_{t})$
, and thus,
$\unicode[STIX]{x1D6F7}^{l}(V)\in \unicode[STIX]{x1D6F4}$
.
(iii) Let
$x\in X$
. It is easy to see that
$\unicode[STIX]{x1D6F7}(x)=[T_{x}]$
, where
$T_{x}=\{t\in T:x\in U_{t}\}$
is a pruned subtree of
$T$
. In other words,
$\unicode[STIX]{x1D6F7}(x)$
is a body of a pruned subtree of
$T$
, and thus, is a closed subset of
$[T]$
.
(iv) If, moreover,
$(U_{t})_{t\in T}$
is point-finite, then
$T_{x}=\{t\in T:x\in U_{t}\}$
is a pruned finitely branching subtree of
$T$
, and thus,
$\unicode[STIX]{x1D6F7}(x)=[T_{x}]$
is compact.
(v) If
$(U_{t})_{t\in T}$
is locally finite and clopen, then, due to (i), it remains to show that
$\unicode[STIX]{x1D6F7}$
is upper semicontinuous. Let
$V$
be an open subset of
$[T]$
and
$x\in \unicode[STIX]{x1D6F7}^{u}(V)$
. For every
$b\in \unicode[STIX]{x1D6F7}(x)$
there exists
$n_{b}\in \unicode[STIX]{x1D714}$
such that
$V_{b|n_{b}}\subseteq V$
, so
$\{V_{b|n_{b}}\}_{b\in \unicode[STIX]{x1D6F7}(x)}$
is an open cover of
$\unicode[STIX]{x1D6F7}(x)$
. From (iv) we have that
$\unicode[STIX]{x1D6F7}(x)$
is compact, and hence, there is a subcover
$\{V_{t_{i}}\}_{i=1}^{k}$
. We can assume that
$|t_{i}|=n_{0}$
for some
$n_{0}\in \unicode[STIX]{x1D714}$
and for all
$i=1,\ldots ,k$
. Since
$(U_{t})_{t\in T}$
is locally finite and clopen, by virtue of Lemma 3.3(v) there exists an open neighborhood
$U$
of
$x$
such that the set
is finite. Let
and
First we observe that
$G$
is an open neighborhood of
$x$
. Finally, by the definition of
$\unicode[STIX]{x1D6F7}$
, we observe that
$G\subseteq \unicode[STIX]{x1D6F7}^{u}(V)$
, since we have that
$T_{x}^{n_{0}}\subseteq \{t_{1},\ldots ,t_{k}\}$
and
$\unicode[STIX]{x1D6F7}(x)\subseteq \bigcup _{i=1}^{k}V_{t_{i}}$
.◻
5 Disjoint refinements of tree schemes
As we figured out in the previous section (Theorem 4.2), disjoint precise refinements of tree schemes are of particular interest, since, through them, we achieve the construction of measurable single-valued selections.
Maitra and Rao [Reference Maitra and Rao19], in their approach, defined a weaker version of Kuratowski’s reduction principle as follows: if
$k$
is a cardinal and
${\mathcal{F}}$
a family of subsets of
$X$
, then
${\mathcal{F}}$
satisfies the
$k$
-weak reduction principle, if whenever
$\{A_{\unicode[STIX]{x1D6FC}}:\unicode[STIX]{x1D6FC}<\unicode[STIX]{x1D6FD}\}\subseteq {\mathcal{F}}$
,
$\unicode[STIX]{x1D6FD}<k$
and
$X=\bigcup _{\unicode[STIX]{x1D6FC}<\unicode[STIX]{x1D6FD}}A_{\unicode[STIX]{x1D6FC}}$
, there exists a disjoint precise refinement
$\{B_{\unicode[STIX]{x1D6FC}}:\unicode[STIX]{x1D6FC}<\unicode[STIX]{x1D6FD}\}\subseteq {\mathcal{F}}$
.
Here we define a hereditary version of this weak reduction principle and we prove that it is the essential factor in order to construct disjoint precise refinements of tree schemes which belong to a certain class.
Recall that if
$\unicode[STIX]{x1D6E4}$
is a class of sets and
$X$
a set, then we denote by
$\unicode[STIX]{x1D6E4}(X)$
the collection of subsets of
$X$
which belong to
$\unicode[STIX]{x1D6E4}$
. For example,
$\unicode[STIX]{x1D6E4}(X)$
could stand for a topology on
$X$
. We also use the following notation:
${\sim}\unicode[STIX]{x1D6E4}(X)=\{X\setminus A:A\in \unicode[STIX]{x1D6E4}(X)\}$
,
$\unicode[STIX]{x1D6E5}(X)=\sim \unicode[STIX]{x1D6E4}(X)\cap \unicode[STIX]{x1D6E4}(X)$
and
$\unicode[STIX]{x1D6E4}(Y)=\unicode[STIX]{x1D6E4}(X)|Y=\{A\cap Y:A\in \unicode[STIX]{x1D6E4}(X)\}$
for any
$Y\subseteq X$
(for reference see [Reference Kechris16, p. 167]).
The above notation can be extended as follows: if
${\mathcal{A}}$
is a class of families of sets, then we denote by
${\mathcal{A}}(X)$
the collection of families of subsets of
$X$
which belong to
${\mathcal{A}}$
and by
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
the collection of subfamilies of
$\unicode[STIX]{x1D6E4}(X)$
which belong in
${\mathcal{A}}(X)$
. For example,
${\mathcal{A}}(X)$
could be the collection of families of subsets of
$X$
which are locally finite in
$X$
and
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
the collection of families of open subsets of
$X$
which are locally finite in
$X$
.
Definition 5.1. Let
$\unicode[STIX]{x1D6E4}$
be a class of sets,
${\mathcal{A}}$
a class of families of sets,
$X$
a set and
$k$
a cardinal.
(i) We say that
$\unicode[STIX]{x1D6E4}(X)$
satisfies the
$k$
-weak reduction principle, if each
$\{A_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
such that
$|I|<k$
and
$X=\bigcup _{i\in I}A_{i}$
, has a disjoint precise refinement
$\{B_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
.If
$\unicode[STIX]{x1D6E4}(X)$
satisfies the
$k$
-weak reduction principle for any cardinal
$k$
, then we say that
$\unicode[STIX]{x1D6E4}(X)$
satisfies the weak reduction principle.(ii) We say that
$\unicode[STIX]{x1D6E4}(X)$
satisfies the
$k$
-weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary, if
$\unicode[STIX]{x1D6E4}(Y)$
satisfies the
$k$
-weak reduction principle for each
$Y\in \unicode[STIX]{x1D6E5}(X)$
.If
$\unicode[STIX]{x1D6E4}(X)$
satisfies the
$k$
-weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary for any cardinal
$k$
, then we say that
$\unicode[STIX]{x1D6E4}(X)$
satisfies the weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary.(iii) We say that
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
satisfies the
$k$
-weak reduction principle, if each
$\{A_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
such, that
$|I|<k$
and
$X=\bigcup _{i\in I}A_{i}$
, has a disjoint precise refinement
$\{B_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
.If
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
satisfies the
$k$
-weak reduction principle for any cardinal
$k$
, then we say that
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
satisfies the weak reduction principle.(iv) We say that
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
satisfies the
$k$
-weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary, if
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(Y))$
satisfies the
$k$
-weak reduction principle for each
$Y\in \unicode[STIX]{x1D6E5}(X)$
.If
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
satisfies the
$k$
-weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary for any cardinal
$k$
, then we say that
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
satisfies the weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary.
Proposition 5.2. Let
$k$
be a cardinal,
$\unicode[STIX]{x1D6E4}$
a class of sets and
$X$
a set such that:
(1)
$X\in \unicode[STIX]{x1D6E4}(X)$
;(2)
$\unicode[STIX]{x1D6E4}(X)$
is closed under finite intersections.
Then the following are equivalent:
(i)
$\unicode[STIX]{x1D6E4}(X)$
satisfies the weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary (
$k$
-weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary);(ii) every
$\unicode[STIX]{x1D6E4}(X)$
tree scheme
$(U_{t})_{t\in T}$
on
$X$
(
$T$
is
$k$
-branching) has a
$\unicode[STIX]{x1D6E4}(X)$
disjoint precise refinement.
The statement of this proposition includes two cases. The one stated inside the parentheses can be proved exactly in the same way, so its proof is omitted.
Proof. (i)
$\Rightarrow$
(ii) Let
$(U_{t})_{t\in T}$
be a
$\unicode[STIX]{x1D6E4}(X)$
tree scheme on
$X$
. Set
$G_{\emptyset }=X$
and suppose that
$G_{t}\subseteq U_{t}$
and
$G_{t}\in \unicode[STIX]{x1D6E5}(X)$
. Since
$\{U_{s}:s\in \operatorname{succ}(t)\}\subseteq \unicode[STIX]{x1D6E4}(X)$
, we observe that
$\{G_{t}\cap U_{s}:s\in \operatorname{succ}(t)\}\subseteq \unicode[STIX]{x1D6E4}(G_{t})$
covers
$G_{t}$
, so it has a disjoint precise refinement
$\{G_{s}:s\in \operatorname{succ}(t)\}\subseteq \unicode[STIX]{x1D6E4}(G_{t})$
. From (1) and (2) we conclude that the recursively defined disjoint precise refinement
$(G_{t})_{t\in T}$
belongs to
$\unicode[STIX]{x1D6E4}(X)$
.
(ii)
$\Rightarrow$
(i) Let
$Y\in \unicode[STIX]{x1D6E5}(X)$
. We have to show that
$\unicode[STIX]{x1D6E4}(Y)$
satisfies the weak reduction principle. Let
$\{A_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(Y)$
such that
$Y=\bigcup _{i\in I}A_{i}$
. From (2) we have that
$\{A_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
. Set
$U_{\emptyset }=X$
. Consider that the immediate successors of
$\emptyset$
are exactly
$t_{1},t_{2}$
and set
$U_{t_{1}}=Y$
and
$U_{t_{2}}=X\setminus Y$
. Then consider that the immediate successors of
$t_{1}$
is the set
$I$
and for every
$i\in \operatorname{succ}(t_{1})$
set
$U_{i}=A_{i}$
. Finally, consider that
$U_{t}=U_{t_{2}}$
for any
$t\in \operatorname{succ}(t_{2})$
, and
$U_{t}=U_{i}$
for any
$t\in \operatorname{succ}(i)$
and
$i\in I$
. It is easy to see that in this way we can define a pruned tree
$T$
(on some set) and a
$\unicode[STIX]{x1D6E4}(X)$
tree scheme
$(U_{t})_{t\in T}$
, which, by hypothesis, has a
$\unicode[STIX]{x1D6E4}(X)$
disjoint precise refinement
$(G_{t})_{t\in T}$
. To complete the proof it suffices to observe that
$\{G_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
is a disjoint precise refinement of
$\{A_{i}\}_{i\in I}$
.◻
Proposition 5.3. Let
$k$
be a cardinal,
$\unicode[STIX]{x1D6E4}$
a class of sets,
${\mathcal{A}}$
a class of families of sets and
$X$
a set such that:
(1)
$\{Y\}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(Y))$
for any
$Y\subseteq X$
;(2)
$\unicode[STIX]{x1D6E4}(X)$
is closed under finite intersections;(3) if
$Y\subseteq X$
and
$\{A_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
, then
$\{A_{i}\cap Y\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(Y))$
;(4) if
$Y\in \unicode[STIX]{x1D6E5}(X)$
and
$\{A_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(Y))$
, then
$\{A_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
;(5) if
$\{A_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
and it is pairwise disjoint, then
$\{A_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
;(6) if
$\{A_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
, then
$\{A_{i}\}_{i\in J}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
for each
$J\subseteq I$
.
Then the following are equivalent:
(i)
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
satisfies the weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary (
$k$
-weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary);(ii) every
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
tree scheme
$(U_{t})_{t\in T}$
on
$X$
(
$T$
is
$k$
-branching) has a
$\unicode[STIX]{x1D6E4}(X)$
disjoint precise refinement.
As in the previous proposition, the statement again includes two cases. The one stated inside the parentheses can be proved exactly in the same way, so its proof is omitted.
Proof. (i)
$\Rightarrow$
(ii) Let
$(U_{t})_{t\in T}$
be a
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
tree scheme on
$X$
. Set
$G_{\emptyset }=X$
and suppose that
$G_{t}\subseteq U_{t}$
and
$G_{t}\in \unicode[STIX]{x1D6E5}(X)$
. Since
$\{U_{s}:s\in \operatorname{succ}(t)\}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
, by applying (3) we observe that
$\{G_{t}\cap U_{s}:s\in \operatorname{succ}(t)\}$
belongs to
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(G_{t}))$
and, moreover, covers
$G_{t}$
, so it has a disjoint precise refinement
$\{G_{s}:s\in \operatorname{succ}(t)\}\in \unicode[STIX]{x1D6E4}(G_{t})$
. From (2) we have that the recursively defined disjoint precise refinement
$(G_{t})_{t\in T}$
is a
$\unicode[STIX]{x1D6E4}(X)$
tree scheme.
(ii)
$\Rightarrow$
(i) Let
$Y\in \unicode[STIX]{x1D6E5}(X)$
. We have to show that
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(Y))$
satisfies the weak reduction principle. Let
$\{A_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(Y))$
such that
$Y=\bigcup _{i\in I}A_{i}$
. From (4) we have that
$\{A_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
. Set
$U_{\emptyset }=X$
. Consider that the immediate successors of
$\emptyset$
are exactly
$t_{1},t_{2}$
and set
$U_{t_{1}}=Y$
and
$U_{t_{2}}=X\setminus Y$
. From (5) we have that
$\{U_{s}:s\in \operatorname{succ}(\emptyset )\}\in {\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
. Then consider that the immediate successors of
$t_{1}$
is the set
$I$
and for every
$i\in \operatorname{succ}(t_{1})$
set
$U_{i}=A_{i}$
. Finally, consider that
$U_{t}=U_{t_{2}}$
for any
$t\in \operatorname{succ}(t_{2})$
, and
$U_{t}=U_{i}$
for any
$t\in \operatorname{succ}(i)$
and
$i\in I$
. It is easy to see ((6) should be used) that in this way we can define a pruned tree
$T$
(on some set) and a
${\mathcal{A}}(\unicode[STIX]{x1D6E4}(X))$
tree scheme
$(U_{t})_{t\in T}$
, which, by hypothesis, has a
$\unicode[STIX]{x1D6E4}(X)$
disjoint precise refinement
$(G_{t})_{t\in T}$
. To complete the proof it suffices to observe that
$\{G_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
is a disjoint precise refinement of
$\{A_{i}\}_{i\in I}$
.◻
6 Single-valued selection theorems
6.1 Single-valued continuous selections of lsc multifunctions and characterizations
Michael [Reference Michael21] showed that the existence of continuous selections characterize the topological structure of the domain space, such as paracompactness. Along the same lines, Maitra and Rao [Reference Maitra and Rao19] showed that the existence of measurable selections characterize the domain space through the weak reduction principle. As we have already seen (Theorem 4.2), our method of constructing continuous selections is based on the existence of disjoint precise refinements of tree schemes. So it is natural to expect that the existence of continuous selections can also characterize the domain in terms of tree schemes. Considering the results of the previous section and the characterizations in [Reference Maitra and Rao19], it is more than expected that continuous selections also characterize the domain through the hereditary version of the weak reduction principle we defined in the previous section.
In this subsection the main result we are interested in is the zero-dimensional Michael selection theorem. Here we give a new proof of this theorem and of some other known selection theorems that can be found in [Reference Mägerl18, Reference Maitra and Rao19, Reference Michael22, Reference Michael and Pixley24]. In fact, thinking similarly to [Reference Maitra and Rao19], we characterize the existence of continuous selections in three different ways: in terms of tree schemes, of the hereditary version of the weak reduction principle, and of the topological structure of the domain space.
Theorem 6.1. Let
$(X,\unicode[STIX]{x1D70F})$
be a topological space. The following are equivalent.
(i) If
$Y$
is a completely metrizable space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a lsc multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a continuous single-valued selection.(ii) Every open tree scheme
$(U_{t})_{t\in T}$
on
$X$
has an open disjoint precise refinement.(iii)
$\unicode[STIX]{x1D70F}$
satisfies the weak reduction principle (
${\sim}\unicode[STIX]{x1D70F}\cap \unicode[STIX]{x1D70F}$
)-hereditary.(iv)
$(X,\unicode[STIX]{x1D70F})$
is paracompact Hausdorff with
$\operatorname{dim}(X)=0$
.
Proof. (i)
$\Rightarrow$
(ii) Let
$(U_{t})_{t\in T}$
be an open tree scheme on
$X$
. We define
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{[T]}\setminus \{\emptyset \}$
by
$\unicode[STIX]{x1D6F7}$
is lsc and closed-valued from Proposition 4.3 and, moreover,
$[T]$
is completely metrizable, and thus,
$\unicode[STIX]{x1D6F7}$
admits a continuous selection
$\unicode[STIX]{x1D719}:X\rightarrow [T]$
. We set
$G_{t}=\unicode[STIX]{x1D719}^{-1}(V_{t})$
and we observe that
$(G_{t})_{t\in T}$
is an open disjoint precise refinement of
$(U_{t})_{t\in T}$
.
(ii)
$\Rightarrow$
(i) Let
$Y$
be a completely metrizable space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a lsc multifunction. From Proposition 3.7 there exists a complete open tree scheme
$(W_{t})_{t\in T}$
on
$Y$
. Due to Theorem 4.2, it suffices to show that
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
has an open disjoint precise refinement. By Lemma 4.1,
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
is an open tree scheme on
$X$
, so, by hypothesis, it has an open disjoint precise refinement.
(ii)
$\Leftrightarrow$
(iii) Follows immediately from Proposition 5.2 for
$\unicode[STIX]{x1D6E4}(X)=\unicode[STIX]{x1D70F}$
.
(iii)
$\Rightarrow$
(iv) It is immediate.
(iv)
$\Rightarrow$
(iii) Let
$G$
be a clopen subset of
$X$
and
$\{U_{i}\}_{i\in I}$
an open family of subsets of
$G$
(in the relative topology) such that
$G\,=\,\bigcup _{i\in I}U_{i}$
. We observe that
$G$
, as a closed subspace of
$X$
, is paracompact Hausdorff with
$\operatorname{dim}(G)\,=\,0$
, and thus, there exists an open disjoint precise refinement
$\{G_{i}\}_{i\in I}$
. Since
$G\,\in \,({\sim}\unicode[STIX]{x1D70F}\,\cap \,\unicode[STIX]{x1D70F})$
, it follows that
$\{G_{i}\}_{i\in I}\subseteq ({\sim}\unicode[STIX]{x1D70F}\cap \unicode[STIX]{x1D70F})$
.◻
Theorem 6.2. If
$(X,\unicode[STIX]{x1D70F})$
is Lindelöf zero-dimensional,
$Y$
completely metrizable, and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
lsc multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a continuous single-valued selection.
Proof. Due to Theorem 6.1 it suffices to show that
$\unicode[STIX]{x1D70F}$
satisfies the weak reduction principle (
${\sim}\unicode[STIX]{x1D70F}\cap \unicode[STIX]{x1D70F}$
)-hereditary. Let
$G$
be a clopen subset of
$X$
and
$\{U_{i}\}_{i\in I}$
an open cover of
$G$
in the relative topology.
$G$
is obviously a Lindelöf zero-dimensional subspace. Let
${\mathcal{V}}$
be the family of all clopen subsets of
$G$
such that each is contained in some
$U_{i}$
. Since
$G$
has a basis of clopen sets, then
${\mathcal{V}}$
is an open cover of
$G$
. Assume that
$\{W_{n}\}_{n\in \unicode[STIX]{x1D714}}$
is a countable subcover of
${\mathcal{V}}$
and define
$G_{n}=W_{n}\setminus \bigcup _{m<n}W_{m}$
. Then
$\{G_{n}\}_{n\in \unicode[STIX]{x1D714}}$
is a clopen disjoint refinement of
$\{U_{i}\}_{i\in I}$
, so
$\{G_{n}\}_{n\in \unicode[STIX]{x1D714}}$
is also locally finite in
$G$
. For every
$n\in \unicode[STIX]{x1D714}$
we select a unique
$i_{n}\in I$
such that
$G_{n}\subseteq U_{i_{n}}$
and we define
$G_{i}=\bigcup \{G_{n}:i_{n}=i\}$
for all
$i\in I$
. Since
$\{G_{n}\}_{n\in \unicode[STIX]{x1D714}}$
is locally finite in
$G$
, then
$G_{i}$
is clopen for all
$i\in I$
. Hence,
$\{G_{i}\}_{i\in I}$
is a disjoint clopen precise refinement of
$\{U_{i}\}_{i\in I}$
.◻
Theorem 6.3. Let
$(X,\unicode[STIX]{x1D70F})$
be a topological space. The following are equivalent.
(i) If
$Y$
is a Polish space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a lsc multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a continuous single-valued selection.(ii) Every open tree scheme
$(U_{t})_{t\in T}$
on
$X$
, where
$T$
is countably branching, has an open disjoint precise refinement.(iii)
$\unicode[STIX]{x1D70F}$
satisfies the
$\aleph _{1}$
-weak reduction principle (
${\sim}\unicode[STIX]{x1D70F}\cap \unicode[STIX]{x1D70F}$
)-hereditary.(iv)
$(X,\unicode[STIX]{x1D70F})$
is countably paracompact normal with
$\operatorname{dim}(X)=0$
.
Proof. (i)
$\Rightarrow$
(ii) The only difference with the proof of (i)
$\Rightarrow$
(ii) of Theorem 6.1 is that
$[T]$
is also separable.
(ii)
$\Rightarrow$
(i) Similarly, the only difference with the proof of (ii)
$\Rightarrow$
(i) of Theorem 6.1 is that the tree scheme
$(W_{t})_{t\in T}$
on
$Y$
could be such that
$T$
is countably branching (Proposition 3.7).
(ii)
$\Leftrightarrow$
(iii) Follows immediately from Proposition 5.2 for
$\unicode[STIX]{x1D6E4}(X)=\unicode[STIX]{x1D70F}$
and
$k=\aleph _{1}$
.
(iii)
$\Rightarrow$
(iv) It is immediate.
(iv)
$\Rightarrow$
(iii) Let
$G$
be a clopen subset of
$X$
and
$\{U_{n}\}_{n\in \unicode[STIX]{x1D714}}$
a countable open cover of
$G$
in the relative topology. We observe that
$G$
, as a closed subspace of
$X$
, is countably paracompact normal with
$\operatorname{dim}(G)=0$
, and thus, we can construct an open disjoint precise refinement
$\{G_{n}\}_{n\in \unicode[STIX]{x1D714}}$
. Since
$G\in ({\sim}\unicode[STIX]{x1D70F}\cap \unicode[STIX]{x1D70F})$
, it follows that
$\{G_{n}\}_{n\in \unicode[STIX]{x1D714}}\subseteq ({\sim}\unicode[STIX]{x1D70F}\cap \unicode[STIX]{x1D70F})$
.◻
Lemma 6.4. Let
$X$
be a non-empty set,
$Y$
a topological space,
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{K}}(Y)$
a multifunction and
$\{W_{i}\}_{i\in I}$
a family of open subsets of
$Y$
that is locally finite in
$Y$
. Then
$\{\unicode[STIX]{x1D6F7}^{l}(W_{i})\}_{i\in I}$
is point-finite in
$X$
.
Proof. Let
$x\in X$
. For every
$y\in \unicode[STIX]{x1D6F7}(x)$
there exists an open neighborhood
$U_{y}$
of
$y$
that intersects finitely many
$W_{i}$
.
$\{U_{y}\}_{y\in \unicode[STIX]{x1D6F7}(x)}$
is an open cover of
$\unicode[STIX]{x1D6F7}(x)$
, and thus, due to compactness, there is a finite subcover
${\mathcal{U}}$
. Let
$V=\bigcup \,{\mathcal{U}}$
. It is easy to see that
$V$
intersects finitely many
$W_{i}$
, and hence, the same applies to
$\unicode[STIX]{x1D6F7}(x)$
, which implies that
$x$
belongs to finitely many
$\unicode[STIX]{x1D6F7}^{l}(W_{i})$
.◻
Theorem 6.5. Let
$(X,\unicode[STIX]{x1D70F})$
be a topological space and for each
$Z\subseteq X$
let
$\unicode[STIX]{x1D70F}_{Z}$
be the relative topology on
$Z$
and
${\mathcal{A}}(\unicode[STIX]{x1D70F}_{Z})$
the collection of families of open subsets of
$Z$
which are point-finite in
$Z$
. The following are equivalent.
(i) If
$Y$
is a Polish space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{K}}(Y)$
a lsc multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a continuous single-valued selection.(ii) Every point-finite open tree scheme
$(U_{t})_{t\in T}$
on
$X$
, where
$T$
is countable branching, has an open disjoint precise refinement.(iii)
${\mathcal{A}}(\unicode[STIX]{x1D70F})$
satisfies the
$\aleph _{1}$
-weak reduction principle (
${\sim}\unicode[STIX]{x1D70F}\cap \unicode[STIX]{x1D70F}$
)-hereditary.(iv)
$(X,\unicode[STIX]{x1D70F})$
is normal with
$\operatorname{dim}(X)=0$
.
Proof. (i)
$\Rightarrow$
(ii) Let
$(U_{t})_{t\in T}$
be a point-finite open tree scheme on
$X$
, where
$T$
is countable branching. We define
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{[T]}\setminus \{\emptyset \}$
by
$\unicode[STIX]{x1D6F7}$
is compact-valued lsc from Proposition 4.3 and
$[T]$
is Polish, and thus,
$\unicode[STIX]{x1D6F7}$
admits a continuous selection
$\unicode[STIX]{x1D719}:X\rightarrow [T]$
. We set
$G_{t}=\unicode[STIX]{x1D719}^{-1}(V_{t})$
and we observe that
$(G_{t})_{t\in T}$
is an open disjoint precise refinement of
$(U_{t})_{t\in T}$
.
(ii)
$\Rightarrow$
(i) Let
$Y$
be a Polish space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{K}}(Y)$
a lsc multifunction. From Proposition 3.7 there exists a complete open tree scheme
$(W_{t})_{t\in T}$
on
$Y$
, where
$T$
is countable branching, such that
$\{W_{t}:|t|=n\}$
is locally finite in
$Y$
for all
$n\in \unicode[STIX]{x1D714}$
. Since
$\unicode[STIX]{x1D6F7}$
is compact-valued, from the above lemma and Lemma 4.1,
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
is a point-finite open tree scheme on
$X$
, so, by hypothesis, it has an open disjoint precise refinement. Thus, by virtue of Theorem 4.2,
$\unicode[STIX]{x1D6F7}$
admits a continuous selection.
(ii)
$\Leftrightarrow$
(iii) Follows immediately from Proposition 5.3.
(iii)
$\Rightarrow$
(iv) It is immediate.
(iv)
$\Rightarrow$
(iii) Let
$G$
be a clopen subset of
$X$
and
$\{U_{i}\}_{i\in I}\in {\mathcal{A}}(\unicode[STIX]{x1D70F}_{G})$
with
$|I|\leqslant \aleph _{0}$
such that
$G=\bigcup _{i\in I}U_{i}$
.
$G$
is normal as a closed subspace of
$X$
and
$\{U_{i}\}_{i\in I}$
is a point-finite open cover of
$G$
in the relative topology, and thus, there exists an open precise refinement
$\{V_{i}\}_{i\in I}$
such that
$\operatorname{cl}_{G}(V_{i})\subseteq U_{i}$
for all
$i\in I$
. Moreover,
$\operatorname{dim}(G)=0$
, since
$G$
is a closed subspace, so there exists a family
$\{W_{i}\}_{i\in I}$
of clopen subsets of
$G$
(which are also clopen in
$X$
) such that
$\operatorname{cl}_{G}V_{i}\subseteq W_{i}\subseteq U_{i}$
for all
$i\in I$
. Since
$|I|\leqslant \aleph _{0}$
, we can assume a strict well-order
${<}$
on
$I$
which is isomorphic with an ordinal less or equal to
$\unicode[STIX]{x1D714}$
. Then for all
$i\in I$
we define
$G_{i}=W_{i}\setminus \bigcup _{j<i}W_{j}$
and we observe that
$\{G_{i}\}_{i\in I}$
is a clopen disjoint precise refinement of
$\{U_{i}\}_{i\in I}$
.◻
6.2 Single-valued measurable selections of measurable multifunctions and characterizations
The main result of this subsection is the Kuratowski–Ryll-Nardzewski selection theorem. Here, on the same wavelength with [Reference Maitra and Rao19], we characterize the existence of measurable single-valued selections in terms of tree schemes and of the hereditary version of the weak reduction principle, and then we provide a new proof of the Kuratowski–Ryll-Nardzewski selection theorem and of some known variations of this theorem; all of them can be found in [Reference Kuratowski and Ryll-Nardzewski17].
Theorem 6.6. Let
$X$
be a non-empty set and
$\unicode[STIX]{x1D6F4}$
a non-empty family of subsets of
$X$
that is closed under countable unions, finite intersections and
$X\in \unicode[STIX]{x1D6F4}$
. The following are equivalent.
(i) If
$Y$
is a Polish space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a
$\unicode[STIX]{x1D6F4}$
-measurable multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a
$\unicode[STIX]{x1D6F4}$
-measurable single-valued selection.(ii) Every
$\unicode[STIX]{x1D6F4}$
tree scheme
$(U_{t})_{t\in T}$
on
$X$
, where
$T$
is countably branching, has a
$\unicode[STIX]{x1D6F4}$
disjoint precise refinement.(iii)
$\unicode[STIX]{x1D6F4}$
satisfies the
$\aleph _{1}$
-weak reduction principle (
${\sim}\unicode[STIX]{x1D6F4}\cap \unicode[STIX]{x1D6F4}$
)-hereditary.
Proof. (i)
$\Rightarrow$
(ii) Let
$(U_{t})_{t\in T}$
be a
$\unicode[STIX]{x1D6F4}$
tree scheme on
$X$
such that
$T$
is countably branching. We define
$\unicode[STIX]{x1D6F7}:X\rightarrow 2^{[T]}\setminus \{\emptyset \}$
by
$\unicode[STIX]{x1D6F7}$
is
$\unicode[STIX]{x1D6F4}$
-measurable and closed-valued from Proposition 4.3. Moreover,
$[T]$
is Polish, and thus,
$\unicode[STIX]{x1D6F7}$
admits a
$\unicode[STIX]{x1D6F4}$
-measurable selection
$\unicode[STIX]{x1D719}:X\rightarrow [T]$
. We set
$G_{t}=\unicode[STIX]{x1D719}^{-1}(V_{t})$
and we observe that
$(G_{t})_{t\in T}$
is a
$\unicode[STIX]{x1D6F4}$
disjoint precise refinement of
$(U_{t})_{t\in T}$
.
(ii)
$\Rightarrow$
(i) Let
$Y$
be a Polish space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a
$\unicode[STIX]{x1D6F4}$
-measurable multifunction. From Proposition 3.7 there exists a complete open tree scheme
$(W_{t})_{t\in T}$
on
$Y$
such that
$T$
is countably branching. By Lemma 4.1,
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
is a
$\unicode[STIX]{x1D6F4}$
tree scheme on
$X$
; therefore, it has a
$\unicode[STIX]{x1D6F4}$
disjoint precise refinement. The requested selection, as usual, is a consequence of Theorem 4.2.
(ii)
$\Leftrightarrow$
(iii) Follows immediately from Proposition 5.2 for
$\unicode[STIX]{x1D6E4}(X)=\unicode[STIX]{x1D6F4}$
and
$k=\aleph _{1}$
.◻
Theorem 6.7. If
$(X,\unicode[STIX]{x1D6F4})$
is a measurable space,
$Y$
a Polish space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a
$\unicode[STIX]{x1D6F4}$
-measurable multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a
$\unicode[STIX]{x1D6F4}$
-measurable single-valued selection.
Proof. Due to Theorem 6.6, it suffices to show that
$\unicode[STIX]{x1D6F4}$
has the
$\aleph _{1}$
-weak reduction principle
$\unicode[STIX]{x1D6F4}$
-hereditary. So let
$G\in \unicode[STIX]{x1D6F4}$
,
$\{U_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6F4}$
with
$|I|\leqslant \aleph _{0}$
such that
$G=\bigcup _{i\in I}U_{i}$
. We assume a strict well-order
${<}$
on
$I$
and for all
$i\in I$
we define
$G_{i}=U_{i}\setminus \bigcup _{j<i}U_{j}$
, which obviously belongs to the
$\unicode[STIX]{x1D70E}$
-algebra
$\unicode[STIX]{x1D6F4}$
. Hence,
$\{G_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6F4}$
is a disjoint precise refinement of
$\{U_{i}\}_{i\in I}$
.◻
Let
$\unicode[STIX]{x1D6E4}$
be a class of sets and
$\unicode[STIX]{x1D6E4}(X)$
the collection of subsets of
$X$
which are in
$\unicode[STIX]{x1D6E4}$
for any set
$X$
. Recall that
$\unicode[STIX]{x1D6E4}$
satisfies the generalized reduction property (see [Reference Kechris16, Definition 22.14]), if for any set
$X$
and
$\{A_{n}\}_{n\in \unicode[STIX]{x1D714}}\subseteq \unicode[STIX]{x1D6E4}(X)$
there exists
$\{B_{n}\}_{n\in \unicode[STIX]{x1D714}}\subseteq \unicode[STIX]{x1D6E4}(X)$
such that
$B_{n}\cap B_{m}=\emptyset$
for
$n\neq m$
,
$B_{n}\subseteq A_{n}$
for all
$n\in \unicode[STIX]{x1D714}$
and
$\bigcup _{n\in \unicode[STIX]{x1D714}}B_{n}=\bigcup _{n\in \unicode[STIX]{x1D714}}A_{n}$
.
Lemma 6.8. Let
$\unicode[STIX]{x1D6E4}$
be a class of sets that satisfies the generalized reduction property and
$X$
a non-empty set such that
$\emptyset \in \unicode[STIX]{x1D6E4}(X)$
. Then
$\unicode[STIX]{x1D6E4}(X)$
satisfies the
$\aleph _{1}$
-weak reduction principle
$\unicode[STIX]{x1D6E5}(X)$
-hereditary.
Proof. Let
$G\in \unicode[STIX]{x1D6E5}(X)$
and
$\{U_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
such that
$|I|\leqslant \aleph _{0}$
and
$G=\bigcup _{i\in I}U_{i}$
. We may assume that
$|I|=\aleph _{0}$
, otherwise we can add the empty set so many times until we reach
$\aleph _{0}$
. There exists a pairwise disjoint family
$\{G_{i}\}_{i\in I}\subseteq \unicode[STIX]{x1D6E4}(X)$
such that
$G_{i}\subseteq U_{i}$
for all
$i\in I$
and
$\bigcup _{i\in I}G_{i}=\bigcup _{i\in I}U_{i}$
.◻
Theorem 6.9. If
$X$
is a metrizable space,
$\unicode[STIX]{x1D709}$
an ordinal,
$1<\unicode[STIX]{x1D709}<\unicode[STIX]{x1D714}_{1}$
,
$Y$
a Polish space and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a
$\unicode[STIX]{x1D6F4}_{\unicode[STIX]{x1D709}}^{0}(X)$
-measurable multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a
$\unicode[STIX]{x1D6F4}_{\unicode[STIX]{x1D709}}^{0}(X)$
-measurable single-valued selection.
Proof. It is known that
$\unicode[STIX]{x1D6F4}_{\unicode[STIX]{x1D709}}^{0}(X)$
is closed under countable unions, finite intersections, satisfies the generalized reduction property and
$\emptyset ,X\in \unicode[STIX]{x1D6F4}_{\unicode[STIX]{x1D709}}^{0}(X)$
(see [Reference Kechris16, Proposition 22.1, Theorem 22.16]). The result follows from the previous lemma and Theorem 6.6.◻
The classes
$\unicode[STIX]{x1D6F4}_{2n+2}^{1}(X)$
and
$\unicode[STIX]{x1D6F1}_{2n+1}^{1}(X)$
, for
$X$
Polish and
$n\in \unicode[STIX]{x1D714}$
, of the projective hierarchy are closed under countable unions, finite intersections, satisfy the generalized reduction property and contain
$\emptyset$
and
$X$
(see [Reference Kechris16, p. 327]), and thus, we can prove exactly in the same way the following two results.
Theorem 6.10. If
$X,Y$
are Polish spaces,
$n\in \unicode[STIX]{x1D714}$
and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a
$\unicode[STIX]{x1D6F4}_{2n+2}^{1}(X)$
-measurable multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a
$\unicode[STIX]{x1D6F4}_{2n+2}^{1}(X)$
-measurable single-valued selection.
Theorem 6.11. If
$X,Y$
are Polish spaces,
$n\in \unicode[STIX]{x1D714}$
and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a
$\unicode[STIX]{x1D6F1}_{2n+1}^{1}(X)$
-measurable multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a
$\unicode[STIX]{x1D6F1}_{2n+1}^{1}(X)$
-measurable single-valued selection.
6.3 Single-valued continuous selections of continuous multifunctions and the hyperspace selection problem
Let us consider two topological spaces
$X,Y$
and a multifunction
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
, where
${\mathcal{F}}(Y)$
is equipped with the Vietoris topology. Recall that the Vietoris topology is generated by the sets
$\{A\in {\mathcal{F}}(Y):A\cap U\neq \emptyset \}$
and
$\{A\in {\mathcal{F}}(Y):A\subseteq U\}$
, where
$U$
is an arbitrary open subset of
$Y$
. Michael [Reference Michael20] proposed that the problem of finding a single-valued continuous selection for
$\unicode[STIX]{x1D6F7}$
can be reduced in the following two problems: the first is to determine whether
$\unicode[STIX]{x1D6F7}$
is continuous and the second is to find a continuous map
$\unicode[STIX]{x1D719}:{\mathcal{F}}(Y)\rightarrow Y$
such that
$\unicode[STIX]{x1D719}(A)\in A$
for all
$A\in {\mathcal{F}}(Y)$
. The second problem is known as the hyperspace selection problem; for more details we refer to Repovs̆ and Semenov [Reference Repovs̆, Semenov, Hušek and van Mill26], Gutev [Reference Gutev, Hart, van Mill and Simon11], Gutev and Nogura [Reference Gutev, Nogura and Pearl12].
Generally, let
$X$
be a topological space and
${\mathcal{D}}$
a subspace of
${\mathcal{F}}(X)$
. A continuous map
$\unicode[STIX]{x1D719}:{\mathcal{D}}\rightarrow X$
such that
$\unicode[STIX]{x1D719}(A)\in A$
for all
$A\in {\mathcal{D}}$
, is called a continuous selection for
${\mathcal{D}}$
. A famous result in this direction that was proved independently by Choban [Reference Choban4] and Engelking, Heath, and Michael [Reference Engelking, Heath and Michael9] is the following.
If
$X$
is a completely metrizable space with
$\operatorname{dim}(X)=0$
, then there exists a continuous selection for
${\mathcal{F}}(X)$
.
This result, as Michael [Reference Michael20] first observed, evidently implies the following selection theorem.
If
$X$
is a topological space,
$Y$
a completely metrizable space with
$\operatorname{dim}(Y)=0$
and
$\unicode[STIX]{x1D6F7}:X\rightarrow {\mathcal{F}}(Y)$
a continuous multifunction, then
$\unicode[STIX]{x1D6F7}$
admits a single-valued continuous selection.
Here, using the core idea of Theorem 4.2, we provide an elementary proof of the above solution of the hyperspace selection problem, based on the concept of the leftmost branch of a tree (see [Reference Kechris16, p. 9]).
Theorem 6.12. Let
$X$
be a completely metrizable space with
$\operatorname{dim}(X)=0$
. Then there exists a continuous selection for
${\mathcal{F}}(X)$
.
Proof. Consider the identity multifunction
$\unicode[STIX]{x1D6F7}:{\mathcal{F}}(X)\rightarrow {\mathcal{F}}(X)$
; that is,
$\unicode[STIX]{x1D6F7}(A)=A$
for all
$A\in {\mathcal{F}}(X)$
. It is obvious that
$\unicode[STIX]{x1D6F7}$
is continuous. From Proposition 3.7 there exists a complete clopen disjoint tree scheme
$(W_{t})_{t\in T}$
on
$X$
. From Lemma 4.1
$(\unicode[STIX]{x1D6F7}^{l}(W_{t}))_{t\in T}$
is a clopen tree scheme on
$X$
. Assume that
$T$
is tree on a set
$I$
and let
${\leqslant}$
be a well-order on
$I$
. For each
$A\in {\mathcal{F}}(X)$
we define the pruned subtree
$T_{A}=\{t\in T:A\in \unicode[STIX]{x1D6F7}^{l}(W_{t})\}$
. Now we can correspond to each
$A\in {\mathcal{F}}(X)$
the leftmost branch
$b_{A}\in [T_{A}]$
; that is,
$b_{A}(n)\leqslant t(n)$
for each
$n\in \unicode[STIX]{x1D714}$
and
$t\in T_{A}$
with
$|t|=n$
. We define
$\unicode[STIX]{x1D719}:{\mathcal{F}}(X)\rightarrow X$
by
$\{\unicode[STIX]{x1D719}(A)\}=\bigcap _{n\in \unicode[STIX]{x1D714}}W_{b_{A}|n}$
. To complete the proof it suffices to show that
$\unicode[STIX]{x1D719}$
is a continuous selection of
$\unicode[STIX]{x1D6F7}$
. Let
$A\in {\mathcal{F}}(X)$
and
$W$
be an open neighborhood of
$\unicode[STIX]{x1D719}(A)$
. Since
$(W_{t})_{t\in T}$
is complete, there is
$n_{0}\in \unicode[STIX]{x1D714}$
such that
$\unicode[STIX]{x1D719}(A)\in W_{b_{A}|n_{0}}\subseteq W$
. Let
and
Since
$\unicode[STIX]{x1D6F7}(A)=A$
, observe that
$A\cap W_{t}\neq \emptyset$
if and only if
$t\in T_{A}$
. Furthermore,
$\{W_{t}:|t|=n\}$
is a cover of
$X$
for any
$n\in \unicode[STIX]{x1D714}$
, and hence,
$A\subseteq \bigcup _{t\in T_{A}^{n}}W_{t}$
and
$A\cap W_{b_{A}|n}\neq \emptyset$
for any
$n\leqslant n_{0}$
. Thus,
${\mathcal{U}}$
is an open neighborhood of
$A$
(with respect to the Vietoris topology). Moreover, by the definition of the leftmost branch and the fact that
$\{W_{t}:|t|=n\}$
is a pairwise disjoint cover of
$X$
for any
$n\leqslant n_{0}$
, we have
$b_{B}|n_{0}=b_{A}|n_{0}$
for all
$B\in {\mathcal{U}}$
. Therefore,
$\unicode[STIX]{x1D719}(B)\in W_{b_{A}|n_{0}}\subseteq W$
for all
$B\in {\mathcal{U}}$
, and so
$\unicode[STIX]{x1D719}$
is continuous. It remains to show that
$\unicode[STIX]{x1D719}$
is a selection of
$\unicode[STIX]{x1D6F7}$
. Again let
$A\in {\mathcal{F}}(X)$
. By the definition of
$b_{A}$
we have
$A\in \unicode[STIX]{x1D6F7}^{l}(W_{b_{A}|n})$
for all
$n\in \unicode[STIX]{x1D714}$
, equivalently
$\unicode[STIX]{x1D6F7}(A)\cap W_{b_{A}|n}\neq \emptyset$
for all
$n\in \unicode[STIX]{x1D714}$
. But
$\{W_{b_{A}|n}:n\in \unicode[STIX]{x1D714}\}$
is a neighborhood base at
$\unicode[STIX]{x1D719}(A)$
and
$\unicode[STIX]{x1D6F7}$
is closed-valued, and thus,
$\unicode[STIX]{x1D719}(A)\in \unicode[STIX]{x1D6F7}(A)$
, and the proof is complete.◻