Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Note after (2b), p. 28 — if ΔZ_{m−1} is decreasing, r_m < ΔZ_{m−1}(n) for n ≤ k_m and r_m ≥ ΔZ_{m−1}(n) for n ≥ k_m + 1

Proved
LowerFareFirst.Critical.note2b_critical_sign

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

airline-revenue-managementcritical-value-policyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (Ω,μ)(\Omega, \mu)(Ω,μ) carry integer-valued demands DmD_mDm​, let rmr_mrm​ be fares, and let Zm(n)Z_m(n)Zm​(n), ΔZm(n)=Zm(n)−Zm(n−1)\Delta Z_m(n) = Z_m(n) - Z_m(n-1)ΔZm​(n)=Zm​(n)−Zm​(n−1) be the optimal values and marginal seat values of the seat management model with lower classes booking first. Fix a class m≥2m \ge 2m≥2 and suppose that ΔZm−1(n)\Delta Z_{m-1}(n)ΔZm−1​(n) is decreasing (nonincreasing) in n≥1n \ge 1n≥1. Let kkk be the critical value of class mmm,

k=km=max⁡{ n≥1∣rm<ΔZm−1(n) }.k = k_m = \max\{\, n \ge 1 \mid r_m < \Delta Z_{m-1}(n) \,\}.k=km​=max{n≥1∣rm​<ΔZm−1​(n)}.

Then

rm<ΔZm−1(n)for 1≤n≤km,rm≥ΔZm−1(n)for n≥km+1.r_m < \Delta Z_{m-1}(n) \quad \text{for } 1 \le n \le k_m, \qquad r_m \ge \Delta Z_{m-1}(n) \quad \text{for } n \ge k_m + 1.rm​<ΔZm−1​(n)for 1≤n≤km​,rm​≥ΔZm−1​(n)for n≥km​+1.

So the fare of class mmm falls below the expected value of the marginal seat to the higher classes exactly when at most kmk_mkm​ seats remain; this is why a class-mmm request should be rejected if and only if n≤kmn \le k_mn≤km​. For m=2m = 2m=2 this is the paper's condition (5), with ΔZ1(n)=r1P[D1≥n]\Delta Z_1(n) = r_1 P[D_1 \ge n]ΔZ1​(n)=r1​P[D1​≥n].

Formalization Note. The paper's hypothesis "ΔZm(n)\Delta Z_m(n)ΔZm​(n) is decreasing in nnn for all mmm" is used only for class m−1m - 1m−1, and is stated only there; none of the standing assumptions of §1 is needed. Both changes make the statement more general. The existence of kmk_mkm​ is taken as a hypothesis, as on the page.

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

open MeasureTheory

theorem note2b_critical_sign {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    (D : ℕ → Ω → ℕ) (r : ℕ → ℝ) (m k : ℕ) (hm : 2 ≤ m)
    (hdec : ∀ n : ℕ, 1 ≤ n → dZ μ D r (m - 1) (n + 1) ≤ dZ μ D r (m - 1) n)
    (hk : IsCriticalValue μ D r m k) :
    (∀ n : ℕ, 1 ≤ n → n ≤ k → r m < dZ μ D r (m - 1) n) ∧
      (∀ n : ℕ, k + 1 ≤ n → dZ μ D r (m - 1) n ≤ r m) := by sorry

end LowerFareFirst.Critical
Source
Wollmer (1992), Operations Research 40(1), §1, paragraph after Eq. (2b), p. 28; with Eq. (5), §2, 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