Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (4), p. 28 — ΔZ_1(n) = r_1P[D_1 ≥ n], and ΔZ_1(n) is decreasing in n

Proved
LowerFareFirst.Critical.eq4_dZ1_tail

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

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

In the seat management model with lower fare classes booking first (fares r1>⋯>rc>0r_1 > \cdots > r_c > 0r1​>⋯>rc​>0, integer-valued demands DmD_mDm​, optimal values Zm(n)Z_m(n)Zm​(n), standing assumptions of §1), let ΔZ1(n)=Z1(n)−Z1(n−1)\Delta Z_1(n) = Z_1(n) - Z_1(n-1)ΔZ1​(n)=Z1​(n)−Z1​(n−1) be the marginal value of the nnn-th seat when only class 1 books.

For every n≥1n \ge 1n≥1,

ΔZ1(n)=r1 P[D1≥n],\Delta Z_1(n) = r_1\,P[D_1 \ge n],ΔZ1​(n)=r1​P[D1​≥n],

and ΔZ1\Delta Z_1ΔZ1​ is decreasing (nonincreasing) in nnn: ΔZ1(n+1)≤ΔZ1(n)\Delta Z_1(n+1) \le \Delta Z_1(n)ΔZ1​(n+1)≤ΔZ1​(n) for all n≥1n \ge 1n≥1.

This is the starting point of the induction of Theorem 2, and with (2b) it gives the classical two-class rule (5): a class 2 request is refused exactly when r2<r1P[D1≥n]r_2 < r_1 P[D_1 \ge n]r2​<r1​P[D1​≥n].

Formalization Note. "Decreasing" is read as nonincreasing: P[D1≥n]P[D_1 \ge n]P[D1​≥n] is constant on any nnn with P[D1=n]=0P[D_1 = n] = 0P[D1​=n]=0, so the strict reading is false.

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

open MeasureTheory

theorem eq4_dZ1_tail {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    (D : ℕ → Ω → ℕ) (r : ℕ → ℝ) (c : ℕ)
    (hM : IsSeatModel μ D r c) :
    (∀ n : ℕ, 1 ≤ n → dZ μ D r 1 n = r 1 * probGe μ D 1 n) ∧
      (∀ n : ℕ, 1 ≤ n → dZ μ D r 1 (n + 1) ≤ dZ μ D r 1 n) := by sorry

end LowerFareFirst.Critical
Source
Wollmer (1992), Operations Research 40(1), §2, Eq. (4) and the sentence after it, 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