Splitting squares (Q926397)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Splitting squares
scientific article

    Statements

    Splitting squares (English)
    0 references
    0 references
    27 May 2008
    0 references
    A set \(A\subseteq2^\omega\) is a splitting family if for every \(a\in[\omega]^\omega\) there exists \(x\in A\) such that \(\exists^\infty n\in a\) \(x(n)=0\) and \(\exists^\infty n\in a\) \(x(n)=1\), i.e., \(x\) splits \(a\). The set \(A\) is called countably splitting, if for every countable set \(F\subseteq[\omega]^\omega\) we can find \(x\in A\) which splits every element of \(F\). The author proves that for every Borel function \(f:[2^\omega]^n\to2^\omega\) there exists a closed countably splitting family \(A\) such that \(f\restriction[A]^n\) omits a perfect set of values in \(2^\omega\). This result answers in the negative a question of J. Zapletal, and it is somewhat stronger than the question requires.
    0 references
    coutably splitting family
    0 references
    partition calculus
    0 references
    lattice of constructibility degrees
    0 references
    tree forcing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references