1 Introduction
We will use the following standard notation: ZF for Zermelo–Fraenkel set theory, ZFC for Zermelo–Fraenkel set theory with the axiom of choice, ZFA for ZF weakened to permit the existence of atoms and ZFA + AC for ZFA with the addition of the axiom of choice.
All of our positive results about the implications between various consequences of the axiom of choice are theorems of ZFA and therefore theorems of the stronger theory ZF. Our independence results all hold in the theory ZF although many of them are first proved in ZFA and then transferred to ZF using a transfer theorem of Pincus.
Let
$\delta>0$
, the subject of this article is the deductive strength of the following theorem of ZFA + AC:
$$ \begin{align*} \begin{aligned} &\text{For every separable pseudometric space } (X, d),\\ & X \text{has a maximal non-strictly } \delta\text{ -separated set.} \end{aligned} \end{align*} $$
and three closely related theorems (see Definition 1.2, (6)–(9)). Our abbreviation for this theorem of
$\mathsf{ZFA} + \mathsf{AC}$
is
$\mathsf{PN}(\delta )$
(P for ‘pseudometric’ and N for ‘non-stricty’).
We begin with the definitions we will require.
Definition 1.1 (Metric space and set theoretic terminology).
-
(1) We use
$\omega $
for the set of natural numbers. That is,
$\omega = \{0, 1, 2, \ldots \}$
. -
(2)
$\mathbb {Z}$
denotes the set of integers and
$\mathbb {Z}^+ = \{ 1, 2, 3, \ldots \}$
is the set of positive integers. -
(3) A metric space is a pair
$(X,d),$
where X is a set and
$d: X \times X \to [0, \infty )$
is a function which satisfies: For all x,
$y,$
and z in
$X,$
-
(a)
$d(x,y) = 0 \iff x=y;$
-
(b)
$d(x,y) = d(y,x);$
-
(c)
$d(x,z) \le d(x,y) + d(y,z).$
-
-
(4) A pseudometric space is a pair
$(X,d)$
satisfying items (3b), (3c) above and for every
$x \in X d(x,x)=0$
. -
(5) An ultrametric space is a metric space
$(X,d)$
such that for every
$x, y, z \in X,$
$$\begin{align*}d(x,z) \le \text{max}(d(x,y), d(y,z)). \end{align*}$$
-
(6) Assume that
$(X,d)$
is either a metric space or a pseudometric space, that
$Y \subseteq X$
and that
$\delta> 0$
is a real number. Then-
(a) Y is a strictly
$\delta $
-separated set (in
$(X,d)$
) if for all distinct points x and y in Y,
$d(x,y)> \delta $
. -
(b) Y is a non-strictly
$\delta $
-separated set (in
$(X,d)$
) if for all distinct points x and y in Y,
$d(x,y) \ge \delta $
.
-
Definition 1.2 (Weak choice axioms).
-
(1) AC (Form 1 in [Reference Howard and Rubin4]) is the axiom of choice: For every set X of non-empty sets, there is a function
$f : X \to \bigcup X$
such that
$\forall y \in X, f(y) \in y$
. -
(2) CC (Form 8 in [Reference Howard and Rubin4]): For every countable set X of non-empty sets, there is a function
$f : X \to \bigcup X$
such that
$\forall y \in X, f(y) \in y$
. -
(3)
$\mathsf{CC}(\mathbb {R})$
(Form 94 in [Reference Howard and Rubin4]): For every countable set X of non-empty sets of real numbers, there is a function
$f : X \to \bigcup X$
such that
$\forall y \in X, f(y) \in y$
. -
(4) A relation R on set X is entire (on X) if for every
$x \in X$
there exists
$y \in X$
such that
$x \mathrel {R} y$
. -
(5) DC (Form 43 in [Reference Howard and Rubin4]) is “For every non-empty set X and every entire relation R on X there is a sequence
$\{ x_i \}_{i = 1} ^\infty \subset X$
such that
$x_i \mathrel {R} x_{i+1}$
for all
$i \in \mathbb {Z}^+$
.” -
Each of the following eight statements has a parameter
$\delta $
, where
$\delta $
is a positive real number. -
(6)
$\mathsf{PS}(\delta ) $
: For every separable pseudometric space
$(X,d)$
, X has a maximal strictly
$\delta $
-separated subset. -
(7)
$\mathsf{MS}(\delta )$
: For every separable metric space
$(X,d)$
, X has a maximal strictly
$\delta $
-separated subset. -
(8)
$\mathsf{PN}(\delta )$
: For every separable pseudometric space
$(X,d)$
, X has a maximal non-strictly
$\delta $
-separated subset. -
(9)
$\mathsf{MN}(\delta )$
: For every separable metric space
$(X,d)$
, X has a maximal non-strictly
$\delta $
-separated subset. -
(10)
$\mathsf{PSE}(\delta ) $
: For every separable pseudometric space
$(X,d)$
, if
$S \subseteq X$
is strictly
$\delta $
-separated set then there is an
$S' \subseteq X$
such that
$S \subseteq S'$
and
$S'$
is a maximal strictly
$\delta $
-separated set. -
(11)
$\mathsf{MSE}(\delta )$
: For every separable metric space
$(X,d)$
, if
$S \subseteq X$
is strictly
$\delta $
-separated set then there is an
$S' \subseteq X$
such that
$S \subseteq S'$
and
$S'$
is a maximal strictly
$\delta $
-separated set. -
(12)
$\mathsf{PNE}(\delta )$
: For every separable pseudometric space
$(X,d)$
, if
$S \subseteq X$
is non-strictly
$\delta $
-separated set then there is an
$S' \subseteq X$
such that
$S \subseteq S'$
and
$S'$
is a maximal non-strictly
$\delta $
-separated set. -
(13)
$\mathsf{MNE}(\delta )$
: For every separable metric space
$(X,d)$
, if
$S \subseteq X$
is non-strictly
$\delta $
-separated set then there is an
$S' \subseteq X$
such that
$S \subseteq S'$
and
$S'$
is a maximal non-strictly
$\delta $
-separated set.
In [Reference Dybowski and Górka2] Dybowski and Górka studied
$\mathsf{PS}(\delta )$
and
$\mathsf{MS}(\delta )$
. They proved that several strengthenings of
$\mathsf{PS}(\delta )$
are equivalent to AC in ZF. To be more specific, in their Proposition 4.2 they proved that the following statement is equivalent to AC:
$$ \begin{align} \begin{aligned} &\text{For every pseudometric space } (X, d), \text{ and every } \delta>0, \\ & X \text{has a maximal strictly } \delta\text {-separated set.} \end{aligned} \end{align} $$
(Note that the “separable” requirement has been removed.)
They also showed that if “pseudometric” is replaced by “metric” or by “ultrametric” in (1) each of the resulting statements is equivalent to AC.
Remark 1.3 (ZFA).
For all
$\delta \in \mathbb {R}^+$
,
$\mathsf{DC} \implies \mathsf{PS}(\delta ) + \mathsf{PN}(\delta ) + \mathsf{MN}(\delta ) + \mathsf{MS}(\delta )$
.
Proof. The implication
$\mathsf{DC} \implies \mathsf{PS}(\delta )$
was proved before (see [Reference Dybowski and Górka2, Corollary 4.5]). The proof given can be modified to show that DC implies
$\mathsf{PN}(\delta )$
. Since
$\mathsf{PN}(\delta )$
implies
$\mathsf{MN}(\delta )$
and
$\mathsf{PS}(\delta )$
implies
$\mathsf{MS}(\delta )$
, it follows that DC also implies
$\mathsf{MN}(\delta )$
and
$\mathsf{MS}(\delta )$
.
Finally they ask in Problem 4.6 about what else can be said concerning the strength, in set theory without AC, of the statements
$\mathsf{PS}(\delta )$
and
$\mathsf{MS}(\delta )$
.
The purpose of this article is to provide some answers to this question and to related questions involving items (6) through (13) in Definition 1.2 above. Our results are summarized in the following diagram. (See the paragraph following the proof of Theorem 2.2 for a description of the abbreviations used in the diagram.)
We use a variation of the notation of [Reference Bentley and Herrlich1], namely, if
$\boldsymbol {\Psi }$
and
$\boldsymbol {\Phi }$
are sentences and occur in a box together then they are equivalent in ZF. If
$\boldsymbol {\Psi }$
implies
$\boldsymbol {\Phi }$
in ZF and we don’t know whether of not
$\boldsymbol {\Phi }$
implies
$\boldsymbol {\Psi }$
in ZF we use
$\boldsymbol {\Psi } \to \boldsymbol {\Phi }$
. Sentence
$\boldsymbol {\Psi } \mapsto \boldsymbol {\Phi }$
means that in ZF,
$\boldsymbol {\Psi }$
implies
$\boldsymbol {\Phi }$
but
$\boldsymbol {\Phi }$
does not imply
$\boldsymbol {\Psi }$
.
means
$\boldsymbol {\Psi }$
does not imply
$\boldsymbol {\Phi }$
in ZF and we don’t know whether or not
$\boldsymbol {\Phi }$
implies
$\boldsymbol {\Psi }$
.

The diagram shows that there are several unsolved problems. For example,
-
(1) Does
$\mathsf{PSE}$
imply
$\mathsf{PNE}$
? -
(2) Does CC imply
$\mathsf{MN}$
or
$\mathsf{MNE}$
? -
(3) Does either of
$\mathsf{MN}$
or
$\mathsf{MSE}$
imply
$\mathsf{MNE}$
? -
(4) Is
$\mathsf{MN}$
provable in ZF?
We note that if the answer to question (4) is in the affirmativeFootnote 1 then all of the other questions are answered and the diagram collapses to

2 Preliminary results
Proposition 2.1 (ZFA).
If
$(X,d)$
is a separable metric space then
$|X| \le |\mathbb {R}|$
.
Proof. For each point
$x \in X$
we can define a (unique) sequence
$\hat {x}$
of elements of D (the countable dense set) by letting
$\hat {x}_n$
be the first element of D which is in
$B(x,1/(n+1))$
. It is clear that the function
$x \mapsto \hat {x}$
is one to one so
$|X| \le |D^{\aleph _0}| \le |\aleph _0^{\aleph _0}| = |\mathbb {R}|$
.
Theorem 2.2 (ZFA).
Assume
$\boldsymbol {\Psi }$
is one of
$\mathsf{PS, MS, PN, MN, PSE, MSE, PNE,}$
or
$\mathsf{MNE}$
and
$\delta _1$
and
$\delta _2$
are positive real numbers. Then
$\boldsymbol {\Psi }(\delta _1) \implies \boldsymbol {\Psi }(\delta _2)$
.
Proof. We give an outline of the proof for the case that
$\boldsymbol {\Psi }$
is
$\mathsf{PSE}$
and leave the remaining similar proofs for the interested reader.
Assume
$\mathsf{PSE}(\delta _1)$
and let S be a strictly
$\delta _2$
-separated set in the pseudometric space
$(X,p)$
. Define a metric
$p'$
on X by
$p'(x,y) = \frac { \delta _1}{ \delta _2}p(x,y) $
. Then
$(X,p')$
is a pseudometric space and S is a strictly
$\delta _1$
-separated set in
$(X,p')$
. Using
$\mathsf{PSE}(\delta _1)$
there is a maximal strictly
$\delta _1$
-separated set
$S'$
in
$(X,p')$
such that
$S \subset S'$
and therefore
$S'$
is a maximal strictly
$\delta _2$
-separated set in
$(X,p)$
.
Having in mindFootnote
2
Theorem 2.2, for the remainder of the article we use the following notation. If
$\boldsymbol {\Psi }$
is one of
$\mathsf{PS, MS, PN, MN, PSE, MSE, PNE,}$
or
$\mathsf{MNE}$
, we will frequently write
$\boldsymbol {\Psi }$
for any one of the equivalent statements “
$\forall \delta> 0, \boldsymbol {\Psi }(\delta )$
”, “
${\exists \delta> 0, \boldsymbol {\Psi }(\delta )}$
” or, if
$\delta $
is a specific positive real number, “
$\boldsymbol {\Psi }(\delta )$
”.
Proposition 2.3 (ZFA).
Let
$(\boldsymbol {\Psi }_1, \boldsymbol {\Phi }_1)$
be (PS, PSE) or (PN, PNE) and let
$(\boldsymbol {\Psi }_2, \boldsymbol {\Phi }_2)$
be (MS, MSE) or (MN, MNE). Then, CC
$+ \boldsymbol {\Psi }_1 \implies \boldsymbol {\Phi }_1 \implies \boldsymbol {\Psi }_1$
and CC(
$\mathbb {R}$
)
$+ \boldsymbol {\Psi }_2 \implies \boldsymbol {\Phi }_2 \implies \boldsymbol {\Psi }_2$
.
Proof. Let us notice that the implications
$\boldsymbol {\Phi }_1 \implies \boldsymbol {\Psi }_1$
and
$\boldsymbol {\Phi }_2 \implies \boldsymbol {\Psi }_2$
are clear. We shall prove only the implication CC
$+ \boldsymbol {\Psi }_1 \implies \boldsymbol {\Phi }_1$
since CC(
$\mathbb {R}$
)
$+ \boldsymbol {\Psi }_2 \implies \boldsymbol {\Phi }_2$
follows in the similar manner using the fact that all separable metric spaces can be bijectively embedded in
$\mathbb {R}$
(see Proposition 2.1). We prove the implication CC
$+ \boldsymbol {\Psi }_1 \implies \boldsymbol {\Phi }_1$
for pair
$(\boldsymbol {\Psi }_1, \boldsymbol {\Phi }_1) = (\mathsf{PN}, \mathsf{PNE})$
since the remaining case follows in the similar way.
Let us assume CC and PN hold. Let
$(X, d)$
be a pseudometric separable space,
$\delta> 0$
and
$S \subset X$
be an arbitrary non-strictly
$\delta $
-separated set. We define
$N_\delta (S) = \bigcup _{x \in S} B\left ({x, \delta }\right )$
. Let us consider pseudometric space
$\left ({X \setminus N_\delta (S), d}\right )$
. Under CC separability is hereditaryFootnote
3
(see [Reference Bentley and Herrlich1, Theorem 1.12]) so
$X \setminus N_\delta (S)$
is separable. Thus by virtue of PN space
$X \setminus N_\delta (S)$
contains a maximal non-strictly
$\delta $
-separable set
$S_0$
. We claim that
$S' := S \cup S_0$
is the maximal non-strictly
$\delta $
-separated set in X containing S.
Indeed, let
$x, y \in S'$
,
$x \neq y$
. If
$x, y \in S$
or
$x, y \in S_0$
, then
$d(x, y) \ge \delta $
. If
$x \in S$
and
$y \in S_0$
, then
$y \notin N_\delta (S)$
so
$y \notin B(x, \delta )$
. It proves that
$S'$
is non-strictly
$\delta $
-separated set.
Let us suppose that
$S'$
is not a maximal non-strictly
$\delta $
-separated set, i.e., there exists
$x_0 \notin S'$
such that
$d(x_0, x) \ge \delta $
for all
$x \in S'$
. In particular
$d(x_0, x) \ge \delta $
for all
$x \in S$
so
$x_0 \notin N_\delta (S)$
. Since
$x_0 \in X \setminus N_\delta (S)$
,
$x_0 \notin S_0$
and
$S_0$
is maximal non-strictly
$\delta $
-separated set in
$X \setminus N_\delta (S)$
, then
$d(x_0, x) < \delta $
for some
$x \in S_0$
and it gives a contradiction.
Theorem 2.4 (ZFA).
Let
$\boldsymbol {\Psi }$
be one of
$\mathsf{PS, MS, PN, MN, PSE, MSE, PNE,}$
or
$\mathsf{MNE}$
, then
$\mathsf{DC} \implies \boldsymbol {\Psi }$
.
Proof. Let
$(\boldsymbol {\Psi _1}, \boldsymbol {\Psi _2})$
be one of (PS, PSE), (MS, MSE), (PN, PNE), or (MN, MNE). By Remark 1.3 we have DC
$\implies \boldsymbol {\Psi _1}$
. Thus by virtue of Proposition 2.3 we get
$\mathsf{DC} \implies \mathsf{DC} + \boldsymbol {\Psi _1} \implies \mathsf{CC} + \boldsymbol {\Psi _1} \implies \boldsymbol {\Psi _2}$
.
We now turn to a brief discussion of Fraenkel–Mostowski models and a transfer theorem of Pincus. Fraenkel–Mostowski permutation models of the theory ZFA provide a relatively easy way of proving independence results in the theory ZFA.Footnote
4
These independence results usually have the form “There is a permutation model in which
$\boldsymbol {\Phi } = \boldsymbol {\Gamma } \land \lnot \boldsymbol {\Psi }$
holds” where
$\boldsymbol {\Gamma }$
and
$\boldsymbol {\Psi }$
are consequences of AC. A sentence
$\boldsymbol {\Phi }$
is transferable if there is a meta theorem “If there is a Fraenkel–Mostowski model of ZFA in which
$\boldsymbol {\Phi }$
is true then there is a model of ZF in which
$\boldsymbol {\Phi }$
is true.” We will be using a transfer theorem of Pincus [Reference Pincus6, Theorem 4]. The part of the theorem that we need is the following.
Theorem 2.5. Let
$\boldsymbol {\Phi }$
be a conjunction of
$\mathsf{CC}$
and any (finite) number of injectively boundable statements. If
$\boldsymbol {\Phi }$
has a Fraenkel–Mostowski model then
$\boldsymbol {\Phi }$
has a ZF model.
For a definition of injectively boundable see [Reference Pincus6] or [Reference Howard and Rubin4, Note 103].
3 Strict
$\delta $
-separation in separable pseudometric spaces
We first show that
$\mathsf{PS}$
is provable in ZFA.
Theorem 3.1 (ZFA).
For all
$\delta \in \mathbb {R}^+$
,
$\mathsf{PS}(\delta )$
.
Proof. By Theorem 2.2, we only have to prove the theorem for
$\delta = 1$
. As in the proof of Theorem 2.4 this proof depends on ideas from [Reference Dybowski and Górka2]. Let
$(X,p)$
be a separable pseudometric space with countable dense subset
$D = \{d_i : i \in \mathbb {Z}^{+} \}$
and assume that
$(X,p)$
has no finite maximal strictly
$1$
-separated set.
Lemma 3.2. If T is a finite subset of X and
$N \in \mathbb {Z}^{+}$
is such that
$\Omega := B(d_N, 1/2) \setminus \bigcup _{t\in T}\overline {B}(t,1) \neq \emptyset $
, then there exists
$i \in \mathbb {Z}^{+}$
such that
$d_i \in \Omega $
.
Proof. The set
$\Omega $
is open and by our assumption non-empty. Since D is dense in
$(X,p)$
, there is an
$i \in \mathbb {Z}^{+}$
such that
$d_i \in \Omega $
. This completes the proof of the lemma.
We shall define by recursion a sequence of pairs of positive integers
$(k_i, n_i)_{i=1}^\infty $
so that the set
$\{ d_{k_i} : i \in \mathbb {Z}^+ \}$
is a maximal strictly
$1$
-separated set in
$(X,p)$
. We give the construction of the set
$(k_i, n_i)_{i=1}^\infty $
and prove by induction that
$(k_i, n_i)_{i=1}^\infty $
has the following properties for
$i \in \mathbb {Z}^+$
:
-
(1)
$d_{k_i} \in B(d_{n_i}, \frac {1}{2})$
; -
(2) if
$j \in \mathbb {Z}^+$
is such that
$j < i$
, then
$n_j < n_i$
; -
(3) if
$j \in \mathbb {Z}^+$
is such that
$j < i$
, then
$p(d_{k_i}, d_{k_j})> 1$
.
Construction of the sequence
$(k_i, n_i)_{i=1}^\infty $
:
$\bullet~ (k_1,n_1) = (1,1)$
. It is clear that Properties (1) through (3) are true when
$i = 1$
.
$\bullet $
Assume that
$(k_i, n_i)$
has been defined for all
$i < m$
and that for all
$i < m$
, Properties (1) through (3) are true. By Property (3) the set
$\{ d_{k_i} : i < m \}$
is strictly
$1$
-separated, but, by our assumption, is not maximal. Therefore there exists
$ y \in X$
such that for all
$i < m$
,
$p(y, d_{k_i})> 1$
and thus there must be an
$N \in \mathbb {Z}^+$
such that
$y \in B(d_N, 1/2)$
. Let
$$ \begin{align} n_m = \min \left\{ l: B(d_l, 1/2) \setminus \bigcup_{i=1}^{m-1}\overline{B}(d_{k_i},1) \neq \emptyset \right\}. \end{align} $$
By Lemma 3.2 there is
$k \in \mathbb {Z}^+$
such that
$d_k \in B(d_{n_m}, 1/2) \setminus \bigcup _{i=1}^{m-1}\overline {B}(d_{k_i},1)$
. We let
$$ \begin{align} k_m= \min \left\{ k: d_k \in B(d_{n_m}, 1/2) \setminus \bigcup_{i=1}^{m-1}\overline{B}(d_{k_i},1) \right\}. \end{align} $$
Assuming that
$(k_i, n_i)$
satisfies items (1) through (3) (preceding the Construction) for all
$i < m$
we show that
$(k_i, n_i)$
satisfies those properties for
$i = m$
.
Property (1) follows from Equation (3) in the Construction.
For Property (2) we first note that for all
$j < m$
,
$n_j \ne n_m$
. Indeed, since
$p(d_{n_j}, d_{k_j}) <1/2$
and
$p(d_{n_m}, d_{k_m}) < 1/2$
, the equality
$n_j = n_m$
would lead to the contradiction
To complete the proof assume that Property (2) is false and let
$i'$
be the least positive integer less than m for which
$n_m \le n_{i'}$
. Then, since for all
$j <m n_j \ne n_m$
, we have
$n_m < n_{i'}$
. We also know that
$d_{k_m}\in B(d_{n_m}, 1/2) \setminus \bigcup _{i=1}^{i'-1}\overline {B}(d_{k_i},1) $
. Therefore,
$ n_{i'} \le n_m$
and we get a contradiction.
Property (3) follows from Equation (3) in the Construction.
To complete the proof of Theorem 3.1 we have to argue that
$S = \{ d_{k_i} : i \in \mathbb {Z}^+ \}$
is a maximal strictly
$1$
-separated set. The fact that S is strictly
$1$
-separated follows from Property (3). To prove that S is maximal we assume the contrary. Then there exists
$y \in X\setminus S$
such that for all
$i \in \mathbb {Z}^{+}, p(y,d_{k_i})> 1$
. There is an
$n \in \mathbb {Z}^+$
such that
$y \in B(d_n, 1/2)$
and we assume that n is the least such positive integer. Since
$\{ n_i \}_{i \in \mathbb {Z}^+}$
is a strictly increasing sequence of integers there is the least
$j \in \mathbb {Z}^+$
such that
$n \le n_j$
. It is not possible that
$n = n_j$
because, as above this leads to the contradiction
so
$n < n_j$
. On the other hand
$y \in B(d_n, 1/2) \setminus \bigcup _{i=1}^{j-1}\overline {B}(d_{k_i}, 1)$
and thus by the definition of
$n_j$
in (2) we have
$n_j \le n$
which is an obvious contradiction.
Theorem 3.3 (ZFA).
$\mathsf{PSE} \implies \mathsf{CC}$
.
Proof. By Theorem 2.2, it suffices to prove
$\mathsf{PSE}(1) \implies \mathsf{CC}$
.
Assume that
$\mathcal {Y} = \{Y_n : n \in \omega \}$
is a countable pairwise disjoint family of non-empty sets (and that the mapping
$n \mapsto Y_n$
is one to one). Our plan is to apply
$\mathsf{PSE}(1)$
to a certain separable pseudometric space
$(X,d)$
and a strictly
$1$
-separated set in
$(X,d)$
to get a maximal strictly
$1$
-separated set. From this we will be able to obtain a choice function for
$\mathcal {Y}$
.
To construct X we assume without loss of generality that
For
$i \in \mathbb {Z}^+$
we define two sequences
$a_i = (a_i(k))_{k\in \mathbb {Z}^+}$
and
$a_i' = ( a_i'(k))_{k \in \mathbb {Z}^+}$
(both in
$\mathbb {R}^{(\mathbb {Z}^+)}$
) by
$$ \begin{align*} a_i(k) = \begin{cases}\frac{i+1}{i} & \text{ if } i = k\\ 0 & \text{ otherwise} \end{cases} , \,\,\,\, a_i'(k) = \begin{cases} \frac{1}{i} & \text{ if }i = k \\ 0 & \text{ otherwise}. \end{cases} \end{align*} $$
Let
$\mathbf {z} \in \mathbb {R}^{(\mathbb {Z}^+)}$
be the zero sequence defined by
$\mathbf {z}(k) = 0$
for all
$k \in \mathbb {Z}^+$
and define A and
$A_E$
, respectively, by
Let
$d_E$
be the usual Euclidean metric on
$A_E$
defined by
$$\begin{align*}d_E(b,c) = \sqrt{\sum_{k=1}^\infty (c(k)-b(k))^2}. \end{align*}$$
For each
$n \in \omega $
, let
$X_n = (A \times \{ n \}) \cup Y_n$
and let
$X = \bigcup _{n \in \omega } X_n$
. Finally, define a metric d on X by
$$\begin{align*}d(t,s) = \begin{cases} 3 & \text{ if } \exists m,n \in \omega \text{ with } m \ne n \land t \in X_n \land s \in X_m \\ 0 & \text{ if } \exists n \in \omega \text{ such that }t,s \in Y_n \\ d_E(x,y) & \text{ if } \exists n \in \omega \hskip.05in \exists x, y \in A \text{ such that } t = (x,n) \land s = (y,n) \\ d_E(x,\mathbf{z}) & \text{ if } \exists n \in \omega \hskip.05in \exists x \in A \text{ such that } (t= (x,n) \land s \in Y_n ) \text{ or }\\ & \hskip.2in(s = (x,n) \land t \in Y_n). \end{cases}. \end{align*}$$
Our assumption that the elements of
$\mathcal {Y}$
are pairwise disjoint and the assumption (4) ensure that d is well defined. Furthermore, one can easily convince oneself that
$(X,d)$
is a pseudometric space.
We now list some properties of
$(X,d)$
which will be useful in proving Lemmas 3.5 through 3.7. The proofs are straightforward.
Lemma 3.4.
-
(1) For all
$n \in \omega , i \in \mathbb {Z}^+, s \in Y_n, d((a^{\prime }_i,n),s) = 1/i$
. -
(2) If
$i \ne j$
,
$d((a_i,n),(a_j,n)) = \sqrt {\left ( \frac {i+1}{i}\right )^2 + \left (\frac {j+1}{j}\right )^2}> 1$
. -
(3) For all
$ n \in \omega , i \in \mathbb {Z}^+, d((a_i,n),(a^{\prime }_i,n)) = 1$
. -
(4) For all
$n \in \omega , s \in Y_n, t \in X \setminus Y_n$
, if
$d(s,t) \leq 1$
then
$t = (a^{\prime }_i,n)$
for some
$i \in \mathbb {Z}^+$
.
Lemma 3.5. The set
$D = \bigcup _{n \in \omega } (A \times \{ n \}) = A \times \omega $
is a countable dense subset of
$(X,d)$
.
Proof. Since A is countable,
$D = A \times \omega $
is countable. Furthermore, since
$X = D \cup \left ( \bigcup _{n \in \omega } Y_n \right )$
, to show that D is dense in
$(X,d)$
it suffices to prove that every
$t \in \bigcup _{n \in \omega } Y_n$
is a limit point of D. By definition
$\{ (a^{\prime }_i,n) : i \in \mathbb {Z}^+ \land n \in \omega \} \subseteq D$
. Therefore part (1) of Lemma 3.4 implies that t is a limit point of D.
Let
$S = \bigcup _{n \in \omega } \left ( \{a_i : i \in \mathbb {Z}^+ \} \times \{ n \} \right ) = \{a_i : i \in \mathbb {Z}^+ \} \times \omega $
.
Lemma 3.6. The set S is strictly
$1$
-separated.
Proof. Assume
$(a_i,n)$
and
$(a_j,m)$
are distinct elements in S. If
$n \ne m$
then by the first clause of the definition of d,
$d((a_i,n),(a_j,m)) = 3> 1$
. On the other hand, if
$n = m$
then
$i \ne j$
, so by part (2) of Lemma 3.4,
$d((a_i,n),(a_j,m))> 1$
.
Lemma 3.7. If
$S'$
is a maximal strictly
$1$
-separated set containing S then for all
$n \in \omega $
,
$|S' \cap Y_n| = 1$
.
Proof. Assume
$S'$
satisfies the hypotheses of the lemma and assume
$n \in \omega $
. Clearly,
$|S' \cap Y_n| \le 1$
. We prove
$|S' \cap Y_n| \ge 1$
by contradiction. Suppose
$S' \cap Y_n = \emptyset $
. Since
$S'$
is maximal, for all
$y \in Y_n$
there is a
$t \in S' \setminus Y_n$
such that
$d(t,y) \le 1$
. By part (4) of Lemma 3.4,
$t = (a^{\prime }_i,n)$
for some
$i \in \mathbb {Z}^+$
. But by part (3) in Lemma 3.4,
$d((a^{\prime }_i,n), (a_i,n)) = 1$
. This is a contradiction since
$(a_i,n) \in S \subseteq S'$
.
By Lemmas 3.5 and 3.6 and
$\mathsf{PSE}(1)$
, there is a maximal strictly
$1$
-separated set
$S'$
containing S. Therefore, by Lemma 3.7,
$\mathcal {Y}$
has a choice function.
4 Non-strict
$\delta $
-separation in separable pseudometric spaces
Theorem 4.1 (ZFA).
$\mathsf{PN} \implies \mathsf{CC}$
.
Proof. As in the proof of Theorem 3.3, it suffices to prove
$\mathsf{PN}(1) \implies \mathsf{CC}$
. Assume
$\mathsf{PN}(1)$
and let X be a countable family of non-empty, pairwise disjoint sets where the function
$n \mapsto X_n$
is one to one from
$\omega $
onto X. Also assume without loss of generality that
$(\bigcup X) \cap \mathbb {R} = \emptyset $
. We will construct a choice function for X.
Lemma 4.2. There is a separable pseudometric space
$(Z,p)$
such that:
-
(1)
$\bigcup _{n \in \omega } (X_n \times \{ 0, 1 \}) \subseteq Z;$
-
(2) every maximal non-strictly
$1$
-separated set S in
$(Z,p)$
satisfies for all
$n \in \omega $
,-
(a)
$0 < \large | S \cap \large (X_n \times \{ 0, 1\}\large ) \large |; $
-
(b)
$\left | S \cap (X_n \times \{ 0 \}) \right | \le 1$
and
$\left | S \cap (X_n \times \{ 1 \}) \right | \le 1.$
-
Before giving the proof of the lemma we argue that Lemma 4.2 is sufficient to prove Theorem 4.1 in the case
$\delta = 1$
.
To construct a choice function f for X let
$(Z,p)$
be the pseudometric given by Lemma 4.2. By
$\mathsf{PN}(1)$
there is a maximal non-strictly
$1$
-separated set S in
$(Z,p)$
and by Lemma 4.2, for each
$n \in \omega $
, each of
$S \cap (X_n \times \{ 0 \})$
and
$S \cap (X_n \cap \{ 1 \})$
contains at most one element and one of these two sets is non-empty. We can therefore define
$f(X_n)$
to be the element of
$x \in X_n$
for which
$(x,0) \in S$
if such an element exists. Otherwise
$f(X_n)$
is the element
$x \in X_n$
for which
$(x,1) \in S$
.
Proof of Lemma 4.2.
We begin by defining a certain subset
$Y_0$
of the Euclidean plane
$(\mathbb {R}^2, d)$
as follows. Let
$$ \begin{align*} A_0^0 &= \left\{ (x,y) \in \mathbb{R}^2: x^2 + (y-1)^2 = 1 \text{ and } 0 < x < \sqrt{3}/2 \text{ and } x \text{ is rational and } 0 < y < 1/2 \right\},\\ A_0^1 &= \left\{ (x,y) \in \mathbb{R}^2 : x^2 + y^2 = 1 \text{ and } 0 < x < \sqrt{3}/2 \text{ and } x \text{ is rational and } 1/2 < y < 1 \right\}, \\ Y_0 &= A_0^0 \cup A_0^1. \end{align*} $$

Note that both
$A_0^0$
and
$A_0^1$
are countable. For every positive integer n we let
$A_n^0 = \{ (a, b + 2n) : (a,b) \in A_0^0 \}$
,
$A_n^1 = \{ (x, y + 2n) : (x,y) \in A_0^1 \}$
and
$Y_n = A_n^0 \cup A_n^1$
. Since for every
$(x,y) \in Y_0$
, we have
$0 < y < 1$
we conclude that for every pair
$(x,y) \in Y_n$
we have
$2n < y < 2n + 1$
.
Sublemma 4.2.1. Let
$n \in \omega $
, then for all
$(a_1,b_1)$
and
$(a_2, b_2)$
in
$A_n^0$
and for all
$(x_1,y_1)$
and
$(x_2,y_2)$
in
$A_n^1$
we have
Proof. It is enough to prove the Sublemma for
$n=0$
. Parts (6)–(8) are clear from the picture. For part (5) an algebraic proof can be given by assuming that
$(a_1,b_1) \in A_0^0$
and
$(x_1,y_1) \in A_0^1$
and calculating the square of the distance from
$(a_1,b_1)$
to
$(x_1,y_1)$
.
For
$n \in \omega $
, let
$Z_n = Y_n \cup \left ( X_n \times \{0, 1\}\right )$
and let
$Z = \bigcup _{n\in \omega } Z_n$
. We shall define a pseudometric p on Z using the usual metric on
$\mathbb {R}^2$
and for each
$n \in \omega $
, placing one copy of
$X_n$
(namely,
$X_n \times \{ 0 \}$
) at the point
$(0,2n)$
and one copy of
$X_n$
(namely,
$X_n \times \{ 1 \}$
) at
$(0,2n+1)$
. Here are the details. Define a function
$c : Z \to \mathbb {R}^2$
by
$$\begin{align*}c(t,s) = \begin{cases} (t,s) & \text{ if } (t, s) \in \bigcup_{n \in \omega} Y_n \\ (0, 2n) & \text{ if } t \in X_n \text{ and } s = 0 \\ (0,2n+1) & \text{ if } t \in X_n \text{ and } s = 1. \end{cases} \end{align*}$$
Function c assigns each point of Z to a point in the plane and the distance between two elements of Z will be the Euclidean distance between their assignments. That is, define a pseudometric p on Z by
Sublemma 4.2.2. Assume
$z_1, z_2 \in A_n^0$
,
$w_1, w_2 \in A_n^1$
,
$u_1, u_2 \in X_n \times \{ 0 \}$
and
$v_1, v_2 \in X_n \times \{ 1 \}$
, then
-
(1)
$p(z_1, w_1) < 1$
, -
(2)
$p(z_1, z_2) < 1$
and
$p(w_1,w_2) < 1$
, -
(3)
$p(z_1,u_1) < 1$
and
$p(w_1,v_1) < 1$
, -
(4)
$p(z_1, v_1) = 1$
and
$p(w_1,u_1) = 1$
, -
(5)
$p(u_1,v_1) = 1$
, -
(6)
$p(u_1,u_2) = 0$
and
$p(v_1,v_2) = 0$
.
Proof. Using the definitions of c and p, items (1) through (4) follow from equations (5) through (8) respectively and items (5) and (6) are clear from the definitions of c and p.
It is clear that
$(Z,p)$
is a pseudometric space. It is also the case that
$\bigcup _{n \in \omega } Y_n$
is a countable dense subset of Z since every element of
$X_n \times \{ 0 \}$
is a limit point of
$A_n^0$
and every element of
$X_n \times \{ 1 \}$
is a limit point of
$A_n^1$
. Therefore
$(Z,p)$
is a separable pseudometric space satisfying condition (1) of Lemma 4.2.
To argue that condition (2) of Lemma 4.2 holds assume that S is a maximal non-strictly
$1$
-separated set in
$(Z,p)$
and that
$n \in \omega $
. Part (2b) follows from Sublemma 4.2.2 part (6). To argue for part (2a), we begin by showing that for
$i \in \{0,1\},$
We will argue for
$i=0$
and the case
$i=1$
we leave to the reader. Assume
$u \in X_n \times \{ 0 \}$
,
$z \in Z \setminus (X_n \times \{ 0 \})$
and
$p(u,z) < 1$
. Under these assumptions
$z \notin Z_m$
where
$m \in \omega \setminus \{ n \}$
because for every element z of
$Z_m$
, if
$r_1$
is the second component of
$c(z)$
then
$2m \le r_1 \le 2m + 1$
. Whereas, if
$r_2$
is the second component
$c(u)$
then
$r_2 = 2n$
. This implies that
$p(u,z) = d(c(u),c(z)) \ge 1$
. Since
$z \notin \bigcup _{m \in \omega \setminus \{ n \}} Z_m$
we have
$z \in Z_n \setminus (X_n \times \{ 0 \}) = A^0_n \cup A^1_n \cup (X_n \times \{ 1 \})$
. By Sublemma 4.2.2, item (4),
$z \notin A^1_n$
. By Sublemma 4.2.2, item (5),
$z \notin X_n \times \{ 1 \}$
. Therefore
$z \in A^0_1$
completing the proof of (10).
We complete the proof of Lemma 4.2, part (2) by contradiction. Assume that both
$S \cap (X_n \times \{ 0 \})$
and
$S \cap (X_n \times \{ 1 \})$
are empty. By the first of these assumptions, since S is maximal, for every
$z \in X_n \times \{ 0 \}$
there is an element
$s \in S$
such that
$p(z,s) < 1$
. Hence, by equation (10) this means that there is an element
$e_0 \in S \cap A^0_n$
. Similarly, there is an element
$e_1 \in S \cap A^1_n$
. But this is a contradiction, since by Sublemma 4.2.2, part (1),
$p(e_0,e_1) < 1$
.
Corollary 4.3.
-
(i)
$\mathsf{CC} \iff \mathsf{PSE} \implies \mathsf{MSE}$
; -
(ii)
$ \mathsf{PN} \iff \mathsf{PNE} \implies \mathsf{CC}$
.
5 Strict and non-strict
$\delta $
-separation in separable metric spaces
We first make several remarks about the consequences of Proposition 2.1 for Fraenkel–Mostowski models of ZFA.
Remark 5.1.
-
(1) In any Fraenkel–Mostowski model of ZFA the real numbers are well orderable and therefore, by Proposition 2.1, every separable metric space is well orderable. It follows from the discussion in [Reference Jech5, Section 4.2] that all of the statements
$\mathsf{MSE}$
,
$\mathsf{MNE}$
,
$\mathsf{MS,}$
and
$\mathsf{MN}$
are true in all Fraenkel–Mostowski models. -
(2) The statements
$\mathsf{MSE}$
,
$\mathsf{MNE}$
,
$\mathsf{MS,}$
and
$\mathsf{MN}$
are injectively boundable. See [Reference Howard and Rubin4, Note 103] or [Reference Pincus6] for a definition of injectively boundable. -
(3) Therefore using Theorem 2.5, if
$\boldsymbol {\Phi }$
is any consequence of
$\mathsf{AC}$
which is false in some Fraenkel–Mostowski model and whose negation is injectively boundable then none of the statements
$\mathsf{MSE}$
,
$\mathsf{MS}$
,
$\mathsf{MNE,}$
or
$\mathsf{MN}$
implies
$\boldsymbol {\Phi }$
in
$\mathsf{ZF}$
. For most of the sentences
$\boldsymbol {\Phi }$
which are consequences of AC and mentioned in [Reference Howard and Rubin4], the negation of
$\boldsymbol {\Phi }$
is injectively boundable. In particular the negations of
$\mathsf{CC}$
and
$\mathsf{DC}$
are injectively boundable. So none of these four statements implies
$\mathsf{CC}$
nor does any one of them imply
$\mathsf{DC}$
. See [Reference Pincus7, Theorem 4] or Note 103 of [Reference Howard and Rubin4] for a more complete discussion of the transfer theorem of Pincus used here.
Theorem 5.2 (ZFA).
$\mathsf{CC}(\mathbb {R}) \iff \mathsf{MSE}$
.
Proof.
$\mathsf{MSE} \implies \mathsf{CC}(\mathbb {R})$
: Assume that
$\mathcal {Y} = \left \{Y_n \colon n \in \omega \right \}$
is a countable family of pairwise disjoint non-empty subsets of
$\mathbb {R}$
and that the mapping
$n \mapsto Y_n$
is one-to-one. Since
$\mathbb {R}$
is bijective with
$(3n, 3n+1)$
for all
$n \in \omega $
, we can assume that
$Y_n \subset (3n, 3n+1)$
for all
$n \in \omega $
. Let
$Y = \bigcup \mathcal {Y}$
. Let
$D_0$
be the set of dyadic numbers, i.e.,
$D_0 = \left \{m/ 2^n \colon \, m \in \mathbb {Z}, n \in \mathbb {Z}^+\right \}$
and
$D_1 = D_0 + 1/3$
. Sets
$D_0$
and
$D_1$
are countable and dense in
$\mathbb {R}$
and it is easy to check that
$D_0 \cap D_1 = \emptyset $
. We can assumeFootnote
5
that
$Y \cap \left ({D_0 \cup D_1}\right ) = \emptyset $
. Finally, we put
$X = Y \cup D_0 \cup D_1$
and define metric d on X in the following manner:
$$\begin{align*}d(x, y) = \begin{cases} 0 & \text{if } x=y\\ 1 + |x - y| & \text{if } x\neq y \; \text{and} \; x,y \in D_1 \\ 1 + |y - x + 1/3| & \text{if } x \in D_1 \; \text{and} \; y \not\in D_1 \\ 1 + |x - y + 1/3| & \text{if } x \not\in D_1 \; \text{and} \; y \in D_1 \\ |x-y| & \text{otherwise}. \end{cases} \end{align*}$$
It is easy to check that d is indeed metric and
$(X, d)$
is separable metric space with
$D_0 \cup D_1$
as the countable and dense set in X. Since
$D_1$
is strictly
$1$
-separated set in X and
$X \subset \mathbb {R}$
is separable, we can use the assumed statement so there exists a maximal strictly
$1$
-separated set
$S'$
in X such that
$D_1 \subset S'$
. We shall show that
$|Y_n \cap S'| = 1$
for all
$n \in \omega $
.
Let us notice that for every
$x \in D_0$
there exists
$y \in D_1$
such that
$d(x, y) = 1$
. Indeed, it is enough to take
$y = x + 1/3 \in D_1$
and then
$d(x, y) = 1 + |x - y + 1/3| = 1$
. Since
$S'$
is strictly
$1$
-separated set and
$D_1 \subset S'$
, it means that
$S' \cap D_0 = \emptyset $
.
Let us fix
$n \in \omega $
. If
$x, y \in Y_n \cap S' \subset Y_n \subset (3n, 3n + 1)$
, then
$d(x, y) = |x - y| < 1$
. Thus
$x = y$
since
$x, y \in S'$
. Hence
$|Y_n \cap S'| \le 1$
.
Let us suppose that
$Y_n \cap S' = \emptyset $
for some
$n \in \omega $
. Let us take
$x \in Y_n$
and fix
$y \in S'$
. Since
$S' \cap D_0 = \emptyset $
, either
$y \in D_1$
or
$y \in Y$
. If
$y \in D_1$
, then
$y - 1/3 \in D_0$
and
$Y_n \cap D_0 = \emptyset $
so
$x \neq y - 1/3$
. Thus
$d(x, y) = 1 + |x - y + 1/3|> 1$
. If
$y \in Y$
, then
$y \not \in Y_n$
since
$Y_n \cap S' = \emptyset $
so
$d(x, y)> 1$
. We have
$d(x, y)> 1$
for all
$y \in S'$
so it contradicts the maximality of
$S'$
. Hence
$Y_n \cap S' \neq \emptyset $
for all
$n \in \omega $
.
$\mathsf{CC}(\mathbb {R}) \implies \mathsf{MSE}$
: By Proposition 2.3 we have that
$\mathsf{CC}(\mathbb {R}) + \mathsf{MS} \implies \mathsf{MSE}$
but MS is true in ZFA by Theorem 3.1.
Corollary 5.3. MSE is not provable in ZF.
Proof. It follows immediately from Theorem 5.2.
Proposition 5.4 (ZFA).
$\mathsf{MNE} \implies \mathsf{CC}(\mathbb {R})$
.
Proof. Assume that
$\mathcal {Y} = \left \{Y_n \colon n \in \omega \right \}$
is a countable family of pairwise disjoint non-empty subsets of
$\mathbb {R}$
and that the mapping
$n \mapsto Y_n$
is one-to-one. Let
$S^1$
be unit circle in
$\mathbb {R}^2$
, namely,
$S^1 = \left \{(x, y) \in \mathbb {R}^2\colon \; x^2 + y^2 = 1\right \}$
. There exists a bijection
$f\colon \mathbb {R} \to S^1$
. Let
$\widehat {Y}_n = f(Y_n) + (4n, 0)$
for all
$n \in \omega $
. Since f is bijective and
$\mathbb {R}$
is linearly ordered, it is enough to prove that there exists set
$S'$
such that
$S' \cap \widehat {Y}_n$
is non-empty and finite for all
$n \in \omega $
to complete the proof.
Let
$D^1 = \left \{(x, y) \in \mathbb {Q}^2\colon \; x^2 + y^2 < 1\right \}$
and
$D_n^1 = D^1 + (4n, 0)$
for all
$n \in \omega $
. We consider metric space
$(X, d)$
where
$X = \bigcup _{n \in \omega } \left ({\widehat {Y}_n \cup D_n^1}\right )$
and d is the usual Euclidean metric on
$\mathbb {R}^2$
. Obviously, X is separable with
$\bigcup _{n \in \omega } D_n^1$
as a countable and dense set. Let
$S = \left \{(4n, 0)\colon \; n \in \omega \right \}$
. It is non-strictly
$1$
-separated set in X so by MNE there exists a maximal non-strictly
$1$
-separated set
$S'$
such that
$S \subset S'$
.
Let us notice that for all
$n \in \omega , x \in D_n^1$
, and
$y \in \widehat {Y}_n$
we have
$d\left ({(4n, 0), x}\right ) < 1$
and
$d\left ({(4n, 0), y}\right ) = 1$
. Thus
$S' \cap \bigcup _{n \in \omega } D_n^1 \setminus \{(4n,0)\} = \emptyset $
. Since
$S'$
is maximal and
$d(x, y) \ge 1$
for all
$x \in D_n^1 \cup \widehat {Y}_n$
and
$y \in D_m^1 \cup \widehat {Y}_m$
where
$n \neq m$
, it is easy to see that
$S' \cap \widehat {Y}_n \neq \emptyset $
for all
$n \in \omega $
. Moreover for all
$n \in \omega $
set
$S' \cap \widehat {Y}_n$
is finite since every
$1$
-separated set contained in
$S^1 + (4n, 0)$
is finite.
Corollary 5.5 (ZFA).
$\mathsf{CC}(\mathbb {R}) + \mathsf{MN} \iff \mathsf{MNE}$
.
Theorem 5.6 (ZFA).
$\mathsf{MN} + \mathsf{CC} \iff \mathsf{PN}$
.
Proof. For the implication “
$\Longleftarrow $
” we note that
$\mathsf{PN} \implies \mathsf{MN}$
is clear and from Theorem 4.1 we have
$\mathsf{PN} \implies \mathsf{MN}$
.
For the other implication let
$(X, p)$
be a separable pseudometric space and D be a countable and dense set. We convert this space into metric space in the standard way. We define an equivalence relation
$\sim $
on X as follows:
$x \sim y \Longleftrightarrow p(x,y) = 0$
for all
$x, y \in X$
. Then
$(X/{\sim }, d)$
is metric space where
$d\left ({[x], [y]}\right ) = p(x,y)$
for all
$x, y \in X$
and
$[x]$
denotes the equivalence class of x. Obviously
$D/{\sim }$
is a countable and dense set in
$X/{\sim }$
so
$(X/{\sim }, d)$
is separable.
Since we assumed MN, there exists a maximal non-strictly
$1$
-separable set S in
$(X/{\sim }, d)$
. Every non-strictly
$1$
-separated in every separable metric space is at most countable so S is at most countable. Let
$S = \left \{S_i\right \}_{i=1}^\infty $
. From CC there exists set
$\widehat {S} = \left \{s_i\right \}_{i=1}^\infty \subset X$
such that
$s_i \in S_i$
for every
$i \in \mathbb {Z}^+$
. Then
$[s_i] = S_i$
for every
$i \in \mathbb {Z}^+$
and it is easy to see that
$\widehat {S}$
is a maximal non-strictly
$1$
-separated set in
$(X, p)$
.
Corollary 5.7. In the theory ZF, the sentence PN (and therefore the sentence PNE) does not imply DC.
Proof. In [Reference Howard and Rubin3] a Fraenkel–Mostowski model is constructed in which CC is true and DC is false. By Remark 5.1 Part (1), MN is also true in this model. By Remark 5.1 Part (2), MN is injectively boundable. It follows from Theorem 2.5 that there is a model of ZF in which both CC and MN are true and DC is false. Therefore, by Theorem 5.6, in this model PN is true and DC is false.
We close this section with the following observation, which, together with Lemma 5.9, establishes a connection with MNE, MN, and question (4) posed in the Introduction.
Theorem 5.8 (ZFA).
Let
$(X, d)$
be a separable, complete metric space and let
$\delta> 0$
. Then, for every non-strictly
$\delta $
-separated subset S of X there exists a maximal non-strictly
$\delta $
-separated subset
$S'$
of X such that
$S \subset S'$
.
Proof. First of all we shall prove the following lemma.
Lemma 5.9 (ZFA).
Let
$(X, d)$
be a separable, complete metric space and
$\mathcal {F}$
be the family of all non-empty closed subsets of X. Then, there exists choice function for
$\mathcal {F,}$
i.e., set
$\left \{a_F\right \}_{F \in \mathcal {F}} \subset X$
such that
$a_F \in F$
for all
$F \in \mathcal {F}$
.
Proof. Let
$\left \{x_i\right \}_{i=1}^\infty \subset X$
be a countable and dense subset of X. Let
$F \in \mathcal {F}$
. We shall give the construction of
$a_F \in F$
. We define sequence
$\left \{n_k\right \}_{k=1}^\infty \subset \omega $
in the following manner:
-
•
$n_1 = \min \left \{i \in \mathbb {Z}^+\colon \; x_i \in \bigcup _{x \in F} B\left ({x, 1/2}\right )\right \}$
; -
•
$n_{k+1} = \min \left \{i \in \mathbb {Z}^+\colon \; x_i \in B\left ({x_{n_k}, 1/2^k}\right ) \cap \bigcup _{x \in F} B(x, 1/2^{k+1})\right \}$
for all
$k \ge 1$
.
Obviously, set
$\bigcup _{x \in F} B\left ({x, 1/2}\right )$
is open and non-empty so
$n_1$
is well-defined. Let us assume that
$n_k$
are defined for
$k \le m$
. We will show that
$n_{m+1}$
is well-defined. Since set
$B\left ({x_{n_m}, 1/2^m}\right ) \cap \bigcup _{x \in F} B(x, 1/2^{m+1})$
is open, it is enough to show that it is non-empty. Let us notice that
$x_{n_m} \in \bigcup _{x \in F} B\left ({x, 1/2^m}\right )$
so
$B\left ({x_{n_m}, 1/2^m}\right ) \cap F \neq \emptyset $
. As a consequence
$B\left ({x_{n_m}, 1/2^m}\right ) \cap \bigcup _{x \in F} B(x, 1/2^{m+1}) \neq \emptyset $
and it shows that
$n_{m+1}$
is well-defined. The sequence
$\left \{n_k\right \}_{k=1}^\infty $
has the following properties:
-
(1)
$x_{n_{k+1}} \in B\left ({x_{n_k}, 1/2^{k}}\right )$
for all
$k \ge 1$
; -
(2)
$\text {dist}\left ({x_{n_k}, F}\right ) < 1/2^k$
for all
$k \ge 1$
.
From
$(1)$
we conclude that sequence
$\left \{x_{n_k}\right \}_{k=1}^\infty $
is Cauchy sequence so it converges since X is complete. Let
$\lim _{k\to \infty } x_{n_k} = x \in X$
. From
$(2)$
, since
$\text {dist}\left ({x, F}\right ) \le \text {dist}\left ({x_{n_k}, F}\right ) + d(x, x_{n_k})$
for every
$k \ge 1$
, then
$\text {dist}\left ({x, F}\right ) = 0$
. But F is closed so
$x \in F$
. We put
$a_F := x$
.
LetFootnote
6
$\left \{x_i\right \}_{i=1}^\infty \subset X$
be a countable and dense subset of X and let S be non-strictly
$\delta $
-separated subset of X. By virtue of Lemma 5.9 let
$\mathcal {F}$
be the family of all non-empty closed subsets of X and
$\left \{a_F\right \}_{F \in \mathcal {F}} \subset X$
be a set such that
$a_F \in F$
for all
$F \in \mathcal {F}$
. Let us denote
$N_\delta (S) = \bigcup _{x \in S} B\left ({x, \delta }\right )$
. If
$N_\delta (S) = X$
, then S is maximal non-strictly
$\delta $
-separated set so we assume
$N_\delta (S) \neq X$
. Let
$y \in X \setminus N_\delta (S)$
. We define sequences
$\left \{y_n\right \}_{n=1}^\infty \subset X$
and
$\left \{k_n\right \}_{n=1}^\infty \subset \omega $
as followsFootnote
7
:
-
•
$k_1 = 0, y_1 = y$
; -
•
$k_n = \min \left \{i> k_{n-1}\colon \; \overline {B}\left ({x_i, \delta /3}\right ) \setminus \left ({\bigcup _{j=1}^{n-1} B\left ({y_j, \delta }\right ) \cup N_\delta (S)}\right ) \neq \emptyset \right \}$
for all
$n \ge 2$
; -
•
$y_n = a_F$
where
$F = \overline {B}\left ({x_{k_n}, \delta /3}\right ) \setminus \left ({\bigcup _{j=1}^{n-1} B\left ({y_j, \delta }\right ) \cup N_\delta (S)}\right )$
for all
$n \ge 2$
.
We shall show that
$S' := S \cup \left \{y_n\right \}_{n=1}^\infty $
is a maximal non-strictly
$\delta $
-separated set in X containing S. Let us fix
$n \in \mathbb {Z}^+$
. Since
$y_n \notin \left ({\bigcup _{j=1}^{n-1} B\left ({y_j, \delta }\right ) \cup N_\delta (S)}\right )$
, then
$d(y_n, y_j) \ge \delta $
for all
$j < n$
and
$d(y_n, s) \ge \delta $
for all
$s \in S$
. But
$n \in \mathbb {Z}^+$
was arbitrary so
$d(y_n, y_j) \ge \delta $
for all
$n, j \in \mathbb {Z}^+$
,
$n \neq j$
. It proves that
$S'$
is non-strictly
$\delta $
-separated set.
Let us suppose that
$S'$
is not maximal, i.e., there exists
$x \in X$
such that
$d(x, y_n) \ge \delta $
for all
$n \in \mathbb {Z}^+$
and
$d(x, s) \ge \delta $
for all
$s \in S$
. There exists
$i \in \mathbb {Z}^+$
such that
$x \in \overline {B}\left ({x_i, \delta /3}\right )$
. Thus
$x \in \overline {B}\left ({x_i, \delta /3}\right ) \setminus \left ({\bigcup _{j=1}^{\infty } B\left ({y_j, \delta }\right ) \cup N_\delta (S)}\right )$
. Let us suppose that
$i \neq k_n$
for any
$n \in \mathbb {Z}^+$
. The sequence
$\left \{k_n\right \}_{n=1}^\infty $
is increasing so there exists
$n \in \mathbb {Z}^+$
such that
$k_n < i < k_{n+1}$
. By the definition of
$k_{n+1}$
we have
$\overline {B}\left ({x_i, \delta /3}\right ) \setminus \left ({\bigcup _{j=1}^{n} B\left ({y_j, \delta }\right ) \cup N_\delta (S)}\right ) = \emptyset $
so
$\overline {B}\left ({x_i, \delta /3}\right ) \setminus \left ({\bigcup _{j=1}^{\infty } B\left ({y_j, \delta }\right ) \cup N_\delta (S)}\right ) = \emptyset $
which contradicts the fact that x is an element of this set. Hence
$i = k_n$
for some
$n \in \mathbb {Z}^+$
. Obviously
$n \ge 2$
since
$i \in \mathbb {Z}^+$
and
$k_1 = 0 \notin \mathbb {Z}^+$
. It means that
$x \in \overline {B}\left ({x_{k_n}, \delta /3}\right ) \setminus \left ({\bigcup _{j=1}^{n-1} B\left ({y_j, \delta }\right ) \cup N_\delta (S)}\right )$
. Since
$y_n \in \overline {B}\left ({x_{k_n}, \delta /3}\right ) \setminus \left ({\bigcup _{j=1}^{n-1} B\left ({y_j, \delta }\right ) \cup N_\delta (S)}\right )$
either, we obtain
$x, y_n \in \overline {B}\left ({x_{k_n}, \delta /3}\right )$
so
$d(x, y_n) \le 2\delta /3$
. It gives a contradiction with the fact that
$d(x, y_n) \ge \delta $
. Hence
$S'$
is maximal non-strictly
$\delta $
-separated set.
Acknowledgments
We wish to thank the referee for their comments and suggestions.
Competing interests
The authors declare that they have no competing interests.




