Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 7, p. 26 — if α≠0\alpha \ne 0α=0, every Nash equilibrium of GfG_fGf​ has x3(j)=1/(m+1)x_3(j) = 1/(m+1)x3​(j)=1/(m+1)

Proved
FixpNash.Bubelis.aux3_uniform

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

game-theorynash-equilibriump2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f(x)=c0xm+⋯+cmf(x) = c_0 x^m + \dots + c_mf(x)=c0​xm+⋯+cm​ be a real polynomial with f(0)≤0f(0) \le 0f(0)≤0 and f(1)≥0f(1) \ge 0f(1)≥0 which has a unique root α\alphaα in [0,1][0,1][0,1], and let GfG_fGf​ be the gadget of Lemma 7. Suppose α≠0\alpha \neq 0α=0. Then in every mixed Nash equilibrium x=(x1,x2,x3)x = (x_1, x_2, x_3)x=(x1​,x2​,x3​) of GfG_fGf​ the auxiliary player 3 plays the uniform strategy:

x3(j)=1m+1,j=0,…,m.x_3(j) = \frac{1}{m+1}, \qquad j = 0, \dots, m .x3​(j)=m+11​,j=0,…,m.

Together with the strategies of players 1 and 2 forced earlier in the proof, this determines the whole equilibrium, which is the uniqueness half of Lemma 7.

Formalization Note The root α\alphaα is a named parameter with the hypothesis 0≤α≤10 \le \alpha \le 10≤α≤1, f(α)=0f(\alpha) = 0f(α)=0, and β=α\beta = \alphaβ=α for every root β∈[0,1]\beta \in [0,1]β∈[0,1] of fff.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_FixpNash_Bubelis_Gadget
Formal statement
namespace FixpNash.Bubelis

/-- Proof of Lemma 7, p. 26: let `f` satisfy `f(0) ≤ 0`, `f(1) ≥ 0` and have the unique root `α`
in `[0, 1]`. If `α ≠ 0`, then in every Nash equilibrium `x` of the gadget `G_f` player 3 plays
the uniform strategy `x₃(j) = 1/(m + 1)`, `j = 0, …, m`. -/
theorem aux3_uniform {m : ℕ} (c : Fin (m + 1) → ℝ)
    (hf0 : poly c 0 ≤ 0) (hf1 : 0 ≤ poly c 1) (α : ℝ)
    (hα : 0 ≤ α ∧ α ≤ 1 ∧ poly c α = 0 ∧
      ∀ β : ℝ, 0 ≤ β → β ≤ 1 → poly c β = 0 → β = α)
    (hα0 : α ≠ 0) (x : ∀ p, Strat m p → ℝ) (hx : AGT.IsMixedNash (gadget c) x)
    (j : Fin (m + 1)) :
    x .aux3 j = 1 / ((m : ℝ) + 1) := by sorry

end FixpNash.Bubelis
Source
Etessami & Yannakakis, On the complexity of Nash equilibria and other fixed points, author manuscript (SIAM J. Comput. 39 (2010)), proof of Lemma 7, p. 26
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me