Proof of Hindman’s Theorem.

(If ℕ is finitely coloured, there exists (xn)n=1∞ such that FS⁡(x1,x2,…) is monochromatic).

Let A1,A2,…,Ak be the colour classes (A1⊔A2⊔⋯⊔Ak=ℕ) and U an idempotent ultrafilter.

Claim: Ai∈U for some i (this is because ultrafilters are prime: whenever we have a finite union lying in the ultrafilter we have at least one of the components lying in the ultrafilter, else have Aic∈U for each i, hence A1c∩⋯∩Akc∈U, but this is (A1∪⋯∪Ak)c, contradicting the fact that A1∪⋯∪Ak∈U).

Let A=Ai∈U. Therefore we have ∀⁡Uy,y∈A. Then:

  • (1) ∀⁡Ux,∀⁡Uy,y∈A
  • (2) ∀⁡Ux,∀⁡Uy,x∈A
  • (3) A∈U+U=U gives that ∀⁡Ux,∀⁡Uy,x+y∈A.

Then (1) and (2) and (3) give:

∀⁡Ux,∀⁡Uy,FS⁡(x,y)⊆A.

Now fix x1∈A such that

∀⁡Uy,FS⁡(x1,y)⊆A.

Assume we have found x1,…,xn such that

∀⁡Uy,FS⁡(x1,…,xn,y)⊆A{y:FS⁡(x1,…⁡,xn,y)⊆A}⏟=:B∈U=U+U

Then have ∀⁡Ux,∀⁡Uy,x+y∈B.

  • (1) ∀⁡Ux,∀⁡Uy,FS⁡(x1,…,xn,x+y)⊆A
  • (2) ∀⁡Ux,∀⁡Uy,FS⁡(x1,…,xn,x)⊆A
  • (3) ∀⁡Ux,∀⁡Uy,FS⁡(x1,…,xn,y)⊆A.

Then (1), (2) and (3) give:

∀⁡Ux,∀⁡Uy,FS⁡(x1,…,xn,x,y)⊆A.

Thus fix xn+1≫xn. Have ∀⁡Uy,FS⁡(x1,…,xn,xn+1,y)⊆A. Then done by induction.

□