Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Proposition 1, p. 10 — convergence to the unique equilibrium from every impulse

Proved
NetExtDominance.Introspective.converge_outside

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

equilibrium-selectionmonotone-dynamicsnetwork-externalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In a market with In/Out inverse demand, suppose p>pmax⁡p>p_{\max}p>pmax​ or p<pmin⁡p<p_{\min}p<pmin​, and let q∈[0,1]q\in[0,1]q∈[0,1] be an equilibrium quantity, D(p,q)=qD(p,q)=qD(p,q)=q. Every impulse I0∈[0,1]I_0\in[0,1]I0​∈[0,1] produces level-kkk consumption converging to qqq:

D(p,⋅)∘k(I0)⟶q(k→∞).D(p,\cdot)^{\circ k}(I_0)\longrightarrow q\qquad(k\to\infty).D(p,⋅)∘k(I0​)⟶q(k→∞).

With uniqueness of the equilibrium quantity, this establishes impulse independence outside the threshold interval.

Formalization Note The equilibrium hypothesis refers to aggregate demand, including saturated quantities at 000 and 111.

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

/-- Proof of Proposition 1, second paragraph: every admissible impulse
converges to the unique equilibrium outside the threshold prices. -/
theorem converge_outside
    (M : Market) (QL QH : ℝ) (hIO : IsInOut M.P QL QH)
    (p : ℝ) (hp : pmax M.P QH < p ∨ p < pmin M.P QL)
    (q : ℝ) (hq : IsEquilibriumQty M p q)
    (I0 : ℝ) (hI0 : I0 ∈ Set.Icc (0 : ℝ) 1) :
    IsIntrospectiveEq M p I0 q := 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. 10, proof of Proposition 1, second 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