Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.3, p. 17 — S*_t(x) ⊆ S*_t(x + 1), and S*_t(x) ⊆ S*_{t+1}(x) when V_t ⊆ V_{t+1}

Proved
RobustMNL.Dynamic.assortment_monotone

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

assortment-optimizationdynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-managementrobust-optimization

In the robust capacity-allocation model over periods 1,…,T1, \dots, T1,…,T, with compact nonempty uncertainty sets Vt⊆R++n+1\mathcal V_t \subseteq \mathbb R^{n+1}_{++}Vt​⊆R++n+1​, let St∗(x)S^*_t(x)St∗​(x) denote an optimal assortment of smallest cardinality of the period-ttt Bellman problem with capacity xxx. Then:

  1. For every 1≤t≤T1 \le t \le T1≤t≤T and x≥1x \ge 1x≥1,
St∗(x)⊆St∗(x+1).S^*_t(x) \subseteq S^*_t(x+1).St∗​(x)⊆St∗​(x+1).
  1. For every 1≤t≤T−11 \le t \le T-11≤t≤T−1 and x≥1x \ge 1x≥1 with Vt⊆Vt+1\mathcal V_t \subseteq \mathcal V_{t+1}Vt​⊆Vt+1​,
St∗(x)⊆St+1∗(x).S^*_t(x) \subseteq S^*_{t+1}(x).St∗​(x)⊆St+1∗​(x).

More remaining capacity leads to a larger optimal assortment; and, when uncertainty does not shrink over time, so does approaching the end of the horizon. This is the robust analogue of the nesting properties of single-leg revenue management.

Formalization Note Each part holds for every pair of smallest-cardinality maximizers (IsOptAssort). "For any xxx" is read as x≥1x \ge 1x≥1 (St∗(0)S^*_t(0)St∗​(0) is not defined by the Bellman equation); "for any ttt" is 1≤t≤T1 \le t \le T1≤t≤T, and t+1≤Tt + 1 \le Tt+1≤T in part 2 so that St+1∗(x)S^*_{t+1}(x)St+1∗​(x) exists. The only hypothesis of part 2 beyond the standing assumptions is Vt⊆Vt+1\mathcal V_t \subseteq \mathcal V_{t+1}Vt​⊆Vt+1​. JJJ is defined for every x∈Nx \in \mathbb Nx∈N, so no capacity bound CCC appears. Revenues are arbitrary reals (the paper's r1≥⋯≥rn>0r_1 \ge \dots \ge r_n > 0r1​≥⋯≥rn​>0 is dropped).

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

theorem assortment_monotone {n : ℕ} (T : ℕ) (V : ℕ → Set (ℝ × (Fin n → ℝ)))
    (r : Fin n → ℝ) (hV : IsUncertaintySeq T V) :
    (∀ (t x : ℕ) (S S' : Finset (Fin n)), 1 ≤ t → t ≤ T → 1 ≤ x →
        IsOptAssort T V r t x S → IsOptAssort T V r t (x + 1) S' → S ⊆ S') ∧
      (∀ (t x : ℕ) (S S' : Finset (Fin n)), 1 ≤ t → t + 1 ≤ T → 1 ≤ x → V t ⊆ V (t + 1) →
        IsOptAssort T V r t x S → IsOptAssort T V r (t + 1) x S' → S ⊆ S') := 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.3, p. 17; proof pp. 17–18
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