agMP_u_eq
theoremverified
The rational payoff of matching pennies equals its integer payoff table agMPv.
Statement
theorem agMP_u_eq (p i : Fin 2) (y : Fin 2 → ℕ) : agMP.u p i y = (agMPv p i y : ℚ)- 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
Classical.choiceQuot.soundpropext- Built on 2
- Used by 1
- agMP_no_pureNEIn matching pennies every pure profile leaves a player with regret 1 = 2λ.
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 agMP_u_eq (p i : Fin 2) (y : Fin 2 → ℕ) : agMP.u p i y = (agMPv p i y : ℚ) := by simp only [agMP, agMPv] split_ifs <;> simp