Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. OA-5 — forward-looking equilibria ↔ pure-strategy Nash equilibria of G(m)

Proved
DataTrackComp.Surplus.lemma_2

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

data-trackingnash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1perfect-bayesian-equilibrium

Let uˉ>0\bar u>0uˉ>0 and m>0m>0m>0. A price pair (p1A,p1B)(p^A_1,p^B_1)(p1A​,p1B​) is a pure-strategy Nash equilibrium of the reduced game G(m)\mathbf G(m)G(m) if and only if there is a perfect Bayesian equilibrium of the forward-looking setting whose product-1 prices are (p1A,p1B)(p^A_1,p^B_1)(p1A​,p1B​):

(p1A,p1B)∈PSNE(G(m))  ⟺  ∃ forward-looking equilibrium with prices (p1A,p1B).(p^A_1,p^B_1)\in\mathrm{PSNE}(\mathbf G(m))\iff\exists\ \text{forward-looking equilibrium with prices }(p^A_1,p^B_1).(p1A​,p1B​)∈PSNE(G(m))⟺∃ forward-looking equilibrium with prices (p1A​,p1B​).

Both directions of the lemma are included. Through it, existence, uniqueness and every property of the forward-looking equilibrium prices reduce to the two-player game G(m)\mathbf G(m)G(m).

Preamble
import Mathlib
import Definitions.Def_DataTrackComp_Surplus_Game
import Definitions.Def_DataTrackComp_Surplus_ReducedGame
Formal statement
namespace DataTrackComp.Surplus

theorem lemma_2 (ubar m pA pB : ℝ) (hu : 0 < ubar) (hm : 0 < m) :
    IsPSNE m pA pB ↔ ∃ E : Assessment, IsEquilibrium .forward ubar m E ∧ E.pA = pA ∧ E.pB = pB := by sorry

end DataTrackComp.Surplus
Source
Bimpikis, Morgenstern & Saban, Data Tracking under Competition, authors' manuscript with online appendix (Operations Research, doi:10.1287/opre.2023.2489; PDF of 2023-05-04), p. OA-5 (PDF 40), Lemma 2
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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