The axiom of choice in metric measure spaces and maximal ı -separated sets

We show that the Axiom of Countable Choice is necessary and sufﬁcient to prove that the existence of a Borel measure on a pseudometric space such that the measure of open balls is positive and ﬁnite implies separability of the space. In this way a negative answer to an open problem formulated in Górka (Am Math Mon 128:84–86, 2020) is given. Moreover, we study existence of maximal δ -separated sets in metric and pseudometric spaces from the point of view the Axiom of Choice and its weaker forms.


Introduction
Assuming the Axiom of Choice (AC) the following theorem holds Theorem 1.1 Let (X , d) be a pseudometric space with a Borel measure μ such that the measure of every open ball is positive and finite. Then, the space X is separable.
We refer to [6,Theorem 4.1] for the proof of Theorem 1.1 in the case of metric spaces. 1 Let us stress that the condition that the distance between different points is positive is not a necessary assumption for the proof in [6] so it remains valid also for pseudometrics. In fact, the converse to the implication in Theorem 1.1 also holds, i.e. 1 The proof relies on application of the Vitali covering lemma, but in this case the Axiom of Choice is used. if a pseudometric space (X , d) is separable, then there exists a Borel measure on X such that the measure of every open ball is positive and finite (see [7,Theorem 2]) and it is theorem of ZF. It was shown in [7,Theorem 2] that the Axiom of Dependent Choice (DC) is sufficient to prove Theorem 1.1 for metric spaces. Furthermore, in [7] there was asked the question if Theorem 1.1 in the case of metric spaces is equivalent to DC.
The first aim of this paper is to give an answer to the above question. Namely, we shall show that the Axiom of Countable Choice (CC) (which is strictly weaker than DC) is sufficient to prove Theorem 1.1. Moreover, we shall prove that CC is necessary assumption for Theorem 1.1 to be true. In this manner, we show that Theorem 1.1 is not equivalent to DC.
Let us stress that the proof in [7,Theorem 2] uses the technique of maximal nonoverlapping balls. The idea behind it is similar to the concept of maximal δ-separated sets but, especially in the terms of maximality, it considers the relation between points, not balls (see Remark 4.1 for further details). On the other hand, using maximal δseparated sets one can prove Theorem 1.1 (see 2 [5,Theorem 2.2.16]). Furthermore, the existence of maximal δ-separated sets is widely used in analysis on metric spaces. Therefore, the second aim of the paper is focus on maximal δ-separated sets and investigate them in terms of AC and weaker forms of choice.
The remainder of the paper is structured as follows. In Sect. 2, we introduce the notations and recall the definitions of various types of axioms of choice. Moreover, some basic objects from analysis on metric spaces are collected there. Section 3 is devoted to the proof of equivalence between the Axiom of Countable Choice and Theorem 1.1. We close this section with an open question. In the last section we focus on δ-separated sets. The problem of existence of maximal δ-separated sets is studied in many types of metric spaces, e.g. separable spaces, geometrically doubling spaces, spaces with doubling measure. We show the relations between the existence of maximal δ-separtated sets and axioms of choice.

Axioms of choice
Let us recall that AC states that every collection {A α } α∈ of nonempty sets has a choice function, i.e. f : In similar manner CC states that every countable collection {A n } ∞ n=1 of nonempty sets has a choice function, i.e. f : N → ∞ n=1 A n such that f (n) ∈ A n for all n ∈ N. In general, in this paper by countable set we mean its cardinality is less or equal to ℵ 0 .
We will be applying the Axiom of Dependent Choice (DC) in some cases which is strictly weaker than AC and strictly stronger than CC (see [10,Theorem 2.12] for implications and [14, Sect. 8.2, Problem 5.26] for strictness). The DC states that for every nonempty set X and entire relation 3 R on X there exists a sequence Informally DC guarantees that the procedure based on choice at each step (i.e. an element in the next step is not determined by the previous steps) and such that in general those choices are dependent on the previous ones can be continued up to (countable) infinity. In ZF (Zermelo-Fraenkel set theory without any kind of choice type axiom) we can make only finitely many of those steps.
In parentheses next to the Theorem, Lemma etc., we provide the appropriate assumption regarding choice type axiom-DC, CC or ZF.
We will denote the length of a finite sequence x as |x| and its elements as The proof of the Lemma 2.1 is contained in [12,Note 101]. Nevertheless, for the sake of completeness we provide the proof.
Proof Let S v f in be the family of all finite sequences x ⊂ X such that x 1 = v and x i R x i+1 for all i = 1, . . . |x| − 1. Let R be a binary relation on S v f in defined as follows: x R y ⇐⇒ |y| = |x| + 1 and x i = y i for all i = 1, . . . , |x|.
Since R is entire, it is easy to see that R is entire too. Therefore, by DC there exists . Thus, a sequence we are looking for is Let X be a set, R be a binary relation on X and x be a finite sequence in X . For the purposes of the next lemma we will say that an element y ∈ X is a successor of x if x i R y for all i = 1, . . . , |x| and there is no z ∈ X with this property such that z R y. In addition, we will say that x is maximal if x is a one-element sequence or x j is a successor of x i j−1 i=1 for every j = 2, . . . , |x|. Then, we will say that infinite sequence is maximal.

Lemma 2.2 (DC) Let X be a nonempty set, v ∈ X and R be a binary relation on X .
Let us suppose that for every maximal finite sequence x in X there exists successor y ∈ X of x. Then, there exists a maximal sequence Proof We are reasoning in the similar way as before. Let S max f in be the family of maximal finite sequences in X . Obviously S max f in is nonempty since it contains oneelement sequences. We define a binary relation R on S max f in in the same manner as before: x R y ⇐⇒ |y| = |x| + 1 and x i = y i for all i = 1, . . . , |x|.
Since every maximal finite sequence in X has successor, relation R is entire. By is a maximal sequence in X .
For more information regarding the Axiom of Choice and its weaker forms we refer to books [10], [14] or [13]. Some connections between choice type axioms and the topology of pseudometric spaces are done in [1], [4], [3].
If (X , d) is a pseudometric space we can define an equivalence relation ∼ on X as follows: x ∼ y ⇐⇒ d(x, y) = 0.
Every pseudometric space (X , d) can be viewed as metric space (X * , d * ) where X * = X /∼ and d * is metric given by: where [x] denotes the equivalence class of x. In general, properties of X and the induced metric space X * may vary depends on the choice principles we are dealing with. For more details and some connections between these spaces we refer to [11].

Basic tools from analysis on metric spaces
We shall recall basic definitions that play an important role in the analysis on metric spaces.
Let (X , d) be a metric space and δ > 0. We say that set Y which consists of closed We will focus only on strict δ-covers and thus we will omit the word "strict". We denote the closed ball B of center x and radius r as B(x, r ) or B r if we do not want to specify any center. Moreover, we say that metric space X is proper if every closed ball in X is compact.
We say that metric space X is geometrically doubling if there exists a constant M ∈ N such that for every r > 0 every ball of radius r can be covered by at most M balls of radius r /2.

Remark 2.4
It is easy to see that if X is geometrically doubling, then every ball B r can be covered by finitely many balls of arbitrarily small radius.
Let (X , d, μ) be a metric measure space equipped with a metric d and the Borel measure μ. We say that the measure μ is doubling if the measure of every closed ball is finite and positive and there exists a constant 4 C ≥ 1 such that for every x ∈ X and r > 0 It is easy to see that measure is doubling for closed balls if and only if it is doubling for open balls and, in contrast to Remark 2.3, the best doubling constant in both cases is the same, i.e.
The same definitions applies to pseudometric spaces. One can read more about results concerning geometrically doubling spaces and doubling measures in the analysis on metric spaces, e.g. in [2,8,9] or [15]. It is not difficult to see that if (X , d, μ) is a metric-measure space with doubling measure μ, then (X , d) is geometrically doubling (see Theorem 4.9 in Sect. 4.). Conversely, Luukkainen and Saksman in [15] prove that every complete 5 geometrically doubling metric space carries a doubling measure.

Existence of nontrivial Borel measure vs separability of metric space
In this section we prove that Theorem 1.1 and CC are equivalent.
The following statements are equivalent: For k, n, l ∈ N such that l ≥ l 0 (n) let A(k, n, l) be the set of families of nonoverlapping open balls contained in B k with radius smaller than 1/n and measure bigger than 1/l. Since l ≥ l 0 (n), we have {B(x 0 , r n )} ∈ A(k, n, l) for some 6 r n < 1/n so A(k, n, l) is nonempty. For fixed k, n, l ∈ N, l ≥ l 0 (n), all families contained in A(k, n, l) are finite and their cardinalities are uniformly upper bounded by the constant value dependent on k, l. Indeed, assume there exists β ∈ A(k, n, l) such that #β > lμ (B k ) (this set can be finite as well as infinite). Let β ⊂ β be finite and # β > lμ (B k ) (we do not need any kind of the axiom of choice to select a finite subset with an arbitrary big cardinality of any infinite set). Then, It gives us a contradiction, thus β has to be a finite set and the cardinality of β is no bigger than μ(B k )l.
Let c k,n,l = max {#β : β ∈ A(k, n, l)} < ∞. Since the family {A(k, n, l)} k,n,l is countable, we can choose an element α k,n,l from every set A(k, n, l) with cardinality equals c k,n,l and the choice is guaranteed by CC. The element α k,n,l is a maximal element of A(k, n, l) under inclusion.
Next, for fixed k, n, l by finiteness of α k,n,l there exists a set S(k, n, l) of exactly one center of each ball 7 from α k,n,l . Therefore, by CC we can choose such a set S(k, n, l) from every α k,n,l . Finally, let us define the set which is countable by CC as countable union of finite sets. We need to show that the set S is dense in X .
For this purpose we fix x ∈ X and ε > 0. Let K be such that , and therefore from the maximality of α K ,N ,L there exists y ∈ S(K , N , L) ⊂ S and δ < 1/N such that be an arbitrary countable family of nonempty sets and let X = ∞ i=1 A i . Without loss of generality, we can assume that the sets A i are pairwise disjoint 8 . Let us define the function d : X × X → {0, 1} as follows: Obviously, d is a pseudometric on X , and therefore (X , d) is a pseudometric space. Open balls in this space are either sets A i or the whole space, thus the topology τ on X has the form It is easy to check that the topology τ is also σ -algebra on X . Thus, τ is the Borel σ -algebra B(X ) on X .
Next, we define a Borel measure μ : B(X ) → [0, 1]. Since A i are pairwise disjoint and B(X ) = τ , it is enough to define μ on every A i . We put μ(A i ) = 1/2 i . Then, μ(X ) = 1 and the measure of every open ball is finite and positive. This allows us to use Theorem 1.1 which gives the separability of X . Let {d i } ∞ i=1 be a dense subset of X . We define function f : N → X as follows: From Theorem 3.1 we have the following corollary. The above theorem is an essential improvement of [7, Theorem 2], where Theorem 3.2 has been proven assuming DC. In this way, we give an answer to the open problem from [7] which was mentioned in the introduction.

Problem 3.3
It is very natural to ask whether CC is equivalent to the statement in Theorem 3.2.

ı-separated sets
In this section, we shall explore the idea of maximal δ-separated sets mentioned in the introduction in terms of the choice type axioms. These sets play a crucial role in the analysis on metric spaces. Let us recall that a subset Y of a metric space ( The same definition applies to pseudometric or ultrametric spaces. In applications in the analysis on metric spaces there are essentially no differences between strict and non-strict δ-separated sets so we will focus only on strict δ-separated sets and thus we will omit the word "strict". In most often cases, we need to be guaranteed the existence of maximal (under inclusion) δ-separated sets for δ's of the form 1/n (in general δ < 1).

Remark 4.1
As indicated in the introduction, the concepts of δ-separated sets and pairwise disjoint balls are different in general, especially in the terms of maximality. It is easy to see that if Y is δ-separated set in X , then B (y, δ/2) y∈Y is a family of pairwise disjoint balls. The converse is not true. As an example one can take X = {0, 1} with discrete metric . The family B(0, 3/4), B(1, 3/4) consists of pairwise disjoint balls with δ = 3/2 (and it is even maximal) but d(0, 1) = 1 so X is not 3/2-separated set (and thus also not maximal). Looking at the same space, {0} is maximal 3/2-separated set, while B(0, 3/4) is not maximal, since B(0, 3/4), B(1, 3/4) is bigger.
Our journey will begin with the following proposition. Let Y ⊂ X be a maximal 3/4-separated set in (X , d). Then, Y contains exactly one element from each set A α . Indeed, Y contains at most one element from each set A α since if x, y ∈ Y ∩ A α and x = y, then d(x, y) = 1/2 from the definition of d, but d(x, y) > 3/4 from the definition of Y . Moreover, Y has nonempty intersection with A α for every α. Indeed, let us suppose Y ∩ A α = ∅ for some α and take x ∈ A α . If y ∈ Y , then y / ∈ A α so d(x, y) = 1 > 3/4 for all y ∈ Y . This contradicts the maximality of Y .
As we can see the assumption of existence of a maximal δ-separated set for every metric space is so strong that it implies AC. We will therefore look at the existence of a maximal δ-separated set for metric or pseudometric spaces with certain properties which often appear in the analysis on metric spaces.

(i) Let δ > 0 and (X , d) be a pseudometric space such that the cardinality of every δ-separated set in X is finite and their cardinalities are uniformly upper bounded by some constant C. Then, there exists a maximal δ-separated set; (ii) Let δ > 0 and (X , d) be a pseudometric space which contains a finite δ/2-cover.
Then, all δ-separated sets in X are finite and their cardinalities are uniformly upper bounded. Hence, in particular, there exists a maximal δ-separated set.
The following statements are equivalent with DC: δ > 0 and (X , d)

Let us pay an attention that (i) and (ii) are counterparts of (iv) and (iii), recpectively.
Proof ZF ⇒ (i): Let us take x 1 ∈ X . Then, we choose x 2 ∈ X such that d(x 2 , x 1 ) > δ (if any such x 2 exists). Next, we choose x 3 ∈ X such that d(x 3 , x 2 ) > δ and d(x 3 , x 1 ) > δ (also if any such x 3 exists) and so on. After finite steps we will not be able to pick the next point such that selected points would create a δ-separated set since the cardinality of any δ-separated set in X is no bigger than C.
ZF ⇒ (ii): By assumption we can write X = N n=1 B n δ/2 . Since the distance between every two points of any ball B n δ/2 is at most δ, every δ-separated set has no more than N elements. By (i) there exists a maximal δ-separated set.
DC ⇒ (iii): We can assume there is no finite maximal δ-separated set in X (otherwise, we can take one). Let X = ∞ n=1 B n δ/2 and pick v ∈ B 1 δ/2 . Let R be a binary relation on X × N defined as follows: We will show that relation R satisfies the assumption of Lemma 2.
is a finite δ-separated set, it cannot be maximal. Let us take z ∈ B n δ/2 such that d( z, z i ) > δ for all i = 1, . . . , N , where n is the least n > n 1 for which such z exists. It has to be n > max {n i : i = 1, . . . , N } since otherwise it would contradicts a maximality of z. Therefore, (z i , n i ) R ( z, n) for all i = 1, . . . , N and ( z, n) is a successor of z. By Lemma 2.2 there exists a maximal sequence (iii)* ⇒ DC: Let us fix nonempty set X and entire relation R on X . We can assume X has more than one element. Let S f in be the family of all finite sequences in X and denote by S n the family of all finite sequences of length n in X . Clearly ∞ n=1 S n = S f in . We define relation R on S f in in the following manner: x R y ⇐⇒ |x| < |y| and x i = y i for all i = 1, . . . , |x| and y i R y i+1 for all i = |x|, . . . , |y| − 1.
It is easy to see that R is transitive. Next, we define metric 9 d on S f in : 1, if ||x| − |y|| = 1 and x R y and y R x; 3, if ||x| − |y|| ≥ 3 and x R y or y R x ; 2, otherwise.
We will show there exists a countable 5/4-cover in (S f in , d). To simplify the notation, for z ∈ X let nz ∈ S n be the sequence with all elements equal z. Let us take x ∈ X and y ∈ X such that x = y. Note that S n−1 ⊂ B (nx, 5/4) ∪ B (ny, 5/4) for all n ≥ 2. Indeed, let us fix z ∈ S n−1 . If z 1 = x, then ||z| − |nx|| = 1 and z R nx (and obviously nx R z). Hence, d(z, nx) = 1 < 5/4. If z 1 = x, then z 1 = y and analogously d(z, ny) = 1 < 5/4. It proves the above inclusion, therefore, summing it over all n we get a countable 5/4-cover in S f in . By assumption there exists a maximal 5/2-separated set Y in S f in . Hence, for all y 1 , y 2 ∈ Y , y 1 = y 2 we have d(y 1 , y 2 ) = 3.
The set Y is infinite. Indeed, let us suppose Y is finite, i.e. Y = {y 1 , . . . , y k }. Take y n with the greatest length among elements of Y and denote N = |y n |. Since R is entire, there exist x 1 , x 2 , x 3 ∈ X such that y N n R x 1 , x 1 R x 2 , x 2 R x 3 . Let x = y 1 n , . . . , y N n , x 1 , x 2 , x 3 . We get ||y n | − |x|| = 3 and y n R x so d(y n , x) = 3. Moreover, from the definition of y n we have ||y i |−|x|| ≥ 3 for i = 1, . . . , k and since d(y i , y n ) = 3 for i = n, we have y i R y n . Therefore, from transitivity of R we have y i R x for all i = 1, . . . , k. Thus, d(y i , x) = 3 for all i = 1, . . . , k and it contradicts the maximality of Y .
We get that Y is countably infinite and we can enumerate elements of Y by the function f , i.e. Y = y n i ∞ i=1 where |y n i | = n i is increasing. Since d(y n i , y n i+1 ) = 3, we have y n i R y n i+1 and |y n i+1 | ≥ |y n i | + 3. Finally, a required sequence we define as follows  (iv)* ⇒ DC: Let us fix nonempty set X and an entire relation R on X . We define metric d on S f in as in the proof of the previous implication. Let us suppose all 5/2separated sets in (S f in , d) are finite. Then, by the assumption there exists a maximal and finite 5/2-separated set. Since all maximal 5/2-separated sets are infinite in that space, we get a contradiction. Thus, there exists an infinite 5/2-separated set and we can construct the required sequence in the same manner as in the last two paragraphs of the proof of the previous implication.
DC ⇒ (iv): Let us suppose there is no maximal δ-separated set in X . We will show there exists an infinite δ-separated set in X . Let S x R y ⇐⇒ |y| = |x| + 1 and x i = y i for all i = 1, . . . , |x|.
The relation R is entire. Indeed, let us fix x ∈ S sep f in . By an assumption x cannot be maximal δ-separated set. Therefore, there exists x ∈ X such that x = x i for all i = 1, . . . |x| and y = (x 1 , . . . x |x| , x) creates δ-separated set, so consequently x R y.
is an infinite δ-separated set in X .
In view of Theorem 4.3 we immediately get two results.    Then, for every δ > 0 there exists a maximal δ-separated set.
Proof First of all we shall prove the following lemma. (X , d) B(y, 2r ). Thus, we get the following string of inequalities

Lemma 4.8 (ZF) Let
which is an obvious contradiction. Therefore, every δ-separated set Y is finite and If X is bounded, then by Lemma 4.8 all δ-separated sets are finite and uniformly upper bounded, and thus the proof follows. Therefore, we can assume that X is an unbounded space. Let {x n } ∞ n=1 be a dense subset of X . We define sequence {n k } ∞ k=1 ⊂ N as follows: n 1 = 1, n k is the smallest n > n k−1 such that d(x n , x n i ) > δ for every i = 1, . . . , k−1. Let us note that the construction goes to infinity since X is unbounded and the whole sequence is determined by n 1 so the procedure is possible in ZF. Clearly, x n k ∞ k=1 is a δ-separated set. We claim that x n k ∞ k=1 is a maximal δ-separated set. Indeed, let us suppose there exists x ∈ X such that d(x, x n k ) > δ for every k ∈ N. By Lemma 4.8, ball B(x, 2δ) contains only finitely many elements of sequence x n k ∞ k=1 . Hence, there exists 0 < ε ≤ δ such that d(x, x n k ) > δ + ε for every k ∈ N. Let m ∈ N be such that d(x, x m ) < ε. Obviously m = n k for all k ∈ N. Therefore, from the construction of the sequence {n k } ∞ k=1 ⊂ N, there exists k ∈ N such that d(x m , x n k ) ≤ δ. Thus, This contradiction finishes the proof.
There is also a well-known result connecting geometrically doubling spaces with spaces which admit a doubling measure. We simply obtain it with the help of Lemma 4.8.  Proof (i) ⇒ (iv): Let X be a geometrically doubling space and fix x ∈ X . For n ∈ N let A n be the family that consists of finite sets of closed balls of radius 2 −n which cover B(x, n). Since X is geometrically doubling, A n = ∅. From CC we can choose one element B n from every set A n . Let B = ∞ n=1 B n . The family B of closed balls is countable since every B n is finite and we are assuming CC. Again, from CC we can choose one center x n from every ball in B. We claim that {x n } ∞ n=1 is dense in X .
Indeed, let us fix y ∈ X , ε > 0 and let N ∈ N be such that y ∈ B(x, N ) and 2 −N < ε. From the construction there exists a subset . Hence, for some j = 1, . . . , M we have y ∈ B(x n j , 2 −N ) ⊂ B(x n j , ε) .
(iv) ⇒ (iii): Let us fix δ > 0. If a space is geometrically doubling, then by the assumption it is separable. Therefore, by Theorem 4.7 (true in ZF) there exists a maximal δ-separated set.
(ii) ⇒ (i): Let {A i } i∈Z be an arbitrary countable family of nonempty pairwise disjoint sets and let X = i∈Z A i . We define pseudometric on X in the following manner: d(x, y) = |i − j| if and only if x ∈ A i and y ∈ A j . Then, τ (X ) = B(X ) = i∈I A i : I ⊂ Z ∪ {∅}. We define measure μ on B(X ) as follows: μ ( A i ) = 1 for all i ∈ Z. Obviously, the measure of every ball is positive and finite. Moreover, μ is doubling since for every r > 0 and x ∈ X we have μ B (x, 2r ) μ B (x, r ) = 2 2r + 1 2 r + 1 ≤ 3.
Therefore, for every r > 0 we obtain μ B 2r ≤ 3μ B r . Hence, from the assumption there exists a maximal 1/2-separated set in X . The rest of the proof goes in the same way as the proof of Proposition 4.2.