AFTD Auto-Formalizing Theoretical Domains

poc8_val

def

The total u-value of the vertex set selected by P, computed by a fold.

Statement

def poc8_val (P : Fin 8 → Bool) : ℕ
Source
step towards poc_linkedness_conjecture_counterexample (counterexample to arXiv:1908.05433, Conjecture 3.10; kernel-checked certificate)
Verified
06 Oct 2026
Axioms
none listed
Built on 1
  • poc8_uThe valuation u = (5, 5, 5, 1, 1, 1, 12, 0) on the eight vertices.
Used by 3
  • poc8_gmms_okCheck for a bipartition (P, not P): 8 times the smaller part value is below 105 = 7·15, or one of the two parts is disconnected.
  • poc_linkedness_conjecture_counterexampleCounterexample to arXiv:1908.05433 Conjecture 3.10 for two agents: there is a graph G on 8 vertices that is (2,3)-linked but not…
  • poc8_val_eqThe folded value agrees with the real sum of u over the selected vertices.

Lean source view module on GitHub

/-- Total `u`-value of the vertices selected by `P`. -/
def poc8_val (P : Fin 8 → Bool) : ℕ :=
  (List.finRange 8).foldr (fun v acc => (if P v then poc8_u v else 0) + acc) 0
See it in the graphDiscuss this resultChallenge it