Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 8.3.6 (Gale and Holmes): the optimal advance-purchase discount ŵ exceeds the optimal peak-load discount w₂ and earns at least as much, V_APD(ŵ) ≥ V_peak(w₂)

Proved
RevenueManagement.advance_purchase_beats_peak_load

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

advance-purchasemechanism-designoperations-researchpeak-load-pricingrevenue-management

In the two-flight monopoly of Sect. 8.3.6 with reservation price vvv, capacity CCC, peak share α∈(0,1)\alpha \in (0, 1)α∈(0,1) and waiting-cost distribution FFF with density fff, let w2w_2w2​ solve the peak-load first-order condition (8.13), (v−w)f(w)−F(w)=1/α−1(v - w)f(w) - F(w) = 1/\alpha - 1(v−w)f(w)−F(w)=1/α−1, and w^\hat ww^ the advance-purchase condition (8.15), (v−w)f(w)−F(w)=0(v - w)f(w) - F(w) = 0(v−w)f(w)−F(w)=0, with f>0f > 0f>0 and the marginal revenue (v−w)−F(w)/f(w)(v - w) - F(w)/f(w)(v−w)−F(w)/f(w) strictly decreasing on [0,wC][0, w_C][0,wC​] (the book's uniqueness assumption: the page prints "increasing", but its footnote 18 identifies it with the monotone marginal-revenue Assumption 7.2, which in the waiting cost w=v−uw = v - uw=v−u is decreasing), and let w^\hat ww^ maximize VAPDV_{APD}VAPD​ on [0,wC][0, w_C][0,wC​]. Then w2<w^w_2 < \hat ww2​<w^ and VAPD(w^)≥Vpeak(w2)V_{APD}(\hat w) \ge V_{peak}(w_2)VAPD​(w^)≥Vpeak​(w2​): advance-purchase discounts earn at least the revenue of peak-load pricing.

Preamble
import Definitions.Def_RevenueManagement_competition
Formal statement
namespace RevenueManagement

theorem advance_purchase_beats_peak_load (v C α wC : ℝ) (F f : ℝ → ℝ) (hα : 0 < α ∧ α < 1)
    (w2 wh : ℝ) (h2 : w2 ∈ Set.Icc 0 wC) (hw : wh ∈ Set.Icc 0 wC)
    (hf : ∀ w ∈ Set.Icc 0 wC, 0 < f w)
    (hψ : StrictAntiOn (fun w => (v - w) - F w / f w) (Set.Icc 0 wC))
    (h13 : (v - w2) * f w2 - F w2 = 1 / α - 1) (h15 : (v - wh) * f wh - F wh = 0)
    (hopt : ∀ w ∈ Set.Icc 0 wC, advancePurchaseRevenue v C α F w ≤ advancePurchaseRevenue v C α F wh) :
    w2 < wh ∧ peakLoadRevenue v C α F w2 ≤ advancePurchaseRevenue v C α F wh := by sorry

end RevenueManagement
Source
Kalyan T. Talluri and Garrett J. van Ryzin, The Theory and Practice of Revenue Management, Kluwer/Springer 2004, DOI 10.1007/b139000, pp. 373-374, Sect. 8.3.6, Eq. (8.13)-(8.15), and Appendix 8.A p. 404 (proof that V_APD(ŵ) ≥ V_peak(w2))
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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