Borel’s conjecture and meager-additive sets
Abstract.
We prove that it is relatively consistent with that every strong measure zero subset of the real line is meager-additive while there are uncountable strong measure zero sets (i.e., Borel’s conjecture fails). This answers a long-standing question due to Bartoszyński and Judah.
Key words and phrases:
Borel’s conjecture, forcing, meager-additivity, selection principles.2020 Mathematics Subject Classification:
Primary: 03E35, 03E75, 03E15. Secondary: 54F65.1. Introduction
In this paper, we continue the study of the structure of strong measure zero sets.111The reader may consult Section 2 for the definitions of the concepts used in the introduction. Strong measure zero sets were introduced by Borel in [5], and have been studied from the beginning of the previous century. Borel conjectured that every strong measure zero set of real numbers must be countable. A few years later, Sierpiński proved in [22] that if the continuum hypothesis () is assumed, then there exists an uncountable strong measure zero set of reals. Nevertheless, the question about the relative consistency of Borel’s conjecture remained open until 1976 when Laver, in his ground-breaking [16], constructed a model of set theory in which every strong measure zero set of reals is countable. In his construction, Laver used Cohen’s forcing technique.
A result of Galvin, Mycielski, and Solovay (see [8]) provides a characterization of Borel’s strong nullity in terms of an algebraic (or translation-like) property for subsets of the real line. By means of this characterization, a strengthening of strong nullity, meager-additivity, appeared on the scene. Meager-additivity, as well as other smallness notions on the real line have received considerable attention in recent years. A 1993 question due to Bartoszyński and Judah (see [2], or [23, Problem 12.4]) asks whether strong nullity and meager-additivity have a very rigid relationship, in the following sense:
Problem (Bartoszyński–Judah, 1993).
Suppose that every strong measure zero set of reals is meager-additive. Does Borel’s conjecture follow?
The main result of this paper is a negative answer to this question.
Theorem A.
It is relatively consistent with that every strong measure zero set of reals is meager-additive, yet Borel’s conjecture fails.
For the proof of Theorem A, we use the technique of iterated forcing with countable support to construct a model of set theory in which there are uncountable strong measure zero sets, and every strong measure zero set in the final extension appears in some intermediate stage of the iteration. This allows us to “catch the tail” in a way such that every strong measure zero set of reals in the final extension is forced to satisfy a certain selection principle in the sense of Scheepers (see [20]) that implies meager-additivity.
The work is organized as follows: In Section 2 we will introduce (in a way as self-contained as possible) the essential preliminaries to this paper, as well as the terminology that will be used hereby. In Section 3 we will introduce and analyze a forcing notion that will be crucial for our construction. In Section 4 we will offer a proof of Theorem A. Finally, in Section 5, we will discuss some concluding remarks and open problems.
Acknowledgments
My sincerest gratitude goes to Stevo Todorčević, for his patience, and for the crucial suggestions he gave me while working on this problem and on the earlier drafts of this paper. I also wish to thank Osvaldo Guzmán for the knowledge he shared with me, to Ondřej Zindulka for pointing out my attention to [11], and to the anonymous referee for useful suggestions that considerably improved the presentation of this article.
2. Preliminaries
2.1. Terminology
We will denote by the set of non-negative integers. Recall that a subset of is called an initial segment if for every , and , we have that . Every initial segment of is either finite or equals . If is an initial segment of , and is a countable set, a function is called a partition of . We will use the notation for each piece of the partition . We will say that is a partition into finite sets if each is finite.
We will also denote by the set of real numbers, and by the Cantor space of two-valued sequences ; both endowed with the usual structure that makes them Polish (separable and completely metrizable) groups.
2.2. Meager-additivity and strong nullity
In [5], Borel introduced the notion of strong nullity for sets of real numbers. Recall that if is a metric space with distance function , then the diameter of its subset is defined as
A metric space has strong measure zero if for every sequence of positive real numbers, there is an open cover of with for every . If is a metric space, we will denote by the class of subsets of that are strong measure zero spaces.
A classical result of Galvin, Mycielski, and Solovay (see [8]) establishes a link between Borel’s strong nullity and a translation-like property for subsets of the reals. The Galvin–Mycielski–Solovay theorem asserts that a set of real numbers is a strong measure zero space if, and only if, for every meager set . The same result holds if subsets of the Cantor space are considered instead of subsets of the real line. The Galvin–Mycielski–Solovay theorem motivates the definition of meager-additivity. A set of real numbers is meager-additive if is meager for every meager set . The notion of meager-additivity can be extended to any topological group. If is a topological group, we will denote by the class of meager-additive subsets of .
We spell out the following fact, which is essentially [11, Theorem 3.5]:
Proposition 2.1.
Let be a locally compact Polish group. Then both classes and are -ideals of sets with , and if is either the real line, or the Cantor space, then , where is the -ideal of Lebesgue-null subsets of .∎
In [24], Zindulka offered a Borel-like characterization of meager-additivity for subsets of the Cantor space . A metric space has sharp measure zero if, and only if, for every sequence of positive real numbers, there exists an open cover of with , and there is a partition into finite sets such that every is in all but finitely many elements of the set
Zindulka’s results (see [24, Theorem 1.3]) imply that a subset of the Cantor space is meager-additive if, and only if, it has sharp measure zero. By [24, Theorem 6.4], the same characterization holds for subsets of any Euclidean space . Moreover, Hrušák and Zindulka proved in [11, Theorem 7.6] that if is a locally compact Polish group admitting a two-sided invariant metric, then a subset of is meager-additive if, and only if, it has sharp measure zero.
Finally, let be the usual map given by
The following proposition, that is a combination of [3, Lemma 8.1.12] and [24, Proposition 6.2], will be useful later on:
Proposition 2.2.
A subset of the unit interval has strong (sharp) measure zero if, and only if, has strong (sharp) measure zero.∎
2.3. Topological combinatorics
A relative open cover of a subset of the topological space is a family of open subsets of such that . Since our definition of a relative cover depends both on , and its ambient space , we will often refer to as a cover of .222This notation is inspired by the conditional probability of given . If either equals , or if the ambient space is clear from the context, we will simplify notation as much as possible.
A cover of is called:
-
•
a pre--cover if every is in all but finitely many elements of .333A pre--cover, in opposition to a -cover (see [20] for definitions), is not required to be infinite.
-
•
a -cover if every is in infinitely many elements of .
-
•
an -cover if every finite subset of is included in a single element of , and no element of covers .
We will respectively denote by , , , and the classes of pre--covers, -covers, open covers, and -covers of .
For the sake of completeness, we include a proof of the following well-known fact:
Lemma 2.3 (Folklore).
For every topological space , and every , if is partitioned into finitely many pieces, then at least one of the pieces is an -cover of . In particular, for every finite subset , we have that .
Proof.
Let , and let be a partition. Clearly, no has as an element. If no , for , is an -cover of , choose finite subsets , for , such that no element of includes . Then no element of includes the finite set
which is a contradiction. For the second part of the statement, let be fixed. Since , and , is an -cover of . If is an arbitrary finite set, proceed inductively. ∎
Let and be classes of relative covers (not necessarily of the same subset) on a space . We will say that the selection principle holds if, and only if, for every sequence of elements of there exists, for each , some open set such that the set is an element of .
Following Kočinac and Scheepers in [14], a cover of is called -groupable if it is infinite and there exists a partition into finite sets such that every element of is in all but finitely many elements of the set
We will denote by the class of -groupable covers of .
2.4. Forcing
A forcing notion is a partially ordered set . The elements of are also called conditions, and if then is said to extend . Two conditions and are compatible if a single condition extends both of them. A subset of is called open if it contains all extensions of all of its elements. A subset of is called dense if it contains some extension of every condition in . A subset of is a filter if it satisfies the following two conditions:
-
(1)
If , and , then .
-
(2)
Every two elements of have a common extension in .
If is a family of dense open subsets of , then a filter is called -generic if it intersects every element of non-trivially. If a filter on intersects all dense open subsets of that belong to the transitive model , then is said to be -generic. In this situation, one can define the forcing (or generic) extension which is a transitive model of set theory that includes and contains as an element. The model is usually referred to as the ground model. Our notation is standard and follows [10], [13], and [15]; which are also standard references for the general theory concerning the forcing technique.
3. The forcing notions
In this section, we will introduce (and analyze some of the properties of) a variation of Silver’s forcing of partial functions into , with their domain included in , and such that the complement of each of their domains is infinite (see [10, Chapter 22]). Before introducing this family of forcing notions, we will need some definitions and results from the general theory.
Definition 3.1.
The forcing notion is said to satisfy Axiom if there exists a sequence of partial orders on such that:
-
(1)
For every , if , then .
-
(2)
For every , if , then .
-
(3)
For every sequence of elements of such that , there exists a condition such that for every .
-
(4)
For every , and every , if , then there exist a finite set , and , such that .
Recall that the forcing notion is said to be -bounding if, and only if, for every -generic filter on , and for every function in , there exists a function in such that for every .
Proposition 3.2.
If the forcing notion satisfies Axiom , then it is proper and -bounding.
Proof.
It is clear that if satisfies Axiom , then it satisfies Baumgartner’s Axiom (see [4, §7] for definitions), and therefore is proper.
To see that is -bounding, let be a -generic filter on , let be a function in , and set . For each , let be a finite set, and let be such that . Let be the function in defined by . If for every , then
and therefore, in , for all . ∎
Corollary 3.3.
If is a countable support iteration of forcing notions, all of them satisfying Axiom , then is proper and -bounding.
Proof.
Follows from Theorem III.3.2 and Theorem V.4.3 in [21]. ∎
Proposition 3.4.
If is a countable support iteration of forcing notions, all of them satisfying Axiom , such that has the -chain condition, and for all , then .
Proof.
If is a partition into finite sets such that every is a finite, non-empty interval, and whenever , we will say that is an interval partition of . We will denote by the standard interval partition of determined by
A function whose domain is some proper subset of will be called a partial function. On the other hand, if the function has as its domain, we will say that is total. If is a partial function, then we define the gap-counting function by
A total function is said to be staggered divergent if it is non-decreasing and divergent, i.e., . If is divergent, we define
An easy (but useful) observation is that if is a partial function with divergent gap-counting , then for every we have that .
Let be some sequence of sets. A partial function
is called a partial -selector if, and only if, for all .
For the duration of this section, fix a sequence of finite sets.
Definition 3.5.
The forcing notion is the set of partial -selectors such that the gap-counting function is staggered divergent.
We order by if .
The aim of this section is to prove that the forcing notion satisfies Axiom . To do this, we will start by defining, for each , a binary relation on given by if, and only if, and for all ,
The relation may be thought of in the following way: if is an extension of , and these two partial functions are exactly the same until (and including) the first interval of the partition in which the domain of avoids at least non-negative integers. Of course, the expression “exactly the same” means that these functions even have the same gaps in their domains.
Lemma 3.6.
For every , the relation is a partial order on .
Proof.
It is enough to prove that the relation on is transitive. Suppose that . We want to conclude that . Since , . Since also , we have that for every ,
Therefore, . ∎
Theorem 3.7.
The forcing notion satisfies Axiom .
Proof.
The only items in Definition 3.1 that require a proof are and :
Let be a sequence of conditions such that , and let
If it turns out that , then for all . Thus, it is enough to prove that the gap-counting function is staggered divergent:
To see that is non-decreasing, let be fixed. Since
we can choose some such that . Note that for every , it holds that . In particular, we have that if , then . This implies that is non-decreasing in the interval . Since this holds for every , is non-decreasing.
Let us check now that is divergent. Fix a non-negative integer . As before, for every , we have that . Thus,
Since was arbitrary, and is non-decreasing, we have that is divergent.
Let be such that , fix , and set
Let also be the finite set of partial -selectors with domain .
We will define recursively: Start by choosing a condition such that and . Then choose some such that there exists some such that . Now, if , and we already defined , for , let be such that , , and . Then choose some such that there exists some such that . Finally, let . Clearly, . Now, if , and is arbitrary, we can find a further extension such that . If , then , and therefore . Thus, , as required. ∎
4. A proof of the main result
In this section we will offer a proof of Theorem A.
Definition 4.1.
Let be a partition into finite sets. A subset of the topological space is called -supernull if for every sequence of -covers of , there exists an infinite collection of open sets such that for every , and every element of is an element of all but finitely many elements of the set
Proposition 4.2.
If is a subset of the Cantor space such that the selection principle holds, then has sharp measure zero. In particular, every -supernull subset of has sharp measure zero.
Proof.
Let be a sequence of positive real numbers. Without loss of generality, let us assume that for all , and that as . Let be the collection of all open subsets of such that
Let also be a partition such that every is infinite, and let be the set of finite unions such that:
-
(1)
are all elements of .
-
(2)
for every .
Since the sequence as , we may assume that no has as an element, and therefore every is an -cover of . Using the selection principle , choose open sets such that . Now, for each , let be such that in a way such that are all elements of , and for every . Since all the ’s have different diameters (in particular they are different), the set belongs to . The argument finishes by recalling that . ∎
The classes and may differ in many models of set theory: If the continuum hypothesis holds, for example, then by [17, Theorem 2.1] there exists a Luzin set, which is a strong measure zero set that is not meager, and therefore is not meager-additive. Nevertheless, the classes and cannot be extremely different. More precisely, it cannot be the case that every meager-additive set of reals in countable, while there exists an uncountable strong measure zero set.
Recall that is the minimal cardinality of a set of functions such that for every there exists some such that there are infinitely many with .
Corollary 4.3.
The following are equivalent.
-
(1)
Every strong measure zero set of reals is countable.
-
(2)
Every meager-additive set of reals is countable.
Proof.
It is enough to prove that . We proceed by cases:
-
(i)
If , it is a result of Bartoszyński (see [1, Theorem 2 (1)]) that there exists an uncountable meager-additive subset of the real line.
-
(ii)
If , let be a strong measure zero set of reals with . Since , has the Hurewicz property (see [12]). By [7, Theorem 8], is a set of reals that has the Hurewicz property and such that the selection principle holds. By [19, Theorem 14], this implies that the selection principle holds. Therefore, by Proposition 4.2, has sharp measure zero, and is meager-additive.
This concludes the proof. ∎
Corollary 4.3 implies that the classes and are provably in not extremely different in the sense that it cannot be case that coincides with the class of countable subsets of , while there exists an uncountable strong measure zero set. The Bartoszyński–Judah problem asks whether the classes of meager-additive sets and strong measure zero sets are intrinsically distinct in the sense that they can only be equal if they are trivially equal, i.e., if and coincide, this is because . As announced in the introduction, we will give a negative answer to this question by building a model of set theory in which the notions of meager-additivity and strong nullity coincide, yet there exists an uncountable strong measure zero set.
Theorem 4.4.
If has a model, then it has a model in which:
-
(1)
Every strong measure zero subset of is -supernull.
-
(2)
There are no unbounded reals over .
-
(3)
.
-
(4)
.
It is worth mentioning that the relative consistency of was first proved by Corazza in [6], and then independently reproved by Goldstern, Judah, and Shelah in [9]. Before getting lost in the details of Theorem 4.4, let us show how it can be used to prove Theorem A.
Proof of Theorem A.
Let be a model of set theory in which all the items in Theorem 4.4 hold. By Proposition 4.2, . Now, if is a strong measure zero set of real numbers that it is not meager-additive, since both and are -ideals (cf. Poposition 2.1), we may assume that . By Proposition 2.2, ; contradiction. An analogous argument proves that, in , there are uncountable strong measure zero sets of the reals. ∎
Let be some sequence of -covers of the Cantor space. We will construct a sequence of finite sets such that each is a cover of , and all the ’s are pairwise disjoint: Since is compact, let be a finite cover of . For every , if we already defined for all , let
By Lemma 2.3, is an -cover of , so there exists a finite set that covers . This finishes the construction.
Fix a sequence of -covers of , and set as described above.
Lemma 4.5.
For every , and every , the sets
are dense open subsets of .
Proof.
That all the ’s and all the ’s are open is obvious, so we only need to check the density.
-
(1)
Let be a condition, and let be fixed. We are looking for a partial -selector extending , with , and such that the gap-counting is still monotone. If , there is nothing to prove. Otherwise, let be such that , and let be the set of all the non-negative integers such that . For each , choose , with , and choose arbitrary open sets . Setting , we obtain that is the desired condition.
-
(2)
Let , and let be fixed. For each , choose some . Since each is an open cover of , there must exist open sets such that for all . If we define
then the condition is as desired.
This concludes the argument. ∎
If is a -generic filter on , we define
Theorem 4.6.
If is a -generic filter on , then:
-
(1)
is a total function, i.e., it has as its domain.
-
(2)
For every , . In particular, is one-to-one.
-
(3)
Every element of is in all but finitely many elements of the set
Proof.
Fix a -generic filter on .
-
(1)
For each , let . Then .
-
(2)
If , since is a partial -selector, .
-
(3)
For each , choose a condition . Then is in all but finitely many elements of the set
and therefore (3) follows readily.
∎
We are now in shape to finish the proof of the main result.
Proof of Theorem 4.4.
The model in which we are interested is obtained by doing a countable support iteration of , for , over a model of , where at each stage in the iteration, , and where we have dovetailed so as to ensure that for any such that
then for cofinally many we have that . This dovetailing can be done since there are only continuum many sequences of -covers of , and the intermediate models satisfy the continuum hypothesis.
Claim.
.
Proof of the Claim.
By [13, Theorem 16.30], the iteration poset satisfies the -chain condition. This implies that if is a subset of in with , then there exists some such that . Now, if is such that , let be such that . By Theorem 4.6, there is in an infinite cover of such that for every , and such that every element of is in all but finitely many elements of the set
Therefore, . ∎
5. Concluding remarks
The following question is due to the anonymous referee:
Question 5.1.
Is it relatively consistent with that , but is not of the form for any cardinal number ?
We will say that a subset of the real numbers is a relative pre--set if the selection principle holds.
Question 5.2.
Suppose that every strong measure zero set of reals is a relative pre--set. Does Borel’s conjecture follow?
At first sight, Question 5.2 could seem like just a random variation of the Bartoszyński–Judah problem. We will spend the remainder of this section to explain why this is not the case. There exists a forcing notion analogous to (see [18, Theorem 5]), that adds a pre--cover by selecting one open set in each coordinate of a given sequence of -covers. Fix a sequence of -covers of . A partial -selector is called initial if is a finite initial segment of .
Definition 5.3.
The forcing notion is the set of pairs such that:
-
(1)
is a finite subset of
-
(2)
is an initial -selector.
We order by if:
-
(1)
.
-
(2)
.
-
(3)
.
By [18, Theorem 6], the forcing notion has the countable chain condition. Clearly, forces that for the sequence of -covers , we can select one open set in each coordinate of to obtain a pre--cover of . Nevertheless, it is easy to see that adds a Cohen real to the universe. This is problematic since if Cohen (in particular unbounded) reals are added to the universe, it is not clear at all how to assure that strong measure zero sets in an extension given by a suitable iteration appeared in some intermediate stage. On the other hand, it is not clear how to force the existence of a pre--cover by selecting one open set in each coordinate of if countable conditions are used instead of finite ones; once a point avoids infinitely many open sets, it avoids them forever. In particular, one may ask the following:
Question 5.4.
Let be a sequence of -covers of the Cantor space. Is it possible to generically add a cover such that for every without adding unbounded (or even Cohen) reals?
References
- [1] T. Bartoszyński. Remarks on small sets of reals. Proc. Amer. Math. Soc., 131(2), 2003.
- [2] T. Bartoszyński and H. Judah. Strong measure zero sets. In H. Judah, editor, Set Theory of the Reals. Israel Math. Conf. Proc., Ramat Gan, 1993.
- [3] T. Bartoszyński and H. Judah. Set Theory. Wellesley, Massachusetts. A K Peters, 1995.
- [4] J.E. Baumgartner. Iterated Forcing. In A.R.D. Mathias, editor, Surveys in Set Theory. London Mathematical Society, Cambridge, 1983.
- [5] E. Borel. Sur la classification des ensembles de mesure nulle. Bull. Soc. Math. France, 47, 1919.
- [6] P. Corazza. The generalized Borel conjecture and strongly proper orders. Trans. Amer. Math. Soc., 316, 1989.
- [7] D.H. Fremlin and A.W. Miller. On some properties of Hurewicz, Menger, and Rothberger. Fund. Math, 129(1), 1988.
- [8] F. Galvin, J. Mycielski, and R.M. Solovay. Strong measure zero sets. Notices Amer. Math. Soc, 26(3), 1979.
- [9] M. Goldstern, H. Judah, and S. Shelah. Strong measure zero sets without Cohen reals. J. Symb. Log., 58(4), 1993.
- [10] L.J. Halbeisen. Combinatorial Set Theory With a Gentle Introduction to Forcing. Springer Monographs in Mathematics. Springer, 2017.
- [11] M. Hrušák and O. Zindulka. Strong measure zero in Polish groups. In M. Scheepers and O. Zindulka, editors, Centenary of the Borel conjecture, volume 755 of Contemp. Math. Amer. Math. Soc., Providence, RI, 2020.
- [12] W. Hurewicz. Über Folgen stetiger funktionen. Fund. Math., 9, 1927.
- [13] T. Jech. Set Theory. The Third Millenium Edition. Springer, 2003.
- [14] L.D.R. Kočinac and M. Scheepers. Combinatorics of open covers (VII): Groupability. Fund. Math., 179, 2003.
- [15] K. Kunen. Set Theory, volume 34 of Studies in Logic. College Publications, 2011.
- [16] R. Laver. On the consistency of Borel’s conjecture. Acta Math., 137, 1976.
- [17] A.W. Miller. Special subsets of the real line. In K. Kunen and J.E. Vaughan, editors, Handbook of Set-Theoretic Topology. North-Holland, 1984.
- [18] A.W. Miller. The cardinal characteristic for relative -sets. Topology Appl., 156(5), 2009.
- [19] A. Nowik, M. Scheepers, and T. Weiss. The algebraic sum of sets of real numbers with strong measure zero sets. J. Symb. Log., 63(1), 1998.
- [20] M. Scheepers. Combinatorics of open covers I: Ramsey theory. Topology Appl., 69, 1996.
- [21] S. Shelah. Proper and Improper Forcing, volume 5 of Perspectives in Logic. Cambridge University Press, 2017.
- [22] W. Sierpińki. Sur un ensemble non denombrable, dont toute image continue est de mesure nulle. Fund. Math, 11, 1928.
- [23] B. Tsaban. Selection principles and special sets of reals. In E. Pearl, editor, Open Problems in Topology II. Elsevier B.V., 2007.
- [24] O. Zindulka. Strong measure zero and meager-additive sets through the prism of fractal measures. Comment. Math. Univ. Carolin., 60, 2018.