Lemma 1, p. 15 — the balanced demand and supply of each platform in Case P and Case F (4.2)–(4.7)
ProvedCongestedPlatforms.Surge.lemma_1Fix , , , and prices with positive driver margins . Demands and supplies are balanced when they reproduce themselves through the utilization : drivers enter until (3.5), and customers choose according to (3.1).
- Case P (partially covered market). The positive solutions of
— displays (3.2a), (3.2b), (3.5) — are exactly , of (4.3), (4.6). 2. At this solution, the location of the customer indifferent between platform 0 and the outside option and the location of the one indifferent between platform 1 and the outside option satisfy
which is the Case P condition of (4.2), (4.5). 3. Case F (fully covered market). The positive solutions of
— displays (3.3a), (3.3b), (3.5) — are exactly , , , of (4.4), (4.7).
This is what justifies the closed forms of balanced demand and supply used throughout the mission: they are the fixed points of the two congestion feedback loops.
Formalization Note is written out as . The hypotheses and 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 , and the Case P solution satisfies iff ; reason: this is what the proof (Online Supplement p. 1) establishes; , themselves are defined by (4.2)–(4.7) in the Setting.
- encoding: prices in → and ; reason: excludes only the endpoints where demand or supply vanish and is undefined.
import Mathlib import Definitions.Def_CongestedPlatforms_Surge_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.