Documentation

FormalConjectures.ErdosProblems.«505»

Erdős Problem 505 #

Reference: erdosproblems.com/505

Borsuk's conjecture (1933): Is every bounded set of diameter 1 in $\mathbb{R}^n$ the union of at most $n + 1$ sets of diameter strictly less than 1?

Erdős [Er44] suspected this is false for sufficiently large $n$. Confirmed by Kahn–Kalai [KK93], who disproved the conjecture for $n \geq 2015$. The current best is $n \geq 64$ (Jenrich–Brouwer, 2014).

The conjecture is true for $n \leq 3$ (Eggleston [Eg55] for $n = 3$).

References #

AI disclosure #

Lean 4 code in this file was drafted with assistance from Claude (Anthropic). The mathematical content and references are the author's own work.

theorem Erdos505.erdos_505.test_dim_one (S : Set (EuclideanSpace (Fin 1))) (hS : Bornology.IsBounded S) (hd : 0 < Metric.diam S) :
∃ (F : Fin 2Set (EuclideanSpace (Fin 1))), S ⋃ (i : Fin 2), F i ∀ (i : Fin 2), Metric.diam (F i) < Metric.diam S
theorem Erdos505.erdos_505 :
∃ (n : ) (S : Set (EuclideanSpace (Fin n))), Bornology.IsBounded S 0 < Metric.diam S ∀ (F : Fin (n + 1)Set (EuclideanSpace (Fin n))), S ⋃ (i : Fin (n + 1)), F i∃ (i : Fin (n + 1)), Metric.diam S Metric.diam (F i)

Erdős Problem 505 (disproved). Borsuk's conjecture is false for sufficiently large $n$: there exists a dimension $n$ and a bounded set $S \subseteq \mathbb{R}^n$ with positive diameter such that $S$ cannot be covered by $n + 1$ subsets each of diameter strictly less than $\operatorname{diam}(S)$.

Erdős [Er44] suspected this. Disproved by Kahn–Kalai [KK93] for $n \geq 2015$. Currently known to be false for $n \geq 64$. A formal proof was formalised by Boris Alexeev using Aristotle.

theorem Erdos505.erdos_505.small_dim (n : ) (hn : n 3) (S : Set (EuclideanSpace (Fin n))) (hS : Bornology.IsBounded S) (hd : 0 < Metric.diam S) :
∃ (F : Fin (n + 1)Set (EuclideanSpace (Fin n))), S ⋃ (i : Fin (n + 1)), F i ∀ (i : Fin (n + 1)), Metric.diam (F i) < Metric.diam S

Borsuk's conjecture, small dimensions (open / true for $n \leq 3$). Every bounded set $S \subseteq \mathbb{R}^n$ with $n \leq 3$ can be covered by $n + 1$ subsets each of strictly smaller diameter.

Trivial for $n \leq 2$; proved for $n = 3$ by Eggleston [Eg55].