Simple product colorings

If A is a set colored with m colors, and B is colored with n colors, the coloring of A × B obtained by coloring (a, b) with the pair (color of a, color of b) will be called an m × n simple product coloring (SPC) of A × B. SPC's of Cartesian products of three or more sets are defined analogously. It is shown that there are 2 × 2, and 2 × 2 × 2 SPC's of $\text{Q}$² and $\text{Q}$³ which forbid the distance one; that there is no 2^k SPC of $\text{Q}$^k forbidding the distance one, for k > 3; and that there is no 2 × 2 SPC of $\text{Q}$ × $\text{Q}$(√15), and thus none of $\text{R}$², forbidding the distance 1.