gale_distance_graph
For a finite subset V of the 3-dimensional Euclidean space EuclideanSpace ℝ (Fin 3) and a real number t, gale_distance_graph V t is the simple graph with vertex set V (as a subtype) where two vertices u, v ∈ V are adjacent if and only if u ≠ v and the distance between u and v is strictly greater than t.
Statement
def gale_distance_graph (V : Finset (EuclideanSpace ℝ (Fin 3))) (t : ℝ) : SimpleGraph V- Defined in
- arXiv:2610.28828, Sec. 3.1
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Used by 11
- op462_counterexample_of_integer_witnessAn exact integer coordinate certificate and a non-four-colorable witness graph produce a finite counterexample with cardinality at most…
- 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…
- op462_counterexample_extend_cardA finite three-dimensional counterexample can be enlarged to any prescribed larger finite cardinality by adding points inside its convex…
- is_gale_counterexample_threeA finite subset V of the 3-dimensional Euclidean space
EuclideanSpace ℝ (Fin 3)is a counterexample to Gale's conjecture in dimension 3… - 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…
- counterexample_partition_diameter_ratio_three_101There exists a finite subset V of 3-dimensional Euclidean space of cardinality 101 and strictly positive diameter such that for every…
- threshold_graph_not_four_colorable_of_integer_witnessDistinct integer coordinate triples with pairwise squared distances at most S squared, witness-edge squared distances at least Q, a…
- 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…
- 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…
Read back from the Lean
Given a finite set V of points in 3-dimensional Euclidean space EuclideanSpace ℝ (Fin 3) and a real number t, gale_distance_graph V t is defined as the simple graph on the vertices of V (as a subtype) in which two vertices u and v are adjacent if and only if u ≠ v and the Euclidean distance between u and v is strictly greater than t.
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
/-- The distance threshold graph on a finite subset V of EuclideanSpace R (Fin 3) with threshold t. -/ def gale_distance_graph (V : Finset (EuclideanSpace ℝ (Fin 3))) (t : ℝ) : SimpleGraph V := { Adj := fun u v => u ≠ v ∧ t < dist (u : EuclideanSpace ℝ (Fin 3)) (v : EuclideanSpace ℝ (Fin 3)) symm := ⟨fun a b h => ⟨h.1.symm, by rw [dist_comm]; exact h.2⟩⟩ loopless := ⟨fun a h => h.1 rfl⟩ }