Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 3.1, p. 6 — f(A ∪ {i}, v) is a convex combination of rᵢ and f(A, v)

Proved
RobustMNL.Static.convex_combination

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

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

Let v=(v0,v1,…,vn)∈R++n+1v = (v_0, v_1, \dots, v_n) \in \mathbb R^{n+1}_{++}v=(v0​,v1​,…,vn​)∈R++n+1​, let A⊆AA \subseteq \mathcal AA⊆A be an assortment and let i∉Ai \notin Ai∈/A be a product. Then the expected revenue of A∪{i}A \cup \{i\}A∪{i} is the following convex combination of the revenue rir_iri​ and the expected revenue f(A,v)f(A, v)f(A,v):

f(A∪{i},v)=viv0+vi+∑ℓ∈Avℓ⋅ri+v0+∑ℓ∈Avℓv0+vi+∑ℓ∈Avℓ⋅f(A,v).f(A \cup \{i\}, v) = \frac{v_i}{v_0 + v_i + \sum_{\ell\in A} v_\ell}\cdot r_i + \frac{v_0 + \sum_{\ell \in A} v_\ell}{v_0 + v_i + \sum_{\ell\in A} v_\ell}\cdot f(A, v).f(A∪{i},v)=v0​+vi​+∑ℓ∈A​vℓ​vi​​⋅ri​+v0​+vi​+∑ℓ∈A​vℓ​v0​+∑ℓ∈A​vℓ​​⋅f(A,v).

The two weights are positive and add up to one, so f(A∪{i},v)f(A\cup\{i\}, v)f(A∪{i},v) lies between rir_iri​ and f(A,v)f(A,v)f(A,v). This identity is the whole content of Lemma 3.1.

Formalization Note Products are Fin n (Lean index iii is the paper's product i+1i+1i+1); v0v_0v0​ is p.1 and viv_ivi​ is p.2 i. The revenues rrr are arbitrary reals, a harmless generalization of the paper's ri>0r_i > 0ri​>0.

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

theorem convex_combination {n : ℕ} (r : Fin n → ℝ) (p : ℝ × (Fin n → ℝ)) (hp : IsPos p)
    (A : Finset (Fin n)) (i : Fin n) (hi : i ∉ A) :
    rev r (insert i A) p =
      p.2 i / (p.1 + p.2 i + ∑ ℓ ∈ A, p.2 ℓ) * r i
        + (p.1 + ∑ ℓ ∈ A, p.2 ℓ) / (p.1 + p.2 i + ∑ ℓ ∈ A, p.2 ℓ) * rev r 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, Proof of Lemma 3.1, p. 6, display
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