Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 4.5.2: by submodularity of G, the greatest optimal booking limit of class i is nonincreasing in the booking level of any other class j

Proved
RevenueManagement.joint_overbooking_limits_monotone

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

monotone-comparative-staticsoperations-researchoverbookingrevenue-managementsubmodularity

In the substitutable-capacity model with nonnegative capacities and Poisson show demands with means qjxjq_j x_jqj​xj​, qj≥0q_j \ge 0qj​≥0: for classes i≠ji \ne ji=j and any levels xxx, the greatest optimal booking limit of class iii when class jjj is held one unit higher, at xj+1x_j + 1xj​+1, is at most the greatest optimal booking limit of class iii at xxx (in N∪{∞}\mathbb N \cup \{\infty\}N∪{∞}). This is the consequence of Proposition 4.4 that the book draws in the paragraph following it.

Preamble
import Definitions.Def_RevenueManagement_overbooking
Formal statement
namespace RevenueManagement

theorem joint_overbooking_limits_monotone {n m : ℕ} (h : Fin n → Fin (m + 1) → ℝ)
    (Cap : Fin (m + 1) → ℝ) (hCap : ∀ i, 0 ≤ Cap i) (p s q : Fin n → ℝ) (hq : ∀ j, 0 ≤ q j)
    (y x : Fin n → ℕ) (i j : Fin n) (hij : i ≠ j) :
    jointLimit h Cap p s q y (x + Pi.single j 1) i ≤ jointLimit h Cap p s q y x i := 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, p. 164, the paragraph after Proposition 4.4 ('The submodularity property implies that the optimal booking limit for class j is nonincreasing in the booking limit for any other class i ≠ j')
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