Mob families and mad families (Q1128180)

From MaRDI portal
Revision as of 18:43, 21 March 2024 by Openalex240321050300 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Mob families and mad families
scientific article

    Statements

    Mob families and mad families (English)
    0 references
    0 references
    0 references
    11 January 1999
    0 references
    The standard example of an almost disjoint family is the collection of branches \(b\) of \(T\) a countable splitting tree. For this review we fix \(T = \omega^{<\omega}\). The cardinal invariant \(\mathfrak a\) is the smallest cardinality of a maximal almost disjoint family on a countable set. A set \(A \subset T\) if called \textit{off-branch} if \(A \cap b\) is finite for every \(b\) is a branch of \(T\). One can then talk about almost disjoint families of off-branch sets, and \(\mathfrak o\) is the smallest cardinality of one of those. Answering a question of Leathrum, this paper shows the consistency of \(\mathfrak o < \mathfrak d =\) the dominating number. Answering a question implicit in work of Shelah, this paper shows the consistency of the unbounding number \(\mathfrak b\) \(< \mathfrak a\) with \(\mathfrak c > \omega_2\). Both proofs proceed by adding sets via forcings that preserve unbounded sets in the ground model.
    0 references
    0 references
    0 references
    0 references
    0 references
    almost disjoint family
    0 references
    countable splitting tree
    0 references
    off-branch sets
    0 references
    consistency
    0 references
    dominating number
    0 references
    unbounding number
    0 references
    0 references