poc8_val_eq
theoremverified
The folded value agrees with the real sum of u over the selected vertices.
Statement
theorem poc8_val_eq (P : Fin 8 → Bool) : ((poc8_val P : ℕ) : ℝ) = ∑ v ∈ Finset.univ.filter (fun v => P v = true), (poc8_u v : ℝ)
- Source
- step towards poc_linkedness_conjecture_counterexample (counterexample to arXiv:1908.05433, Conjecture 3.10; kernel-checked certificate)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- Used by 1
- 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…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem poc8_val_eq (P : Fin 8 → Bool) : ((poc8_val P : ℕ) : ℝ) = ∑ v ∈ Finset.univ.filter (fun v => P v = true), (poc8_u v : ℝ) := by unfold poc8_val rw [Finset.sum_filter] simp [Fin.sum_univ_succ, List.finRange_succ]