AFTD Auto-Formalizing Theoretical Domains

tsp_tour_length

def

The length of a tour σ on a finite set V under edge weight function ℓ is ∑_{v ∈ V} ℓ(v, σ(v)).

Statement

def tsp_tour_length {V : Type*} [Fintype V] (ℓ : V → V → ℝ) (σ : Equiv.Perm V) : ℝ
Defined in
arXiv:2611.09421 Section 1
Verified
10 Nov 2026
Axioms
none listed
Used by 1
  • tsp_optOPT is the infimum length of a tour on V under edge weights ℓ.

Read back from the Lean

Given a finite type V, a cost/weight function ℓ : V → V → ℝ, and a permutation σ : Equiv.Perm V, tsp_tour_length ℓ σ is defined as the sum over all v : V of ℓ v (σ 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

/-- The length of a tour σ under edge weights ℓ is the sum over v of ℓ(v, σ v). -/
def tsp_tour_length {V : Type*} [Fintype V] (ℓ : V → V → ℝ) (σ : Equiv.Perm V) : ℝ := ∑ v : V, ℓ v (σ v)
See it in the graphDiscuss this resultChallenge it