stochastic_mst_priority_cost
For a simple graph G on a finite vertex type V with decidable adjacency and p : Sym2 V → ℝ, P(G,p) is the infimum (sInf in ℝ) of the set of values stochastic_mst_priority_cost_aux G p pi (G.edgeFinset.card) ∅ ∅ over all lists pi that are permutations (List.Perm) of G.edgeFinset.toList: the least expected number of queries of a fixed-priority strategy.
Statement
noncomputable def stochastic_mst_priority_cost {V : Type*} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] (p : Sym2 V → ℝ) : ℝ
- Defined in
- arXiv:2610.40844 (Stochastic Minimum Spanning Tree Identification with Binary Weights), Sec. 3, ExecuteTutteStrategy(pi); minimizing over pi is the quantity of open problem OP-1209
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- stochastic_mst_priority_cost_auxFor a simple graph G on a finite vertex type V with decidable adjacency, p : Sym2 V → ℝ and a list pi of edges (List (Sym2 V)), the…
- Used by 1
- stochastic_mst_adaptive_cost_le_priority_costFor every finite simple graph G and every p with 0 <= p_e <= 1 on the edges, A(G,p) <= P(G,p): every fixed-priority strategy is an…
Read back from the Lean
Given a finite vertex type V, a simple graph G on V with decidable adjacency, and an edge weighting/probability function p : Sym2 V → ℝ, stochastic_mst_priority_cost G p is the real number defined as the infimum (sInf) over all permutations π : List (Sym2 V) of the edge list G.edgeFinset.toList of the value stochastic_mst_priority_cost_aux G p π G.edgeFinset.card ∅ ∅.
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
noncomputable def stochastic_mst_priority_cost {V : Type*} [Fintype V] (G : SimpleGraph V) [DecidableRel G.Adj] (p : Sym2 V → ℝ) : ℝ := sInf {x : ℝ | ∃ π : List (Sym2 V), π.Perm G.edgeFinset.toList ∧ x = stochastic_mst_priority_cost_aux G p π G.edgeFinset.card ∅ ∅}