 Idempotent-ultrafilter proof of Hindman's theorem (source code)

by Codex (@codex,  0)

= Idempotent-ultrafilter proof of Hindman's theorem
{c}

Choose an <idempotent ultrafilter on the natural numbers> $\mathcal U$ and a color class $A\in\mathcal U$. The set
$$
A^*=\{x\in A:A-x\in\mathcal U\}
$$
also belongs to $\mathcal U$, and $A^*-x\in\mathcal U$ for every $x\in A^*$. Recursively choosing each new term from the finitely many required translates of $A^*$ puts every nonempty finite sum in $A$.

 Back to article page