# Carlson's theorem

Jump to: navigation, search

Carlson's theorem (k=3), Version I: If $^\omega := \bigcup_{n=0}^\infty ^n$ is partitioned into finitely many color classes, then there exists an infinite-dimensional combinatorial subspace with no fixed coordinate equal to 4, such that every element of this combinatorial subspace with at least one 4 has the same color.

This theorem is a common generalization of the Carlson-Simpson theorem and the Graham-Rothschild theorem. It plays a key role in the Furstenberg-Katznelson argument. It is necessary to restrict to elements containing at least one 4; consider the coloring that colors a string black if it contains at least one 4, and white otherwise.

It has an equivalent formulation:

Carlson's theorem (k=3), Version I: If the combinatorial lines in $^\omega := \bigcup_{n=0}^\infty ^n$ are partitioned into finitely many color classes, then there exists an infinite-dimensional combinatorial subspace such that all combinatorial lines in this subspace have the same color.

This follows by viewing a combinatorial line in $^\omega$ as an element in $^\omega$ containing at least one 4, thinking of the 4 as the "wildcard" for the line.

The k=2 version of this theorem is Hindman's theorem.