poc8_gmms_check
theoremverified
Every bipartition (P, not P) of the eight vertices passes the bipartition check.
Statement
theorem poc8_gmms_check (P : Fin 8 → Bool) : poc8_gmms_ok P = true- 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
- poc8_gmms_check_allKernel check of the bipartition condition for all 256 Boolean membership vectors of the eight vertices.
- 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.
- 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_gmms_check (P : Fin 8 → Bool) : poc8_gmms_ok P = true := by have hP : P = ![P 0, P 1, P 2, P 3, P 4, P 5, P 6, P 7] := by funext x; fin_cases x <;> rfl rw [hP] exact poc8_gmms_check_all _ _ _ _ _ _ _ _