Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 20, p. 47 — at a Nash equilibrium, t_i = r_i = u_i(x)

Proved
FixpNash.DivFree.threshold_eq_expectedPayoff

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

fixed-pointgame-theorynash-equilibriump2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a finite game in which every player has a nonempty set of pure strategies, and let xxx be a Nash equilibrium. Write ri=ui(x)r_i=u_i(x)ri​=ui​(x) for the expected payoff of player iii in xxx. Then for every player iii the threshold tit_iti​ of the map GIG_IGI​ at xxx equals rir_iri​:

ti=ri=ui(x).t_i=r_i=u_i(x).ti​=ri​=ui​(x).

This is the key step of the second half of the proof of Lemma 20: at an equilibrium xij=max⁡(xij+v(x)ij−ri,0)x_{ij}=\max(x_{ij}+v(x)_{ij}-r_i,0)xij​=max(xij​+v(x)ij​−ri​,0) for all i,ji,ji,j, hence fi,x(ri)=1f_{i,x}(r_i)=1fi,x​(ri​)=1, so rir_iri​ is the threshold, and GI(x)=xG_I(x)=xGI​(x)=x follows.

Formalization Note. tit_iti​ is the threshold of the definition file, the unique root of fi,x(t)=1f_{i,x}(t)=1fi,x​(t)=1. Every strategy set is assumed nonempty, the paper's tacit assumption.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_DGPNash_NashMap_nashMap
import Definitions.Def_FixpNash_DivFree_Map
Formal statement
namespace FixpNash.DivFree

/-- Proof of Lemma 20, p. 47: at a Nash equilibrium `x`, the threshold `tᵢ` equals
player `i`'s expected payoff `rᵢ = uᵢ(x)`. -/
theorem threshold_eq_expectedPayoff {ι : Type*} [Fintype ι] [DecidableEq ι]
    {S : ι → Type*} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
    (u : ι → (∀ i, S i) → ℝ)
    (hS : ∀ i, Nonempty (S i)) (x : ∀ i, S i → ℝ)
    (hNE : AGT.IsMixedNash u x) :
    ∀ i : ι, threshold u x i = AGT.expectedPayoff u x i := by sorry

end FixpNash.DivFree
Source
Etessami & Yannakakis, On the complexity of Nash equilibria and other fixed points, author manuscript (SIAM J. Comput. 39 (2010)), Section 4, proof of Lemma 20, p. 47
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