AFTD Auto-Formalizing Theoretical Domains

is_gale_counterexample_three

def

A finite subset V of the 3-dimensional Euclidean space EuclideanSpace ℝ (Fin 3) is a counterexample to Gale's conjecture in dimension 3 if it has strictly positive diameter and its distance threshold graph at threshold gale_sigma_three * Metric.diam (V : Set (EuclideanSpace ℝ (Fin 3))) is not 4-colorable.

Statement

def is_gale_counterexample_three (V : Finset (EuclideanSpace ℝ (Fin 3))) : Prop
Defined in
arXiv:2610.28828, Sec. 2 and Theorem 2
Verified
23 Oct 2026
Axioms
none listed
Built on 2
  • gale_sigma_threeThe real constant gale_sigma_three is 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 t is…
Used by 12

Read back from the Lean

For a given finite set $V$ of points in 3-dimensional Euclidean space $\mathbb{R}^3$ (EuclideanSpace ℝ (Fin 3)), is_gale_counterexample_three V is the proposition that: 1. The diameter of $V$ is strictly positive (0 < Metric.diam (V : Set (EuclideanSpace ℝ (Fin 3)))); and 2. The distance graph on $V$ with threshold $\sigma_3 \cdot \operatorname{diam}(V)$ is not 4-colorable, where $\sigma_3 = \sqrt{\frac{3 + \sqrt{3}}{6}}$. That is, the graph with vertex set $V$, where distinct vertices $u, v \in V$ are adjacent if and only if their Euclidean distance strictly exceeds $\sigma_3 \cdot \operatorname{diam}(V)$, admits no proper graph coloring with 4 colors.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Predicate asserting that a finite subset of R^3 is a counterexample to Gale's conjecture. -/
def is_gale_counterexample_three (V : Finset (EuclideanSpace ℝ (Fin 3))) : Prop := 0 < Metric.diam (V : Set (EuclideanSpace ℝ (Fin 3))) ∧
  ¬ (gale_distance_graph V (gale_sigma_three * Metric.diam (V : Set (EuclideanSpace ℝ (Fin 3))))).Colorable 4
See it in the graphDiscuss this resultChallenge it