Skip to main content

Since we can cover the reals by at most $\mathfrak{r}$ (reaping number) closed null sets, we can do a countable support iteration of rational perfect set forcing over a model of CH to get a model of $\omega_1 = \mathfrak{r} < \mathfrak{d} = \omega_2$.

To see that $cov(\mathcal{E}) \leq \mathfrak{r}$$\operatorname{cov}(\mathcal{E}) \leq \mathfrak{r}$, just note that for every infinite $A \subseteq \omega$, $i \in \{0, 1\}$, the set $N_{A, i} = \{x \in 2^{\omega} : (\forall n \in A) (x(n) = i)\}$ is closed null.

$\mathfrak{d} = \omega_2$ in this model because Miller real is not dominated by any ground model real. Also the ground model p-points are preserved so $\mathfrak{r} = \mathfrak{u} = \omega_1$. The proof of this fact can be found in chapter 23 of Halbeisen's Combinatorial set theory.

Since we can cover the reals by at most $\mathfrak{r}$ (reaping number) closed null sets, we can do a countable support iteration of rational perfect set forcing over a model of CH to get a model of $\omega_1 = \mathfrak{r} < \mathfrak{d} = \omega_2$.

To see that $cov(\mathcal{E}) \leq \mathfrak{r}$, just note that for every infinite $A \subseteq \omega$, $i \in \{0, 1\}$, the set $N_{A, i} = \{x \in 2^{\omega} : (\forall n \in A) (x(n) = i)\}$ is closed null.

$\mathfrak{d} = \omega_2$ in this model because Miller real is not dominated by any ground model real. Also the ground model p-points are preserved so $\mathfrak{r} = \mathfrak{u} = \omega_1$. The proof of this fact can be found in chapter 23 of Halbeisen's Combinatorial set theory.

Since we can cover the reals by at most $\mathfrak{r}$ (reaping number) closed null sets, we can do a countable support iteration of rational perfect set forcing over a model of CH to get a model of $\omega_1 = \mathfrak{r} < \mathfrak{d} = \omega_2$.

To see that $\operatorname{cov}(\mathcal{E}) \leq \mathfrak{r}$, just note that for every infinite $A \subseteq \omega$, $i \in \{0, 1\}$, the set $N_{A, i} = \{x \in 2^{\omega} : (\forall n \in A) (x(n) = i)\}$ is closed null.

$\mathfrak{d} = \omega_2$ in this model because Miller real is not dominated by any ground model real. Also the ground model p-points are preserved so $\mathfrak{r} = \mathfrak{u} = \omega_1$. The proof of this fact can be found in chapter 23 of Halbeisen's Combinatorial set theory.

added 520 characters in body
Source Link
Ashutosh
  • 9.6k
  • 1
  • 34
  • 55

Since we can cover the reals by at most $\tau$$\mathfrak{r}$ (reaping number) closed null sets, we can do a countable support iteration of rational perfect set forcing over a model of CH to get a model of $\omega_1 = \tau < \mathfrak{d} = \omega_2$$\omega_1 = \mathfrak{r} < \mathfrak{d} = \omega_2$.

To see that $cov(\mathcal{E}) \leq \mathfrak{r}$, just note that for every infinite $A \subseteq \omega$, $i \in \{0, 1\}$, the set $N_{A, i} = \{x \in 2^{\omega} : (\forall n \in A) (x(n) = i)\}$ is closed null.

$\mathfrak{d} = \omega_2$ in this model because Miller real is not dominated by any ground model real. Also the ground model p-points are preserved so $\mathfrak{r} = \mathfrak{u} = \omega_1$. The proof of this fact can be found in chapter 23 of Halbeisen's Combinatorial set theory.

Since we can cover the reals by at most $\tau$ (reaping number) closed null sets, we can do a countable support iteration of rational perfect set forcing over a model of CH to get a model of $\omega_1 = \tau < \mathfrak{d} = \omega_2$.

Since we can cover the reals by at most $\mathfrak{r}$ (reaping number) closed null sets, we can do a countable support iteration of rational perfect set forcing over a model of CH to get a model of $\omega_1 = \mathfrak{r} < \mathfrak{d} = \omega_2$.

To see that $cov(\mathcal{E}) \leq \mathfrak{r}$, just note that for every infinite $A \subseteq \omega$, $i \in \{0, 1\}$, the set $N_{A, i} = \{x \in 2^{\omega} : (\forall n \in A) (x(n) = i)\}$ is closed null.

$\mathfrak{d} = \omega_2$ in this model because Miller real is not dominated by any ground model real. Also the ground model p-points are preserved so $\mathfrak{r} = \mathfrak{u} = \omega_1$. The proof of this fact can be found in chapter 23 of Halbeisen's Combinatorial set theory.

Source Link
Ashutosh
  • 9.6k
  • 1
  • 34
  • 55

Since we can cover the reals by at most $\tau$ (reaping number) closed null sets, we can do a countable support iteration of rational perfect set forcing over a model of CH to get a model of $\omega_1 = \tau < \mathfrak{d} = \omega_2$.