Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 6, ¶2 — the Theorem for interior points: generically, interior N.E. are finite and none is efficient

Proved
Dubey1986.Inefficiency.main_theorem_interior

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

game-theorygenericitynash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pareto-efficiency

Let n≥2n\ge2n≥2, k(i)≥1k(i)\ge1k(i)≥1, and let Vi⊇SiV^i\supseteq S^iVi⊇Si be open. There is an open dense set U∗U^*U∗ of (U)n(U)^n(U)n such that for every u∈U∗u\in U^*u∈U∗:

  1. the Nash equilibria sss of uuu with every sis^isi in the interior of SiS^iSi are finite in number;
  2. no Nash equilibrium of uuu that is also efficient has all of its components sis^isi in the interior of SiS^iSi.

This is the conclusion of the first part of the proof, "the proof of the theorem for s∈Int⁡S1×⋯×Int⁡Sns\in\operatorname{Int}S^1\times\dots\times\operatorname{Int}S^ns∈IntS1×⋯×IntSn". The boundary case (faces of the simplices and subgames) then gives the full Theorem.

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

theorem main_theorem_interior {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) :
    ∃ Ustar : Set (Fin n → Strat k → ℝ), IsOpenDense V Ustar ∧ ∀ u ∈ Ustar,
      {s | s ∈ NashSet u ∧ ∀ i, s i ∈ interior (simplex (k i))}.Finite ∧
      ∀ s ∈ NashSet u ∩ EffSet u, ¬ ∀ i, s i ∈ interior (simplex (k i)) := by sorry

end Dubey1986.Inefficiency
Source
Dubey, Inefficiency of Nash Equilibria, IIASA WP-83-74 (July 1983), p. 6, second paragraph
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