No label defined (Q3708010)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3933058
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3933058

      Statements

      0 references
      1984
      0 references
      dominating sets
      0 references
      unbounded sets
      0 references
      splitting sets
      0 references
      minimal cardinalities
      0 references
      maximal almost disjoint subset
      0 references
      ZFC
      0 references
      forcing
      0 references
      [For the entire collection see Zbl 0544.00006.] A subset \({\mathcal S}\) of \(^{\omega}\omega\) is said to be dominating [splitting] if for all \(g\in^{\omega}\omega\) there is \(f\in {\mathcal S}\) such that \(g<^*f\) \([f\nless^*g]\). (The notation \(f<^*g\) means \(| \{n<\omega:\) \(f(n)\geq g(n)\}| <\omega.)\) A subset \({\mathcal P}\) of \([\omega]^{\omega}\) is said to be splitting if for all \(A\in [\omega]^{\omega}\) there exists \(X\in {\mathcal P}\) such that \(| A\cap X| =| A\setminus X| =\omega\). The symbols \({\mathfrak d}\), \({\mathfrak b}\) and \({\mathfrak s}\) denote, respectively, the minimal cardinalities of a dominating, an unbounded and a splitting set; and \({\mathfrak a}\) is the minimal cardinality of a maximal almost disjoint subset of \([\omega]^{\omega}.\) It is not difficult to prove in ZFC that \(\aleph_ 1\leq {\mathfrak s}\wedge {\mathfrak b}\leq {\mathfrak s}\vee {\mathfrak b}\leq {\mathfrak d}\leq {\mathfrak d}\vee {\mathfrak a}\leq {\mathfrak c}=2^{\aleph_ 0}\), and \({\mathfrak b}\leq {\mathfrak a}.\) In the present article, extending results and responding to questions of E. van Douwen, B. Balcar, P. Simon, P. Nyikos, E. Miller and others, the author shows that each of the following is consistent with ZFC: (1) \(\aleph_ 1={\mathfrak b}<{\mathfrak s}={\mathfrak a}={\mathfrak c}=\aleph_ 2\); (2) \(\aleph_ 1={\mathfrak s}<{\mathfrak b}={\mathfrak c}=\aleph_ 2\); (3) \(\aleph_ 1<{\mathfrak s}={\mathfrak b}={\mathfrak c}=\aleph_ 2\); in each of the models constructed one has in addition \(2^{\aleph_ 1}=\aleph_ 2.\) The required notions of forcing are described in considerable detail.
      0 references

      Identifiers