Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3), p. 28 — Z_1(n) = r_1{nP[D_1 ≥ n] + Σ_{j<n} jP[D_1 = j]}

Proved
LowerFareFirst.Critical.eq3_Z1_closed_form

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

airline-revenue-managementdynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the seat management model with lower fare classes booking first: fare classes 1,…,c1, \dots, c1,…,c with fares r1>⋯>rc>0r_1 > \cdots > r_c > 0r1​>⋯>rc​>0, integer-valued demands DmD_mDm​ on a probability space, and Zm(n)Z_m(n)Zm​(n) the optimal expected revenue with nnn empty seats when only classes 1,…,m1, \dots, m1,…,m may book, under the standing assumptions of §1.

When only the highest class may book, the optimal expected revenue is given in closed form: for every n≥0n \ge 0n≥0,

Z1(n)=r1{n P[D1≥n]+∑j=0n−1j P[D1=j]}.Z_1(n) = r_1 \Big\{ n\,P[D_1 \ge n] + \sum_{j=0}^{n-1} j\,P[D_1 = j] \Big\}.Z1​(n)=r1​{nP[D1​≥n]+j=0∑n−1​jP[D1​=j]}.

The right-hand side is r1E[min⁡(D1,n)]r_1 \mathbb E[\min(D_1, n)]r1​E[min(D1​,n)]: with a single class every request is accepted while seats remain. Equation (3) is the base case of the paper's induction and yields the marginal seat value (4).

Preamble
import Mathlib
import Definitions.Def_LowerFareFirst_Critical_Model
Formal statement
namespace LowerFareFirst.Critical

open MeasureTheory

theorem eq3_Z1_closed_form {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    (D : ℕ → Ω → ℕ) (r : ℕ → ℝ) (c : ℕ)
    (hM : IsSeatModel μ D r c) :
    ∀ n : ℕ, Z μ D r 1 n =
      r 1 * ((n : ℝ) * probGe μ D 1 n + ∑ j ∈ Finset.range n, (j : ℝ) * probEq μ D 1 j) := by sorry

end LowerFareFirst.Critical
Source
Wollmer (1992), Operations Research 40(1), §2, Eq. (3), p. 28
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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