Carlson-Simpson theorem: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
'''Carlson-Simpson theorem''' (k=3): If <math>[3]^\omega := \bigcup_{n=0}^\infty [3]^n</math> is partitioned into finitely many color classes, then one of the color classes contains an infinite-dimensional combinatorial subspace, i.e. another copy of <math>[3]^\omega</math>. | '''Carlson-Simpson theorem''' (k=3): If <math>[3]^\omega := \bigcup_{n=0}^\infty [3]^n</math> is partitioned into finitely many color classes, then one of the color classes contains an infinite-dimensional [[combinatorial subspace]], i.e. another copy of <math>[3]^\omega</math>. | ||
Implies the [[coloring Hales-Jewett theorem]]. The k=2 version already implies Hindman's theorem. | Implies the [[coloring Hales-Jewett theorem]]. The k=2 version already implies [[Hindman's theorem]]. | ||
It is used in the [[Furstenberg-Katznelson argument]]. | It is used in the [[Furstenberg-Katznelson argument]]. | ||
Revision as of 14:23, 15 February 2009
Carlson-Simpson theorem (k=3): If [math]\displaystyle{ [3]^\omega := \bigcup_{n=0}^\infty [3]^n }[/math] is partitioned into finitely many color classes, then one of the color classes contains an infinite-dimensional combinatorial subspace, i.e. another copy of [math]\displaystyle{ [3]^\omega }[/math].
Implies the coloring Hales-Jewett theorem. The k=2 version already implies Hindman's theorem.
It is used in the Furstenberg-Katznelson argument.
