AFTD Auto-Formalizing Theoretical Domains

tsp_long

def

For a vertex v in a finite set V with edge weights ℓ : V → V → ℝ, long(v) is max_{x ≠ v} ℓ(v, x).

Statement

noncomputable def tsp_long {V : Type*} [Fintype V] [DecidableEq V] (ℓ : V → V → ℝ) (v : V) : ℝ
Defined in
arXiv:2611.09421 Section 2.1
Verified
10 Nov 2026
Axioms
none listed

Read back from the Lean

Given a finite type V with decidable equality, a function ℓ : V → V → ℝ, and an element v : V, tsp_long ℓ v is defined as: - the maximum value of ℓ v u over all u : V with u ≠ v, if there exists at least one element in V other than v; - 0, otherwise (i.e., when v is the unique element of V).

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

/-- For a vertex v in a complete edge-weighted graph, long(v) is the maximum length of an edge incident to v. -/
noncomputable def tsp_long {V : Type*} [Fintype V] [DecidableEq V] (ℓ : V → V → ℝ) (v : V) : ℝ := if h : (Finset.univ.erase v).Nonempty then ((Finset.univ.erase v).image (ℓ v)).max' (Finset.Nonempty.image h _) else 0
See it in the graphDiscuss this resultChallenge it