Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2, p. 87 — with semigroup survivals, G(u) of (2) is componentwise concave in each uᵢ and submodular in u

Proved
SubstOverbooking.Structure.theorem2_concave_submodular

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

concavityoverbookingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semigroupsubmodularity

Consider the overbooking model with nnn reservation classes, revenues rir_iri​ and refunds qi≤riq_i \le r_iqi​≤ri​, reservations on hand xix_ixi​, net benefits aija_{ij}aij​ and capacities cj≥0c_j \ge 0cj​≥0 for the real inventory classes j=1,…,mj = 1, \dots, mj=1,…,m. Suppose that for every class iii the survivals {Zi(ui)}\{Z_i(u_i)\}{Zi​(ui​)} have the semigroup property, with finite means, on a parameter set P⊆[0,∞)P \subseteq [0, \infty)P⊆[0,∞) (containing 000, closed under addition and nonnegative differences), and that Z1(u1),…,Zn(un)Z_1(u_1), \dots, Z_n(u_n)Z1​(u1​),…,Zn​(un​) are independent. Let GGG be the expected net revenue (2). Then:

  1. componentwise concavity (6): for every u∈Pnu \in P^nu∈Pn, every class iii and all ε,α∈P\varepsilon, \alpha \in Pε,α∈P,
G(u+(ε+α)ei)−G(u+αei)≤G(u+εei)−G(u);G(u + (\varepsilon + \alpha) e_i) - G(u + \alpha e_i) \le G(u + \varepsilon e_i) - G(u);G(u+(ε+α)ei​)−G(u+αei​)≤G(u+εei​)−G(u);
  1. submodularity: for all u,u′∈Pnu, u' \in P^nu,u′∈Pn,
G(u∨u′)+G(u∧u′)≤G(u)+G(u′).G(u \vee u') + G(u \wedge u') \le G(u) + G(u').G(u∨u′)+G(u∧u′)≤G(u)+G(u′).

Componentwise concavity yields critical booking levels for each class, and submodularity says these levels are nonincreasing in the bookings accepted for other classes.

Formalization Note. Concavity is stated in the increment form (6), which is what the paper proves and which makes sense on a discrete P=NP = \mathbb NP=N (binomial survivals) as well as on P=[0,∞)P = [0, \infty)P=[0,∞) (Poisson survivals). Submodularity is lattice submodularity on PnP^nPn via the platform SupermodularOn of −G-G−G. The paper proves the case n=2n = 2n=2 and states the extension is straightforward; the statement is for general nnn. The parameter set PPP is required to be closed under nonnegative differences as well as sums, so that for levels uk≤uk′u_k \le u'_kuk​≤uk′​ in PPP the increment uk′−uku'_k - u_kuk′​−uk​ is again a level and the semigroup property applies to it; the two cases of the paper, P=NP = \mathbb NP=N and P=[0,∞)P = [0, \infty)P=[0,∞), have this property.

Preamble
import Mathlib
import Definitions.Def_SubstOverbooking_Structure_Setting
import Definitions.Def_Supermodularity_Monotonicity_SupermodularOn
Formal statement
namespace SubstOverbooking.Structure

theorem theorem2_concave_submodular {n m : ℕ} (r q x : Fin n → ℝ) (hqr : ∀ i, q i ≤ r i)
    (a : Fin n → Fin (m + 1) → ℝ) (c : Fin (m + 1) → ℝ) (hc : ∀ j, j ≠ 0 → 0 ≤ c j)
    (P : Set ℝ) (hP : IsParamSet P) (L : Fin n → ℝ → PMF ℕ)
    (hL : ∀ i, IsSemigroupFamily P (L i)) :
    (∀ u : Fin n → ℝ, (∀ k, u k ∈ P) → ∀ i : Fin n, ∀ ε ∈ P, ∀ α ∈ P,
      G r q x a c L (Function.update u i (u i + ε + α)) - G r q x a c L (Function.update u i (u i + α))
        ≤ G r q x a c L (Function.update u i (u i + ε)) - G r q x a c L u) ∧
    Supermodularity.Monotonicity.SupermodularOn (fun u => - G r q x a c L u)
      {u : Fin n → ℝ | ∀ k, u k ∈ P} := by sorry

end SubstOverbooking.Structure
Source
Karaesmen & van Ryzin, Overbooking with Substitutable Inventory Classes, Operations Research 52(1):83–104 (2004), p. 87, Theorem 2; proof pp. 87–88, (6)–(8)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me