Colouring and non-productivity of \(\aleph_ 2\)-c.c (Q678760): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: math/9609218 / rank
 
Normal rank

Revision as of 16:57, 18 April 2024

scientific article
Language Label Description Also known as
English
Colouring and non-productivity of \(\aleph_ 2\)-c.c
scientific article

    Statements

    Colouring and non-productivity of \(\aleph_ 2\)-c.c (English)
    0 references
    0 references
    3 September 1997
    0 references
    For cardinals \(\lambda,\mu,\theta,\sigma\) the symbol \(\text{Pr}_1(\lambda,\mu,\theta,\sigma)\) means that there exists a symmetric function \(d\colon\lambda\times\lambda\to \theta\) such that for each sequence \((u_{\alpha})_{\alpha<\mu}\) of pairwise disjoint subsets of \(\lambda\) of size less than \(\sigma\) and for every \(\gamma<\theta\) there are \(\alpha<\beta\) such that \(d[u_{\alpha}\times u_{\beta}]=\{\gamma\}\). The main result of the paper is that \(\text{Pr}_1(\aleph_2,\aleph_2,\aleph_2,\aleph_0)\) holds. Moreover, the statement \(\text{Pr}_1(\lambda^{+2},\lambda^{+2},\lambda^{+2},\lambda)\) is proved for any regular cardinal \(\lambda\).
    0 references
    0 references
    0 references
    0 references
    0 references
    colouring
    0 references
    negative partition relation
    0 references
    non-productivity
    0 references
    club guessing
    0 references
    0 references