maxcut_fair9_targets
def
Six explicit three-color profiles used as finite deviation targets.
Statement
def maxcut_fair9_targets : List (Fin 9 → Fin 3)- Source
- Related work: arXiv:2610.04948, Section 4, asks whether all unweighted Max-k-Cut games have a strong equilibrium; this finite obstruction to selecting a fair Nash equilibrium was discovered in experiment 12959 and independently checked in 12961, 12964 and 12973.
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Used by 2
- maxcut_fair9_normalized_certificatesFor every three-color profile on the nine-vertex graph whose first vertex has color zero, if all utilities are at least four and no…
- maxcut_fair9_no_strong_with_min_fourNo strong equilibrium of the nine-vertex graph with three colors gives every vertex utility at least four.
Lean source view module on GitHub
def maxcut_fair9_targets : List (Fin 9 → Fin 3) := let t1 : Fin 9 → Fin 3 := ![0,1,1,2,0,1,0,2,2] let t2 : Fin 9 → Fin 3 := ![0,1,1,2,1,2,0,2,0] let t3 : Fin 9 → Fin 3 := ![0,1,1,2,2,1,0,2,0] [t1, t2, t3, (fun v => Equiv.swap (1 : Fin 3) 2 (t1 v)), (fun v => Equiv.swap (1 : Fin 3) 2 (t2 v)), (fun v => Equiv.swap (1 : Fin 3) 2 (t3 v))]