Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 3.20 — stability of Nash equilibria under graphon changes

Proved
GraphonGames.Stability.theorem_3_20_stability

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

graphon-gamenash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stability

Assume Assumptions 1, 4, and 5. Let www be a graphon with operator WWW satisfying cz∥W∥<1\sqrt{c_z}\|W\|<1cz​​∥W∥<1 and condition (17), and let α\alphaα be its Nash equilibrium. Let w′w'w′ be any graphon with operator W′W'W′ satisfying cz∥W′∥<1\sqrt{c_z}\|W'\|<1cz​​∥W′∥<1, and let α′\alpha'α′ be any Nash equilibrium for w′w'w′. Then

∥α−α′∥L2(I)≤κ∥W−W′∥,κ=c0ℓJ(1−cz∥W∥)(1−cz∥W∥)[ℓc(1−cz∥W∥)−ℓJcα∥W∥].\|\alpha-\alpha'\|_{L^2(I)}\leq\kappa\|W-W'\|,\qquad \kappa=\frac{c_0\ell_J(1-\sqrt{c_z}\|W\|)} {(1-\sqrt{c_z}\|W\|) [\ell_c(1-\sqrt{c_z}\|W\|)-\ell_J\sqrt{c_\alpha}\|W\|]}.∥α−α′∥L2(I)​≤κ∥W−W′∥,κ=(1−cz​​∥W∥)[ℓc​(1−cz​​∥W∥)−ℓJ​cα​​∥W∥]c0​ℓJ​(1−cz​​∥W∥)​.

This quantifies how much an equilibrium profile can move when the graphon changes. The coefficient uses the original graphon's operator norm and the paper's uncancelled expression.

Formalization Note The equilibrium predicate uses the equivalent third condition of Proposition 3.6 and includes an aggregate for each graphon. The first equilibrium is given as a witness; Proposition 3.17 provides its existence and uniqueness. No condition (17) is imposed on w′w'w′. The norm of W−W′W-W'W−W′ is the operator norm of w−w′w-w'w−w′, and the inequality is in extended nonnegative reals.

Preamble
import Mathlib
import Definitions.Def_GraphonGames_Stability_Setting

open MeasureTheory
open scoped ENNReal
Formal statement
namespace GraphonGames.Stability

theorem theorem_3_20_stability
    (b : ℝ → ℝ → ℝ) (f : ℝ → ℝ → ℝ → ℝ)
    (μ0 : Measure ℝ) (cα cz ℓc ℓJ c0 : ℝ)
    (h1 : GraphonGames.Existence.Asm1 b μ0 cα cz)
    (h4 : GraphonGames.Existence.Asm4 (GraphonGames.Existence.cost b f μ0) ℓc ℓJ)
    (h5 : GraphonGames.Existence.Asm5 b c0)
    (w w' : I → I → ℝ) (hw : IsGraphon w) (hw' : IsGraphon w')
    (hW : Real.sqrt cz * (opNorm w).toReal < 1)
    (h17 : ℓJ / ℓc *
      (Real.sqrt cα * (opNorm w).toReal /
        (1 - Real.sqrt cz * (opNorm w).toReal)) < 1)
    (hW' : Real.sqrt cz * (opNorm w').toReal < 1)
    (α α' : I → ℝ)
    (hα : IsNash w b f μ0 α) (hα' : IsNash w' b f μ0 α') :
    eLpNorm (α - α') 2 volume ≤
      ENNReal.ofReal
        (c0 * ℓJ * (1 - Real.sqrt cz * (opNorm w).toReal) /
          ((1 - Real.sqrt cz * (opNorm w).toReal) *
            (ℓc * (1 - Real.sqrt cz * (opNorm w).toReal) -
              ℓJ * Real.sqrt cα * (opNorm w).toReal))) *
        opNorm (w - w') := by sorry

end GraphonGames.Stability
Source
Carmona, Cooney, Graves & Laurière, Stochastic Graphon Games: I. The Static Case, arXiv:1911.10664v1, p. 17, Theorem 3.20
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me