Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
โ† Formalpedia

Corollary 3.5 โ€” larger uncertainty implies larger robust assortment: Z*(๐’ฑโ€ฒ) โ‰ค Z*(๐’ฑ), S*(๐’ฑ) โІ S*(๐’ฑโ€ฒ)

Proved
RobustMNL.Static.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

Larger uncertainty implies a larger robust assortment. Let VโІVโ€ฒโІR++n+1\mathcal V \subseteq \mathcal V' \subseteq \mathbb R^{n+1}_{++}VโІVโ€ฒโІR++n+1โ€‹ be compact uncertainty sets, with V\mathcal VV nonempty. 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โ€ฒ),

where Sโˆ—(โ‹…)S^*(\cdot)Sโˆ—(โ‹…) denotes any optimal robust assortment of smallest cardinality.

More uncertainty lowers the optimal worst-case revenue and enlarges the robust assortment: product variety acts as a buffer against uncertainty in the choice parameters.

Formalization Note The inclusion is stated for every pair S,Sโ€ฒS, S'S,Sโ€ฒ of smallest-cardinality optimal assortments for V\mathcal VV and Vโ€ฒ\mathcal V'Vโ€ฒ. The page writes "VโІVโ€ฒโІR++n\mathcal V \subseteq \mathcal V' \subseteq \mathbb R^n_{++}VโІVโ€ฒโІR++nโ€‹"; it is read, as in Theorem 3.2, as compact sets in R++n+1\mathbb R^{n+1}_{++}R++n+1โ€‹ (the standing assumption of Sec. 3). Nonemptiness of Vโ€ฒ\mathcal V'Vโ€ฒ follows from that of V\mathcal VV. Revenues are arbitrary reals; products are Fin n.

Preamble
import Mathlib
import Definitions.Def_RobustMNL_Static_Model
Formal statement
namespace RobustMNL.Static

theorem larger_uncertainty {n : โ„•} (r : Fin n โ†’ โ„) (V V' : Set (โ„ ร— (Fin n โ†’ โ„)))
    (hV : IsCompact V) (hne : V.Nonempty) (hpos : โˆ€ p โˆˆ V, IsPos p)
    (hV' : IsCompact V') (hpos' : โˆ€ p โˆˆ V', IsPos p) (hsub : V โІ V') :
    Zstar V' r โ‰ค Zstar V r โˆง
      โˆ€ S S' : Finset (Fin n), IsSmallestOptimal V r S โ†’ IsSmallestOptimal V' r S' โ†’ S โІ S' := by sorry

end RobustMNL.Static
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