Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1, p. 16, second inequality — ΔJ_{t+1}(x) ≤ ΔJ_t(x): the marginal value of capacity decreases over time

Proved
RobustMNL.Dynamic.marginalValue_antitone_time

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

dynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

In the robust capacity-allocation model, for every period 1≤t≤T1 \le t \le T1≤t≤T and every capacity level x≥1x \ge 1x≥1,

ΔJt+1(x)≤ΔJt(x).\Delta J_{t+1}(x) \le \Delta J_t(x).ΔJt+1​(x)≤ΔJt​(x).

At t=Tt = Tt=T, where JT+1≡0J_{T+1} \equiv 0JT+1​≡0, this says JTJ_TJT​ is nondecreasing in capacity.

The second half of Theorem 4.1: as the horizon runs out, a unit of capacity is worth less. It gives the nonnegative increment ΔJt+1(x)−ΔJt+2(x)\Delta J_{t+1}(x) - \Delta J_{t+2}(x)ΔJt+1​(x)−ΔJt+2​(x) used in the second part of Theorem 4.3.

Formalization Note As for the first inequality, x=0x = 0x=0 is excluded (the paper's "x∈{0,…,C}x \in \{0, \dots, C\}x∈{0,…,C}" includes an undefined ΔJt(0)\Delta J_t(0)ΔJt​(0)) and xxx has no upper bound. Revenues are arbitrary reals.

Preamble
import Mathlib
import Definitions.Def_RobustMNL_Dynamic_ValueFunction
Formal statement
namespace RobustMNL.Dynamic

theorem marginalValue_antitone_time {n : ℕ} (T : ℕ) (V : ℕ → Set (ℝ × (Fin n → ℝ)))
    (r : Fin n → ℝ) (hV : IsUncertaintySeq T V) (t x : ℕ) (ht : 1 ≤ t) (htT : t ≤ T) (hx : 1 ≤ x) :
    marginalValue T V r (t + 1) x ≤ marginalValue T V r t x := by sorry

end RobustMNL.Dynamic
Source
Rusmevichientong, Topaloglu, Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model, Operations Research (2012), doi:10.1287/opre.1120.1063, authors' manuscript of 20 Sep 2011, Theorem 4.1 (second inequality), p. 16; proof in Appendix A, p. 32
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me