is_gale_counterexample_three
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_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…
- gale_sigma_threeThe real constant
- Used by 12
- op462_counterexample_of_integer_witnessAn exact integer coordinate certificate and a non-four-colorable witness graph produce a finite counterexample with cardinality at most…
- min_gale_counterexample_card_threeThe minimum cardinality
min_gale_counterexample_card_threeof a finite counterexample to Gale's conjecture in dimension 3 is the infimum… - op_462_not_is_gale_counterexample_three_of_card_le_fourFor every finite subset V of
EuclideanSpace ℝ (Fin 3), if the cardinality of V is at most 4, then V is not a counterexample to Gale's… - op_462_min_counterexample_card_three_in_rangeThere exists a unique natural number m in the range 5 ≤ m ≤ 101 such that m is the least element of the set of cardinalities of all finite…
- op462_lt101_of_integer_witnessAn integer coordinate certificate on fewer than 101 indexed points, with unit diameter bound, a strict threshold gap and a…
- op_462_five_le_min_gale_counterexample_card_threeIf there exists a finite counterexample to Gale's conjecture in dimension 3, then the minimum cardinality…
- op462_counterexample_extend_cardA finite three-dimensional counterexample can be enlarged to any prescribed larger finite cardinality by adding points inside its convex…
- op_462_gale_counterexample_card_three_ge_fiveFor every finite subset V of
EuclideanSpace ℝ (Fin 3), if V is a counterexample to Gale's conjecture in dimension 3… - op_462_min_gale_counterexample_card_three_in_rangeThe minimum cardinality
min_gale_counterexample_card_threeof a finite counterexample to Gale's conjecture in dimension 3 satisfies 5 ≤… - op_462_min_card_le_of_integer_witnessFor any positive integer scale S, integer threshold Q, and n points in ℤ³ with unit diameter bound and edge list E at squared distance at…
- op_462_gale_counterexample_card_three_le_101There exists a finite subset V of
EuclideanSpace ℝ (Fin 3)with cardinality 101 that is a counterexample to Gale's conjecture in… - op_462_is_least_iffFor every natural number m, m is the least element of the set of cardinalities of finite counterexamples to Gale's conjecture in dimension…
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