This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Borel’s conjecture and meager-additive sets

Daniel Calderón Department of Mathematics, University of Toronto, 40 St George Street, Toronto, Ontario, M5S 2E4, Canada [email protected]
Abstract.

We prove that it is relatively consistent with ZFC\mathrm{ZFC} 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 (CH\mathrm{CH}) 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 ZFC\mathrm{ZFC} 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 𝐍\mathbf{N} the set of non-negative integers. Recall that a subset aa of 𝐍\mathbf{N} is called an initial segment if for every nan\in a, and m<nm<n, we have that mam\in a. Every initial segment of 𝐍\mathbf{N} is either finite or equals 𝐍\mathbf{N}. If aa is an initial segment of 𝐍\mathbf{N}, and XX is a countable set, a function π:Xa\pi\colon X\to a is called a partition of XX. We will use the notation [n]π:=π1{n}X[n]_{\pi}:=\pi^{-1}\{n\}\subseteq X for each piece of the partition π\pi. We will say that π\pi is a partition into finite sets if each [n]π[n]_{\pi} is finite.

We will also denote by 𝐑\mathbf{R} the set of real numbers, and by 𝐂\mathbf{C} the Cantor space of two-valued sequences x:𝐍{0,1}x\colon\mathbf{N}\to\{0,1\}; 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 YY is a metric space with distance function dd, then the diameter of its subset XX is defined as

diamX:=supx,yXd(x,y).\operatorname{\mathrm{diam}}X:=\sup_{x,y\in X}d(x,y).

A metric space XX has strong measure zero if for every sequence (εn:n𝐍)(\varepsilon_{n}:n\in\mathbf{N}) of positive real numbers, there is an open cover {Un:n𝐍}\{U_{n}:n\in\mathbf{N}\} of XX with diamUnεn\operatorname{\mathrm{diam}}U_{n}\leq\varepsilon_{n} for every n𝐍n\in\mathbf{N}. If YY is a metric space, we will denote by 𝒩+(Y)\mathscr{N}^{+}(Y) the class of subsets of YY 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 XX of real numbers is a strong measure zero space if, and only if, X+M𝐑X+M\neq\mathbf{R} for every meager set M𝐑M\subseteq\mathbf{R}. 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 XX of real numbers is meager-additive if X+MX+M is meager for every meager set M𝐑M\subseteq\mathbf{R}. The notion of meager-additivity can be extended to any topological group. If YY is a topological group, we will denote by 𝒩(Y)\mathscr{N}^{\star}(Y) the class of meager-additive subsets of YY.

We spell out the following fact, which is essentially [11, Theorem 3.5]:

Proposition 2.1.

Let YY be a locally compact Polish group. Then both classes 𝒩+(Y)\mathscr{N}^{+}(Y) and 𝒩(Y)\mathscr{N}^{\star}(Y) are σ\sigma-ideals of sets with 𝒩(Y)𝒩+(Y)\mathscr{N}^{\star}(Y)\subseteq\mathscr{N}^{+}(Y), and if YY is either the real line, or the Cantor space, then 𝒩+(Y)𝒩(Y)\mathscr{N}^{+}(Y)\subseteq\mathscr{N}(Y), where 𝒩(Y)\mathscr{N}(Y) is the σ\sigma-ideal of Lebesgue-null subsets of YY.∎

In [24], Zindulka offered a Borel-like characterization of meager-additivity for subsets of the Cantor space 𝐂\mathbf{C}. A metric space XX has sharp measure zero if, and only if, for every sequence (εn:n𝐍)(\varepsilon_{n}:n\in\mathbf{N}) of positive real numbers, there exists an open cover A={Un:n𝐍}A=\{U_{n}:n\in\mathbf{N}\} of XX with diamUnεn\operatorname{\mathrm{diam}}U_{n}\leq\varepsilon_{n}, and there is a partition π:A𝐍\pi\colon A\to\mathbf{N} into finite sets such that every xXx\in X is in all but finitely many elements of the set

{[n]π:n𝐍}.\left\{\bigcup[n]_{\pi}:n\in\mathbf{N}\right\}.

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 𝐑n\mathbf{R}^{n}. Moreover, Hrušák and Zindulka proved in [11, Theorem 7.6] that if YY is a locally compact Polish group admitting a two-sided invariant metric, then a subset of YY is meager-additive if, and only if, it has sharp measure zero.

Finally, let c:𝐂[0,1]c\colon\mathbf{C}\to[0,1] be the usual map given by

c(x):=n𝐍x(n)2n+1.c(x):=\sum_{n\in\mathbf{N}}\frac{x(n)}{2^{n+1}}.

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 XX of the unit interval [0,1][0,1] has strong (sharp) measure zero if, and only if, c1(X)c^{-1}(X) has strong (sharp) measure zero.∎

2.3. Topological combinatorics

A relative open cover of a subset XX of the topological space YY is a family AA of open subsets of YY such that XAX\subseteq\bigcup A. Since our definition of a relative cover AA depends both on XX, and its ambient space YY, we will often refer to AA as a cover of X|YX|Y.222This notation is inspired by the conditional probability of XX given YY. If either XX equals YY, or if the ambient space is clear from the context, we will simplify notation as much as possible.

A cover AA of X|YX|Y is called:

  • a pre-γ\gamma-cover if every xXx\in X is in all but finitely many elements of AA.333A pre-γ\gamma-cover, in opposition to a γ\gamma-cover (see [20] for definitions), is not required to be infinite.

  • a λ\lambda-cover if every xXx\in X is in infinitely many elements of AA.

  • an ω\omega-cover if every finite subset of XX is included in a single element of AA, and no element of AA covers XX.

We will respectively denote by PΓ[X|Y]P\Gamma[X|Y], Λ[X|Y]\Lambda[X|Y], O[X|Y]O[X|Y], and Ω[X|Y]\Omega[X|Y] the classes of pre-γ\gamma-covers, λ\lambda-covers, open covers, and ω\omega-covers of X|YX|Y.

For the sake of completeness, we include a proof of the following well-known fact:

Lemma 2.3 (Folklore).

For every topological space YY, and every AΩ[Y]A\in\Omega[Y], if AA is partitioned into finitely many pieces, then at least one of the pieces is an ω\omega-cover of YY. In particular, for every finite subset FAF\subseteq A, we have that AFΩ[Y]A\setminus F\in\Omega[Y].

Proof.

Let AΩ[Y]A\in\Omega[Y], and let π:A{0,,k1}\pi\colon A\to\{0,\dots,k-1\} be a partition. Clearly, no [i]π[i]_{\pi} has YY as an element. If no [i]π[i]_{\pi}, for i<ki<k, is an ω\omega-cover of YY, choose finite subsets FiYF_{i}\subseteq Y, for i<ki<k, such that no element of [i]π[i]_{\pi} includes FiF_{i}. Then no element of AA includes the finite set

i<kFiY,\bigcup_{i<k}F_{i}\subseteq Y,

which is a contradiction. For the second part of the statement, let UAU\in A be fixed. Since A=(A{U}){U}A=(A\setminus\{U\})\cup\{U\}, and UYU\neq Y, A{U}A\setminus\{U\} is an ω\omega-cover of YY. If FAF\subseteq A is an arbitrary finite set, proceed inductively. ∎

Let 𝒜\mathscr{A} and \mathscr{B} be classes of relative covers (not necessarily of the same subset) on a space YY. We will say that the selection principle 𝖲1(𝒜,)\mathsf{S}_{1}(\mathscr{A},\mathscr{B}) holds if, and only if, for every sequence (An:n𝐍)(A_{n}:n\in\mathbf{N}) of elements of 𝒜\mathscr{A} there exists, for each n𝐍n\in\mathbf{N}, some open set UnAnU_{n}\in A_{n} such that the set {Un:n𝐍}\{U_{n}:n\in\mathbf{N}\} is an element of \mathscr{B}.

Following Kočinac and Scheepers in [14], a cover AA of X|YX|Y is called λ\lambda-groupable if it is infinite and there exists a partition π:A𝐍\pi\colon A\to\mathbf{N} into finite sets such that every element of XX is in all but finitely many elements of the set

{[n]π:n𝐍}.\left\{\bigcup[n]_{\pi}:n\in\mathbf{N}\right\}.

We will denote by GΛ[X|Y]G\Lambda[X|Y] the class of λ\lambda-groupable covers of X|YX|Y.

2.4. Forcing

A forcing notion is a partially ordered set 𝐏\mathbf{P}. The elements of 𝐏\mathbf{P} are also called conditions, and if pqp\leq q then pp is said to extend qq. Two conditions pp and qq are compatible if a single condition extends both of them. A subset DD of 𝐏\mathbf{P} is called open if it contains all extensions of all of its elements. A subset DD of 𝐏\mathbf{P} is called dense if it contains some extension of every condition in 𝐏\mathbf{P}. A subset GG of 𝐏\mathbf{P} is a filter if it satisfies the following two conditions:

  1. (1)

    If pGp\in G, and pqp\leq q, then qGq\in G.

  2. (2)

    Every two elements of GG have a common extension in GG.

If 𝒟\mathscr{D} is a family of dense open subsets of 𝐏\mathbf{P}, then a filter GG is called 𝒟\mathscr{D}-generic if it intersects every element of 𝒟\mathscr{D} non-trivially. If a filter GG on 𝐏\mathbf{P} intersects all dense open subsets of 𝐏\mathbf{P} that belong to the transitive model VV, then GG is said to be VV-generic. In this situation, one can define the forcing (or generic) extension V[G]V[G] which is a transitive model of set theory that includes VV and contains GG as an element. The model VV 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 𝐏(𝐭)\mathbf{P}(\mathbf{t})

In this section, we will introduce (and analyze some of the properties of) a variation of Silver’s forcing of partial functions into {0,1}\{0,1\}, with their domain included in 𝐍\mathbf{N}, 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 𝐏\mathbf{P} is said to satisfy Axiom 𝖡\mathsf{B} if there exists a sequence (n:n𝐍)(\leq_{n}:n\in\mathbf{N}) of partial orders on 𝐏\mathbf{P} such that:

  1. (1)

    For every n𝐍n\in\mathbf{N}, if pnqp\leq_{n}q, then pqp\leq q.

  2. (2)

    For every n𝐍n\in\mathbf{N}, if pn+1qp\leq_{n+1}q, then pnqp\leq_{n}q.

  3. (3)

    For every sequence (pn:n𝐍)(p_{n}:n\in\mathbf{N}) of elements of 𝐏\mathbf{P} such that pn+1npnp_{n+1}\leq_{n}p_{n}, there exists a condition p𝐏p\in\mathbf{P} such that pnpnp\leq_{n}p_{n} for every n𝐍n\in\mathbf{N}.

  4. (4)

    For every q𝐏q\in\mathbf{P}, and every n𝐍n\in\mathbf{N}, if q``τV"q\Vdash``\tau\in V", then there exist a finite set HVH\in V, and pnqp\leq_{n}q, such that p``τH"p\Vdash``\tau\in H".

Recall that the forcing notion 𝐏\mathbf{P} is said to be ωω\omega^{\omega}-bounding if, and only if, for every VV-generic filter GG on 𝐏\mathbf{P}, and for every function f:𝐍𝐍f\colon\mathbf{N}\to\mathbf{N} in V[G]V[G], there exists a function g:𝐍𝐍g\colon\mathbf{N}\to\mathbf{N} in VV such that f(n)<g(n)f(n)<g(n) for every n𝐍n\in\mathbf{N}.

Proposition 3.2.

If the forcing notion 𝐏\mathbf{P} satisfies Axiom 𝖡\mathsf{B}, then it is proper and ωω\omega^{\omega}-bounding.

Proof.

It is clear that if 𝐏\mathbf{P} satisfies Axiom 𝖡\mathsf{B}, then it satisfies Baumgartner’s Axiom 𝖠\mathsf{A} (see [4, §7] for definitions), and therefore is proper.

To see that 𝐏\mathbf{P} is ωω\omega^{\omega}-bounding, let GG be a VV-generic filter on 𝐏\mathbf{P}, let f:𝐍𝐍f\colon\mathbf{N}\to\mathbf{N} be a function in V[G]V[G], and set p0:=1𝐏p_{0}:=\textbf{1}_{\mathbf{P}}. For each n𝐍n\in\mathbf{N}, let HnVH_{n}\in V be a finite set, and let pn+1npnp_{n+1}\leq_{n}p_{n} be such that pn+1``f(n)Hn"p_{n+1}\Vdash``f(n)\in H_{n}". Let g:𝐍𝐍g\colon\mathbf{N}\to\mathbf{N} be the function in VV defined by g(n):=maxHn+1g(n):=\max H_{n}+1. If pnpnp\leq_{n}p_{n} for every n𝐍n\in\mathbf{N}, then

p``(n𝐍)(f(n)<g(n))",p\Vdash``(\forall n\in\mathbf{N})(f(n)<g(n))",

and therefore, in V[G]V[G], f(n)<g(n)f(n)<g(n) for all n𝐍n\in\mathbf{N}. ∎

Corollary 3.3.

If 𝐏ω2\mathbf{P}_{\omega_{2}} is a countable support iteration of forcing notions, all of them satisfying Axiom 𝖡\mathsf{B}, then 𝐏ω2\mathbf{P}_{\omega_{2}} is proper and ωω\omega^{\omega}-bounding.

Proof.

Follows from Theorem III.3.2 and Theorem V.4.3 in [21]. ∎

Proposition 3.4.

If 𝐏ω2\mathbf{P}_{\omega_{2}} is a countable support iteration of forcing notions, all of them satisfying Axiom 𝖡\mathsf{B}, such that 𝐏ω2\mathbf{P}_{\omega_{2}} has the 2\aleph_{2}-chain condition, and αCH\Vdash_{\alpha}\mathrm{CH} for all α<ω2\alpha<\omega_{2}, then ω2``𝒩+(𝐂)[𝐂]1"\Vdash_{\omega_{2}}``\mathscr{N}^{+}(\mathbf{C})\subseteq[\mathbf{C}]^{\leq\aleph_{1}}".

Proof.

Every forcing notion satisfying Axiom 𝖡\mathsf{B} is strongly ωω\omega^{\omega}-bounding in the sense of Goldstern, Judah, and Shelah in [9, Definition 1.13]. Then the proposition follows from [9, Corollary 3.6] and Proposition 2.2. ∎

If π:𝐍𝐍\pi\colon\mathbf{N}\to\mathbf{N} is a partition into finite sets such that every [n]π[n]_{\pi} is a finite, non-empty interval, and max[m]π<min[n]π\max[m]_{\pi}<\min[n]_{\pi} whenever m<nm<n, we will say that π\pi is an interval partition of 𝐍\mathbf{N}. We will denote by ζ:𝐍𝐍\zeta\colon\mathbf{N}\to\mathbf{N} the standard interval partition of 𝐍\mathbf{N} determined by

[n]ζ=[n(n+1)2,(n+1)(n+2)2).[n]_{\zeta}=\left[\frac{n(n+1)}{2},\frac{(n+1)(n+2)}{2}\right).

A function ff whose domain is some proper subset of 𝐍\mathbf{N} will be called a partial function. On the other hand, if the function gg has 𝐍\mathbf{N} as its domain, we will say that gg is total. If ff is a partial function, then we define the gap-counting function 𝔤f:𝐍𝐍\mathfrak{g}_{f}\colon\mathbf{N}\to\mathbf{N} by

𝔤f(n):=|[n]ζdomf|.\mathfrak{g}_{f}(n):=\left|[n]_{\zeta}\setminus\operatorname{\mathrm{dom}}f\right|.

A total function g:𝐍𝐍g\colon\mathbf{N}\to\mathbf{N} is said to be staggered divergent if it is non-decreasing and divergent, i.e., limng(n)=\lim_{n}g(n)=\infty. If g:𝐍𝐍g\colon\mathbf{N}\to\mathbf{N} is divergent, we define

μn(g):=min{m𝐍:g(m)n}.\mu_{n}(g):=\min\left\{m\in\mathbf{N}:g(m)\geq n\right\}.

An easy (but useful) observation is that if ff is a partial function with divergent gap-counting 𝔤f\mathfrak{g}_{f}, then for every n𝐍n\in\mathbf{N} we have that 𝔤f(μn(𝔤f))n\mathfrak{g}_{f}(\mu_{n}(\mathfrak{g}_{f}))\geq n.

Let 𝐭=(tn:n𝐍)\mathbf{t}=(t_{n}:n\in\mathbf{N}) be some sequence of sets. A partial function

f:domfn𝐍tnf\colon\operatorname{\mathrm{dom}}f\to\bigcup_{n\in\mathbf{N}}t_{n}

is called a partial 𝐭\mathbf{t}-selector if, and only if, f(n)tnf(n)\in t_{n} for all ndomfn\in\operatorname{\mathrm{dom}}f.

For the duration of this section, fix a sequence 𝐭=(tn:n𝐍)\mathbf{t}=(t_{n}:n\in\mathbf{N}) of finite sets.

Definition 3.5.

The forcing notion 𝐏(𝐭)\mathbf{P}(\mathbf{t}) is the set of partial 𝐭\mathbf{t}-selectors pp such that the gap-counting function 𝔤p\mathfrak{g}_{p} is staggered divergent.

We order 𝐏(𝐭)\mathbf{P}(\mathbf{t}) by pqp\leq q if pqp\supseteq q.

The aim of this section is to prove that the forcing notion 𝐏(𝐭)\mathbf{P}(\mathbf{t}) satisfies Axiom 𝖡\mathsf{B}. To do this, we will start by defining, for each n𝐍n\in\mathbf{N}, a binary relation n\leq_{n} on 𝐏(𝐭)\mathbf{P}(\mathbf{t}) given by pnqp\leq_{n}q if, and only if, pqp\leq q and for all iμn(𝔤q)i\leq\mu_{n}(\mathfrak{g}_{q}),

[i]ζdomq=[i]ζdomp.[i]_{\zeta}\setminus\operatorname{\mathrm{dom}}q=[i]_{\zeta}\setminus\operatorname{\mathrm{dom}}p.

The relation n\leq_{n} may be thought of in the following way: pnqp\leq_{n}q if pp is an extension of qq, and these two partial functions are exactly the same until (and including) the first interval of the partition ζ\zeta in which the domain of qq avoids at least nn 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 n𝐍n\in\mathbf{N}, the relation n\leq_{n} is a partial order on 𝐏(𝐭)\mathbf{P}(\mathbf{t}).

Proof.

It is enough to prove that the relation n\leq_{n} on 𝐏(𝐭)\mathbf{P}(\mathbf{t}) is transitive. Suppose that pnqnrp\leq_{n}q\leq_{n}r. We want to conclude that pnrp\leq_{n}r. Since qnrq\leq_{n}r, μn(𝔤q)=μn(𝔤r)\mu_{n}(\mathfrak{g}_{q})=\mu_{n}(\mathfrak{g}_{r}). Since also pnqp\leq_{n}q, we have that for every iμn(𝔤q)=μn(𝔤r)i\leq\mu_{n}(\mathfrak{g}_{q})=\mu_{n}(\mathfrak{g}_{r}),

[i]ζdomr=[i]ζdomq=[i]ζdomp.[i]_{\zeta}\setminus\operatorname{\mathrm{dom}}r=[i]_{\zeta}\setminus\operatorname{\mathrm{dom}}q=[i]_{\zeta}\setminus\operatorname{\mathrm{dom}}p.

Therefore, pnrp\leq_{n}r. ∎

Theorem 3.7.

The forcing notion 𝐏(𝐭)\mathbf{P}(\mathbf{t}) satisfies Axiom 𝖡\mathsf{B}.

Proof.

The only items in Definition 3.1 that require a proof are (3)\eqref{3.typeBdefin} and (4)\eqref{4.typeBdefin}:

(3)\eqref{3.typeBdefin} Let (pn:n𝐍)(p_{n}:n\in\mathbf{N}) be a sequence of conditions such that pn+1npnp_{n+1}\leq_{n}p_{n}, and let

p:=n𝐍pn.p:=\bigcup_{n\in\mathbf{N}}p_{n}.

If it turns out that p𝐏(𝐭)p\in\mathbf{P}(\mathbf{t}), then pnpnp\leq_{n}p_{n} for all n𝐍n\in\mathbf{N}. Thus, it is enough to prove that the gap-counting function 𝔤p\mathfrak{g}_{p} is staggered divergent:

(3.1)(3.1) To see that 𝔤p\mathfrak{g}_{p} is non-decreasing, let m𝐍m\in\mathbf{N} be fixed. Since

limnμn(𝔤pn)=,\lim_{n\to\infty}\mu_{n}(\mathfrak{g}_{p_{n}})=\infty,

we can choose some n𝐍n\in\mathbf{N} such that mμn(𝔤pn)m\leq\mu_{n}(\mathfrak{g}_{p_{n}}). Note that for every iμn(𝔤pn)i\leq\mu_{n}(\mathfrak{g}_{p_{n}}), it holds that [i]ζdompn=[i]ζdomp[i]_{\zeta}\setminus\operatorname{\mathrm{dom}}p_{n}=[i]_{\zeta}\setminus\operatorname{\mathrm{dom}}p. In particular, we have that if iμn(𝔤pn)i\leq\mu_{n}(\mathfrak{g}_{p_{n}}), then 𝔤p(i)=𝔤pn(i)\mathfrak{g}_{p}(i)=\mathfrak{g}_{p_{n}}(i). This implies that 𝔤p\mathfrak{g}_{p} is non-decreasing in the interval [0,m][0,m]. Since this holds for every m𝐍m\in\mathbf{N}, 𝔤p\mathfrak{g}_{p} is non-decreasing.

(3.2)(3.2) Let us check now that 𝔤p\mathfrak{g}_{p} is divergent. Fix a non-negative integer n𝐍n\in\mathbf{N}. As before, for every iμn(𝔤pn)i\leq\mu_{n}(\mathfrak{g}_{p_{n}}), we have that 𝔤p(i)=𝔤pn(i)\mathfrak{g}_{p}(i)=\mathfrak{g}_{p_{n}}(i). Thus,

𝔤p(μn(𝔤pn))=𝔤pn(μn(𝔤pn))n.\mathfrak{g}_{p}(\mu_{n}(\mathfrak{g}_{p_{n}}))=\mathfrak{g}_{p_{n}}(\mu_{n}(\mathfrak{g}_{p_{n}}))\geq n.

Since n𝐍n\in\mathbf{N} was arbitrary, and 𝔤p\mathfrak{g}_{p} is non-decreasing, we have that 𝔤p\mathfrak{g}_{p} is divergent.

(4)\eqref{4.typeBdefin} Let q𝐏(𝐭)q\in\mathbf{P}(\mathbf{t}) be such that q``τV"q\Vdash``\tau\in V", fix n𝐍n\in\mathbf{N}, and set

F:=iμn(𝔤q)[i]ζdomq.F:=\bigcup_{i\leq\mu_{n}(\mathfrak{g}_{q})}[i]_{\zeta}\setminus\operatorname{\mathrm{dom}}q.

Let also {sk:k<l}\{s_{k}:k<l\} be the finite set of partial 𝐭\mathbf{t}-selectors with domain FF.

We will define pnqp\leq_{n}q recursively: Start by choosing a condition q0qq_{0}\leq q such that domqFdomq0\operatorname{\mathrm{dom}}q\cup F\subseteq\operatorname{\mathrm{dom}}q_{0} and q0F=s0q_{0}\upharpoonright F=s_{0}. Then choose some p0q0p_{0}\leq q_{0} such that there exists some x0Vx_{0}\in V such that p0``τ=x0"p_{0}\Vdash``\tau=x_{0}". Now, if k1k\geq 1, and we already defined pip_{i}, for i<ki<k, let qkqq_{k}\leq q be such that domqk=dompk1\operatorname{\mathrm{dom}}q_{k}=\operatorname{\mathrm{dom}}p_{k-1}, qkF=skq_{k}\upharpoonright F=s_{k}, and qk(domqkF)=pk1(dompk1F)q_{k}\upharpoonright(\operatorname{\mathrm{dom}}q_{k}\setminus F)=p_{k-1}\upharpoonright(\operatorname{\mathrm{dom}}p_{k-1}\setminus F). Then choose some pkqkp_{k}\leq q_{k} such that there exists some xkVx_{k}\in V such that pk``τ=xk"p_{k}\Vdash``\tau=x_{k}". Finally, let p:=pl1(dompl1F)p:=p_{l-1}\upharpoonright(\operatorname{\mathrm{dom}}p_{l-1}\setminus F). Clearly, pnqp\leq_{n}q. Now, if H:={xk:k<l}VH:=\{x_{k}:k<l\}\in V, and rpr\leq p is arbitrary, we can find a further extension srs\leq r such that FdomsF\subseteq\operatorname{\mathrm{dom}}s. If sF=sks\upharpoonright F=s_{k}, then spks\leq p_{k}, and therefore s``τ=xk"s\Vdash``\tau=x_{k}". Thus, p``τH"p\Vdash``\tau\in H", as required. ∎

4. A proof of the main result

In this section we will offer a proof of Theorem A.

Definition 4.1.

Let π:𝐍𝐍\pi\colon\mathbf{N}\to\mathbf{N} be a partition into finite sets. A subset XX of the topological space YY is called π\pi-supernull if for every sequence (An:n𝐍)(A_{n}:n\in\mathbf{N}) of ω\omega-covers of YY, there exists an infinite collection of open sets {Un:n𝐍}\{U_{n}:n\in\mathbf{N}\} such that UnAnU_{n}\in A_{n} for every n𝐍n\in\mathbf{N}, and every element of XX is an element of all but finitely many elements of the set

{{Uk:k[n]π}:n𝐍}.\left\{\bigcup\left\{U_{k}:k\in[n]_{\pi}\right\}:n\in\mathbf{N}\right\}.
Proposition 4.2.

If XX is a subset of the Cantor space 𝐂\mathbf{C} such that the selection principle 𝖲1(Ω[𝐂],GΛ[X|𝐂])\mathsf{S}_{1}(\Omega[\mathbf{C}],G\Lambda[X|\mathbf{C}]) holds, then XX has sharp measure zero. In particular, every π\pi-supernull subset of 𝐂\mathbf{C} has sharp measure zero.

Proof.

Let (εn:n𝐍)(\varepsilon_{n}:n\in\mathbf{N}) be a sequence of positive real numbers. Without loss of generality, let us assume that εn+1<εn\varepsilon_{n+1}<\varepsilon_{n} for all n𝐍n\in\mathbf{N}, and that εn0\varepsilon_{n}\to 0 as nn\to\infty. Let BnB_{n} be the collection of all open subsets UU of 𝐂\mathbf{C} such that

εn+1<diamUεn.\varepsilon_{n+1}<\operatorname{\mathrm{diam}}U\leq\varepsilon_{n}.

Let also ρ:𝐍𝐍\rho\colon\mathbf{N}\to\mathbf{N} be a partition such that every [n]ρ[n]_{\rho} is infinite, and let AnA_{n} be the set of finite unions Umn,0Umn,k1U_{m_{n,0}}\cup\dots\cup U_{m_{n,k-1}} such that:

  1. (1)

    mn,0<mn,1<<mn,k1m_{n,0}<m_{n,1}<\dots<m_{n,k-1} are all elements of [n]ρ[n]_{\rho}.

  2. (2)

    Umn,iBmn,iU_{m_{n,i}}\in B_{m_{n,i}} for every i<ki<k.

Since the sequence εn0\varepsilon_{n}\to 0 as nn\to\infty, we may assume that no AnA_{n} has 𝐂\mathbf{C} as an element, and therefore every AnA_{n} is an ω\omega-cover of 𝐂\mathbf{C}. Using the selection principle 𝖲1(Ω[𝐂],GΛ[X|𝐂])\mathsf{S}_{1}(\Omega[\mathbf{C}],G\Lambda[X|\mathbf{C}]), choose open sets VnAnV_{n}\in A_{n} such that {Vn:n𝐍}GΛ[X|𝐂]\{V_{n}:n\in\mathbf{N}\}\in G\Lambda[X|\mathbf{C}]. Now, for each n𝐍n\in\mathbf{N}, let k(n)𝐍k(n)\in\mathbf{N} be such that Vn=Umn,0Umn,k(n)1V_{n}=U_{m_{n,0}}\cup\dots\cup U_{m_{n,k(n)-1}} in a way such that mn,0<<mn,k(n)1m_{n,0}<\dots<m_{n,k(n)-1} are all elements of [n]ρ[n]_{\rho}, and Umn,iBmn,iU_{m_{n,i}}\in B_{m_{n,i}} for every i<k(n)i<k(n). Since all the Umn,iU_{m_{n,i}}’s have different diameters (in particular they are different), the set {Umn,i:n𝐍&i<k(n)}\left\{U_{m_{n,i}}:n\in\mathbf{N}\,\&\,i<k(n)\right\} belongs to GΛ[X|𝐂]G\Lambda[X|\mathbf{C}]. The argument finishes by recalling that diamUmn,iεn\operatorname{\mathrm{diam}}U_{m_{n,i}}\leq\varepsilon_{n}. ∎

The classes 𝒩+(𝐑)\mathscr{N}^{+}(\mathbf{R}) and 𝒩(𝐑)\mathscr{N}^{\star}(\mathbf{R}) 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 𝒩+(𝐑)\mathscr{N}^{+}(\mathbf{R}) and 𝒩(𝐑)\mathscr{N}^{\star}(\mathbf{R}) 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 𝔟\mathfrak{b} is the minimal cardinality of a set \mathscr{F} of functions f:𝐍𝐍f\colon\mathbf{N}\to\mathbf{N} such that for every g:𝐍𝐍g\colon\mathbf{N}\to\mathbf{N} there exists some ff\in\mathscr{F} such that there are infinitely many n𝐍n\in\mathbf{N} with g(n)<f(n)g(n)<f(n).

Corollary 4.3.

The following are equivalent.

  1. (1)

    Every strong measure zero set of reals is countable.

  2. (2)

    Every meager-additive set of reals is countable.

Proof.

It is enough to prove that ¬(1)¬(2)\neg(1)\Rightarrow\neg(2). We proceed by cases:

  1. (i)

    If 𝔟=1\mathfrak{b}=\aleph_{1}, it is a result of Bartoszyński (see [1, Theorem 2 (1)]) that there exists an uncountable meager-additive subset of the real line.

  2. (ii)

    If 𝔟>1\mathfrak{b}>\aleph_{1}, let XX be a strong measure zero set of reals with |X|=1|X|=\aleph_{1}. Since 𝔟>1\mathfrak{b}>\aleph_{1}, XX has the Hurewicz property (see [12]). By [7, Theorem 8], XX is a set of reals that has the Hurewicz property and such that the selection principle 𝖲1(O[X],O[X])\mathsf{S}_{1}(O[X],O[X]) holds. By [19, Theorem 14], this implies that the selection principle 𝖲1(Ω[𝐑],GΛ[X|𝐑])\mathsf{S}_{1}(\Omega[\mathbf{R}],G\Lambda[X|\mathbf{R}]) holds. Therefore, by Proposition 4.2, XX has sharp measure zero, and is meager-additive.

This concludes the proof. ∎

Corollary 4.3 implies that the classes 𝒩+(𝐑)\mathscr{N}^{+}(\mathbf{R}) and 𝒩(𝐑)\mathscr{N}^{\star}(\mathbf{R}) are provably in ZFC\mathrm{ZFC} not extremely different in the sense that it cannot be case that 𝒩(𝐑)\mathscr{N}^{\star}(\mathbf{R}) coincides with the class of countable subsets of 𝐑\mathbf{R}, 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 𝒩+(𝐑)\mathscr{N}^{+}(\mathbf{R}) and 𝒩(𝐑)\mathscr{N}^{\star}(\mathbf{R}) coincide, this is because 𝒩(𝐑)=𝒩+(𝐑)=[𝐑]0\mathscr{N}^{\star}(\mathbf{R})=\mathscr{N}^{+}(\mathbf{R})=[\mathbf{R}]^{\leq\aleph_{0}}. 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 ZFC\mathrm{ZFC} has a model, then it has a model in which:

  1. (1)

    Every strong measure zero subset of 𝐂\mathbf{C} is ζ\zeta-supernull.

  2. (2)

    There are no unbounded reals over LL.

  3. (3)

    𝒩+(𝐂)=[𝐂]1\mathscr{N}^{+}(\mathbf{C})=[\mathbf{C}]^{\leq\aleph_{1}}.

  4. (4)

    20=22^{\aleph_{0}}=\aleph_{2}.

It is worth mentioning that the relative consistency of 𝒩+(𝐂)=[𝐂]1\mathscr{N}^{+}(\mathbf{C})=[\mathbf{C}]^{\leq\aleph_{1}} 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 MM be a model of set theory in which all the items in Theorem 4.4 hold. By Proposition 4.2, 𝒩+(𝐂)=𝒩(𝐂)\mathscr{N}^{+}(\mathbf{C})=\mathscr{N}^{\star}(\mathbf{C}). Now, if XX is a strong measure zero set of real numbers that it is not meager-additive, since both 𝒩+(𝐑)\mathscr{N}^{+}(\mathbf{R}) and 𝒩(𝐑)\mathscr{N}^{\star}(\mathbf{R}) are σ\sigma-ideals (cf. Poposition 2.1), we may assume that X[0,1]X\subseteq[0,1]. By Proposition 2.2, c1(X)𝒩+(𝐂)𝒩(𝐂)c^{-1}(X)\in\mathscr{N}^{+}(\mathbf{C})\setminus\mathscr{N}^{\star}(\mathbf{C}); contradiction. An analogous argument proves that, in MM, there are uncountable strong measure zero sets of the reals. ∎

Let 𝐓=(An:n𝐍)\mathbf{T}=(A_{n}:n\in\mathbf{N}) be some sequence of ω\omega-covers of the Cantor space. We will construct a sequence of finite sets 𝐓^:=(tn:n𝐍)\hat{\mathbf{T}}:=(t_{n}:n\in\mathbf{N}) such that each tnAnt_{n}\subseteq A_{n} is a cover of 𝐂\mathbf{C}, and all the tnt_{n}’s are pairwise disjoint: Since 𝐂\mathbf{C} is compact, let t0A0t_{0}\subseteq A_{0} be a finite cover of 𝐂\mathbf{C}. For every n1n\geq 1, if we already defined tkt_{k} for all k<nk<n, let

Bn:=Ank<ntk.B_{n}:=A_{n}\setminus\bigcup_{k<n}t_{k}.

By Lemma 2.3, BnB_{n} is an ω\omega-cover of 𝐂\mathbf{C}, so there exists a finite set tnBnt_{n}\subseteq B_{n} that covers 𝐂\mathbf{C}. This finishes the construction.

Fix a sequence 𝐓\mathbf{T} of ω\omega-covers of 𝐂\mathbf{C}, and set 𝐓^\hat{\mathbf{T}} as described above.

Lemma 4.5.

For every n𝐍n\in\mathbf{N}, and every x𝐂x\in\mathbf{C}, the sets

Dn:=\displaystyle D_{n}:= {p𝐏(𝐓^):ndomp}and\displaystyle\left\{p\in\mathbf{P}(\hat{\mathbf{T}}):n\in\operatorname{\mathrm{dom}}p\right\}\quad\text{and}
Ex:=\displaystyle E_{x}:= {p𝐏(𝐓^):(N𝐍)(nN)(k[n]ζdomp)(xp(k))}\displaystyle\left\{p\in\mathbf{P}(\hat{\mathbf{T}}):\left(\exists N\in\mathbf{N}\right)\left(\forall n\geq N\right)\left(\exists k\in[n]_{\zeta}\cap\operatorname{\mathrm{dom}}p\right)\left(x\in p(k)\right)\right\}

are dense open subsets of 𝐏(𝐓^)\mathbf{P}(\hat{\mathbf{T}}).

Proof.

That all the DnD_{n}’s and all the ExE_{x}’s are open is obvious, so we only need to check the density.

  1. (1)

    Let q𝐏(𝐓^)q\in\mathbf{P}(\hat{\mathbf{T}}) be a condition, and let n𝐍n\in\mathbf{N} be fixed. We are looking for a partial 𝐓^\hat{\mathbf{T}}-selector pp extending qq, with ndompn\in\operatorname{\mathrm{dom}}p, and such that the gap-counting 𝔤p\mathfrak{g}_{p} is still monotone. If ndomqn\in\operatorname{\mathrm{dom}}q, there is nothing to prove. Otherwise, let m𝐍m\in\mathbf{N} be such that n[m]ζn\in[m]_{\zeta}, and let {mi:i<l}\{m-i:i<l\} be the set of all the non-negative integers such that 𝔤q(m)=𝔤q(mi)\mathfrak{g}_{q}(m)=\mathfrak{g}_{q}(m-i). For each i<li<l, choose ki[mi]ζdomqk_{i}\in[m-i]_{\zeta}\setminus\operatorname{\mathrm{dom}}q, with k0=nk_{0}=n, and choose arbitrary open sets UkitkiU_{k_{i}}\in t_{k_{i}}. Setting p:=q{(ki,Uki):i<l}p:=q\cup\{(k_{i},U_{k_{i}}):i<l\}, we obtain that p𝐏(𝐓^)p\in\mathbf{P}(\hat{\mathbf{T}}) is the desired condition.

  2. (2)

    Let q𝐏(𝐓^)q\in\mathbf{P}(\hat{\mathbf{T}}), and let x𝐂x\in\mathbf{C} be fixed. For each nμ1(𝔤q)n\geq\mu_{1}(\mathfrak{g}_{q}), choose some kn[n]ζdomqk_{n}\in[n]_{\zeta}\setminus\operatorname{\mathrm{dom}}q. Since each tknt_{k_{n}} is an open cover of 𝐂\mathbf{C}, there must exist open sets UkntknU_{k_{n}}\in t_{k_{n}} such that xUknx\in U_{k_{n}} for all n𝐍n\in\mathbf{N}. If we define

    p:=q{(kn,Ukn):nμ1(𝔤q)},p:=q\cup\left\{\left(k_{n},U_{k_{n}}\right):n\geq\mu_{1}(\mathfrak{g}_{q})\right\},

    then the condition p𝐏(𝐓^)p\in\mathbf{P}(\hat{\mathbf{T}}) is as desired.

This concludes the argument. ∎

If GG is a VV-generic filter on 𝐏(𝐓^)\mathbf{P}(\hat{\mathbf{T}}), we define

ϕG:=G.\phi_{G}:=\bigcup G.
Theorem 4.6.

If GG is a VV-generic filter on 𝐏(𝐓^)\mathbf{P}(\hat{\mathbf{T}}), then:

  1. (1)

    ϕG\phi_{G} is a total function, i.e., it has 𝐍\mathbf{N} as its domain.

  2. (2)

    For every n𝐍n\in\mathbf{N}, ϕG(n)tn\phi_{G}(n)\in t_{n}. In particular, ϕG\phi_{G} is one-to-one.

  3. (3)

    Every element of 𝐂\mathbf{C} is in all but finitely many elements of the set

    {{ϕG(k):k[n]ζ}:n𝐍}.\left\{\bigcup\left\{\phi_{G}(k):k\in[n]_{\zeta}\right\}:n\in\mathbf{N}\right\}.
Proof.

Fix a VV-generic filter GG on 𝐏(𝐓^)\mathbf{P}(\hat{\mathbf{T}}).

  1. (1)

    For each n𝐍n\in\mathbf{N}, let pGDnp\in G\cap D_{n}. Then ndompdomϕGn\in\operatorname{\mathrm{dom}}p\subseteq\operatorname{\mathrm{dom}}\phi_{G}.

  2. (2)

    If ndompn\in\operatorname{\mathrm{dom}}p, since pp is a partial 𝐓^\hat{\mathbf{T}}-selector, ϕG(n)=p(n)tn\phi_{G}(n)=p(n)\in t_{n}.

  3. (3)

    For each x𝐂x\in\mathbf{C}, choose a condition pGExp\in G\cap E_{x}. Then xx is in all but finitely many elements of the set

    {{p(k):k[n]ζdomp}:n𝐍},\left\{\bigcup\left\{p(k):k\in[n]_{\zeta}\cap\operatorname{\mathrm{dom}}p\right\}:n\in\mathbf{N}\right\},

    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 𝐏(𝐓^α)\mathbf{P}(\hat{\mathbf{T}}_{\alpha}), for α<ω2\alpha<\omega_{2}, over a model of V=LV=L, where at each stage in the iteration, V[Gα]``𝐓α is a sequence of ω-covers of 𝐂"V[G_{\alpha}]\models``\mathbf{T}_{\alpha}\text{ is a sequence of }\omega\text{-covers of }\mathbf{C}", and where we have dovetailed so as to ensure that for any 𝐓\mathbf{T} such that

V[Gω2]``𝐓 is a sequence of ω-covers of 𝐂",V[G_{\omega_{2}}]\models``\mathbf{T}\text{ is a sequence of }\omega\text{-covers of }\mathbf{C}",

then for cofinally many α<ω2\alpha<\omega_{2} we have that 𝐓=𝐓α\mathbf{T}=\mathbf{T}_{\alpha}. This dovetailing can be done since there are only continuum many sequences of ω\omega-covers of 𝐂\mathbf{C}, and the intermediate models satisfy the continuum hypothesis.

Claim.

V[Gω2]``If X[𝐂]1, then X is a ζ-supernull subset of 𝐂"V[G_{\omega_{2}}]\models``\text{If }X\in[\mathbf{C}]^{\leq\aleph_{1}}\text{, then }X\text{ is a }\zeta\text{-supernull subset of }\mathbf{C}".

Proof of the Claim.

By [13, Theorem 16.30], the iteration poset 𝐏ω2\mathbf{P}_{\omega_{2}} satisfies the 2\aleph_{2}-chain condition. This implies that if XX is a subset of 𝐂\mathbf{C} in V[Gω2]V[G_{\omega_{2}}] with |X|1|X|\leq\aleph_{1}, then there exists some α<ω2\alpha<\omega_{2} such that XV[Gα]X\in V[G_{\alpha}]. Now, if 𝐓=(An:n𝐍)\mathbf{T}=(A_{n}:n\in\mathbf{N}) is such that V[Gω2]``𝐓 is a sequence of ω-covers of 𝐂"V[G_{\omega_{2}}]\models``\mathbf{T}\text{ is a sequence of }\omega\text{-covers of }\mathbf{C}", let βα\beta\geq\alpha be such that 𝐓=𝐓β\mathbf{T}=\mathbf{T}_{\beta}. By Theorem 4.6, there is in V[Gβ+1]V[G_{\beta+1}] an infinite cover {Un:n𝐍}\{U_{n}:n\in\mathbf{N}\} of X|𝐂X|\mathbf{C} such that UnAnU_{n}\in A_{n} for every n𝐍n\in\mathbf{N}, and such that every element of XX is in all but finitely many elements of the set

{{Uk:k[n]ζ}:n𝐍}.\left\{\bigcup\left\{U_{k}:k\in[n]_{\zeta}\right\}:n\in\mathbf{N}\right\}.

Therefore, V[Gω2]``X is a ζ-supernull subset of 𝐂"V[G_{\omega_{2}}]\models``X\text{ is a }\zeta\text{-supernull subset of }\mathbf{C}". ∎

We may continue now with the proof of Theorem 4.4:

  1. (1)

    By Proposition 3.4, every strong measure zero subset XX of 𝐂\mathbf{C} in V[Gω2]V[G_{\omega_{2}}] has cardinality at most 1\aleph_{1}, so it is ζ\zeta-supernull.

  2. (2)

    By Corollary 3.3, every function f:𝐍𝐍f\colon\mathbf{N}\to\mathbf{N} in V[Gω2]V[G_{\omega_{2}}] is dominated by some function g:𝐍𝐍g\colon\mathbf{N}\to\mathbf{N} in the ground model.

  3. (3)

    Working in V[Gω2]V[G_{\omega_{2}}]: By Proposition 3.4, 𝒩+(𝐂)[𝐂]1\mathscr{N}^{+}(\mathbf{C})\subseteq[\mathbf{C}]^{\leq\aleph_{1}}. On the other hand, if XX is a subset of 𝐂\mathbf{C} with |X|1|X|\leq\aleph_{1}, then XX is ζ\zeta-supernull. By Proposition 4.2, XX has sharp measure zero, and by Proposition 2.1, XX has strong measure zero as well.

  4. (4)

    Follows from the usual argument.

5. Concluding remarks

The following question is due to the anonymous referee:

Question 5.1.

Is it relatively consistent with ZFC\mathrm{ZFC} that 𝒩+(𝐑)=𝒩(𝐑)\mathscr{N}^{+}(\mathbf{R})=\mathscr{N}^{\star}(\mathbf{R}), but 𝒩+(𝐑)\mathscr{N}^{+}(\mathbf{R}) is not of the form [𝐑]κ[\mathbf{R}]^{\leq\kappa} for any cardinal number κ\kappa?

We will say that a subset XX of the real numbers is a relative pre-γ\gamma-set if the selection principle 𝖲1(Ω[𝐑],PΓ[X|𝐑])\mathsf{S}_{1}(\Omega[\mathbf{R}],P\Gamma[X|\mathbf{R}]) holds.

Question 5.2.

Suppose that every strong measure zero set of reals is a relative pre-γ\gamma-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 𝐏(𝐓^)\mathbf{P}(\hat{\mathbf{T}}) (see [18, Theorem 5]), that adds a pre-γ\gamma-cover by selecting one open set in each coordinate of a given sequence of ω\omega-covers. Fix a sequence 𝐓\mathbf{T} of ω\omega-covers of 𝐂\mathbf{C}. A partial 𝐓\mathbf{T}-selector ff is called initial if domf\operatorname{\mathrm{dom}}f is a finite initial segment of 𝐍\mathbf{N}.

Definition 5.3.

The forcing notion 𝐒(𝐓)\mathbf{S}(\mathbf{T}) is the set of pairs p=(Cp,fp)p=(C_{p},f_{p}) such that:

  1. (1)

    CpC_{p} is a finite subset of 𝐂\mathbf{C}

  2. (2)

    fpf_{p} is an initial 𝐓\mathbf{T}-selector.

We order 𝐒(𝐓)\mathbf{S}(\mathbf{T}) by pqp\leq q if:

  1. (1)

    CpCqC_{p}\supseteq C_{q}.

  2. (2)

    fpfqf_{p}\supseteq f_{q}.

  3. (3)

    (kdomfpdomfq)(xCq)(xfp(k))(\forall k\in\operatorname{\mathrm{dom}}f_{p}\setminus\operatorname{\mathrm{dom}}f_{q})(\forall x\in C_{q})(x\in f_{p}(k)).

By [18, Theorem 6], the forcing notion 𝐒(𝐓)\mathbf{S}(\mathbf{T}) has the countable chain condition. Clearly, 𝐒(𝐓)\mathbf{S}(\mathbf{T}) forces that for the sequence of ω\omega-covers 𝐓\mathbf{T}, we can select one open set in each coordinate of 𝐓\mathbf{T} to obtain a pre-γ\gamma-cover of 𝐂\mathbf{C}. Nevertheless, it is easy to see that 𝐒(𝐓)\mathbf{S}(\mathbf{T}) 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-γ\gamma-cover by selecting one open set in each coordinate of 𝐓\mathbf{T} 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 𝐓=(An:n𝐍)\mathbf{T}=(A_{n}:n\in\mathbf{N}) be a sequence of ω\omega-covers of the Cantor space. Is it possible to generically add a cover {Un:n𝐍}PΓ[𝐂]\{U_{n}:n\in\mathbf{N}\}\in P\Gamma[\mathbf{C}] such that UnAnU_{n}\in A_{n} for every n𝐍n\in\mathbf{N} 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 γ\gamma-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.