Partitioning products of \({\mathcal P} (\omega)/\text{fin}\) (Q1816560): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.2140/pjm.1996.176.249 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2140/pjm.1996.176.249 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1574847331 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.2140/PJM.1996.176.249 / rank
 
Normal rank

Latest revision as of 09:50, 16 December 2024

scientific article
Language Label Description Also known as
English
Partitioning products of \({\mathcal P} (\omega)/\text{fin}\)
scientific article

    Statements

    Partitioning products of \({\mathcal P} (\omega)/\text{fin}\) (English)
    0 references
    15 December 1996
    0 references
    We generalize the cardinal invariant \({\mathfrak a}\) to products of \({\mathcal P} (\omega)/\text{fin}\) and then sharpen the well-known inequality \({\mathfrak b} \leq {\mathfrak a}\) by proving \({\mathfrak b} \leq {\mathfrak a} (\lambda)\) for every \(\lambda \leq \omega\). Here \({\mathfrak a} (n)\), for \(n< \omega\), is the least size of an infinite partition of \(({\mathcal P} (\omega)/\text{fin})^n\), \({\mathfrak a} (\omega)\) is the least size of an uncountable partition of \(({\mathcal P} (\omega)/ \text{fin})^\omega\), and \({\mathfrak b}\) is the least size of an unbounded family of functions from \(\omega\) to \(\omega\) ordered by eventual dominance. We also prove the consistency of \({\mathfrak b}< {\mathfrak a} (n)\) for every \(n< \omega\).
    0 references
    Boolean algebra
    0 references
    forcing
    0 references
    cardinal invariant
    0 references
    partition
    0 references
    0 references
    0 references

    Identifiers