Parametrized partitions of products of finite sets (Q558236)

Let \(\omega\) denote the set of natural numbers and \(\omega^\omega\) be the set of infinite sequences of natural numbers, and for \(A\subseteq \omega\), \([A]^\omega\) denotes the set of infinite subsets of \(A\). Then the authors prove: For every Borel coloring \(c:\omega^\omega\times [\omega]^\omega\to\{0,1\}\) and every sequence \(\{m_i\}^\infty_{i=0}\) of positive integers, there exist \(H\in [\omega]^\omega\) and a sequence \(\{H_i\}^\infty_{i=0}\) of subsets of \(\omega\) with \(| H_i| =m_i\) for all \(i\) such that \(c\) is constant on the product \((\prod_{i\in \omega} H_i)\times [H]^\omega\). The proof is very long and partitioned into six sections. In section 2 two combinatorial facts about partitions of finite products of finite sets are established which are crucial for the rest of the paper. We cite the rest from the introduction of the paper: ``In section 3, a family of infinite products of finite sets is defined along the lines of the definition of the Ackermann function, the main feature of which is the controlled rate of growth of the sizes of the finite factors. Section 4 is devoted to define a combinatorial forcing relation reminiscent of the Nash-Williams notions of `acceptance' and `rejection' used by \textit{F. Galvin} and \textit{K. Prikry} [J. Symb. Log. 38, 193--198 (1973; Zbl 0276.04003)] to prove the Borel version of \(\omega \to (\omega)^\omega\). In section 5, for each infinite sequence of positive integers \(\{m_i\}^\infty_{i=0}\), we define a \(\sigma\)-algebra, PCL\((\{m_i\}^\infty_{i=0})\), which is then used to prove parametrized partition relations for Borel sets. Section 6 contains the proof of the main result.''