Hindman's theorem
ProvedFamousTheorems.hindmanHindman's theorem. Colour a semigroup with finitely many colours. For every sequence , if all finite products (products with ) are coloured, then some colour class contains all finite products of another sequence .
For this says every finite colouring of has an infinite set all of whose finite sums share a colour. It is the prototypical infinite-dimensional Ramsey theorem, and its standard proof (via idempotent ultrafilters in ) founded the algebra of the Stone–Čech compactification in combinatorics.
Formalization note. Mathlib's Hindman.FP_partition_regular; the colouring is a finite family s of sets covering FP a, and b is a subsequence-product stream.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem hindman {M : Type*} [Semigroup M] (a : Stream' M) (s : Set (Set M)) (hs : s.Finite)
(hcov : Hindman.FP a ⊆ ⋃₀ s) :
∃ c ∈ s, ∃ b : Stream' M, Hindman.FP b ⊆ c := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Hindman.FP_partition_regular`. Proof here reduces to that Mathlib result.