AFTD Auto-Formalizing Theoretical Domains

gale_distance_graph

def

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

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⟩
}
See it in the graphDiscuss this resultChallenge it