Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (6.1)-(6.2) — EMSR(S) is non-increasing in S

Proved
SeatInventory.Distinct.emsr_antitone

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

emsrp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-bookp2o-v1revenue-managementseat-inventory-control

Let a fare class have average fare f≥0f \ge 0f≥0 and integer-valued requests rrr. Then the tail probability Pˉ(S)=P[r≥S]\bar P(S) = P[r \ge S]Pˉ(S)=P[r≥S] is a non-increasing function of SSS, and so is the expected marginal seat revenue

EMSR(S)=Pˉ(S)⋅f.\mathrm{EMSR}(S) = \bar P(S)\cdot f .EMSR(S)=Pˉ(S)⋅f.

Monotonicity of the marginal values is what makes allocating seats one at a time, always to the largest remaining marginal value, revenue-maximising.

Formalization Note The thesis says "decreasing"; its justification (point probabilities are nonnegative) gives only non-increasing, and strict decrease is false when rrr is bounded, so the statement is Antitone. Nonnegativity of the fare is required for the EMSR part and is a standing convention of the model (a fare is a price received).

Preamble
import Mathlib
import Definitions.Def_SeatInventory_Distinct_DemandModel
Formal statement
namespace SeatInventory.Distinct

/-- Belobaba 1987, Eqs. (6.1)–(6.2), p. 142: `P̄(S) = P[r ≥ S]` is non-increasing in `S`, hence so
is `EMSR(S) = P̄(S) · f` for a nonnegative fare `f`. -/
theorem emsr_antitone (f : ℝ) (hf : 0 ≤ f) (p : PMF ℕ) :
    Antitone (tailProb p) ∧ Antitone (emsr f p) := by sorry

end SeatInventory.Distinct
Source
Belobaba, Air Travel Demand and Airline Seat Inventory Management, MIT Flight Transportation Laboratory Report R87-7 (PhD thesis), 1987, p. 142, Eqs. (6.1)-(6.2) and the paragraph after them
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

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