Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (10), p. 10 — the demand rate never exceeds the maximum market share times the market size, λ ≤ S̄Λ

Proved
DeliveryDisclosure.InfoEffort.eq_10

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

boundlogit-demandmarket-sharep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the standing assumptions, let ϕ∈[0,1]\phi\in[0,1]ϕ∈[0,1], and let (p,t)(p,t)(p,t) be a plan with p≥cp\ge cp≥c and t≥0t\ge 0t≥0. Then the demand rate is at most the maximum market share times the market size:

λ(p,t,ϕ)  ≤  Sˉ(ϕ) Λ,Sˉ(ϕ)=11+exp⁡[−(Vˉ−Ve)/ωθ(ϕ)],Vˉ=α−c+βrρ.\lambda(p,t,\phi)\;\le\;\bar S(\phi)\,\Lambda,\qquad \bar S(\phi)=\frac{1}{1+\exp[-(\bar V-V_e)/\omega_\theta(\phi)]},\quad \bar V=\alpha-c+\beta_r\rho.λ(p,t,ϕ)≤Sˉ(ϕ)Λ,Sˉ(ϕ)=1+exp[−(Vˉ−Ve​)/ωθ​(ϕ)]1​,Vˉ=α−c+βr​ρ.

The bound holds because V≤VˉV\le\bar VV≤Vˉ whenever p≥cp\ge cp≥c, q≤1q\le 1q≤1 and t≥0t\ge 0t≥0. It is what makes the capacity condition (16) meaningful: the queue is stable at every plan.

Formalization Note The page calls Vˉ\bar VVˉ a lower bound of VVV (p. 9); it is an upper bound, and eq. (10) uses it as such. The shortest delivery time is t‾=0\underline t=0t​=0.

Preamble
import Mathlib
import Definitions.Def_DeliveryDisclosure_InfoEffort_Model
Formal statement
namespace DeliveryDisclosure.InfoEffort

/-- Eq. (10), p. 10: at every plan with `p ≥ c` and `t ≥ 0` the demand rate is at most
the maximum share times the market size, `λ(p, t, ϕ) ≤ S̄ Λ`. -/
theorem eq_10 (P : Params) (hP : Standing P) (p t ϕ : ℝ) (hϕ : ϕ ∈ Set.Icc (0 : ℝ) 1)
    (hp : P.c ≤ p) (ht : 0 ≤ t) :
    dem P p t ϕ ≤ Sbar P ϕ * P.Λ := by sorry

end DeliveryDisclosure.InfoEffort
Source
Leng, Becerril-Arreola, Parlar & Ferguson, Disclosing Delivery Performance Information (authors' preprint, April 2nd, 2023), p. 10, eq. (10); V̄ from p. 9
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

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