OctoInformBeta

The Euclidean plane cannot be colored with five colors

For a positive integer kk, a proper kk-coloring of the Euclidean plane is a function c:ℝ2→{1,…,k}c:\mathbb R^2\to\{1,\ldots,k\} such that c(x)≠c(y)c(x)\ne c(y) whenever ‖x−y‖=1\lVert x-y\rVert=1. The plane chromatic number χ(ℝ2)\chi(\mathbb R^2) is the least such kk, with no regularity imposed on the color classes. The Hadwiger-Nelson problem asks for the value of χ(ℝ2)\chi(\mathbb R^2). Write S1S^1 for the unit circle in ℝ2\mathbb R^2. Let σ\sigma be normalized arc-length measure on S1S^1. A weak measurable kk-coloring is a Lebesgue measurable function c:ℝ2→{1,…,k}c:\mathbb R^2\to\{1,\ldots,k\} satisfying c(x)≠c(x+u)c(x)\ne c(x+u) for almost every (x,u)∈ℝ2×S1(x,u)\in\mathbb R^2\times S^1 with respect to the product of plane Lebesgue measure and σ\sigma.

de Grey proved χ(ℝ2)≥5\chi(\mathbb R^2)\ge5 in 2018. Falconer had proved that every Lebesgue measurable proper coloring requires at least five colors.

The preprint proves that the Euclidean plane has no proper five-coloring. For every positive integer kk, the preprint proves that a proper kk-coloring exists if and only if a weak measurable kk-coloring exists. It also excludes weak measurable five-colorings. The preprint derives the existence of a finite unit-distance graph that is not five-colorable, a consequence absent from the Lean library.

The Lean library PlaneColoring proves the forward implication of the transfer equivalence, with a Borel weak coloring as its conclusion. The Lean library constructs a measurable proper seven-coloring. Lean has checked every result of the Lean library, so the Lean library is the reference for the statements on these pages. Each result is stated as in the Lean library and linked to its Lean declaration. Wherever the preprint states a result differently, its statement is given beside the Lean library’s statement. The preprint is a guide only to the order and names of results.

The Lean library: PlaneColoring

PlaneColoring is a Lean library: 36 items, in six groups. Each has a page written by OctoInform, listed below.

§1. Introduction 4 items
  1. §1 setting Proper and weak colorings of the plane.
  2. Theorem 1.1 Five labels force a monochromatic unit segment.
  3. Theorem 1.3 Proper colorings admit Borel weak colorings.
  4. Theorem 1.4 Borel measurable weak five-colorings are impossible.
§4. Transfer between proper and weak measurable colorings 3 items
  1. Lemma 4.1 Projected color indicators retain their bounds.
  2. Proposition 4.2 Proper colorings yield Borel weak colorings.
  3. Lemma 4.3 Borel weak colorings yield disjoint full-density loci.
§5. Circle traces and maximal palettes 5 items
  1. Definition 5.1 Circle samples define traces and palettes.
  2. Lemma 5.2 Palette exclusions for weak circle traces.
  3. Corollary 5.4 Almost everywhere disjointness of circle palettes.
  4. Lemma 5.5 Binary centers admit a positive separation.
  5. Proposition 5.6 Circle palettes have one or two labels.
§6. Transitions and local finiteness of cyclic centers 7 items
  1. Definition 6.1 Small translations define the cyclic core.
  2. Lemma 6.2 Transition edges admit traces avoiding both labels.
  3. Lemma 6.3 Angular states constrain density and unit chords.
  4. Lemma 6.4 At most two omitted colors obstruct alternation.
  5. Theorem 6.5 Cyclic centers form a closed set.
  6. Lemma 6.6 Converging four-cycle centers have converging state indicators.
  7. Lemma 6.7 A shared support direction excludes state steps.
§7. Extraction of common exclusion continua 7 items
  1. §7 setting Spatial supports and directional approach data.
  2. Proposition 7.1 Exclusion interfaces from compact crossing sequences.
  3. Lemma 7.2 Disk averages constrain density and support.
  4. Lemma 7.3 Missing transitions restrict disk density overlap.
  5. Lemma 7.4 Small-hole graph approximations exist.
  6. Lemma 7.5 A large disk forces triple overlap.
  7. §7 proof replacement Forest crossings permit constant inner patches.
§8. Angular obstructions and the final contradiction 10 items
  1. Lemma 8.1 Directional approach gives one-sided straddling strips.
  2. Proposition 8.2 Five cyclic exclusions are incompatible.
  3. Lemma 8.3 Valid four-cycle words contain a fifth-color state.
  4. Lemma 8.4 Split conditions force opposite edge directions.
  5. Proposition 8.5 Four cyclic exclusions cannot coexist.
  6. Lemma 8.6 Two-label strips yield local essential constancy.
  7. Lemma 8.7 Triangle straddling exclusions yield one boundary orbit.
  8. Lemma 8.8 Alternating angular states constrain local color density.
  9. Lemma 8.9 Seven Moser vertices lie in the three-label region.
  10. Proposition 8.10 Triangle interface exclusions cannot coexist.

No item matches.