Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 — for i ∉ A: rᵢ > f(A, v) ⟺ f(A ∪ {i}, v) > f(A, v) ⟺ rᵢ > f(A ∪ {i}, v)

Proved
RobustMNL.Static.adding_product_iff

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

assortment-optimizationmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

When is adding a product beneficial? Let v∈R++n+1v \in \mathbb R^{n+1}_{++}v∈R++n+1​, let A⊆AA \subseteq \mathcal AA⊆A be an assortment and let i∉Ai \notin Ai∈/A. Then the following three statements are equivalent:

  1. ri>f(A,v)r_i > f(A, v)ri​>f(A,v);
  2. f(A∪{i},v)>f(A,v)f(A \cup \{i\}, v) > f(A, v)f(A∪{i},v)>f(A,v);
  3. ri>f(A∪{i},v)r_i > f(A \cup \{i\}, v)ri​>f(A∪{i},v).

In words: adding product iii strictly increases the expected revenue exactly when its revenue exceeds the current expected revenue, and then it also exceeds the new one. Lemma 3.1 drives the exchange arguments behind the structural results of the paper (Theorems 3.2 and 3.6).

Formalization Note The equivalence is stated as List.TFAE of the three statements. Products are Fin n (Lean index iii is the paper's product i+1i+1i+1); revenues are arbitrary reals.

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

theorem adding_product_iff {n : ℕ} (r : Fin n → ℝ) (p : ℝ × (Fin n → ℝ)) (hp : IsPos p)
    (A : Finset (Fin n)) (i : Fin n) (hi : i ∉ A) :
    List.TFAE [r i > rev r A p, rev r (insert i A) p > rev r A p,
      r i > rev r (insert i A) p] := 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, Lemma 3.1, p. 6
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