The Hales–Jewett theorem
ProvedFamousTheorems.hales_jewettThe Hales–Jewett theorem. For every finite alphabet and finite set of colours there is a finite dimension such that every colouring of the cube with colours contains a monochromatic combinatorial line.
A combinatorial line is obtained from a word with some "wildcard" coordinates by substituting the same letter for all wildcards. The theorem is the abstract core of Ramsey theory on words: van der Waerden's theorem and the Gallai–Witt theorem follow from it. The density version and Shelah's primitive recursive bounds are landmarks of combinatorics.
Formalization note. Mathlib's Combinatorics.Line.exists_mono_in_high_dimension. The dimension is an index type ι : Type with a Fintype structure, and Combinatorics.Line.IsMono C l says every point of the line l has the same colour.
import Mathlib
namespace FamousTheorems
theorem hales_jewett (α : Type*) [Finite α] (κ : Type*) [Finite κ] :
∃ (ι : Type) (_ : Fintype ι), ∀ C : (ι → α) → κ, ∃ l : Combinatorics.Line α ι, Combinatorics.Line.IsMono C l := by sorry
end FamousTheorems