Groupwise dense families (Q5931216)

From MaRDI portal
scientific article; zbMATH DE number 1590718
Language Label Description Also known as
English
Groupwise dense families
scientific article; zbMATH DE number 1590718

    Statements

    Groupwise dense families (English)
    0 references
    0 references
    0 references
    11 March 2002
    0 references
    A family \({\mathcal G} \subseteq [\omega]^\omega\) is groupwise dense if (i) whenever \(X \in {\mathcal G}\) and \(Y \in [\omega]^\omega\) is almost contained in \(X\), then \(Y \in {\mathcal G}\) and (ii) for every partiton of \(\omega\) into finite intervals there exists an infinite sub-collection of intervals whose union belongs to \({\mathcal G}\). The groupwise density number \({\mathfrak g}\) is the smallest number of groupwise families with empty intersection. The ultrafilter number \({\mathfrak u}\) is the size of the smallest ultrafilter base on \(\omega\). The statement \({\mathfrak u} < {\mathfrak g}\), first shown to be consistent with ZFC by \textit{A. Blass} and \textit{C. Laflamme} [J. Symb. Logic 54, 50-56 (1989; Zbl 0673.03038)] using two models of \textit{A. Blass} and \textit{S. Shelah} [Ann. Pure Appl. Logic 33, 213-243 (1987; Zbl 0634.03047) and Notre Dame J. Formal Logic 30, 530-538 (1989; Zbl 0702.03030)], is known to have strong consequences on both the values of other cardinal characteristics of the continuum and on the structure of (ultra)filters on \(\omega\). The filter dichotomy principle (FD) says that for any non-feeble (= non-meager) filter \({\mathcal F}\) on \(\omega\) there is a finite-to-one function \(f\) such that \(f( {\mathcal F})\) is an ultrafilter. A subset \({\mathcal I}\) of the family of increasing functions \(\omega^{\uparrow \omega}\) from \(\omega\) to \(\omega\) is called an ideal if it is closed downward and closed under pointwise maxima. The collection of ideals is preordered by \({\mathcal I} \leq {\mathcal J}\) if there is \(r \in \omega^{\uparrow \omega}\) such that for every \(f \in {\mathcal I}\) there is \(g \in {\mathcal J}\) with \(f(n) \leq g(r(n))\) for almost all \(n\). Ideals \({\mathcal I}\) and \({\mathcal J}\) are equivalent if both \({\mathcal I} \leq {\mathcal J}\) and \({\mathcal J} \leq {\mathcal I}\) hold. Blass and Laflamme proved that \({\mathfrak u} < {\mathfrak g}\) implies there are four equivalence classes of ideals (4I), and that 4I implies FD. By a detailed analysis of groupwise dense families involving various relatives of \({\mathfrak g}\), the author proves that 4I and FD are in fact equivalent and obtains several related results. Using cofinalities of ultraproducts, the author also shows that \({\mathfrak s } \leq \text{cf} ({\mathfrak d})\) where \({\mathfrak s}\) is the splitting number and \({\mathfrak d}\), the dominating number, thus improving the well-known \({\mathfrak s} \leq {\mathfrak d}\).
    0 references
    0 references
    cardinal characteristics of the continuum
    0 references
    groupwise dense families
    0 references
    groupwise density number
    0 references
    ultrafilter number
    0 references
    splitting number
    0 references
    dominating number
    0 references
    filter dichotomy principle
    0 references
    equivalence classes of ideals
    0 references
    cofinalities
    0 references
    0 references