Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 15 — the balanced demand and supply of each platform in Case P and Case F (4.2)–(4.7)

Proved
CongestedPlatforms.Surge.lemma_1

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

balanced-demandcongestionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1two-sided-platform

Fix λ>0\lambda>0λ>0, γ>0\gamma>0γ>0, α∈(0,1]\alpha\in(0,1]α∈(0,1], c≥0c\ge0c≥0 and prices p0,p1<1p_0,p_1<1p0​,p1​<1 with positive driver margins xi=αpi−c>0x_i=\alpha p_i-c>0xi​=αpi​−c>0. Demands did_idi​ and supplies sis_isi​ are balanced when they reproduce themselves through the utilization ρi=di/si\rho_i=d_i/s_iρi​=di​/si​: drivers enter until si=(αpi−c)ρis_i=(\alpha p_i-c)\rho_isi​=(αpi​−c)ρi​ (3.5), and customers choose according to (3.1).

  1. Case P (partially covered market). The positive solutions of
d0=λ(1−p0−γρ02),d1=λ(1−p1−γρ12),si=(αpi−c)ρi(i=0,1)d_0=\lambda(1-p_0-\gamma\rho_0^2),\quad d_1=\lambda(1-p_1-\gamma\rho_1^2),\quad s_i=(\alpha p_i-c)\rho_i\quad(i=0,1)d0​=λ(1−p0​−γρ02​),d1​=λ(1−p1​−γρ12​),si​=(αpi​−c)ρi​(i=0,1)

— displays (3.2a), (3.2b), (3.5) — are exactly di=diP(pi)d_i=d^P_i(p_i)di​=diP​(pi​), si=siP(pi)s_i=s^P_i(p_i)si​=siP​(pi​) of (4.3), (4.6). 2. At this solution, the location v‾d=1−p0−γρ02\underline v_d=1-p_0-\gamma\rho_0^2v​d​=1−p0​−γρ02​ of the customer indifferent between platform 0 and the outside option and the location vˉd=p1+γρ12\bar v_d=p_1+\gamma\rho_1^2vˉd​=p1​+γρ12​ of the one indifferent between platform 1 and the outside option satisfy

v‾d≤vˉd  ⟺  d0P(p0)+d1P(p1)≤λ,\underline v_d\le\bar v_d\iff d^P_0(p_0)+d^P_1(p_1)\le\lambda,v​d​≤vˉd​⟺d0P​(p0​)+d1P​(p1​)≤λ,

which is the Case P condition of (4.2), (4.5). 3. Case F (fully covered market). The positive solutions of

d0=12λ[1−p0+p1−γ(ρ02−ρ12)],d1=12λ[1−p1+p0−γ(ρ12−ρ02)],si=(αpi−c)ρid_0=\tfrac12\lambda[1-p_0+p_1-\gamma(\rho_0^2-\rho_1^2)],\quad d_1=\tfrac12\lambda[1-p_1+p_0-\gamma(\rho_1^2-\rho_0^2)],\quad s_i=(\alpha p_i-c)\rho_id0​=21​λ[1−p0​+p1​−γ(ρ02​−ρ12​)],d1​=21​λ[1−p1​+p0​−γ(ρ12​−ρ02​)],si​=(αpi​−c)ρi​

— displays (3.3a), (3.3b), (3.5) — are exactly d0=d0F(p0,p1)d_0=d^F_0(p_0,p_1)d0​=d0F​(p0​,p1​), d1=d1F(p1,p0)d_1=d^F_1(p_1,p_0)d1​=d1F​(p1​,p0​), s0=s0F(p0,p1)s_0=s^F_0(p_0,p_1)s0​=s0F​(p0​,p1​), s1=s1F(p1,p0)s_1=s^F_1(p_1,p_0)s1​=s1F​(p1​,p0​) of (4.4), (4.7).

This is what justifies the closed forms of balanced demand DiD_iDi​ and supply SiS_iSi​ used throughout the mission: they are the fixed points of the two congestion feedback loops.

Formalization Note ρi\rho_iρi​ is written out as di/sid_i/s_idi​/si​. The hypotheses αpi−c>0\alpha p_i-c>0αpi​−c>0 and pi<1p_i<1pi​<1 describe where the utilization is defined and demand is positive.

Differences from the source:

  • reading: "the balanced demand … is given by (4.2) … the corresponding balanced supply … by (4.5)" → in each case the closed forms are the unique positive solution of the balance system (3.2)/(3.3) with (3.5) and ρi=di/si\rho_i=d_i/s_iρi​=di​/si​, and the Case P solution satisfies v‾d≤vˉd\underline v_d\le\bar v_dv​d​≤vˉd​ iff d0P+d1P≤λd^P_0+d^P_1\le\lambdad0P​+d1P​≤λ; reason: this is what the proof (Online Supplement p. 1) establishes; DiD_iDi​, SiS_iSi​ themselves are defined by (4.2)–(4.7) in the Setting.
  • encoding: prices in [p‾,pˉ][\underline p,\bar p][p​,pˉ​] → αpi−c>0\alpha p_i-c>0αpi​−c>0 and pi<1p_i<1pi​<1; reason: excludes only the endpoints where demand or supply vanish and ρi=di/si\rho_i=d_i/s_iρi​=di​/si​ is undefined.
Preamble
import Mathlib
import Definitions.Def_CongestedPlatforms_Surge_Setting
Formal statement
namespace CongestedPlatforms.Surge

theorem lemma_1 (lam γ α c p0 p1 : ℝ) (hlam : 0 < lam) (hγ : 0 < γ) (hα : 0 < α) (hα1 : α ≤ 1)
    (hc : 0 ≤ c) (hx0 : 0 < α * p0 - c) (hx1 : 0 < α * p1 - c) (hp0 : p0 < 1) (hp1 : p1 < 1) :
    (∀ d0 d1 s0 s1 : ℝ, 0 < d0 → 0 < d1 → 0 < s0 → 0 < s1 →
      ((d0 = lam * (1 - p0 - γ * (d0 / s0) ^ 2) ∧ d1 = lam * (1 - p1 - γ * (d1 / s1) ^ 2) ∧
          s0 = (α * p0 - c) * (d0 / s0) ∧ s1 = (α * p1 - c) * (d1 / s1)) ↔
        (d0 = dP lam γ α c p0 ∧ d1 = dP lam γ α c p1 ∧
          s0 = sP lam γ α c p0 ∧ s1 = sP lam γ α c p1))) ∧
    (1 - p0 - γ * (dP lam γ α c p0 / sP lam γ α c p0) ^ 2 ≤
        p1 + γ * (dP lam γ α c p1 / sP lam γ α c p1) ^ 2 ↔
      dP lam γ α c p0 + dP lam γ α c p1 ≤ lam) ∧
    (∀ d0 d1 s0 s1 : ℝ, 0 < d0 → 0 < d1 → 0 < s0 → 0 < s1 →
      ((d0 = 1 / 2 * lam * (1 - p0 + p1 - γ * ((d0 / s0) ^ 2 - (d1 / s1) ^ 2)) ∧
          d1 = 1 / 2 * lam * (1 - p1 + p0 - γ * ((d1 / s1) ^ 2 - (d0 / s0) ^ 2)) ∧
          s0 = (α * p0 - c) * (d0 / s0) ∧ s1 = (α * p1 - c) * (d1 / s1)) ↔
        (d0 = dF lam γ α c p0 p1 ∧ d1 = dF lam γ α c p1 p0 ∧
          s0 = sF lam γ α c p0 p1 ∧ s1 = sF lam γ α c p1 p0))) := by sorry

end CongestedPlatforms.Surge
Source
Bernstein, DeCroix, Keskin, Competition between Two-Sided Platforms under Demand and Supply Congestion Effects, SSRN 3250224, version of September 16, 2019, p. 15, Lemma 1, (4.2)–(4.7); systems (3.2a)–(3.3b), (3.5), pp. 11–13; proof: Online Supplement, p. 1 (PDF 33)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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