Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The no-purchase ratio q0si(x)/qisi(x)q_0^{si}(x)/q_i^{si}(x)q0si​(x)/qisi​(x) in the independent assortment model

Proved
AssortSearch.HeurEq.no_purchase_ratio

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

assortment-planningconsumer-searchmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the independent assortment search model with v1,…,vn>0v_1,\dots,v_n>0v1​,…,vn​>0, v0>0v_0>0v0​>0, λ>0\lambda>0λ>0 and the assortment {1,…,x}\{1,\dots,x\}{1,…,x}, write qjm(x)=vj/(v0+∑k≤xvk)q_j^m(x)=v_j/(v_0+\sum_{k\le x}v_k)qjm​(x)=vj​/(v0​+∑k≤x​vk​) and q0m(x)=v0/(v0+∑k≤xvk)q_0^m(x)=v_0/(v_0+\sum_{k\le x}v_k)q0m​(x)=v0​/(v0​+∑k≤x​vk​) for the no-search shares, H(Uˉ,x)=exp⁡(−λ(v0+∑k≤xvk))H(\bar U,x)=\exp(-\lambda(v_0+\sum_{k\le x}v_k))H(Uˉ,x)=exp(−λ(v0​+∑k≤x​vk​)) for the search probability, and q0si(x)=1−∑j≤xqjsi(x)q_0^{si}(x)=1-\sum_{j\le x}q_j^{si}(x)q0si​(x)=1−∑j≤x​qjsi​(x) for the no-purchase demand. For every product variant iii in the assortment,

q0si(x)qisi(x)=q0m(x)+∑j≤xqjm(x) H(Uˉ,x)qim(x)(1−H(Uˉ,x)).\frac{q_0^{si}(x)}{q_i^{si}(x)}=\frac{q_0^m(x)+\sum_{j\le x}q_j^m(x)\,H(\bar U,x)}{q_i^m(x)\big(1-H(\bar U,x)\big)}.qisi​(x)q0si​(x)​=qim​(x)(1−H(Uˉ,x))q0m​(x)+∑j≤x​qjm​(x)H(Uˉ,x)​.

The right-hand side depends on the assortment: the relative preference of the no-purchase option to a product variant is not independent of the assortment, so IIA fails with respect to the no-purchase option.

Formalization Note q0si(x)q_0^{si}(x)q0si​(x) is the normalised no-purchase demand d0(x)d_0(x)d0​(x) of (14); λ>0\lambda>0λ>0 is a free parameter.

Preamble
import Mathlib
import Definitions.Def_AssortSearch_HeurEq_Model
Formal statement
namespace AssortSearch.HeurEq

open RetailVariety.Structure

/-- The relative preference of the no-purchase variant in the independent assortment model
(p. 21): for a product variant `i` of the assortment `x`,
`q_0^si(x) / q_i^si(x) = (q_0^m(x) + ∑_{j ≤ x} q_j^m(x) H(Ū, x)) / (q_i^m(x) (1 − H(Ū, x)))`. -/
theorem no_purchase_ratio {n : ℕ} (lam : ℝ) (v : Fin n → ℝ) (v0 : ℝ)
    (hv : ∀ i, 0 < v i) (hv0 : 0 < v0) (hlam : 0 < lam)
    (x : ℕ) (i : Fin n) (hi : i.val < x) :
    demandNoPurchase lam v v0 x / demand lam v v0 x i =
      (shareNoPurchase v v0 x +
          ∑ j ∈ popularSet n x, share v v0 (popularSet n x) j * searchH lam v v0 x) /
        (share v v0 (popularSet n x) i * (1 - searchH lam v v0 x)) := by sorry

end AssortSearch.HeurEq
Source
Cachon, Terwiesch & Xu, Retail Assortment Planning in the Presence of Consumer Search, working paper (Dec. 20, 2002), p. 21 (PDF 23), §5.1, display for q_0^si(x)/q_i^si(x)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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