Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. E.1, PDF p. 47 — store i's SMR revenue is at most (14)'s objective at S = S̄ with prices pₖ = (αᵢₖ − log ṽᵢₖ)/βᵢₖ off Sᵢ

Proved
MultiStoreAssort.Pricing.storewise_feasible

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

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

Consider the multistore joint pricing model under simultaneous recommendation, with αik>0\alpha_{ik}>0αik​>0, βik>0\beta_{ik}>0βik​>0, discounts cijk≥0c^k_{ij}\ge 0cijk​≥0 and ciik=0c^k_{ii}=0ciik​=0. Fix an assortment profile S\mathbf SS, real prices P=(pik)\mathbf P=(p_{ik})P=(pik​), a best-store rule lll for (S,P)(\mathbf S,\mathbf P)(S,P), and a store iii. Define a price vector for the single-store problem (14) with parameters αk=αik\alpha_k=\alpha_{ik}αk​=αik​, βk=βik\beta_k=\beta_{ik}βk​=βik​ by

pk={pik,k∈Si,1βik(αik−log⁡v~ik(S)),k∉Si.p_k=\begin{cases}p_{ik}, & k\in S_i,\\[2pt] \dfrac{1}{\beta_{ik}}\bigl(\alpha_{ik}-\log\tilde v_{ik}(\mathbf S)\bigr), & k\notin S_i.\end{cases}pk​=⎩⎨⎧​pik​,βik​1​(αik​−logv~ik​(S)),​k∈Si​,k∈/Si​.​

Then

  1. pk≥p~ik(S)p_k\ge\tilde p_{ik}(\mathbf S)pk​≥p~​ik​(S) for every k∈Sˉ∖Sik\in\bar S\setminus S_ik∈Sˉ∖Si​, and
  2. store iii's expected revenue in (13) is at most the objective of (14) at the assortment S=SˉS=\bar SS=Sˉ and the prices (pk)(p_k)(pk​):
∑k∈Sipikvik+∑k∈Sˉ∖Sip~ik(S)v~ik(S)1+∑k∈Sivik+∑k∈Sˉ∖Siv~ik(S) ≤ ∑k∈Sˉpkexp⁡(αik−βikpk)1+∑k∈Sˉexp⁡(αik−βikpk).\frac{\sum_{k\in S_i}p_{ik}v_{ik}+\sum_{k\in\bar S\setminus S_i}\tilde p_{ik}(\mathbf S)\tilde v_{ik}(\mathbf S)}{1+\sum_{k\in S_i}v_{ik}+\sum_{k\in\bar S\setminus S_i}\tilde v_{ik}(\mathbf S)}\ \le\ \frac{\sum_{k\in\bar S}p_k\exp(\alpha_{ik}-\beta_{ik}p_k)}{1+\sum_{k\in\bar S}\exp(\alpha_{ik}-\beta_{ik}p_k)}.1+∑k∈Si​​vik​+∑k∈Sˉ∖Si​​v~ik​(S)∑k∈Si​​pik​vik​+∑k∈Sˉ∖Si​​p~​ik​(S)v~ik​(S)​ ≤ 1+∑k∈Sˉ​exp(αik​−βik​pk​)∑k∈Sˉ​pk​exp(αik​−βik​pk​)​.

This is the first step of the proof of Theorem 6: the cross-store purchases are re-expressed as own-store purchases at a price at least as high.

Formalization Note The prices pkp_kpk​ for k∉Sˉk\notin\bar Sk∈/Sˉ are irrelevant to (14) at S=SˉS=\bar SS=Sˉ; the Lean vector uses the second branch for every k∉Sik\notin S_ik∈/Si​. The hypotheses αik>0\alpha_{ik}>0αik​>0 and ciik=0c^k_{ii}=0ciik​=0 are the section's standing assumptions and are carried for uniformity.

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

theorem storewise_feasible {m n : ℕ} (α β : Fin m → Fin n → ℝ) (c : Fin m → Fin m → Fin n → ℝ)
    (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)
    (S : Fin m → Finset (Fin n)) (P : Fin m → Fin n → ℝ) (l : Fin m → Fin n → Fin m)
    (hl : IsBestStore α β c P S l) (i : Fin m) :
    (∀ k ∈ MultiStoreAssort.SMR.Sbar S \ S i,
        pTilde P l i k ≤ (α i k - Real.log (vTilde α β c P l i k)) / β i k) ∧
      storeRev13 α β c S P l i ≤
        rev14 (α i) (β i) (MultiStoreAssort.SMR.Sbar S)
          (fun k => if k ∈ S i then P i k else (α i k - Real.log (vTilde α β c P l i k)) / β i k) := 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), Online Supplement App. E.1, proof of Theorem 6, 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