This paper introduces a new cardinal characteristic called the splitting number of the reals, explores its connection to Efimov's problem, and analyzes its implications for the structure of infinite compact Hausdorff spaces.
Contribution
It defines the splitting number of the reals and investigates its relationship to Efimov's problem, providing new insights into topological and set-theoretic properties.
Findings
01
The splitting number of the reals is a new cardinal characteristic.
02
Connections established between the splitting number and Efimov's problem.
03
Implications for the existence of certain types of compact spaces.
Abstract
We introduce and analyze a new cardinal characteristic of the continuum, the \emph{splitting number of the reals}, denoted s(R). This number is connected to Efimov's problem, which asks whether every infinite compact Hausdorff space must contain either a non-trivial convergent sequence, or else a copy of βN.
μf([[ζ]])=∣{ξ:ξ is admissible and dom(ξ)=dom(ζ)}∣1.
μf([[ζ]])=∣{ξ:ξ is admissible and dom(ξ)=dom(ζ)}∣1.
P(φ(z))
P(φ(z))
P(φ(z)∣ψ(z))
Uzf=⋃n∈ωUz,nf=⋃{[s]⊆2ω:s∈z(n) for some n}.
Uzf=⋃n∈ωUz,nf=⋃{[s]⊆2ω:s∈z(n) for some n}.
dif(x,y)=min{n∈ω:x(n)=y(n)}.
dif(x,y)=min{n∈ω:x(n)=y(n)}.
P(z selects x∣z does not select y)<2k1.
P(z selects x∣z does not select y)<2k1.
P(⋀1≤i≤nz does not select xi)<e−n/2k+2.
P(⋀1≤i≤nz does not select xi)<e−n/2k+2.
†
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
We introduce and analyze a new cardinal characteristic of the continuum, the splitting number of the reals, denoted s(R). This number is connected to Efimov’s problem, which asks whether every infinite compact Hausdorff space must contain either a non-trivial convergent sequence, or else a copy of βN.
1. Introduction
This paper is about a new cardinal characteristic of the continuum, the splitting number of the reals, denoted s(R).
Definition 1.1**.**
If U and A are infinite sets, we say that UsplitsA provided that both A∩U and A∖U are infinite.
The cardinal number s(R) is defined as the smallest cardinality of a collection U of open subsets of R such that every infinite A⊆R is split by some U∈U.
In this definition, R is assumed to have its usual topology.
The number s(R) is a topological variant of the splitting number s, and is a cardinal characteristic of the continuum in the sense of [2].
Most of this paper is devoted to understanding the place of s(R) among the classical cardinal characteristics of the continuum.
Our main achievement along these lines is to determine completely the place of s(R) in Cichoń’s diagram. More precisely, for every cardinal κ appearing in Cichoń’s diagram, we prove either that κ is a (consistently strict) lower bound for s(R), or that κ is a (consistently strict) upper bound for s(R), or else that each of κ<s(R) and s(R)<κ is consistent.
To explain our motivation for investigating the cardinal number s(R), we begin with a longstanding open problem of set-theoretic topology:
Efimov’s problem [13, 19]: Does every infinite compact Hausdorff space contain either a non-trivial convergent sequence, or else a copy of βN?
An Efimov space is defined to be an infinite compact Hausdorff space containing neither a non-trivial convergent sequence nor a copy of βN, should such a space exist.
Since the 1970’s, it has been known that a negative solution to Efimov’s problem is consistent with ZFC. In other words, it is consistent that Efimov spaces exist. This result is due to Fedorčuk, who published three separate papers giving three separate constructions of Efimov spaces, each time using a different set-theoretic axiom to facilitate his construction [14, 15, 16]. It is unknown whether a positive solution to Efimov’s problem is also consistent, and in this sense the problem remains open.
The cardinal s(R) is related to the question of how “small” an Efimov space can be, where we measure the smallness of a space by its weight. Recall that the weight of a topological space is the smallest size of a basis for that space.
From now on, a space will always mean an infinite Hausdorff topological space.
A space is called non-sequential if it is not discrete and yet contains no non-trivial convergent sequences.
Definition 1.2**.**
The cardinal number z is defined to be the smallest weight of a compact non-sequential space.
The notation z is from the Polish zbiez˙ność meaning convergence, and was suggested by Damian Sobota in [27]. Let us record a few observations:
∘
Booth proved in [5] that every compact space of weight <s is sequentially compact, and thus contains non-trivial convergent sequences. Hence s≤z.
∘
Koppelberg proved in [24] that every compact space with weight <cov(M) contains a non-trivial convergent sequence. (Her proof is phrased in terms of Boolean algebras; see [17, Section 2] for a topological translation.) Hence cov(M)≤z.
∘
The space βN, the Stone-Čech compactification of the countable discrete space N, contains no non-trivial converging sequences, and it follows that z≤c=weight(βN).
∘
If z<c, then there is an Efimov space. This is because any space containing a copy of βN must have weight ≥c. If there is an Efimov space, then z=min{weight(X):X is an Efimov space}.
Thus the number z could be considered a cardinal characteristic of the continuum, one closely tied to Efimov’s problem. Unfortunately, z seems difficult to analyze directly. In this paper, we analyze it indirectly by examining the cardinal s(R) instead. The cardinals s(R) and z are related by the following theorem, whose proof is found in Section 2 below.
Theorem 2.9.
Suppose κ is a cardinal such that s(R)≤κ=cof(κℵ0,⊆). Then z≤κ.
Recall that cof(κℵ0,⊆) denotes the smallest possible size of a collection C of countable subsets of κ such that every countable subset of κ is contained in some member of C.
If κ has uncountable cofinality, and if the Covering Lemma holds with respect to some inner model K satisfying the GCH, then κ=cof(κℵ0,⊆); see [21, Section 4] for a proof. Conversely, if cf(κ)>ω then the inequality κ<cof(κℵ0,⊆) implies the Covering Lemma fails over any such inner model, an assertion of significant large cardinal strength.
(It implies at least that there is an inner model containing a measurable cardinal by results in [7]; on the other hand, Gitik obtained in [18] a model in which cof(ℵω+1ℵ0,⊆)>ℵω+1 using a measurable cardinal κ of Mitchell order o(κ)=κ++.)
Furthermore, the inequality κ<cof(κℵ0,⊆) implies κ≥ℵω. (Again, a proof can be found in [21, Section 4].) Thus if s(R)<ℵω, then we may take κ=s(R) in the above theorem.
Corollary**.**
If s(R)<ℵω then z≤s(R).
The present paper is organized as follows. In Section 2 we prove some basic facts about s(R) and prove the theorem concerning s(R) and z discussed above.
After this, we prove several theorems comparing s(R) with other cardinal characteristics of the continuum. Specifically, in Sections 3 and 4 we prove the following bounds on s(R) in terms of more familiar cardinals:
•
s≤s(R)
•
b≤s(R)
•
cov(M)≤s(R)
•
s(R)≤max{b,non(N)}
(For the definitions of these other cardinal characteristics of the continuum, we refer the reader to [2] or [8].) We show that each of these four bounds is consistently strict.
In Section 5, we also show via forcing the relative consistency of two more inequalities:
•
b=s(R)<non(N)
•
d=cof(M)<s(R)
These six results, together with established facts about the cardinals in Cichoń’s diagram, suffice to pinpoint the location of s(R) in Cichoń’s diagram as described above. This is discussed further in Section 5. We have also included a short Section 6 reviewing the status of Efimov’s problem, and stating some open questions related to s(R) and z.
2. More on s(R) and z
We begin this section by showing that the value of s(R) remains unchanged when R is replaced by any other uncountable Polish space in Definition 1.1, or when the definition is altered by requiring only certain kinds of infinite sets to be split by every U∈U.
Definition 2.1**.**
If X is a topological space, then the number s(X) is defined as the smallest cardinality of a collection U of open subsets of X such that every infinite A⊆X is split by some U∈U.
Lemma 2.2**.**
If Y⊆X, then s(Y)≤s(X).
Proof.
If U is a family of open subsets of X such that every infinite A⊆X is split by some U∈U, then every infinite A⊆Y is split by some U∈U.∎
Lemma 2.3**.**
Suppose X is an uncountable, zero-dimensional, Borel subspace of a Polish space. Then s(X)=s(2ω).
Proof.
If X is as in the statement of the lemma, then X contains a copy of the Cantor space [23, Theorem 6.2] and X embeds topologically into the Cantor space [23, Theorem 7.3]. By the previous lemma, this implies that s(2ω)≤s(X)≤s(2ω), so s(X)=s(2ω).
∎
Lemma 2.4**.**
s(2ω)* is uncountable.*
Proof.
It follows immediately from the definitions that if N has the discrete topology, then s(N) is equal to the splitting number s (which is uncountable). As s≤s(2ω) by Lemma 2.2, s(R) is uncountable.
∎
Theorem 2.5**.**
If X,Y are uncountable Polish spaces, then s(X)=s(Y).
Proof.
Let H denote the Hilbert cube [0,1]ℵ0. To prove the theorem, it suffices to show that s(H)≤s(2ω). This is because, if X is any uncountable Polish space, then X contains a copy of the Cantor space [23, Theorem 6.2] and X embeds into the Hilbert cube [23, Theorem 4.14]. By Lemma 2.2, it follows that s(2ω)≤s(X)≤s(H), so if s(H)≤s(2ω) then s(H)=s(2ω)=s(X) for every uncountable Polish space X.
To see that s(H)≤s(2ω), we use a slight variation of a result of Hausdorff [20], which states that the Baire space ωω can be written as an increasing union ⋃α<ω1Xα, where each Xα is a Gδ subspace of ωω.
This result is a relatively straightforward consequence of the existence of Hausdorff gaps. Recall that a Hausdorff gap is a sequence ⟨(fα,gα):α<ω1⟩ of pairs of functions ω→ω such that
•
fα<∗fβ<∗gβ<∗gα for every α<β<ω1 (where, as usual, f<∗g means that f(n)<g(n) for all but finitely many n∈ω).
•
there is no h:ω→ω such that fα<∗h<∗gα for all α<ω1.
Taking Xα={f∈ωω:fα<∗f<∗gα} for each α<ω1, one may check that each Xα is Gδ and that ωω=⋃α<ω1Xα.
Recall that ωω is homeomorphic to [0,1]∖Q, so we may write [0,1]∖Q=⋃α<ω1Xα, and by setting Yn=Xn∪{the nth rational number in [0,1]} and Yα=Xα for α≥ω, we get [0,1]=⋃α<ω1Yα, where each Yα is a zero-dimensional, Gδ subspace of [0,1].
Furthermore, each Yα is uncountable (because each Xα is, as one may easily check).
Taking Zα=Yαω for every α<ω1, we arrive at the desired modification of Hausdorff’s result: the Hilbert cube H is an increasing union ⋃α<ω1Zα of uncountable, Borel, zero-dimensional subspaces.
For each α<ω1, let Uα be a family of at most s(2ω) open subsets of H such that every infinite A⊆Zα is split by some U∈Uα. (Some such Uα exists by Lemma 2.3.) Let U=⋃α<ω1Uα.
Suppose A⊆H is infinite. Then there is some α<ω1 such that A∩Zα is infinite. Thus there is some U∈Uα such that both (A∩Zα)∩U and (A∩Zα)∖U are infinite. But then both A∩U and A∖U are infinite as well, so U splits A.
This shows that s(H)≤∣U∣=⋃α<ω1Uα≤ℵ1⋅s(2ω). Lemma 2.4 implies that ℵ1⋅s(2ω)=s(2ω), so s(H)≤s(2ω), as desired.
∎
Theorem 2.6**.**
Let X be a Polish space. Let [X]ω denote the set of all countably infinite subsets of X, and let [X]con denote the set of all non-trivial convergent sequences in X, considered as sets rather than sequences. If we define
•
sω(X)* to be the smallest cardinality of a collection U of open subsets of X such that every A∈[X]ω is split by some U∈U, and*
•
scon(X)* to be the smallest cardinality of a collection U of open subsets of X such that every A∈[X]con is split by some U∈U*
then sω(X)=scon(X)=s(X)=s(R).
Proof.
Clearly [X]con⊆[X]ω and every A∈[X]ω is infinite. It follows that scon(X)≤sω(X)≤s(X).
As in the proof of Lemma 2.2, if U is any family that splits every A∈[X]con, then U also splits every A∈[Y]con for any subspace Y of X. As 2ω embeds in X [23, Theorem 6.2], it follows that scon(2ω)≤scon(X). Thus
[TABLE]
(where the final equality follows from the previous theorem). Thus, to finish the proof of the theorem, it suffices to show that s(2ω)≤scon(2ω).
Suppose U is a collection of open subsets of 2ω with ∣U∣≤scon(2ω) such that every A∈[2ω]con is split by some U∈U. If B is any infinite subset of 2ω, then (because 2ω is a compact metrizable space) there is some A⊆B with A∈[2ω]con, and hence some U∈U that splits A. But then U splits B as well. Thus every infinite subset of 2ω is split by some U∈U, and it follows that s(2ω)≤scon(2ω) as desired.
∎
We now move on to the proof of the theorem mentioned in the introduction connecting s(R) with z. The proof bears some resemblance to Fedorčuk’s construction of an Efimov space in [16], which uses the hypotheses 2ℵ0=2ℵ1 and s=ℵ1. It bears an even stronger resemblance to van Douwen and Fleissner’s refinement of Fedorčuk’s construction in [9, Section 2.5], where they construct an Efimov space of weight ℵ1 from the hypotheses 2ℵ0=2ℵ1 and s(R)=ℵ1 (although, of course, the latter hypothesis is not phrased in this way). In some sense, the proof presented here simply optimizes their strategy, and isolates the critical cardinal invariant for the construction.
We also point out that a similar theorem was obtained by Damian Sobota in [28, Section 8]. He showed that if there is a cardinal κ such that cof(N)≤κ=cof(κℵ0,⊆)<c, then there is an Efimov space of weight κ. Equivalently: if cof(N)≤κ=cof(κℵ0,⊆)<c then z≤κ.
As s(R)≤max{b,non(N)}≤cof(N) (with both inequalities being consistently strict), Theorem 2.9 can be viewed as a tightening of Sobota’s result.
Lemma 2.7**.**
s≤s(R).
Proof.
The proof of Lemma 2.4 shows that s≤s(2ω), and s(2ω)=s(R) by Theorem 2.5. (Alternatively, one may note that the proof of Lemma 2.4 applies to s(R) just as well as s(2ω).)
∎
A subset U of a topological space is called regular open if U=int(U).
The regular open subsets of a topological space X form a complete Boolean algebra, called the regular open algebra of X and denoted ro(X). If X is a Stone space (i.e., compact, Hausdorff, and zero-dimensional) then ro(X) is the Boolean completion of clop(X), the Boolean algebra consisting of all clopen subsets of X.
In the following two proofs, we will be looking at ro(2ω), its subalgebras, and their Stone spaces. If A⊆ro(2ω), then ⟨⟨A⟩⟩ denotes the subalgebra of ro(2ω) generated by A. For any subalgebra B of ro(2ω), we denote its Stone space by st(B). Recall that st(B) consists of all ultrafilters on B. Thus whenever A is a subalgebra of B: if x is a point of st(B) then x∩A is a point of st(A) and, conversely, if x∈st(A) then there is some y∈st(B) with y∩st(A)=x.
Lemma 2.8**.**
Suppose B is a countable Boolean algebra such that
[TABLE]
There is a subset U⊆ro(2ω) with ∣U∣=s(R) having the following property:
(∗)
Let ⟨xn:n∈N⟩ be a sequence of points in st(B), and for each n let yn be a point of st(⟨⟨B∪U⟩⟩) such that yn∩B=xn. Then the sequence ⟨yn:n∈N⟩ does not converge in st(⟨⟨B∪U⟩⟩).
Proof.
Let B be a countable Boolean algebra with
clop(2ω)⊆B⊆ro(2ω). B is atomless because B⊇clop(2ω) and clop(2ω) is atomless and dense in ro(2ω). As B is a countable, atomless Boolean algebra, it is isomorphic to clop(2ω), and st(B) is homeomorphic to 2ω.
Hence there is a family U0 of open subsets of st(B) with ∣U0∣=s(R) such that every member of [st(B)]con is split by some U∈U0.
Observe that no X∈[st(B)]con is split by a clopen set. (If x is the limit point of X, then X∩C is either finite or co-finite, depending on whether x∈/C or x∈C respectively.) Thus, by removing any clopen sets from U0 if necessary, we may (and do) assume that no U∈U0 is clopen.
For each b∈B let [b]={x∈st(B):b∈x}, and recall that the sets of this form constitute the canonical basis of clopen sets for st(B). For each U∈U0, let us fix a sequence ⟨bnU:n∈N⟩ of nonempty, pairwise disjoint members of B such that U=⋃n∈N[bUn]. This is possible because B is countable and because U is open, but not clopen, in st(B).
Let F be a family of infinite subsets of N such that ∣F∣=s and every infinite subset of N is split by some A∈F.
For each A∈F and U∈U0, define R(U,A)=int(⋃n∈AbUn). Each bUn is an open subset of 2ω; in this definition, the interior and the closure are taken in 2ω, not in st(B).
Let
[TABLE]
We claim that this U is as required.
One may easily check that int(int(V))=int(V) for any open set V (in any space).
Hence each R(U,A) is a regular open subset of 2ω.
Also, ∣U∣=∣U0∣⋅∣F∣=s(R)⋅s=s(R) (where the final equality holds because s≤s(R) by Lemma 2.7). It remains to check property (∗).
Let ⟨xn:n∈N⟩ be a sequence of points in st(B), and for each n let yn be a point of st(⟨⟨B∪U⟩⟩) such that yn∩B=xn. Let X={xn:n∈N} and Y={yn:n∈N}, and fix some U∈U0 that splits X. Note that the limit point of X is not in U (as then U would not split X). Let
[TABLE]
Any particular [bUm] contains only finitely many points of X, because it is closed and X converges to a point outside [bUm]. This implies B is infinite.
Thus there is some A∈F such that A splits B.
R(U,A)∈U, and we claim that [R(U,A)] splits Y in st(⟨⟨B∪U⟩⟩).
To see this, first notice that if m∈A then bUm⊆R(U,A), and if m∈/A then bUm∩A=∅. (This follows easily from the definition of R(U,A) and the fact that the bUm are open and pairwise disjoint.)
Because A splits B, there are infinitely many m∈A such that [bUm]∩X=∅, and [bUm]⊆[R(U,A)] in st(⟨⟨B∪U⟩⟩) for all such m. Also, if xn∈[bUm] in st(B) then yn∈[bUm]⊆[R(U,A)] in st(⟨⟨B∪U⟩⟩). It follows that Y∩[R(U,A)]⊇X∩⋃m∈A[bUm] is infinite.
Similarly, there are infinitely many m∈/A such that [bUm]∩X=∅, and [bUm]∩[U]=∅ in st(⟨⟨B∪U⟩⟩) for all such m. As before, if xn∈[bUm] in st(B) then yn∈[bUm]⊆[R(U,A)] in st(⟨⟨B∪U⟩⟩), and it follows that Y∖[R(U,A)]⊇Y∩⋃n∈/A[bUn] is infinite.
Hence [R(U,A)] splits Y in st(⟨⟨B∪U⟩⟩). But no clopen set can split a convergent sequence; thus, as [R(U,A)] is clopen in st(⟨⟨B∪U⟩⟩), Y does not converge in st(⟨⟨B∪U⟩⟩).
∎
Theorem 2.9**.**
Suppose κ is a cardinal such that s(R)≤κ=cof(κℵ0,⊆). Then z≤κ.
Proof.
To prove the theorem, we construct via recursion an increasing sequence ⟨Aα:α≤ω1⟩ of ≤κ-sized subalgebras of ro(2ω). The construction will ensure that ∣Aω1∣≤κ and st(Aω1) is non-sequential. This suffices to prove the theorem, because the weight of st(A) is ∣A∣.
For the base step of the recursion, let A0=clop(2ω), and note that A0 is countable.
If λ is a limit ordinal, then take Aλ=⟨⟨⋃α<λAα⟩⟩, noting that if ∣Aα∣≤κ for every α<λ then ∣Aλ∣≤κ also.
For the successor step, fix α<ω1 and suppose Aα has already been constructed with ∣Aα∣≤κ. Let {Cξ:ξ∈κ} be a collection of countable subsets of Aα such that every countable subset of Aα is contained in some Cξ. (Such a family exists because κ=cof(κℵ0,⊆).) For each ξ∈κ, let Bξ=⟨⟨clop(2ω)∪Cξ⟩⟩. Each Bξ is a subalgebra of ro(2ω) satisfying the hypothesis of Lemma 2.8. Applying the lemma, fix for each ξ∈κ some Uξ with ∣Uξ∣≤s(R) such that Bξ and Uξ satisfy property (∗). Finally, set Aα+1=⟨⟨Aα∪⋃ξ∈κUξ⟩⟩ and note that ∣Aα+1∣≤κ.
This completes the recursion.
Let A=Aω1.
We claim that st(A) is non-sequential. Aiming for a contradiction, suppose [st(A)]con=∅. Let ⟨yn:n∈N⟩=Y∈[st(A)]con, and let y∈st(A) be the limit point of Y. For each n∈N, there is some Dn∈A such that Y∩[Dn]={yn}. Let α<ω1 be big enough so that {Cn:n∈N}⊆Aα.
At stage α+1 of our recursion, there was some ξ∈κ such that Cξ⊇{Dn:n∈N}, and we found a set Uξ such that Bξ=⟨⟨clop(2ω)∪Cξ⟩⟩ and Uξ satisfy (∗). For each n∈N, let xn=yn∩Bξ, and note that the xn are distinct because Bξ⊇{Dn:n∈N}. Because Y converges to y in st(Aα), we must also have {xn:n∈N} converging to x=y∩Bξ. Similarly, for each n∈N, let zn=yn∩⟨⟨Bξ∪Uξ⟩⟩; because Y converges to y in st(A), we must also have {xn:n∈N} converging to z=y∩⟨⟨Bξ∪Uξ⟩⟩. As xn=Bξ∩zn for each n, this contradicts (∗).
∎
3. Lower bounds for s(R)
In the previous section, we showed that s is a lower bound for s(R). In this section we prove that cov(M) and b are also lower bounds for s(R).
Theorem 3.1**.**
cov(M)≤s(R).
Proof.
For each x∈R, fix some Sx∈[R]con converging to x. It is not difficult to see that if U is an open subset of R that splits Sx, then x∈∂U. Now suppose U is a family of open subsets of R having the property stated in Definition 1.1. For each x∈R, the set Sx is split by some U∈U, so
[TABLE]
But ∂U is closed and nowhere dense for each open U⊆R, so this shows cov(M)≤∣U∣. As this is true for every U having the property stated in Definition 1.1, it follows that cov(M)≤s(R).
∎
In the Cohen model s<cov(M). It follows from this and Theorem 3.1 that s<s(R) in the Cohen model. Thus the bound proved in Lemma 2.7 is consistently strict. This also shows that the word “uncountable” cannot be removed from the hypothesis of Theorem 2.5, because N is a Polish space and s(N)=s is consistently less than s(R).
Likewise, cov(M)<s in the Mathias model, and it follows from this and Lemma 2.7 that cov(M)<s(R) in the Mathias model. Thus the bound proved in Theorem 3.1 is consistently strict.
Recall that the Cantor space has a basis consisting of sets of the form
[TABLE]
where s∈2<ω. Here, as usual, 2<ω denotes the set of all functions from some finite ordinal n={0,1,…,n−1} to 2={0,1}.
Theorem 3.2**.**
b≤s(R).
Proof.
Suppose U is a collection of open subsets of the Cantor space 2ω such that ∣U∣<b. To prove the theorem, it suffices to show that there is some infinite X⊆2ω that is not split by any U∈U.
For each s∈2<ω, let s⌢0∞ denote the member of 2ω defined by setting
(s⌢0∞)(n)=s(n) if n∈dom(s), and (s⌢0∞)(n)=0 for all n≥dom(s).
Likewise, define s⌢0k=(s⌢0∞)↾(dom(s)+k) for each k∈ω; i.e., s⌢0k is the finite sequence obtained by appending k zeroes to s.
Observe that if s∈2<ω, then the sets of the form [s⌢0k] form a neighborhood basis for the point s⌢0∞ in 2ω.
In particular, if s⌢0∞∈U⊆2ω and U is open, then there must be some k≥0 such that [s⌢0k]⊆U.
For each U∈U, define a function fU:ω→ω by setting
[TABLE]
for each n∈ω. (This function is well-defined by the previous paragraph.)
Equivalently, fU(n) is the smallest k such that for any s∈2n+1, if s⌢0∞∈U then [s⌢0k]⊆U.
As ∣U∣<b, there is some f∈ωω such that fU<∗f for every U∈U (where, as usual, fU<∗f means that fU(n)<f(n) for all but finitely many n∈ω).
Using recursion, define an infinite (strictly increasing) sequence ⟨kn:n<ω⟩ of natural numbers as follows. Let k0=0, and for n≥0 let
[TABLE]
We now define an infinite subset of 2ω that (we claim) is not split by any U∈U.
Given n∈ω, define sn∈2<ω as follows: dom(sn)=kn+1 and
[TABLE]
Informally, sn is a finite sequence of [math]’s and 1’s, with exactly n+1 terms equal to 1, and where these 1’s appear sparsely, separated by increasingly enormous strings of [math]’s. More specifically, if the kth value of the sequence is 1, then it is followed by a length-f(k) string of [math]’s before the next 1 appears in the sequence.
[TABLE]
We claim that the set X={sn⌢0∞:n∈ω} is not split by any U∈U.
To see this, let us suppose that U∈U contains sn⌢0∞ for infinitely many n∈ω. Recall that the sequence ⟨kn:n∈ω⟩ is strictly increasing (and in particular, it contains infinitely many numbers); as fU<∗f, this implies that fU(kn)<f(kn) for all but finitely many n. Thus there is some n∈ω such that sn⌢0∞∈U and fU(kn)<f(kn).
Now dom(sn)=kn+1, so by the definition of fU, sn⌢0∞∈U implies that [sn⌢0fU(kn)]⊆U. As f(kn)>fU(kn), we also have [sn⌢0f(kn)]⊆[xn⌢0fU(n)]. Thus [sn⌢0f(kn)]⊆U.
But for all m≥n, sn⌢0f(kn) is an initial segment of sm. This implies that sm⌢0∞∈[sn⌢0f(kn)]⊆U for all m≥n.
Thus if U∈U contains infinitely many points of X, then it contains co-finitely many points of X. Hence X is not split by any U∈U.
∎
In the Cohen model, b<cov(M). It follows from this and Theorem 3.1 that b<s(R) in the Cohen model. Thus the bound proved in Theorem 3.2 is consistently strict.
Unlike s and cov(M), which are lower bounds for z as well as for s(R), b is not a lower bound for z. This follows from a result of the second author (to appear in a forthcoming paper) which shows that z=ℵ1 in the Laver model; as b=ℵ2 in the Laver model, this shows the consistency of z<b. It also shows that z<s(R) in the Laver model, which is interesting in light of the corollary to Theorem 2.9 mentioned in the introduction.
4. An upper bound for s(R)
In this section we prove our only nontrivial upper bound for s(R), namely s(R)≤max{b,non(N)}.
Recall that non(N) denotes the smallest size of a non-Lebesuge-measurable subset of 2ω. (The value of non(N) remains the same if instead of 2ω we were to use the Lebesgue measure on R or [0,1], or any other standard measure on a Polish space; see [23, Theorem 17.41]). Recall also that if X⊆2ω then the outer measure of X is
[TABLE]
(see [26, Chapter 3] or [23, Section 17.A]). In particular, if X⊆2ω has outer measure 1, then it has non-empty intersection with every measurable, non-null subset of 2ω.
Lemma 4.1**.**
non(N)* is the smallest cardinality of a subset of 2ω with outer measure 1.*
Proof.
Let X⊆2ω be a non-measurable set with ∣X∣=non(N), and let
[TABLE]
where, as usual, x=∗y means that x(n)=y(n) for all but finitely many n∈ω. It is clear that ∣Y∣=∣X∣⋅ℵ0=∣X∣, and we claim that μ∗(Y)=1. To see this, suppose B⊆2ω∖Y is measurable and μ(B)>0. Let
[TABLE]
and note that because B∩Y=∅, we must also have C∩Y=∅. By Kolmogorov’s [math]-1 Law (also known as the [math]-1 Law for Lebesgue measure; see [23, Exercise 17.1]), because C is closed under the equivalence relation =∗, either μ(C)=0 or μ(C)=1. The former is impossible because C⊇B and μ(B)>0, so μ(C)=1. As Y∩C=∅, this implies Y is null, a contradiction.
Thus if B⊆2ω is measurable and Y⊆2ω∖B, then B is null. It follows that μ∗(Y)=1.
∎
Theorem 4.2**.**
s(R)≤max{b,non(N)}.
Proof.
To prove the theorem, we will show that there is a family U of open subsets of the Cantor space 2ω, with ∣U∣=max{b,non(N)}, such that every X∈[2ω]con is split by some U∈U.
Let us begin with a brief sketch of the proof, and in particular of how the members of U are obtained. Given some function f:ω→ω, consider the following randomized, ω-step algorithm for obtaining an open subset of 2ω. On step [math], randomly select 41 of the nodes from level f(0) of the tree 2<ω (such that every node is equally likely to be selected); on step 1, randomly select 81 of the nodes from level f(1) that do not extend an already-chosen node; on step 2, randomly select 161 of the nodes from level f(2) that do not extend an already-chosen node; etc. Once a set S⊆2<ω is selected in this way, define U=⋃s∈S[s]. This U is a “random” open subset of 2ω with measure 41+81+⋯=21. We shall prove that if f:ω→ω grows fast enough, then a set U chosen in this way will split a given X∈[2ω]con with probability 21. Roughly, we need only b functions to make sure that one of them always grows “fast enough”, and only non(N) sequences of selections to ensure that one of them is always “random enough” for this idea to work. By fixing these b functions and non(N) sequences of selections beforehand, we obtain the desired family U of open sets.
To begin, we describe a way of associating to every increasing function f:ω→ω a Polish space Xf and a probability measure μf on Xf. Roughly, the idea behind the definition of Xf and μf is that a point of Xf selected randomly with respect to μf corresponds to a “random” selection of nodes in 2<ω as described in the previous paragraph.
Given n∈ω, let 2[n] denote the set of functions {0,1,…,n−1}→{0,1}. (This set is often denoted 2n, but we adopt a different notation here to distinguish between sets of sequences 2[n] and natural numbers of the form 2n, both of which appear frequently in the following argument.) Fix an increasing function f:ω→ω with f(0)≥2, and for each n∈ω define
[TABLE]
In other words, each A∈Dnf represents a possible outcome of the nth stage of the randomized selection process described above. The requirement that f be increasing with f(0)≥2 simply ensures that ∣A∣=2f(n)−n−2 is always an integer.
Let us consider each Dnf as a (finite) topological space, having the discrete topology. The space Xf is defined as a subspace of ∏n∈ωDnf (which is given the usual product topology) as follows:
[TABLE]
We claim that Xf is a Polish space. To see this, first observe that ∏n∈ωDnf is a Polish space; in fact, it is homeomorphic to the Cantor space, because it is a countably infinite product of discrete spaces each having more than one point.
The space ∏n∈ωDnf has a basis consisting of sets of the form
[TABLE]
where ζ is a function such that dom(ζ)∈ω and ζ(i)∈Dif for all i∈dom(ζ).
Next, observe that for every pair of natural numbers m<n,
[TABLE]
is open in ∏n∈ωDnf. (It is a union of some subset of the finitely many basic open sets [[ζ]] having dom(ζ)=n+1.) Thus Xf=⋂m<n<ωUm,n is a Gδ subspace of a Polish space, and therefore is itself Polish, by Alexandroff’s theorem [23, Theorem 3.11].
We call a function σadmissible if ζ is a function on some ordinal n such that ζ(i)∈Dif for all i<n, and if i<j<n then ζ(j) does not contain an extension of any member of ζ(i). In other words, ζ is admissible if ζ=z↾n for some z∈Xf and n∈ω.
Claim 1**.**
If ζ,ξ are admissible and dom(ζ)=dom(ξ)=n, then ζ and ξ have the same number of admissible extensions with domain n+1.
Proof of claim.
Given an admissible function ζ and some k≥dom(ζ), we say that s∈2[f(k)] is ζ-available if s does not extend any member of ζ(i) for any i<dom(ζ).
We prove, by induction on n (for all k simultaneously), that
(∗)
if dom(ζ)=n≤k, then the number of ζ-available vertices in 2[f(k)] is exactly (21+2n+11)2f(k).
The base case n=0 is trivially true, because if dom(ζ)=0 then every vertex in 2[f(k)] is ζ-available, and this is exactly 2f(k)=(21+20+11)2f(k) vertices. Suppose the claim is true for some m. Let ζ be an admissible function with domain m+1, and suppose k≥m+1. Note that each of the 2m+212f(m) vertices in ζ(m) has exactly 2f(k)−f(m) extensions in 2[f(k)], and that two different vertices from ζ(m) have no common extensions in 2[f(k)].
The ζ-available members of 2[f(k)] are exactly the (ζ↾m)-available vertices minus the extensions of members of ζ(m).
Thus there are exactly
[TABLE]
ζ-available vertices in 2[f(k)]. By induction, (∗) holds for all n≤k<ω.
Let us now show that (∗) implies the claim.
Let ζ be an admissible function with domain n.
If M=(21+2n+11)2f(n) (the number of ζ-available vertices in 2[f(n+1)]) and if N=2n+212f(n) (the number of vertices in any member of Dnf) then ζ has exactly (NM) admissible extensions ζ′ with domain n+1, because ζ′(n) can be any N-sized subset of the Mζ-available vertices in 2[f(n+1)]. This number depends only on n, so this proves the claim.
∎
If ζ is an admissible function, then define
[TABLE]
Using the previous claim, one can show that this function is finitely additive: i.e., if [[ζ1]],…,[[ζn]] are disjoint sets with ⋃i≤n[[ζi]]=[[ζ]], then μf([[ζ]])=∑i≤nμf([[ζi]]). Thus the equation above defines a measure μf on the semi-ring of all sets of the form [[ζ]], where ζ is an admissible function. As this semi-ring of sets is a basis for Xf, Carathéodory’s Extension Theorem asserts that μf extends uniquely to a σ-additive measure on all Borel subsets of Xf.
Note that the empty function ∅ is admissible, and is the only admissible function with domain [math]. It follows that that μf(Xf)=μf([[∅]])=11=1. Thus μf is a probability measure on Xf.
For any well-formed formulas of first-order logic φ(z), and ψ(z), define
[TABLE]
assuming that all these sets are measurable and, in the second equation, that P(ψ(z))=0.
In other words, if z is chosen from Xf randomly with respect to the probability measure μf, then P(φ(z)) is the probability that z satisfies φ(z), and P(φ(z)∣ψ(z)) is the probability that z satisfies φ(z), given that it satisfies ψ(z).
Given f∈B and z∈Xf, define Uz,nf=⋃{[s]⊆2ω:s∈z(n)} for each n∈ω, and define
[TABLE]
(In other words, if z is a “random” point of Xf, then Uz is the result of the randomized selection process described at the beginning of the proof.)
In keeping with our intended intuition for Xf, let us say that a point z∈Xfselects a point x∈2ω if x∈Uzf. We say that z selects xbefore stagen if x∈⋃i<nUz,if; we say that z selects xat stagen if x∈Uz,nf, and we say that z selects xafter stagen if x∈⋃i>nUz,if.
Given two distinct points x,y∈2ω, let
[TABLE]
Claim 2**.**
**
(1)
*For any x∈2ω,
P(z selects x)=21. ***
2. (2)
Let k∈ω and let x,y∈2ω with dif(x,y)≥f(k). Then
[TABLE]
3. (3)
Let k∈ω, let x1,…,xn∈2ω, and suppose that dif(xi,xj)<f(k) for all 1≤i,j≤n. Then
[TABLE]
Proof of claim.
Let k∈ω and let Ad(k) denote the set of admissible functions with domain k. To begin the proof, we show that if n<k and s∈2[f(n)], then
[TABLE]
To see this, let t∈2[f(n)] with t=s. Let dif(s,t)=min{i:s(i)=t(i)}, and let π be the permutation of 2<ω defined by setting π(r)(i)=r(i) for all i=dif(s,t), and otherwise for dif(s,t)=d we take
[TABLE]
(Roughly, π is the permutation of 2<ω obtained by swapping the two cones s↑={r∈2<ω:s≤r} and t↑={r∈2<ω:s≤r} in the natural way.)
Given a function ζ with domain k, define a function πζ by putting
[TABLE]
for all i<k.
By the definition of dif(s,t) and π, it is not hard to see that if m<n<k, then some member of ζ(n) extends some member of ζ(m) if and only if some member of πζ(n) extends some member of πζ(m).
Thus a function ζ with domain k is admissible if and only if πζ is also admissible. In other words, the mapping ζ↦πζ is a bijection from {ζ∈Ad(k):s∈ζ(n)} to {ζ∈Ad(k):t∈ζ(n)}, showing that
[TABLE]
As t was arbitrary, this shows that ∣{ζ∈Ad(k):s∈ζ(n)}∣ depends only on n, and not on s. In particular, we have
[TABLE]
for any s∈2f(n).
As exactly 2n+212f(n) members of 2[f(n)] appear in each set of the form ζ(n), ζ∈Ad(k), we also have
[TABLE]
Hence 2f(n)∣{ζ∈Ad(k):s∈ζ(n)}∣=2n+212f(n)∣Ad(k)∣
for any s∈2[f(n)], and dividing both sides by 2f(n) gives (†).
Next, we claim that for any x∈2ω and k∈ω,
[TABLE]
Let x∈2ω and k∈ω, and observe that if k>n then
[TABLE]
and this is a disjoint union.
Because μf([[ζ]])=∣Ad(k+1)∣1 for all ζ∈Ad(k+1),
[TABLE]
Combining this with (†) gives (‡).
Using (‡), let us now prove (1) and (2). For (1), note that
[TABLE]
and that this is a disjoint union, so
[TABLE]
For (2), note that if x,y∈2ω and f(k)≥dif(x,y), then
[TABLE]
Combining this with (1), we have
[TABLE]
To prove (3), first observe that
[TABLE]
For convenience, let α(z) denote the statement “z does not select any of the xi at stage k” and let β(z) denote the statement “z does not select any of the xi before stage k.”
According to the inequalities above, to prove (3) it suffices to show that
[TABLE]
For each i≤n, let si=xi↾(f(k)+1) and note that si=sj whenever i=j, because (by assumption) dif(xi,xj)<f(k) whenever i=j.
Given an admissible function ζ and some ℓ≥dom(ζ), let us say (as in the proof of Claim 1) that s∈2[f(ℓ)] is ζ-available if s does not extend any member of ζ(i) for any i<dom(ζ).
We showed in the proof of Claim 1 that
(∗)
if dom(ζ)=k≤ℓ, then the number of ζ-available vertices in 2[f(ℓ)] is exactly (21+2k+11)2f(ℓ).
If ζ is admissible and dom(ζ)=k, then define
[TABLE]
If ζ′∈Extk+1(ζ), then (by definition) ζ′(k) can be any 2k+212f(k)-sized subset of the (21+2k+11)2f(k)ζ-available vertices in 2[f(k)]. In other words, setting M=(21+2k+11)2f(k) and N=2k+212f(k) we have
[TABLE]
We now proceed to find an upper bound for the ratio
[TABLE]
Observe that
[TABLE]
Next, recall that if 0<x<1 then ln(1−x)<−x. (One can see this, for example, by using Taylor series: if 0<x<1 then we have ln(1−x)=−∑m=1∞mxm<−x.) Therefore
[TABLE]
and it follows that ln(∣Extk+1(ζ)∣∣Extk+1α(ζ)∣)<M−nN or, equivalently,
[TABLE]
Now observe that
[TABLE]
and putting this together with the previous inequality gives
[TABLE]
To finish the proof, let
[TABLE]
Observe that β(z) holds if and only if z↾k∈B; that is,
[TABLE]
and this is a disjoint union. It follows that
[TABLE]
Similarly, observe that α(z)∧β(z) holds if and only if z↾k∈B and z↾(k+1)∈Extk+1α; that is,
[TABLE]
and this is also a disjoint union. It follows that
[TABLE]
Finally, note that because of the way we have defined μf, if ζ∈B then μf([[ζ′]])=∣Extk+1(ζ)∣μf([[ζ]]) for all ζ′∈Extk+1(ζ), which implies
[TABLE]
for any ζ∈B.
Hence
[TABLE]
as claimed.
∎
Recall that two measure spaces (X,μ) and (Y,ν) are isomorphic if there is a bijection ϕ:X→Y such that, for every Z⊆X, ϕ(Z) is ν-measurable if and only if Z is μ-measurable, and if this is the case then μ(Z)=ν(ϕ(Z)). By [23, Theorem 17.41], the measure μf defined on Xf above is isomorphic to the Lebesgue measure on 2ω. From this and Lemma 4.1, it follows that there is a subset Zf⊆Xf with ∣Zf∣=non(N) such that Zf has outer μf-measure 1. (If ϕ:2ω→Xf is an isomorphism of the Lebesgue measure with μf, then we may simply take Zf=ϕ(Z), where Z⊆2ω has outer measure 1 and ∣Z∣=non(N).)
Let B be an unbounded family of functions ω→ω with ∣B∣=b. Without loss of generality, we may assume that every f∈B is an increasing function with f(0)≥2 (so that Xf and μf are well-defined, and have all the properties discussed above). For each f∈B, fix some Zf⊆Xf such that such that Zf has outer measure 1 with respect to μf and ∣Zf∣=non(N).
Let U={Uzf:f∈B and z∈Zf}, and observe that
[TABLE]
Thus, to finish the proof of the theorem, it suffices to show that every X∈[2ω]con is split by some U∈U.
Let X∈[2ω]con, and let p denote the (unique) limit point of X in 2ω. Replacing X with X∖{p} if necessary, we may (and do) assume that p∈/X.
For each i∈ω, let Ni denote the least natural number with the property that e−Ni/2i+2<2i1.
Given F⊆2ω, we say that the points of F are distinguished byℓ∈ω if dif(x,y)<ℓ for all x,y∈F.
Notice that if the points of F are distinguished by ℓ, then they are distinguished by any ℓ′>ℓ also.
Define a function gX:ω→ω as follows:
•
for each k∈ω, define gX(k) to be the least natural number such that at least N0+N1+⋯+Nk points of X are distinguished by gX(k).
Fix f∈B such that f(k)>gX(k) for infinitely many values of k.
Claim 3**.**
P\!\left(X\setminus U^{f}_{z}\text{\emph{ is infinite}}\ \Big{|}\ z\text{\emph{ does not select }}p\right)=1.
Proof of claim.
Let n∈ω, and let ε>0. Fix some k large enough that 2kn<ε, and let x1,x2,…,xn be points of X such that dif(xi,p)≥f(k) for all 1≤i≤n. (Recall that because p is a limit point of X, there are x∈X such that dif(x,p) is arbitrarily large.) Observe that
[TABLE]
(The first inequality follows from the definition of P(…) and the finite additivity of μf, the second follows from part (2) of Claim 2, and the third follows from our choice of k.)
It follows that
[TABLE]
which implies in particular that
[TABLE]
This is true for any ε>0, so
[TABLE]
This is true for every n∈ω, so
[TABLE]
as claimed.
∎
Notice that the proof of Claim 3 did not require us to use any particular properties of the function f; in fact, Claim 3 is true for any f:ω→ω for which Xf is defined. This is not the case for the next claim, which is only true for sufficiently fast-growing f.
Claim 4**.**
P(X∩Uzf is infinite)=1.
Proof of claim.
By our choice of f, there are infinitely many values of k such that at least N0+N1+⋯+Nk points of X are distinguished by f(k), where the Ni are defined as above, so that each Ni is big enough that e−Ni/2i+2<2i1. Let k0,k1,k2,… be an infinite, increasing sequence of such values of k.
By recursion, define an infinite sequence X0,X1,X2,… of finite subsets of X as follows: for each ℓ∈ω, choose Xℓ so that
•
∣Xℓ∣=Nkℓ,
•
all the points of Xℓ are distinguished by f(kℓ), and
•
if j<ℓ then Xj∩Xℓ=∅.
It is clear from our choice of the kℓ that such a set Xℓ always exists.
Let ε>0, and fix ℓ∈ω large enough that ∑j≥ℓ2kj1<ε. For each j≥ℓ, part (3) of Claim 2 states that
[TABLE]
It follows that
[TABLE]
Taking complements, we have
[TABLE]
Because the Xj are disjoint subsets of X, this implies
[TABLE]
and as ε was arbitrary, this proves the claim.
∎
From Claims 3 and 4, it follows that
[TABLE]
Observe that if some z∈Xf selects p, then Uzf∋p, which implies (because Uzf is open and p is the unique limit point of X) that Uzf contains all but finitely many points of X. Thus
[TABLE]
From part (1) of Claim 2, we also know that P(z does not select p)=1−P(z selects p)=21. Therefore
[TABLE]
or, in other words, {z:Uzf splits X} has μf-measure 21 in Xf. Because Zf has outer μf-measure 1, it follows that Zf∩{z:Uzf splits X}=∅. If z is any point of this intersection, then Uzf is a member of U that splits X. Thus every member of [2ω]con is split by some U∈U.
∎
Theorem 4.2 implies that s(R)=ℵ1 in the random real model, or a little more generally, in any model obtained by adding random reals to a model of CH. This implies that such models contain Efimov spaces of weight ℵ1. It is worth mentioning that this was known already for the random real model: it was proved by the second author and David Fremlin, using different methods, that st((P(N)/fin)V) is an Efimov space in the random real model [11].
5. Cichoń’s diagram
In the introduction, we claimed that for every cardinal κ appearing in Cichoń’s diagram, either κ is a (consistently strict) lower bound for s(R), or κ is a (consistently strict) upper bound for s(R), or else each of κ<s(R) and s(R)<κ is consistent.
Let us review our progress on this so far:
•
cov(M) and b are consistently strict lower bounds for s(R): That they are lower bounds for s(R) was proved in Theorems 3.1 and 3.2. They are consistently strict because b<cov(M)≤s(R) in the Cohen model, and cov(M)<b≤s(R) in the Laver model.
•
ℵ1, add(N), and add(M) are consistently strictly lower bounds for s(R): This follows from the previous bullet point, because each of these cardinals is bounded above by both cov(M) and b.
•
c and cof(N) are consistently strict upper bounds for s(R): We showed in Theorem 4.2 that s(R)≤max{b,non(N)}. Both b and non(N) are bounded above by cof(N) and c, so it follows that s(R)≤cof(N),c. These bounds are consistently strict because in the Miller model, ℵ1=max{b,non(N)}<cof(N)=c=ℵ2.
•
cov(N) and non(M) are incomparable with s(R), in the sense that both s(R)<cov(N),non(M) and s(R)>cov(N),non(M) are consistent. To see the first pair of inequalities, note that
[TABLE]
in the random model; as s(R)≤max{b,non(N)} by Theorem 4.2, it follows that s(R)<cov(N),non(M) in the random model. To see the second pair of inequalities, note that
[TABLE]
in the Cohen model; as cov(M)≤s(R) by Theorem 3.1, we have cov(N),non(M)<s(R) in the Cohen model.
This takes care of 9 of the 12 cardinals in Cichoń’s diagram: we have 5 consistently strict lower bounds, 2 consistently strict upper bounds, and 2 cardinals that are provably incomparable with s(R). The remaining 3 cardinals, cof(M), non(N), and d, are also incomparable with s(R). Here is what we know so far concerning these 3 cardinals:
•
s(R)<cof(M) is consistent: Recall that
b=non(N)<cof(M) in the random model.
As s(R)≤max{b,non(N)} by Theorem 4.2, it follows that s(R)<cof(M) in the random model.
•
s(R)<d is consistent: Recall that
b=non(N)<d in the Miller model.
As s(R)≤max{b,non(N)} by Theorem 4.2, it follows that s(R)<d in the Miller model.
•
non(N)<s(R) is consistent: Recall that non(N)<b in the Laver model.
As b≤s(R) by Theorem 3.2, it follows that non(N)<s(R) in the Laver model.
It remains to prove the consistency of s(R)<non(N) and the consistency of d,cof(M)<s(R).
Theorem 5.1**.**
It is consistent with ZFC that s(R)<non(N).
The proof strategy is to begin with a model of MA+¬CH, and then to force with a σ-centered partial order that will make s(R)=ℵ1 while preserving the value of non(N).
Lemma 5.2**.**
There is a σ-centered notion of forcing P that adds a countable collection U of open subsets of the Cantor space 2ω such that if X∈[2ω]con belongs to the ground model, then there is some U∈U that splits X.
Proof.
For this lemma we use (a slight variation of) a notion of forcing P introduced by Arnie Miller in [25]. Conditions in P are finite sequences of the form ⟨(Ci,Fi):i<m⟩, where each Ci is a clopen subset of 2ω and each Fi is a finite subset of 2ω∖Ci. A condition ⟨(Ci′,Fi′):i<n⟩ extends the condition ⟨(Ci,Fi):i<m⟩ if m≤n and for each i<m, Fi′⊇Fi and Ci′⊇Ci.
(In Miller’s terminology, this poset is called P(2ω).)
Intuitively, this forcing builds countably many open sets Ui, i<ω, and a condition ⟨(Ci,Fi):i<n⟩ constitutes a promise that Ci⊆Ui and that Fi∩Ui=∅ for each i<n.
Suppose G is a V-generic filter for P, and in V[G] define
[TABLE]
for each i<ω. We claim that U={Ui:i<ω} satisfies the conclusion of the theorem.
Let X∈[2ω]con, X∈V, and let x be the unique accumulation point of X. There is some p∈G such that for some i∈dom(p), p(i)=(Cip,Fip) and x∈Fip (because the set of all such p is clearly dense in P). We claim Ui splits X. To see this, define for each natural number n two subsets of P:
[TABLE]
Dn is dense below p, because for any p′≤p, if p′(i)=(Cip′,Fip′) then we may form q by extending Cip′ to include ≥n members of the infinite set X∖Fip′.
Likewise En is dense below p, because for any p′≤p, if p′(i)=(Cip′,Fip′) then (because the limit point x of X is not contained in the closed set Cip′) there are infinitely many points in X∖Cip′, and we may extend Fip′ to include ≥n of them. Thus G meets every Dn, from which it follows that Ui contains infinitely many points of X, and G meets every En, from which it follows that 2ω∖Ui contains infinitely many points of X. Thus Ui splits X.
∎
Lemma 5.3**.**
There is a σ-centered notion of forcing P that does not change the value of c and that forces s(R)=ℵ1.
Proof.
Let P be the length-ω1, finite support iteration of the notion of forcing described in Lemma 5.2. Let U=⋃α<ω1Uα, where Uα denotes the countable set of open subsets of 2ω added at stage α of the iteration. Note that ∣U∣=ℵ1. If X∈[2ω]con in the final model, then because X is countable, there is some α<ω1 such that X appears at stage α of the iteration, and then X is split by some U∈Uα+1. Thus in the final model, every X∈[2ω]con is split by some U∈U, and this shows that s(R)=ℵ1.
∎
Lemma 5.4**.**
Suppose V⊨MA and that P is a σ-centered notion of forcing in V. Then P does not lower the value of non(N).
Proof.
This fact has been observed before (e.g., it forms part of the proof Corollary 39 in [3]), but we do not have an exact reference and the proof is short, so we record it here.
Consider, in the extension, any infinite set A of reals with cardinality less than cV=non(N)V; our goal is to prove that A has measure zero.
A σ-centered forcing never adds random reals [1, Theorem 6.5.31],
so no a∈A is random over the ground model.
Thus, for each a∈A there is a measure-zero Borel set Na in the ground model such that the canonical extension N~a with the same Borel code contains a.
Because P has the countable chain condition, there is, in the ground model, a collection C of at most ∣A∣ Borel sets, each of measure zero, such that all of the Na’s are in C. Because the ground model satisfies MA and because ∣C∣<c, the ground model has a measure-zero Borel set N that includes all the sets from C and, in particular, all the Na’s.
For each a∈A, the fact that Na⊆N is preserved when we pass to the canonical extensions with the same Borel codes in the final model; that is, N~a⊆N~ in VP. In particular, A⊆N~. But N~ has measure zero, because it is the canonical extension of the null set N. Hence A has measure zero.
∎
Beginning with a model of MA+¬CH, force with the partial order P described in Lemma 5.3. By Lemmas 5.3 and 5.4, the resulting model will have s(R)=ℵ1 and non(N)=c>ℵ1.
∎
The cardinal characteristic sep was defined by Kamburelis and Węglorz in [22]. We do not record the definition of sep here (see [6] instead), but will say simply that sep is closely related to s(R), being a variant of s defined in terms of open subsets of 2ω, and that it is not difficult to show s(R)≤sep. We note that in general s(R)=sep because non(M)≤sep by [6, Theorem 1.1], whereas s(R)<non(M) in the random model by Theorem 4.2.
In [6, Section 2], Brendle proved the consistency of d=non(M)<sep. The model he uses is obtained by beginning with MA+¬CH and then performing a length-ω1, finite support iteration of a σ-centered notion of forcing D, defined below, that adds a dominating real. Our proof of Theorem 5.5 below uses a similar model. However, proving s(R)=c in this sort of model seems more difficult than proving sep=c, and several new ideas are required. The proof is self-contained insofar as we do not assume the reader is familiar with [6, Section 2].
Theorem 5.5**.**
It is consistent with ZFC that d=cof(M)<s(R).
Proof.
We begin the proof by defining a variant of the Hechler forcing, which we call D; it is equivalent to the notion of forcing used by Brendle in [6, Section 2].
Conditions in D are pairs of the form ⟨s,ϕ⟩, where
•
s∈ω<ω, and
•
ϕ is a function ω<ω→ω.
The ordering on D is given by declaring ⟨t,ψ⟩≤⟨s,ϕ⟩ if and only if
•
t⊇s,
•
ψ(r)≥ϕ(r) for all r∈ω<ω, and
•
t(j)≥ϕ(t↾j) for all j∈dom(t)∖dom(s).
If p=⟨s,ϕ⟩∈D, we write stem(p)=s.
Note that D is σ-centered, because any conditions ⟨s,ϕ1⟩,…,⟨s,ϕn⟩ in D with the same stem have a common extension with that stem, namely ⟨s,max{ϕ1,…,ϕn}⟩. Also note that forcing with D adds a dominating real: if G is V-generic for D, then ⋃{stem(p):p∈G} is a function ω→ω that is ≥∗ every member of (ωω)V.
Ultimately, the theorem will be proved by adding ℵ2 Cohen reals to a model of CH and then iterating D in ω1 steps, with finite support. (In fact, iterating D over a model of MA+¬CH or even just MActbl, which is equivalent to the equality cov(M)=c, would suffice. This is the model Brendle uses in [6, Section 2], but the present proof is easier if we use the two-step forcing described above.) To begin the proof, though, let us just consider posets of the form 2<ω∗Dα, where
•
2<ω denotes, as above, the tree of all finite [math]-1 sequences, partially ordered by extension, which is equivalent to the notion of forcing Fn(ω,2) for adding one Cohen real.
•
Dα denotes the length-α, finite support iteration of D, where α≤ω1.
For each α≤ω1, let Pα=2<ω∗Dα. If s∈2<ω and p is a 2<ω-name such that s⊩p∈Dα, then we write s∗p for the condition ⟨s,p⟩∈Pα. If g∈2ω is 2<ω-generic over V with g⊇s, then valg(p) denotes the Dα-name obtained from p in V[g].
As usual, a name m˙ of a natural number is a niceP-name (for some notion of forcing P) if it has the form m˙={(a,ka):a∈A}, where A is a maximal antichain in P and each ka is a natural number.
For any s∈2<ω and j∈ω, define s†j so that dom(s†j)=dom(s) and
[TABLE]
Similarly, if s∈2ω then s†j denotes the function with domain ω given by the above equation. Notice that if g∈2ω is 2<ω-generic over V, then so is g†j for all j∈ω.
Let us say that a condition s∗p∈Pα is tidy if
•
there is some finite F⊆α such that s⊩supp(p)=F (i.e., s decides the support of p),
•
for every β∈F, if p(β)=⟨t˙,ϕ˙⟩ then there is some t∈ω<ω such that s∗(p↾β)⊩t˙=tˇ (i.e., s decides the stems of the p(β)), and
•
\mathbbm12<ω⊩p∈Dα (which is stronger than the requirement s⊩p∈Dα, which is necessary to have s∗p∈Pα at all).
Notice that every condition in Pα has a tidy extension. (This is proved by induction on α as follows. The base case is trivial.
If α is a limit ordinal, then given s∗p∈Pα first extend to a condition s′∗p′ such that s′ decides supp(p′), then note that (because Dα uses finite supports) if s′ decides supp(p′) then s′∗p′∈Pβ for some β<α and therefore has a tidy extension by the induction hypothesis.
For the successor case, fix s∗p∈Pα+1. First extend s∗(p↾α) to some s′∗p^∈Pα that decides stem(p(α)), then (using the induction hypothesis) extend s′∗p^∈Pα to a tidy condition s′′∗q^. Then s′′∗(q^⌢p^(α)) is a tidy extension of s∗p.)
For each j∈ω, the function s↦s†j is an automorphism of the forcing notion 2<ω. The function s∗p↦s†j∗p is not an automorphism of Pα, even if we insist that \mathbbm12<ω⊩p∈Dα in order to guarantee that s†j∗p∈Pα. The following claim states that, nonetheless, this function is “almost” an automorphism of Pα. This claim is the main tool used for proving s(R)=ℵ1 in our forcing extension below.
Claim 1**.**
Let α≤ω1, and let s∗p∈Pα be a tidy condition. Then there is some s∗q≤s∗p such that
[TABLE]
for all 2<ω-generic g extending s and for all j∈ω.
When the conclusion of this claim holds, we say that s∗qsymmetrically extendss∗p.
Proof of claim.
The proof is by induction on α. We will prove an ostensibly stronger claim in order to have a sufficiently strong induction hypothesis:
Revised Claim**.**
Let α≤ω1, and let s∗p∈Pα be tidy. Then there is some s∗q≤s∗p such that
for any nice Pα-name m˙ for a natural number, there is a nice Pα-name M˙ for a natural number such that for any 2<ω-generic g extending s and any j∈ω,
(1)
valg†j(q)≤valg(p), and
2. (2)
s∗p⊩valg†j(M˙)≥valg(m˙).
When (2) holds, we say that M˙symmetrically dominatesm˙ at s∗q.
For the base case α=0, we have P0=2<ω. In this case (1) is trivially true and we must show only the second claim.
Let m˙={(aℓ,kℓ):ℓ∈ω} be a nice 2<ω-name for a natural number. For now, we work only in the ground model and construct M˙ as follows.
To begin, we claim that for each r∈2<ω and j∈ω, there is some t∈2<ω such that t⊇r and t†j⊇aℓ for some ℓ∈ω. This is because {aℓ†j:ℓ∈ω} is a maximal antichain in 2<ω; in particular, given r∈2<ω there is always some t∈2<ω such that t⊇r and t⊇aℓ†j for some ℓ∈ω. As aℓ†j⊆t if and only if aℓ⊆t†j, this t is as required.
Next, we claim that for any r∈2<ω, there is some t⊇r and M∈ω such that
[TABLE]
To see this, fix r∈2<ω. Choose t0∈2<ω such that t0⊇r and s0⊇aℓ0 for some ℓ0∈ω. (Note that some such t0 and ℓ0 exist, because {aℓ:ℓ∈ω} is a maximal antichain in 2<ω.) Let N=dom(t0). Using recursion, choose an ascending sequence t0⊆t1⊆⋯⊆tN of members of 2<ω such that for each j<N there is some ℓj+1∈ω with tj+1⊇aℓj+1†j. (Note that some such tj+1 and ℓj+1 always exist, by the previous paragraph.) Let t=tN and let
[TABLE]
To see that t and M are as required, let j∈ω. If j<N, then
[TABLE]
If on the other hand j≥N, then
[TABLE]
(The equality t0†j=t0 follows from the fact that j≥N≥dom(t0).) Either way, (∗) holds.
By the previous paragraph, there is a maximal antichain {ti:i∈ω} of members of 2<ω, along with integers Mi, i∈ω, such that each pair ti,Mi satisfies (∗). Let
[TABLE]
It is clear that M˙ is a nice name. To see that M˙ symmetrically dominates m˙ at s, suppose g⊇s is a 2<ω-generic real and fix j∈ω. Because {ti:i∈ω} is a maximal antichain in the ground model, there is some i∈ω such that ti⊆g†j or, equivalently, ti†j⊆g. But ti†j⊩m˙≤Mi and ti⊩M˙=Mi. This implies valg†j(M˙)=Mi≥valg(m˙).
As j∈ω was arbitrary, (2) holds. (Notice that we have actually proved something a little stronger than (2): that M˙ symmetrically dominates m˙ at ∅.)
Now fix α<ω1 and suppose the (revised) claim is true for all β<α; let us prove it is also true for α.
For (1), if α is a limit ordinal then there is nothing to prove: because Dα is a finite support iteration, s∗p∈Dα implies s∗p∈Dβ already for some β<α, and if s∗q∈Pβ is such that valg†j(q)≤Dβvalg(p) (which must hold for some q by the inductive hypothesis) then valg†j(q)≤Dαvalg(p) also.
Suppose α=β+1 is a successor ordinal, and let us prove that (1) holds for α. Fix s∗p∈Pα.
Then s∗(p↾β)⊩p(β)∈D, and in particular, we may find some σ∈ω<ω and a Pβ-name ϕ˙ such that
s∗(p↾β)⊩p(β)=⟨σ,ϕ˙⟩.
By the inductive hypothesis, there is some q^ such that s⊩q^∈Dβ, s∗q^≤s∗(p↾β), and both (1) and (2) hold for q^ and p.
For each t∈ω<ω, let m˙t be a nice Pβ-name for a natural number such that s∗q^⊩ϕ˙(t)=m˙t. Using the inductive hypothesis (2): for each t∈ω<ω, let M˙t be a nice Pβ-name for a natural number symmetrically dominating m˙t at s∗(p↾β). Let ψ˙ be a Pβ-name for the function t↦M˙t. Then define q∈Pβ+1 by setting q↾β=q^ and q(β)=⟨sˇ,ψ˙⟩. It is clear that this really does define a condition in Pα (because s∗(q↾β)∈Pβ and s∗(q↾β)⊩q(β)∈D). Furthermore, s∗q symmetrically extends s∗p, because if j∈ω then valg†j(q↾β)=valg†j(q^)≤Pβvalg(p↾β) by our choice of q^, and s∗(q↾β)=s∗q^⊩q(β)=⟨sˇ,ψ˙⟩≤⟨sˇ,ϕ˙⟩=p(β).
Let α≤ω1 and suppose that (1) and (2) hold for every β<α. By the argument above, this implies that (1) holds for α. To finish our inductive argument, we must show that (2) holds for α as well.
Let s∗p∈Pα and let m˙={(aℓ0∗aℓ1,kℓ):ℓ∈ω} be a nice Pα-name for a natural number. (We may index our antichain by ω because Pα has the ccc.)
For each ℓ∈ω, if s∗p≤aℓ0∗aℓ1 then (because (1) holds for α) there is some s∗q≤s∗p such that s∗q symmetrically extends s∗p. It follows that, for each ℓ∈ω, there is a maximal antichain Aℓ of conditions below aℓ0∗aℓ1, each of which symmetrically extends aℓ0∗aℓ1. Define
m˙′={(a,kℓ):a∈Aℓ}.
It is clear that \mathbbm1Pα⊩m˙=m˙′. But m˙′ has the property that if (b0∗b1,kℓ)∈m˙′ (where b0∗b1∈Aℓ), then
for any 2<ω-generic g extending b0 and any j∈ω,
valg†j(b1)≤valg(aℓ1).
In particular, if valg(a)⊩m˙=k, then this means that there is some s∈2<ω,s⊆g such that s∗a⊩m˙=k; this implies that for any Pα-generic g∗G, if s∗a∈g∗G then b0∗b1∈g∗G for some b0∗b1∈Aℓ, where ℓ is such that kℓ=k; but then by the previous sentence,
valg†j(b1)≤valg(aℓ1)⊩m˙=m˙′=kℓ
for any j∈ω.
Thus m˙′ has the property that
[TABLE]
By replacing m˙ with m˙′ if necessary, we assume in what follows that m˙ has this property.
Now let us work only in the ground model and construct M˙ as follows.
To begin, we claim that for each r∗r′∈2<ω∗Dα and j∈ω, there is some t∗t′∈Pα and some ℓ∈ω such that t∗t′≤r∗r′ and t†j∗t′≤aℓ0∗aℓ1 for all j∈ω.
To see this, note that {aℓ0∗aℓ1:ℓ∈ω} is a maximal antichain, so given r∗r′ we may extend to some q∗q′≤r∗r′ with q∗q′≤aℓ0∗aℓ1 for some ℓ∈ω; then because (1) holds at α, we may extend further to some t∗t′≤q∗q′ such that if g is any 2<ω-generic real with g⊇t⊇q then valg†j(t′)≤valg(q′)≤valg(aℓ1), for all j∈ω. But this means that
t†j∗t′≤aℓ0∗aℓ1 for all j∈ω, so that t∗t′ is as claimed.
Setting M=kℓ (where ℓ is as in the previous paragraph), it follows that for any r∗r′∈Pα, there is some t∗t′⊇r∗r′ and some M∈ω such that
[TABLE]
Thus there is a maximal antichain {ti∗ti′:i∈ω} of members of Pα, along with integers Mi, i∈ω, such that each pair ti∗ti′,Mi satisfies (∗). Let
[TABLE]
It is clear that M˙ is a nice name. To see that M˙ symmetrically dominates m˙ at s∗p, suppose g⊇s is a 2<ω-generic real. Because {ti:i∈ω} is a maximal antichain for 2<ω (otherwise, {ti∗ti′:i∈ω} could not be a maximal antichain for Pα), there is some i∈ω such that ti⊆g or, equivalently, ti†j⊆g†j for all j∈ω. But for all j∈ω, ti†j∗t′⊩m˙≤Mi and ti∗t′⊩M˙=Mi.
This implies valg(M˙)≥valg†j(m˙) for every j∈ω.
∎
Let P=Fn(ω2,2)∗Dω1. To prove the theorem, we will show that if c≤ℵ2 then 1P⊩ℵ1=d=cof(M)<s(R)=c=ℵ2.
Claim 2**.**
Suppose G is P-generic over V. Then V[G]⊨d=cof(M)=ℵ1.
Proof of claim.
It suffices to show that forcing with Dω1 produces a model in which d=cof(M)=ℵ1 (because forcing with P=Fn(ω2,2)∗Dω1 can be viewed as first forcing with Fn(ω2,2) and afterward forcing with Dω1).
Forcing with Dω1 makes d=ℵ1 because dominating reals are added at every stage of the iteration. Forcing with Dω1 makes non(M)=ℵ1 because our use of finite supports guarantees that Cohen reals are added at every limit stage of cofinality ω. (In fact, Cohen reals are added at every stage of the iteration, because forcing with D adds a Cohen real. Specifically, if d:ω→ω is the dominating real added by D, then the function c:ω→2 defined by setting c(n)=0 if and only if c(n) is even is 2<ω-generic.) Thus d=non(M)=ℵ1 after forcing with Dω1. By a result of Fremlin (see [1, Theorem 2.2.11]), cof(M)=max{d,non(M)}, and so it follows that cof(M)=ℵ1 after forcing with Dω1.
∎
Claim 3**.**
Suppose that V⊨c≤ℵ2 and that G is P-generic over V. Then V[G]⊨s(R)=ℵ2.
Proof of claim.
Let U be a collection of open subsets of 2ω in V[G], with ∣U∣≤ℵ1. To prove the claim, it suffices to show that there is some X∈[2ω]∞ not split by any U∈U.
For each U∈U, let U˙ be a nice P-name for U. Using the fact that P has the countable chain condition, there is some collection N of nice P-names with N∈V such that {U˙:U∈U}⊆N and ∣N∣=ℵ0⋅∣U∣≤ℵ1.
Each nice P-name for an open subset of 2ω has countable support; i.e., it is really a Fn(S,2)∗Dω1-name for some countable S⊆ω2. It follows that there is some λ<ω2 such that every V˙∈N is really a Fn(λ,2)∗Dω1-name. In particular, there is a countable A⊆ω2 such that every V˙∈N is a nice Fn(ω2∖A,2)∗Dω1-name.
Observe that we may factor P by breaking the Cohen part into two pieces along A: P=Fn(ω2∖A,2)∗Fn(A,2)∗Dω1.
Let G be P-generic over V. Let G0 be the restriction of G to Fn(ω2∖A,2), and let V1=V[G0]. Note that V[G] can be viewed as a forcing extension of V1, using the forcing notion 2<ω∗Dω1. Fix h and H such that h is 2<ω-generic over V1, H is Dω1-generic over V1[h], and V[G]=V1[h][H].
We claim that in the final model V[G], no U∈U splits the set X={h†j:j∈ω}∈[2ω]con.
To prove this, we will work in V1 and show that every V˙∈N is forced (in V1) not to split X.
Let g˙ denote the standard V1-name for the 2<ω-generic real, so that every s∈2<ω forces s⊆g˙. Let X˙ be the natural V1-name for the set X, so that \mathbbm12<ω⊩X˙={(g˙)†j:j∈ω} and every s∈2<ω forces s†j⊆g˙†j.
Fix V˙∈N and suppose that s∗p⊩g˙∈/V˙. (Note that if s∗p⊩g˙∈/V˙, then s∗p⊩ “V˙ does not split X˙” because V˙ names an open set, and X˙ names a convergent sequence.)
By Claim 1, there is some s∗q∈2<ω∗Dω1 that symmetrically extends s∗p.
Suppose g is any 2<ω-generic filter containing s (possibly, but not necessarily, equal to h). It follows that g†j is also a 2<ω-generic filter extending s†j for every j∈ω. If j≥∣s∣, then g and g†j are both generic filters extending s=s†j.
Because s∗q≤s∗p, we have s∗q⊩g˙∈/V˙. As g⊇s and g is a 2<ω-generic filter extending s, this implies valg(q)⊩g=valg(g˙)∈/valg(V˙) in V1[g]. If j≥∣s∣, then g†j is also a 2<ω-generic filter extending s, and so as before,
[TABLE]
in V1[g†j].
Now, V1[g†j]=V1[g] (because g and g†j are definable from one another) and valg†j(V˙)=valg(V˙) (because the support of V˙ is disjoint from Fn(A,2)).
Making these substitutions, we see that valg†j(q)⊩g†j∈/valg(V˙) in V1[g]. As this holds for any 2<ω-generic g extending s, we conclude that s∗q⊩g˙†j∈/V˙.
As this is true for any j≥∣s∣, we have
[TABLE]
Thus s∗q⊩ “V˙ does not split X˙."
Thus we see that if s∗p⊩ “g˙∈/V˙” then some extension s∗q≤s∗p forces that V˙ does not split X˙. Thus no s∗p∈2<ω∗Dω1 can force both “g˙∈/V˙” and “V˙ splits X˙”. On the other hand, if s∗p were to force “V˙ splits X˙”, then it would have to force also that g˙∈/V˙, because V˙ names an open set, and \mathbbm12<ω⊩X˙ converges to g˙. Thus there is no s∗p∈2<ω∗Dω1 forcing that V˙ splits X˙.
Consequently, valG(V˙) does not split X in V1[h][H]=V[G].
This is true for any V˙∈N, so it follows that in V[G], no member of U splits X. Because U was an arbitrary ℵ1-sized collection of open subsets of 2ω, V[G]⊨s(R)>ℵ1. A standard argument shows that V[G]⊨c=ℵ2, so V[G]⊨s(R)=ℵ2 as claimed.
∎
The theorem follows from the previous two claims: beginning with a model of c≤ℵ2, forcing with P produces a model in which d=cof(M)<s(R).
∎
6. Open questions, and the status of Efimov’s problem
As mentioned in the introduction (and proved again in this paper), it is consistent that Efimov spaces exist. Therefore Efimov’s problem now takes the form: Is it consistent that there are no Efimov spaces?
Our work here does not “move the needle” on this problem, in the sense that this paper does not show Efimov spaces to exist in any models of ZFC where they were not proved to exist already. The reason is that the second author proved in [10] that if s=cof(sℵ0,⊆) and 2s<2c, then there is an Efimov space. Recently, however, he has realized that the proof in [10] does not require the full strength of this hypothesis: it is enough that s≤κ<c for some cardinal κ such that κ=cf(κℵ0,⊆).
In other words, [10] shows that one may weaken the hypothesis of Theorem 2.9 by replacing “s(R)≤κ” with “s≤κ,” but at the cost of weakening the conclusion by replacing “z≤κ” with “there is an Efimov space."
The Efimov space constructed in [10] has weight c, so the construction there gives us no information about z. Thus if one is only interested in the existence of Efimov spaces, (s)he can safely ignore our paper. If one is also interested in what properties they can have, such as having small weight, then Theorem 2.9 has something to say.
While the Efimov spaces in [10] have weight c, they are “small” in another interesting way: they have character s, which means that each point has a local basis of size ≤s. While the weight of an Efimov space is always bounded below by s, we know of no such bound on the character of an Efimov space.
Question 6.1**.**
Is it consistent that an Efimov space has character <s?
With Shelah, the second author also proved that b=c implies the existence of an Efimov space [12]. Thus the status of Efimov’s problem can be summed up as follows: if there is a model of ZFC without Efimov spaces, then in that model either b<s=c, or else b<c≥s≥ℵω and there are inner models containing large cardinals.
It would be interesting to determine whether the assumption on cofinalities in Theorem 2.9 can be dropped:
Question 6.2**.**
Is it consistent (relative to large cardinals) that s(R)<z?
Another question relevant to the hypothesis of Theorem 2.9 is also an interesting combinatorial question in its own right:
Question 6.3**.**
Is it consistent that cof(s(R))=ω?
We have proved three lower bounds for s(R), namely s, non(M), and b. None of these three lower bounds can have countable cofinality. However, a different argument is required to show this for each of these three cardinals, and none of these three arguments readily generalizes to say anything about the cofinality of s(R). Note that it is easy to make s(R) singular: adding ℵω1 Cohen reals to a model of CH, we obtain a model with cov(M)=ℵω1=c, which implies s(R)=ℵω1.
While we have determined completely the place of s(R) among the cardinals in Cichoń’s diagram, the same cannot be said for z. A great deal toward this goal can be deduced from the theorems above (although we leave such deductions to the reader), but a few questions remain. In our view, the most interesting of these is:
Question 6.4**.**
Is it consistent that non(N)<z?
If one is to avoid blowing the continuum up past ℵω, then z≤s(R), in which case non(N)<z implies non(N)<s(R)≤max{b,non(N)}=b. Thus a positive answer to Question 6.4 (if indeed the answer is positive) will most likely come from a model with non(N)<b.
The Laver model has non(N)<b, but will not work because, as mentioned in Section 3, the second author has shown that z=ℵ1 in the Laver model. Another natural candidate is the model obtained by adding ℵ1 random reals to a model of MA+¬CH.
Question 6.5**.**
What is the value of z in a model obtained by adding ℵ1 random reals to a model of MA+¬CH?
By “adding ℵ1 random reals” we mean forcing with the product measure algebra on 2ℵ1. If instead one were to add the random reals in a length-ω1 finite support iteration, then this forces z≤s(R)≤max{b,non(N)}=ℵ1 (with any ground model). In other words, adding the random reals iteratively adds a small Efimov space, even where none was present before. But it is not clear whether adding the random reals simultaneously will do so. Adding ℵ1 random reals to a model of b=ℵ1 (either simultaneously or by iteration) will once again add small Efimov spaces, because it forces max{b,non(N)}=ℵ1. But it is not clear whether this happens when b>ℵ1 in the ground model.
Bibliography28
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] T. Bartoszyński and H. Judah, Set Theory: On the Structure of the Real Line , A K Peters (1995).
2[2] A. Blass, “Combinatorial cardinal characteristics of the continuum,” in Handbook of Set Theory, M. Foreman and A. Kanamori eds., Springer-Verlag (2010), pp. 395–489.
3[3] A. Blass, J. Brendle, W. Brian, M. Hardy, J. D. Hamkins, and P. Larson, “The rearrangement number,” to appear in Transactions of the American Mathematical Society .
4[4] A. Blass and S. Shelah, “Ultrafilters with small generating sets,” Israel Journal of Mathematics 65 (1984), pp. 259–271.
5[5] D. Booth, “A Boolean view of sequential compactness,” Fundamenta Mathematicae 85 (1974), pp. 99–102.
6[6] J. Brendle, “Around splitting and reaping," Comment. Math. Univ. Carolin. 39 (1998), pp. 269–279.
7[7] A. J. Dodd and R. B. Jensen, “The covering lemma for L [ U ] L delimited-[] 𝑈 \mathrm{L}[U] ,” Annals of Mathematical Logic 22 (1982), pp. 127–135.
8[8] E. K. van Douwen, “The integers and topology,” in Handbook of Set-Theoretic Topology , K. Kunen and J. E. Vaughan, eds., North-Holland, Amsterdam (1984), pp. 111–167.