Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§2.1, p. 8 — three equilibria between threshold prices, two at a threshold

Proved
NetExtDominance.Introspective.three_equilibria

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

inverse-demandmultiple-equilibrianetwork-externalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In a market with In/Out inverse demand, fix pmin⁡≤p≤pmax⁡p_{\min}\le p\le p_{\max}pmin​≤p≤pmax​. Each of the three branches of PPP has exactly one intersection with the price ppp, denoted qoutq_{\mathrm{out}}qout​, qmidq_{\mathrm{mid}}qmid​, and qinq_{\mathrm{in}}qin​. These intersections exhaust the equilibrium quantities:

D(p,q)=q⟺q∈{qout,qmid,qin}(q∈[0,1]).D(p,q)=q\quad\Longleftrightarrow\quad q\in\{q_{\mathrm{out}},q_{\mathrm{mid}},q_{\mathrm{in}}\}\qquad(q\in[0,1]).D(p,q)=q⟺q∈{qout​,qmid​,qin​}(q∈[0,1]).

For pmin⁡<p<pmax⁡p_{\min}<p<p_{\max}pmin​<p<pmax​ they satisfy qout<qmid<qinq_{\mathrm{out}}<q_{\mathrm{mid}}<q_{\mathrm{in}}qout​<qmid​<qin​. At p=pmin⁡p=p_{\min}p=pmin​ the out and middle intersections coincide and the in intersection is larger; at p=pmax⁡p=p_{\max}p=pmax​ the middle and in intersections coincide and the out intersection is smaller. Thus the boundary prices have two distinct equilibrium quantities.

This result supplies the branch quantities used by Proposition 1 and rules out other feasible fixed points.

Formalization Note Branch intersections are predicates on closed intervals, so the repeated equilibrium at a threshold belongs to two branches. Continuity of PPP is not assumed separately; it must follow from the market assumptions.

Preamble
import Mathlib
import Definitions.Def_NetExtDominance_Introspective_Setting
Formal statement
namespace NetExtDominance.Introspective

/-- §2.1: the three branches exhaust all equilibrium quantities, with two
distinct quantities at either threshold. -/
theorem three_equilibria
    (M : Market) (QL QH : ℝ) (hIO : IsInOut M.P QL QH)
    (p : ℝ) (hp1 : pmin M.P QL ≤ p) (hp2 : p ≤ pmax M.P QH) :
    (∃! q, IsQout M.P QL p q) ∧
      (∃! q, IsQmid M.P QL QH p q) ∧
      (∃! q, IsQin M.P QH p q) ∧
      ∀ qo qm qi,
        IsQout M.P QL p qo →
        IsQmid M.P QL QH p qm →
        IsQin M.P QH p qi →
        (∀ q, IsEquilibriumQty M p q ↔ (q = qo ∨ q = qm ∨ q = qi)) ∧
        (pmin M.P QL < p → p < pmax M.P QH → qo < qm ∧ qm < qi) ∧
        (p = pmin M.P QL → qo = qm ∧ qm < qi) ∧
        (p = pmax M.P QH → qo < qm ∧ qm = qi) := by sorry

end NetExtDominance.Introspective
Source
Akerlof, Holden & Rayo, Network Externalities and Market Dominance, author's accepted manuscript (WRAP 178238, dated September 16, 2022), p. 8, §2.1, opening paragraph; http://wrap.warwick.ac.uk/178238
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

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