agCyc4_check
theoremverified
Finite check for four strategies and five players.
Statement
theorem agCyc4_check : ∀ a b d e : Fin 6, a.val + b.val + d.val + e.val = 5 → ∃ i j : Fin 4,
0 < (![a.val, b.val, d.val, e.val] i) ∧
agCycV i (agSub ![a.val, b.val, d.val, e.val] i) + 2 ≤
agCycV j (agSub ![a.val, b.val, d.val, e.val] i)- Source
- step towards ag_two_exact / ag_three_lower / ag_four_lower (Computing Equilibria in Anonymous Games, FOCS 2007 (arXiv:0710.5582), concluding conjecture that s*lambda is a lower bound)
- Verified
- 06 Oct 2026
- Axioms
Quot.soundpropext- Built on 2
- Used by 1
- ag_four_lowerFour strategies: the lower bound sλ is attained. The 5-player, 4-strategy cyclic game is normalised and λ = 1/8-Lipschitz, yet has no pure…
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.
/-- Finite check for four strategies and five players. -/theorem agCyc4_check : ∀ a b d e : Fin 6, a.val + b.val + d.val + e.val = 5 → ∃ i j : Fin 4, 0 < (![a.val, b.val, d.val, e.val] i) ∧ agCycV i (agSub ![a.val, b.val, d.val, e.val] i) + 2 ≤ agCycV j (agSub ![a.val, b.val, d.val, e.val] i) := by decide