Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 4, (ii) — at an interior efficient point the payoff gradients are linearly dependent

Proved
Dubey1986.Inefficiency.eff_interior_mem_Estar

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

first-order-conditionsgame-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pareto-efficiency

Let n≥2n\ge2n≥2, k(i)≥1k(i)\ge1k(i)≥1, let Vi⊇SiV^i\supseteq S^iVi⊇Si be open, and let u∈(U)nu\in(U)^nu∈(U)n be a game. If sss is an efficient point of uuu and every sis^isi lies in the interior of SiS^iSi, then

Du(s)∈E∗,D_u(s)\in E^*,Du​(s)∈E∗,

that is, the derivatives Du1(s),…,Dun(s)Du^1(s),\dots,Du^n(s)Du1(s),…,Dun(s) are linearly dependent.

This is step (ii) of the proof, the necessary condition for Pareto optimality pointed out by Smale; together with (i) it places interior efficient Nash equilibria in Du−1(N∗∩E∗)D_u^{-1}(N^*\cap E^*)Du−1​(N∗∩E∗).

Formalization Note The interiority of every sis^isi is the standing case assumption of the first part of the proof (p. 3). Only this direction of the Appendix's characterization is used and stated.

Preamble
import Mathlib
import Definitions.Def_Dubey1986_Inefficiency_Setting
import Definitions.Def_Dubey1986_Inefficiency_Derivative
Formal statement
namespace Dubey1986.Inefficiency

theorem eff_interior_mem_Estar {n : ℕ} (hn : 2 ≤ n) (k : Fin n → ℕ) (hk : ∀ i, 1 ≤ k i)
    (V : ∀ i, Set (Fin (k i) → ℝ)) (hVo : ∀ i, IsOpen (V i))
    (hSV : ∀ i, simplex (k i) ⊆ V i) (u : Fin n → Strat k → ℝ) (hu : IsGame V u)
    (s : Strat k) (hint : ∀ i, s i ∈ interior (simplex (k i))) (hs : s ∈ EffSet u) :
    Dmap u s ∈ Estar k := by sorry

end Dubey1986.Inefficiency
Source
Dubey, Inefficiency of Nash Equilibria, IIASA WP-83-74 (July 1983), p. 4, display (ii) (under the case assumption of p. 3, Proof, first sentence)
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