Write for the red-blue finite colouring of unordered pairs. The two alternatives concern one arithmetic progression or a pair of disjoint arithmetic progressions; they need not be mutually exclusive. For , a singleton already has no non-blue edge, so the first alternative holds. Assume henceforth .
If the first alternative fails, every -term arithmetic progression contains a red pair. Label each by one such pair's positions , choosing the first in a fixed ordering when there are several. This is a finite colouring with at most colours. The following two branches establish the arithmetic-progression bipartite Ramsey dichotomy.
If an -term arithmetic progression contains no red pair, all of its unordered pairs are blue, since there are only two colours. This gives the first alternative, including the vacuous singleton case. Otherwise the position-pair finite colouring in the root solution is defined everywhere, and the construction below forces the second alternative.
Apply the Gallai theorem for an integer lattice to the finite pattern
Although some coordinates are negative, translating into the positive quadrant and applying the positive-lattice theorem produces a monochromatic copy , with integer . The translation is absorbed into . Let be the common position-pair label on this copy.
For each , the starting point and step
label the red edge at positions . Its endpoints simplify to
Thus the two arithmetic progressions
have a positive common difference , and every cross-pair is red. Their entries are positive because they occur as endpoints of the positive-start, positive-step progressions represented in .
It remains to check disjointness, rather than infer it merely from distinct starting points. The pattern contains points whose second coordinate is . Since all of lies in ,
Consequently
Therefore and are disjoint -term arithmetic progressions with every cross-edge red. Combined with the first branch, this proves the dichotomy.

Articles by others on the same topic (0)

There are currently no matching articles.