AFTD Auto-Formalizing Theoretical Domains

ocycap_fractional_cost

def

The fractional cost of a weight vector x on pairs of vertices of a cycle on n vertices is the sum of weights x(e) over all candidate links e in the complete graph on Fin n.

Statement

noncomputable def ocycap_fractional_cost (n : ℕ) (x : Sym2 (Fin n) → ℝ) : ℝ
Defined in
arXiv:2611.08570 Section 2.2
Verified
09 Nov 2026
Axioms
none listed

Read back from the Lean

A definition ocycap_fractional_cost taking a natural number n and a function x : Sym2 (Fin n) → ℝ, defined as the sum of x e over all edges e in the edge finset of the complete simple graph ⊤ on vertex set Fin n (i.e., the sum of x {u, v} over all 2-element subsets / unordered pairs of distinct vertices {u, v} of Fin n).

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 total fractional cost of a link weight vector x on the candidate links. -/
noncomputable def ocycap_fractional_cost (n : ℕ) (x : Sym2 (Fin n) → ℝ) : ℝ := ∑ e ∈ (⊤ : SimpleGraph (Fin n)).edgeFinset, x e
See it in the graphDiscuss this resultChallenge it