Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 7, PDF p. 47 — every profile earns at most twice the sum of single-store optima

Proved
MultiStoreAssort.Approx.second_inequality

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

assortment-optimizationmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequential-recommendation

In the heterogeneous multi-store model (mmm stores with arrival fractions λi≥0\lambda_i\ge0λi​≥0, ∑iλi=1\sum_i\lambda_i=1∑i​λi​=1; nnn products with revenues r1>r2>⋯>rn>0r_1>r_2>\dots>r_n>0r1​>r2​>⋯>rn​>0; attraction values vik>0v_{ik}>0vik​>0; utility discounts cijk≥0c^k_{ij}\ge0cijk​≥0 with ciik=0c^k_{ii}=0ciik​=0), let R(S)R(\boldsymbol S)R(S) be the (SQR-heter) revenue of a profile S\boldsymbol SS. For each store iii let S~i\tilde S_iS~i​ be an optimal solution of store iii's single-store problem

Ri∗=max⁡S∑k∈Srkvik1+∑k∈Svik.(D.1)R^*_i=\max_S\frac{\sum_{k\in S}r_kv_{ik}}{1+\sum_{k\in S}v_{ik}}.\qquad\text{(D.1)}Ri∗​=Smax​1+∑k∈S​vik​∑k∈S​rk​vik​​.(D.1)

Then for every profile S=(S1,…,Sm)\boldsymbol S=(S_1,\dots,S_m)S=(S1​,…,Sm​),

R(S) ≤ 2∑i=1mλi⋅∑k∈S~irkvik1+∑k∈S~ivik=2∑i=1mλiRi∗.R(\boldsymbol S)\ \le\ 2\sum_{i=1}^m\lambda_i\cdot\frac{\sum_{k\in\tilde S_i}r_kv_{ik}}{1+\sum_{k\in\tilde S_i}v_{ik}}=2\sum_{i=1}^m\lambda_iR^*_i.R(S) ≤ 2i=1∑m​λi​⋅1+∑k∈S~i​​vik​∑k∈S~i​​rk​vik​​=2i=1∑m​λi​Ri∗​.

Each store's revenue under S\boldsymbol SS splits into a first stage (the store's own assortment) and a second stage (the other stores' products, with discounted attraction values); each part is at most Ri∗R^*_iRi∗​. Applied to an optimal profile S∗\boldsymbol S^*S∗ of (SQR-heter) this is the second and third inequality of the proof of Proposition 7, ∑iλiRi∗≥12RQ∗\sum_i\lambda_iR^*_i\ge\frac12R^*_Q∑i​λi​Ri∗​≥21​RQ∗​.

Formalization Note. The statement only uses that each S~i\tilde S_iS~i​ is an optimal solution of (D.1), not the paper's tie rule, and it is stated for every profile S\boldsymbol SS instead of an optimal one; both are generalizations covered by the paper's argument. The positivity of the revenues is pinned, as in the rest of the mission.

Preamble
import Mathlib
import Definitions.Def_ChoiceCDLP_MNL_mnlObjective
import Definitions.Def_MultiStoreAssort_Approx_Model
Formal statement
namespace MultiStoreAssort.Approx

/-- Second and third inequalities of the proof of Proposition 7 (Online Supplement p. 15): if each
`St i` is an optimal solution of store `i`'s single-store problem (D.1), then every profile `S`
earns at most twice `∑_i λ_i ∑_{k ∈ S̃_i} r_k v_{ik} / (1 + ∑_{k ∈ S̃_i} v_{ik})` under (SQR-heter). -/
theorem second_inequality {m n : ℕ} (lam : Fin m → ℝ) (r : Fin n → ℝ) (v : Fin m → Fin n → ℝ)
    (c : Fin m → Fin m → Fin n → ℝ)
    (hlam : ∀ i, 0 ≤ lam i) (hlam1 : ∑ i, lam i = 1) (hr : StrictAnti r) (hrpos : ∀ k, 0 < r k)
    (hv : ∀ i k, 0 < v i k) (hc : ∀ i j k, 0 ≤ c i j k) (hcii : ∀ i k, c i i k = 0)
    (St : Fin m → Finset (Fin n)) (hSt : ∀ i, MultiStoreAssort.SMR.IsOptSingle r (v i) (St i)) :
    ∀ S : Fin m → Finset (Fin n),
      revQh lam r v c S ≤ 2 * ∑ i, lam i * MultiStoreAssort.SMR.single r (v i) (St i) := by sorry

end MultiStoreAssort.Approx
Source
Liu, Chen, Liu & Wan, Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing, authors' manuscript with Online and Additional Supplements (2024-09-17; MSOM DOI 10.1287/msom.2024.0761), PDF p. 47 (Online Supplement p. 15), Appendix D.2, proof of Proposition 7, second and third inequalities; (D.1) on PDF p. 46
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 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