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 (A1A2Ak=) and U an idempotent ultrafilter.

Claim: AiU 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 AicU for each i, hence A1cAkcU, but this is (A1Ak)c, contradicting the fact that A1AkU).

Let A=AiU. Therefore we have Uy,yA. Then:

  • (1) Ux,Uy,yA
  • (2) Ux,Uy,xA
  • (3) AU+U=U gives that Ux,Uy,x+yA.

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

Ux,Uy,FS(x,y)A.

Now fix x1A 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}=:BU=U+U

Then have Ux,Uy,x+yB.

  • (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+1xn. Have Uy,FS(x1,,xn,xn+1,y)A. Then done by induction.