Problems about partitions of cartesian products are common in mathematics. For example, in finite and infinite combinatorics, they keep emerging in Ramsay theory, where one seeks to show that, if a product is partitioned into finitely many parts, one part at least must contain a subset of a certain specified kind. In the transition from finite to infinite products, one usually imposes restrictions of a topological nature on the partition, in order to obtain theorems analogous to those which are valid in the finite case. (See, e.g., [G-P], [Si], [E].)