Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.5 (restated) — larger uncertainty implies a larger robust assortment: Z*(V′) ≤ Z*(V), S*(V) ⊆ S*(V′)

Proved
RobustMNL.Dynamic.larger_uncertainty

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

assortment-optimizationmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let V⊆V′⊆R++n+1\mathcal V \subseteq \mathcal V' \subseteq \mathbb R^{n+1}_{++}V⊆V′⊆R++n+1​ be compact, with V\mathcal VV nonempty, and let rrr be arbitrary real revenues. Then

Z∗(V′)≤Z∗(V)andS∗(V)⊆S∗(V′),Z^*(\mathcal V') \le Z^*(\mathcal V) \qquad\text{and}\qquad S^*(\mathcal V) \subseteq S^*(\mathcal V'),Z∗(V′)≤Z∗(V)andS∗(V)⊆S∗(V′),

the latter for every optimal assortment of smallest cardinality S∗(V)S^*(\mathcal V)S∗(V) over V\mathcal VV and every one S∗(V′)S^*(\mathcal V')S∗(V′) over V′\mathcal V'V′.

In Section 4 the inclusion compares the robust assortments of periods ttt and t+1t+1t+1 when Vt⊆Vt+1\mathcal V_t \subseteq \mathcal V_{t+1}Vt​⊆Vt+1​.

Formalization Note The paper writes "V⊆V′⊆R++nV \subseteq V' \subseteq \mathbb R^n_{++}V⊆V′⊆R++n​"; it is read as subsets of R++n+1\mathbb R^{n+1}_{++}R++n+1​, compact by the standing assumption of Sec. 3. The proof of Theorem 4.3 (p. 18) cites Theorem 3.6 for this inclusion; the inclusion it uses is exactly this corollary's. This restates RobustMNL.Static.larger_uncertainty of the companion mission verbatim up to namespace.

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

theorem larger_uncertainty {n : ℕ} (r : Fin n → ℝ) (V V' : Set (ℝ × (Fin n → ℝ)))
    (hV : IsCompact V) (hne : V.Nonempty) (hpos : ∀ p ∈ V, RobustMNL.Static.IsPos p)
    (hV' : IsCompact V') (hpos' : ∀ p ∈ V', RobustMNL.Static.IsPos p) (hsub : V ⊆ V') :
    RobustMNL.Static.Zstar V' r ≤ RobustMNL.Static.Zstar V r ∧
      ∀ S S' : Finset (Fin n), RobustMNL.Static.IsSmallestOptimal V r S → RobustMNL.Static.IsSmallestOptimal V' r 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, Corollary 3.5, p. 9
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