agCyc3_check
theoremverified
Finite check for three strategies and five players (totals a + b + d = 5).
Statement
theorem agCyc3_check : ∀ a b d : Fin 6, a.val + b.val + d.val = 5 → ∃ i j : Fin 3,
0 < (![a.val, b.val, d.val] i) ∧
agCycV i (agSub ![a.val, b.val, d.val] i) + 2 ≤ agCycV j (agSub ![a.val, b.val, d.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_three_lowerThree strategies: the lower bound exceeds sλ. The 5-player, 3-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 three strategies and five players (totals `a + b + d = 5`). -/theorem agCyc3_check : ∀ a b d : Fin 6, a.val + b.val + d.val = 5 → ∃ i j : Fin 3, 0 < (![a.val, b.val, d.val] i) ∧ agCycV i (agSub ![a.val, b.val, d.val] i) + 2 ≤ agCycV j (agSub ![a.val, b.val, d.val] i) := by decide