Public Mathlib landmark · existing upstream theorem · read-only

Combinatorics · existing Mathlib declaration

Hales–Jewett Theorem

Fix a finite alphabet and finitely many colors. In some sufficiently large finite word space, no matter how every word is colored, there is a family of words obtained by changing one nonempty set of positions together, all with the same color.

The theorem at a glance

Hales–Jewett Theorem at a glance

A source-bound editorial overview of the exact Mathlib formulation. The image is explanatory; the statement map, formal type, and pinned source remain authoritative.

For every finite alphabet and finite color set, some finite coordinate type makes every coloring contain a monochromatic combinatorial line. Generated explanation only; the exact HTML statement and pinned source are authoritative.
Detailed visual description

The theorem block preserves the finite alphabet and color hypotheses, existential finite coordinate type, universal coloring, and monochromatic-line conclusion. The central example gives the complete line for alphabet {a,b,c} under the pattern (a,x,x,b,x): (a,a,a,b,a), (a,b,b,b,b), and (a,c,c,b,c), all with one whole-word halo. The footer explicitly records the non-effective and one-dimensional boundary.

Formal orientation

Statement map

Statement map for Hales–Jewett TheoremFor every finite alphabet and finite color set, some finite word dimension makes every coloring contain a monochromatic combinatorial line. The pinned upstream declaration is Combinatorics.Line.exists_mono_in_high_dimension. The exact checked statement is theorem Combinatorics.Line.exists_mono_in_high_dimension (α : Type u) [Finite α] (κ : Type v) [Finite κ] : ∃ (ι : Type) (_ : Fintype ι), ∀ C : (ι → α) → κ, ∃ l : Combinatorics.Line α ι, l.IsMono C.Mathematical readingFor every finitealphabet and finitecolor set, some finiteword dimension makesevery coloring contain amonochromaticcombinatorial line.Pinned declarationmathlib ·Combinatorics.Line.exists_mono_in_high_dimensionExact checked formtheoremCombinatorics.Line.exists_mono_in_high_dimension(α : Type u) [Finite α](κ : Type v) [Finite κ]: ∃ (ι : Type) (_ :Fintype ι), ∀ C : (ι →α) → κ, ∃ l :Combinatorics.Line α ι,l.IsMono CStatement map for Hales–Jewett TheoremFor every finite alphabet and finite color set, some finite word dimension makes every coloring contain a monochromatic combinatorial line. The pinned upstream declaration is Combinatorics.Line.exists_mono_in_high_dimension. The exact checked statement is theorem Combinatorics.Line.exists_mono_in_high_dimension (α : Type u) [Finite α] (κ : Type v) [Finite κ] : ∃ (ι : Type) (_ : Fintype ι), ∀ C : (ι → α) → κ, ∃ l : Combinatorics.Line α ι, l.IsMono C.Mathematical readingFor every finitealphabet and finitecolor set, some finiteword dimension makesevery coloring contain amonochromaticcombinatorial line.Pinned declarationmathlib ·Combinatorics.Line.exists_mono_in_high_dimensionExact checked formtheoremCombinatorics.Line.exists_mono_in_high_dimension(α : Type u) [Finite α](κ : Type v) [Finite κ]: ∃ (ι : Type) (_ :Fintype ι), ∀ C : (ι →α) → κ, ∃ l :Combinatorics.Line α ι,l.IsMono C

This deterministic map orients the reader from the mathematical summary to the pinned declaration and exact checked form. The HTML statement below is authoritative.

In a sufficiently large finite word space, every finite coloring contains a line formed by varying one nonempty coordinate set together. Scientific diagram · explanatory, not proof evidence.
Detailed visual description

This page indexes Mathlib’s combinatorial-line form of the Hales–Jewett theorem for arbitrary finite types α and κ. It produces some finite coordinate type ι before quantifying over every coloring C : (ι → α) → κ. A line fixes some coordinates and varies one nonempty set of coordinates together through a common letter. The selected declaration supplies no effective or least dimension, canonical choice, coloring-independent line, or algorithm, and it is not the separate multidimensional subspace theorem or the Van der Waerden corollary.

Complementary intuition

A mathematical landmark

The Hales–Jewett theorem is a central structural result in Ramsey theory. Mathlib’s source exposes the theorem’s distinctive route through induction on the alphabet, color-focused families, a product argument, and the final impossibility of more distinct focused colors than the finite color type contains.

The low-text schematic gives the theorem a visual identity; it does not replace the source-bound poster or exact statement.

Authoritative formal type

Exact Mathlib statement

theorem Combinatorics.Line.exists_mono_in_high_dimension (α : Type u) [Finite α] (κ : Type v) [Finite κ] : ∃ (ι : Type) (_ : Fintype ι), ∀ C : (ι → α) → κ, ∃ l : Combinatorics.Line α ι, l.IsMono C
Selected evidence declaration text
theorem Combinatorics.Line.exists_mono_in_high_dimension (α : Type u) [Finite α] (κ : Type v) [Finite κ] : ∃ (ι : Type) (_ : Fintype ι), ∀ C : (ι → α) → κ, ∃ l : Combinatorics.Line α ι, l.IsMono C

ProofAtlas record

What has been checked

Upstream indexedPinned source bytes verified locally
Locally reproducedExact upstream declaration replayed
Reviewed pageCurrent public presentation reviewed
Accepted Atlas resultNot recorded for the preferred artifact

These states distinguish upstream identity, local reproduction, review, and Atlas acceptance. This page is part of the public, read-only Mathlib landmark collection.

Claim boundary

No new theorem is claimed

This page indexes Mathlib’s combinatorial-line form of the Hales–Jewett theorem for arbitrary finite types α and κ. It produces some finite coordinate type ι before quantifying over every coloring C : (ι → α) → κ. A line fixes some coordinates and varies one nonempty set of coordinates together through a common letter. The selected declaration supplies no effective or least dimension, canonical choice, coloring-independent line, or algorithm, and it is not the separate multidimensional subspace theorem or the Van der Waerden corollary.

Provenance

Origin and evidence stay separate

Existing declaration
Combinatorics.Line.exists_mono_in_high_dimension in mathlib
Relationship
The checked artifact is the upstream declaration itself
Preferred checked artifact
artifact.library.mathlib.hales-jewett-theorem.v001
Source handling
Verified upstream reference; no mirrored source package