counterexample_partition_diameter_ratio_three_101
There exists a finite subset V of 3-dimensional Euclidean space of cardinality 101 and strictly positive diameter such that for every 4-partition of V (given by a map c : V → Fin 4), at least one part has diameter strictly greater than 0.88928 times the diameter of V, and this ratio 0.88928 strictly exceeds the 4-partition diameter ratio of the unit 2-sphere sqrt((3 + sqrt(3)) / 6).
Statement
theorem counterexample_partition_diameter_ratio_three_101 :
∃ V : Finset (EuclideanSpace ℝ (Fin 3)),
V.card = 101 ∧
0 < Metric.diam (V : Set (EuclideanSpace ℝ (Fin 3))) ∧
(∀ c : V → Fin 4, ∃ i : Fin 4,
(88928 / 100000 : ℝ) * Metric.diam (V : Set (EuclideanSpace ℝ (Fin 3))) <
Metric.diam ((Subtype.val : V → EuclideanSpace ℝ (Fin 3)) '' (c ⁻¹' {i}))) ∧
gale_sigma_three < (88928 / 100000 : ℝ)- Formalizes
- arXiv:2610.28828 -- A counterexample to Gale's conjecture in $\mathbb{R}^3$, Theorem 2
- Verified
- 28 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- gale_sigma_threeThe real constant
gale_sigma_threeis defined as the square root of (3 + sqrt(3)) / 6. - gale_distance_graphFor a finite subset V of the 3-dimensional Euclidean space
EuclideanSpace ℝ (Fin 3)and a real number t,gale_distance_graph V tis… - sphere_three_partition_ratio_lt_thresholdThe four-partition diameter ratio constant of the unit 2-sphere, namely sqrt((3 + sqrt(3)) / 6), is strictly less than 0.88928.
- non_colorable_imp_partition_diam_gtFor every finite subset V of 3-dimensional Euclidean space and every real number t, if the distance threshold graph on V at threshold t…
- threshold_graph_four_not_colorable_101There exists a finite subset V of 3-dimensional Euclidean space with cardinality 101 and strictly positive diameter such that the distance…
- gale_sigma_threeThe real constant
Read back from the Lean
There exists a finite subset $V$ of 3-dimensional Euclidean space (EuclideanSpace ℝ (Fin 3)) such that:
1. $V$ has cardinality 101;
2. the metric diameter of $V$ (viewed as a set) is strictly positive;
3. for every map $c : V \to \mathrm{Fin}\ 4$ (i.e., every 4-coloring of $V$), there exists some $i \in \mathrm{Fin}\ 4$ such that the metric diameter of the fiber $\{x \in V \mid c(x) = i\}$ (as a subset of the ambient Euclidean space) is strictly greater than $\frac{88928}{100000}$ times the metric diameter of $V$; and
4. $\sqrt{\frac{3 + \sqrt{3}}{6}} < \frac{88928}{100000}$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem is proved by exhibiting an explicit 101-point subset V in 3-dimensional Euclidean space whose Gale distance graph at distance threshold 0.88928 * diam(V) is not 4-colorable. Because the graph cannot be 4-colored, any 4-partition of V must contain an edge within some color class, forcing at least one part to have diameter strictly greater than 0.88928 * diam(V). Combining this with the verified numerical bound that the unit 2-sphere 4-partition diameter ratio is strictly less than 0.88928 establishes the result.
There exists a 101-point set V in 3-dimensional Euclidean space of positive diameter whose Gale distance graph at threshold 0.88928 * diam(V) cannot be 4-colored.
We obtain such a finite set V along with proofs of its three key properties from threshold_graph_four_not_colorable_101: it has exactly 101 points, its diameter is strictly positive, and its Gale distance graph (the graph with edges between points at Euclidean distance strictly greater than 0.88928 * diam(V)) admits no valid 4-coloring.
uses
threshold_graph_four_not_colorable_101obtain ⟨V, hcard, hdiam, hnot⟩ := threshold_graph_four_not_colorable_101Every 4-partition of V has a part with diameter strictly greater than 0.88928 * diam(V), which together with the sphere ratio bound provides the required existential witness.
We provide V as the witness for the existential claim. Its cardinality and positivity of diameter are given directly by the obtained hypotheses. For any 4-partition c : V → Fin 4, non_colorable_imp_partition_diam_gt translates the non-4-colorability of the distance graph into the fact that at least one color class must contain an edge, meaning its diameter strictly exceeds 0.88928 * diam(V). Finally, sphere_three_partition_ratio_lt_threshold provides the verified numerical inequality that the sphere partition ratio is strictly less than 0.88928.
uses
non_colorable_imp_partition_diam_gt,sphere_three_partition_ratio_lt_thresholdexact ⟨V, hcard, hdiam, fun c => non_colorable_imp_partition_diam_gt V _ hnot c, sphere_three_partition_ratio_lt_threshold⟩
non_colorable_imp_partition_diam_gt- If the distance graph on a finite set V at threshold t is not 4-colorable, then for every 4-partition c : V → Fin 4, at least one part has diameter strictly greater than t.
sphere_three_partition_ratio_lt_threshold- The 4-partition diameter ratio of the unit 2-sphere, gale_sigma_three = √((3 + √3)/6), is strictly less than 88928 / 100000 = 0.88928.
threshold_graph_four_not_colorable_101- There exists a 101-point subset V of 3-dimensional Euclidean space of strictly positive diameter whose Gale distance graph at threshold 0.88928 * diam(V) is not 4-colorable.
- The non-trivial geometric and computational work—constructing the 101-point configuration, verifying that its distance graph is not 4-colorable, and computing the numerical upper bound for the sphere ratio—is encapsulated in the three helper lemmas. Line 11 directly packages these components together.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- There exists a 101-point subset in 3D Euclidean space whose 4-partition diameter ratio exceeds 0.88928, strictly greater than the unit sphere ratio. -/theorem counterexample_partition_diameter_ratio_three_101 : ∃ V : Finset (EuclideanSpace ℝ (Fin 3)), V.card = 101 ∧ 0 < Metric.diam (V : Set (EuclideanSpace ℝ (Fin 3))) ∧ (∀ c : V → Fin 4, ∃ i : Fin 4, (88928 / 100000 : ℝ) * Metric.diam (V : Set (EuclideanSpace ℝ (Fin 3))) < Metric.diam ((Subtype.val : V → EuclideanSpace ℝ (Fin 3)) '' (c ⁻¹' {i}))) ∧ gale_sigma_three < (88928 / 100000 : ℝ) := by obtain ⟨V, hcard, hdiam, hnot⟩ := threshold_graph_four_not_colorable_101 exact ⟨V, hcard, hdiam, fun c => non_colorable_imp_partition_diam_gt V _ hnot c, sphere_three_partition_ratio_lt_threshold⟩