Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 21, p. 48 — t_i = max_l ((Σ_{j≤l} z_ij) − 1)/l for the sorted vector z_i

Proved
FixpNash.DivFree.threshold_eq_sup_prefix

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

fixed-pointnash-equilibriump2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1simplex

Fix a finite game, a real vector xxx, and a player iii with ni≥1n_i\ge 1ni​≥1 pure strategies. Let yi=(hij(x))j∈Siy_i=(h_{ij}(x))_{j\in S_i}yi​=(hij​(x))j∈Si​​ and let zi=(zi1,…,zini)z_i=(z_{i1},\dots,z_{in_i})zi​=(zi1​,…,zini​​) be yiy_iyi​ sorted in decreasing order, zi1≥zi2≥⋯≥ziniz_{i1}\ge z_{i2}\ge\dots\ge z_{in_i}zi1​≥zi2​≥⋯≥zini​​. Then the threshold tit_iti​ (the unique solution of fi,x(t)=1f_{i,x}(t)=1fi,x​(t)=1) is

ti=max⁡{1l(∑j=1lzij−1) : l=1,…,ni}.t_i=\max\Bigl\{\tfrac1l\Bigl(\sum_{j=1}^{l}z_{ij}-1\Bigr)\ :\ l=1,\dots,n_i\Bigr\}.ti​=max{l1​(j=1∑l​zij​−1) : l=1,…,ni​}.

This closed form is what lets GIG_IGI​ be computed by a circuit with gates +,−,∗,max⁡,min⁡+,-,*,\max,\min+,−,∗,max,min and rational constants only (Lemma 21): a sorting network produces ziz_izi​, and the divisions are by the integer constants lll.

Formalization Note. The sorted order is given by a bijection e:{0,…,n}→Sie:\{0,\dots,n\}\to S_ie:{0,…,n}→Si​ (so ni=n+1n_i=n+1ni​=n+1) along which hi,e(l)(x)h_{i,e(l)}(x)hi,e(l)​(x) is nonincreasing; the 0-based index lll corresponds to the paper's l+1l+1l+1, hence the denominator l+1l+1l+1 and the prefix {0,…,l}\{0,\dots,l\}{0,…,l}. The statement holds for every real vector xxx.

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 21, p. 48: if `e` lists the `n + 1` strategies of player `i` so that
`zₗ = hᵢ,e(l)(x)` is decreasing in `l`, then
`tᵢ = max_{l = 1, …, n+1} ((∑_{k ≤ l} z_k) − 1) / l` (indices shifted to `Fin (n + 1)`).
Holds for every real vector `x`. -/
theorem threshold_eq_sup_prefix {ι : Type*} [Fintype ι] [DecidableEq ι]
    {S : ι → Type*} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
    (u : ι → (∀ i, S i) → ℝ)
    (x : ∀ i, S i → ℝ) (i : ι) (n : ℕ) (e : Fin (n + 1) ≃ S i)
    (hz : Antitone (fun l : Fin (n + 1) => hVal u x i (e l))) :
    threshold u x i =
      Finset.univ.sup' Finset.univ_nonempty (fun l : Fin (n + 1) =>
        ((∑ k ∈ Finset.Iic l, hVal u x i (e k)) - 1) / ((l : ℕ) + 1 : ℝ)) := 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 21, p. 48
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