Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, PDF p. 11 — under simultaneous recommendation the profile (S̃, …, S̃) is optimal

Proved
MultiStoreAssort.SMR.theorem1_smr_optimal

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

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

A seller operates mmm stores and sells nnn products with revenues r1>r2>⋯>rn>0r_1>r_2>\dots>r_n>0r1​>r2​>⋯>rn​>0 and MNL attraction values vk>0v_k>0vk​>0. A fraction λi≥0\lambda_i\ge0λi​≥0 of customers visits store iii, with ∑iλi=1\sum_i\lambda_i=1∑i​λi​=1. A customer who visits store iii and buys product kkk from store jjj suffers a utility discount cijk≥0c_{ij}^k\ge0cijk​≥0, with ciik=0c_{ii}^k=0ciik​=0. Under the simultaneous recommendation (SMR) model, the customer of store iii facing the profile S=(S1,…,Sm)\mathbf S=(S_1,\dots,S_m)S=(S1​,…,Sm​) chooses product kkk with probability pikM(S)p^M_{ik}(\mathbf S)pikM​(S) given by (1). The seller's problem is

max⁡S=(S1,…,Sm) ∑i=1mλi∑k=1nrk pikM(S).(SMR)\max_{\mathbf S=(S_1,\dots,S_m)}\ \sum_{i=1}^m\lambda_i\sum_{k=1}^n r_k\,p^M_{ik}(\mathbf S).\tag{SMR}S=(S1​,…,Sm​)max​ i=1∑m​λi​k=1∑n​rk​pikM​(S).(SMR)

Let S~\tilde SS~ be the smallest revenue-ordered optimal solution of the single-store problem (3). Then (S~,S~,…,S~)(\tilde S,\tilde S,\dots,\tilde S)(S~,S~,…,S~) is an optimal solution of (SMR): for every profile S\mathbf SS,

∑i=1mλi∑k=1nrk pikM(S) ≤ ∑i=1mλi∑k=1nrk pikM(S~,…,S~).\sum_{i=1}^m\lambda_i\sum_{k=1}^n r_k\,p^M_{ik}(\mathbf S)\ \le\ \sum_{i=1}^m\lambda_i\sum_{k=1}^n r_k\,p^M_{ik}(\tilde S,\dots,\tilde S).i=1∑m​λi​k=1∑n​rk​pikM​(S) ≤ i=1∑m​λi​k=1∑n​rk​pikM​(S~,…,S~).

Under simultaneous recommendation, cross-store coordination never beats running every store as a stand-alone MNL store. The resulting revenue is the paper's benchmark, which the sequential strategy is compared against.

Formalization Note. "The optimal solution is (S~,…,S~)(\tilde S,\dots,\tilde S)(S~,…,S~)" is formalized as "(S~,…,S~)(\tilde S,\dots,\tilde S)(S~,…,S~) is a global maximizer". Optimal solutions need not be unique. S~\tilde SS~ enters through the predicate IsStilde, and the milestone stilde_exists shows such an S~\tilde SS~ exists. The positivity rk>0r_k>0rk​>0 is the series' standing assumption (revenues are prices). Zero discounts cijk=0c_{ij}^k=0cijk​=0 between different stores are allowed, as in the paper.

Preamble
import Mathlib
import Definitions.Def_MultiStoreAssort_SMR_Model
Formal statement
namespace MultiStoreAssort.SMR

/-- Theorem 1, p. 11: the optimal solution to the SMR problem is `S* = (S̃, S̃, …, S̃)`. -/
theorem theorem1_smr_optimal {m n : ℕ} (lam : Fin m → ℝ) (r v : 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 : ∀ k, 0 < v k) (hc : ∀ i j k, 0 ≤ c i j k) (hcii : ∀ i k, c i i k = 0)
    (St : Finset (Fin n)) (hSt : IsStilde r v St) :
    ∀ S : Fin m → Finset (Fin n), revM lam r v c S ≤ revM lam r v c (fun _ => St) := by sorry

end MultiStoreAssort.SMR
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. 11, Theorem 1; proof Online Supplement App. A.1, PDF p. 33
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