For every finite , every finite coloring of contains a monochromatic homothetic copy . The theorem follows from the Hales-Jewett theorem by coloring a word according to the sum of the points indexed by its letters.
Every colouring of the positive integers, even with infinitely many colours, has an arithmetic progression of any prescribed finite length on which the colouring is constant or injective. Encode a progression by the equivalence relation of equality of its colours. This gives a finite colouring of its starting point and step. A Gallai theorem for an integer lattice copy of a suitable two-dimensional pattern makes either all indices inequivalent, or one equal-colour pair range independently over two whole progressions. In the second case, one of those progressions is monochromatic.
For a finite pattern in a real vector space, pull a finite colouring back to words through the displayed sum map. A combinatorial line with active coordinates J maps to . The Hales-Jewett theorem therefore forces a monochromatic homothetic copy. Integer patterns remain in the integer lattice; choosing b sufficiently large gives the positive-lattice version.
Every red-blue finite coloring of the pairs of positive integers has either a blue complete arithmetic progression of any prescribed finite length , or two disjoint -term arithmetic progressions with all cross-pairs red. To see the geometry, assign a chosen red pair of indices in its progression, assuming the first alternative fails. Apply the Gallai theorem for an integer lattice to the fixed finite pattern
In a monochromatic copy with common label , the selected red pairs are precisely
The copy lies in the positive quadrant, so . Consequently the two displayed arithmetic progressions are disjoint. Translating the finite pattern before applying the lattice theorem permits its initially negative coordinates.

Articles by others on the same topic (0)

There are currently no matching articles.