Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6, PDF p. 28 — under SMR, the full assortment in every store at prices θ*ᵢ + 1/βᵢₖ solves the joint problem (13)

Proved
MultiStoreAssort.Pricing.theorem6_full_assortment_markup

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

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

A seller runs mmm stores and sells nnn products. A fraction λi≥0\lambda_i\ge0λi​≥0 of customers visits store iii, ∑iλi=1\sum_i\lambda_i=1∑i​λi​=1. A store-iii customer who buys product kkk from store jjj at store jjj's price pjkp_{jk}pjk​ has utility αik−βikpjk−cijk\alpha_{ik}-\beta_{ik}p_{jk}-c^k_{ij}αik​−βik​pjk​−cijk​ plus Gumbel noise, with αik>0\alpha_{ik}>0αik​>0, βik>0\beta_{ik}>0βik​>0, cijk≥0c^k_{ij}\ge 0cijk​≥0 and ciik=0c^k_{ii}=0ciik​=0. Under simultaneous recommendation the seller's expected revenue is the objective RM(S,P)R^M(\mathbf S,\mathbf P)RM(S,P) of problem (13), where products of Sˉ∖Si\bar S\setminus S_iSˉ∖Si​ are bought from the store l(i,k)l(i,k)l(i,k) that maximizes the customer's utility among the stores offering them. For each store iii let θi∗\theta^*_iθi∗​ be the solution of

θi∗=∑k∈Neα^ik−βikθi∗,α^ik=αik−log⁡βik−1.\theta^*_i=\sum_{k\in\mathcal N}e^{\hat\alpha_{ik}-\beta_{ik}\theta^*_i},\qquad \hat\alpha_{ik}=\alpha_{ik}-\log\beta_{ik}-1.θi∗​=k∈N∑​eα^ik​−βik​θi∗​,α^ik​=αik​−logβik​−1.

Theorem 6. The profile S∗=(N,…,N)\mathbf S^*=(\mathcal N,\dots,\mathcal N)S∗=(N,…,N) with prices

pik∗=θi∗+1βik(i∈[m], k∈[n])p^*_{ik}=\theta^*_i+\frac{1}{\beta_{ik}}\qquad(i\in[m],\ k\in[n])pik∗​=θi∗​+βik​1​(i∈[m], k∈[n])

is an optimal solution of (13): for every assortment profile S\mathbf SS, every real price matrix P\mathbf PP and every best-store rule lll for (S,P)(\mathbf S,\mathbf P)(S,P),

RM(S,P)≤RM(S∗,P∗).R^M(\mathbf S,\mathbf P)\le R^M(\mathbf S^*,\mathbf P^*).RM(S,P)≤RM(S∗,P∗).

Under simultaneous recommendation, the joint assortment and pricing problem thus decouples: offering every product everywhere, at the single-store "constant adjusted markup" prices, earns as much as any coordinated multistore policy.

Formalization Note Optimality is a global upper bound over all profiles, all real prices and all tie-breaking rules lll; uniqueness is not claimed. On the full profile Sˉ∖Si=∅\bar S\setminus S_i=\emptysetSˉ∖Si​=∅, so the right-hand side does not depend on its selection l′l'l′, which is quantified universally. θi∗\theta^*_iθi∗​ enters as a hypothesis (the markup equation holds), whose solvability and uniqueness is a separate milestone. αik>0\alpha_{ik}>0αik​>0 is the page's αik∈R+\alpha_{ik}\in\mathbb R^+αik​∈R+; the statement remains true without it.

Preamble
import Mathlib
import Definitions.Def_MultiStoreAssort_Pricing_Model
Formal statement
namespace MultiStoreAssort.Pricing
open Finset

theorem theorem6_full_assortment_markup {m n : ℕ} (lam : Fin m → ℝ) (α β : Fin m → Fin n → ℝ)
    (c : Fin m → Fin m → Fin n → ℝ) (hlam : ∀ i, 0 ≤ lam i) (hlam1 : ∑ i, lam i = 1)
    (hα : ∀ i k, 0 < α i k) (hβ : ∀ i k, 0 < β i k) (hc : ∀ i j k, 0 ≤ c i j k)
    (hcii : ∀ i k, c i i k = 0) (θ : Fin m → ℝ) (hθ : ∀ i, IsTheta (α i) (β i) (θ i)) :
    ∀ (S : Fin m → Finset (Fin n)) (P : Fin m → Fin n → ℝ) (l l' : Fin m → Fin n → Fin m),
      IsBestStore α β c P S l →
        rev13 lam α β c S P l ≤
          rev13 lam α β c (fun _ => Finset.univ) (fun i k => θ i + 1 / β i k) l' := by sorry

end MultiStoreAssort.Pricing
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. 28, Theorem 6; proof Online Supplement App. E.1, PDF p. 47
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