Weak partition properties on trees
The authors define a partition symbol for trees: \(\kappa\rightsquigarrow(\lambda)^{<\omega}_\omega\) means that if one colours the nodes of the trees \(K^{<\omega}\) with countably many colours then there is a \(\lambda\)-branching subtree such that the colouring takes on finitely many colours on each level (the \(\omega\) indicates the number of colours). The principle is related to a thinning-out method for such trees that the authors use to prove two results on metric spaces: (1)~a Čech-analytic space is \(\sigma\)-locally compact iff it does not contain a closed copy of the space of irrational numbers, and (2)~if a Čech-analytic metric space is not \(\sigma\)-locally separable then there is no sensible value for its Hausdorff dimension. The bulk of the paper is actually devoted to the partition relation and its generalizations. Intriguingly, the relation holds for regular~\(\kappa\) below~\(\mathfrak{p}\) and above~\(\mathfrak{d}\), but not for~\(\mathfrak{b}\) and~\(\mathfrak{d}\) itself.
scientific article; zbMATH DE number 6206981