Hindman's theorem: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
'''Hindman's theorem''': If <math>[2]^\omega := \bigcup_{n=0}^\infty [2]^n</math> is finitely colored, then one of the color classes contain an infinite-dimensional [[combinatorial subspace]], | '''Hindman's theorem''': If <math>[2]^\omega := \bigcup_{n=0}^\infty [2]^n</math> is finitely colored, then one of the color classes contain all elements of an infinite-dimensional [[combinatorial subspace]] which contain the digit 1, and such that none of the fixed digits of this subspace are equal to 1. | ||
The generalization of this theorem to higher k is | The generalization of this theorem to higher k is [[Carlson's theorem]]. Hindman's theorem also implies [[Folkman's theorem]]. | ||
Revision as of 23:51, 15 February 2009
Hindman's theorem: If [math]\displaystyle{ [2]^\omega := \bigcup_{n=0}^\infty [2]^n }[/math] is finitely colored, then one of the color classes contain all elements of an infinite-dimensional combinatorial subspace which contain the digit 1, and such that none of the fixed digits of this subspace are equal to 1.
The generalization of this theorem to higher k is Carlson's theorem. Hindman's theorem also implies Folkman's theorem.
