In mathematics, the Hales–Jewett theorem is a fundamental combinatorial result of Ramsey theory, named after Alfred W. Hales and Robert I. Jewett, that concerns the degree to which high-dimensional objects must necessarily exhibit some combinatorial structure.

Hales–Jewett theorem

Hales and Jewett proved that sufficiently high-dimensional finite colorings contain a monochromatic combinatorial line, establishing the theorem in 1963. Its density strengthening and several simpler proofs are also established.

Known results

Hales and Jewett, 1963: every finite coloring of a sufficiently large alphabetic cube contains a monochromatic combinatorial line.
Furstenberg and Katznelson, 1991: proved the density Hales–Jewett theorem.
D. H. J. Polymath, 2012: developed a combinatorial proof of the density theorem and its multidimensional form.
Shelah, 1988: obtained primitive-recursive bounds for van der Waerden numbers through a one-variable induction related to the theorem.

April–July 2026 extensions

An April 2026 preprint claims an abstract semigroup-and-retraction generalization recovering the classical theorem. A July 2026 preprint claims improved quantitative bounds for Hales–Jewett numbers. Both are advances beyond the classical statement, not resolutions of it, and remain unverified here.

Current status (as of September 2026): The classical and density theorems are settled; the 2026 generalization and bound improvements are claimed advances awaiting independent verification.

Hales–Jewett theorem

Primary source

Progress summary

Solutions 0