AFTD Auto-Formalizing Theoretical Domains

nonadaptive_mst_opt_cost

def

The optimal non-adaptive expected query cost on a finite graph G with decidable adjacency and edge probabilities p is the infimum of the expected query cost over all permutations π of the edge set of G.

Statement

noncomputable def nonadaptive_mst_opt_cost {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (p : G.edgeSet → ℝ) : ℝ
Defined in
arXiv:2610.40844 Sec. 6.3
Verified
07 Nov 2026
Axioms
none listed
Built on 1
  • nonadaptive_mst_expected_costThe expected query cost of a non-adaptive querying order π on a finite graph G with decidable adjacency and edge probabilities p is the…

Read back from the Lean

nonadaptive_mst_opt_cost defines the optimal non-adaptive expected cost for finding a minimum spanning tree on a simple graph G on a finite vertex type V (with decidable equality and adjacency) with edge probabilities p : G.edgeSet → ℝ. Specifically, it is defined as the infimum (sInf) in ℝ of the set of costs c : ℝ such that there exists a list π : List G.edgeSet that is a permutation of (Finset.univ : Finset G.edgeSet).toList and c = nonadaptive_mst_expected_cost G p π.

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 optimal expected query cost among all permutations of edges of G. -/
noncomputable def nonadaptive_mst_opt_cost {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (p : G.edgeSet → ℝ) : ℝ := sInf {c : ℝ | ∃ π : List G.edgeSet, π.Perm (Finset.univ : Finset G.edgeSet).toList ∧ c = nonadaptive_mst_expected_cost G p π}
See it in the graphDiscuss this resultChallenge it