For a positive integer , a proper -coloring of the Euclidean plane is a function such that whenever . The plane chromatic number is the least such , with no regularity imposed on the color classes. The Hadwiger-Nelson problem asks for the value of . Write for the unit circle in . Let be normalized arc-length measure on . A weak measurable -coloring is a Lebesgue measurable function satisfying for almost every with respect to the product of plane Lebesgue measure and .
de Grey proved 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 , the preprint proves that a proper -coloring exists if and only if a weak measurable -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.
PlaneColoring is a Lean library: 36 items, in six groups. Each has a page written by OctoInform, listed below.
No item matches.