Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.7, p. 11 — Z*(𝒱) ≤ Z*_δ(𝒱) ≤ δ + Z*(𝒱) for δ ≥ 0

Proved
RobustMNL.Static.incremental_value_bounds

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⊆R++n+1\mathcal V \subseteq \mathbb R^{n+1}_{++}V⊆R++n+1​ be compact and nonempty and let δ≥0\delta \ge 0δ≥0. Write Zδ∗(V)Z^*_\delta(\mathcal V)Zδ∗​(V) for the optimal value of the Robust Logit problem when every product revenue is increased by δ\deltaδ,

Zδ∗(V)=max⁡S⊆A min⁡v∈V∑i∈S(ri+δ) ϕi(S,v).Z^*_\delta(\mathcal V) = \max_{S\subseteq\mathcal A}\ \min_{v\in\mathcal V} \sum_{i\in S} (r_i + \delta)\,\phi_i(S, v).Zδ∗​(V)=S⊆Amax​ v∈Vmin​i∈S∑​(ri​+δ)ϕi​(S,v).

Then

Z∗(V)≤Zδ∗(V)≤δ+Z∗(V).Z^*(\mathcal V) \le Z^*_\delta(\mathcal V) \le \delta + Z^*(\mathcal V).Z∗(V)≤Zδ∗​(V)≤δ+Z∗(V).

Raising every revenue by δ\deltaδ raises the optimal worst-case revenue by at most δ\deltaδ, because a customer buys at most one product. This sandwich yields Theorem 3.7.

Formalization Note Since ∑i∈S(ri+δ)ϕi(S,v)\sum_{i\in S}(r_i+\delta)\phi_i(S,v)∑i∈S​(ri​+δ)ϕi​(S,v) is the expected revenue f(S,v)f(S,v)f(S,v) computed with revenues ri+δr_i + \deltari​+δ, Zδ∗(V)Z^*_\delta(\mathcal V)Zδ∗​(V) is written as Zstar V (fun i => r i + δ). Revenues are arbitrary reals; products are Fin n.

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

theorem incremental_value_bounds {n : ℕ} (r : Fin n → ℝ) (V : Set (ℝ × (Fin n → ℝ)))
    (hV : IsCompact V) (hne : V.Nonempty) (hpos : ∀ p ∈ V, IsPos p) (δ : ℝ) (hδ : 0 ≤ δ) :
    Zstar V r ≤ Zstar V (fun i => r i + δ) ∧ Zstar V (fun i => r i + δ) ≤ δ + Zstar V r := 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, Proof of Theorem 3.7, p. 11, line after the first display (Z*_δ(V) defined on p. 10)
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