Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Iterative assortment planning estimates relative preferences correctly: v^i(x)/v^j(x)=vi/vj\hat v_i(x)/\hat v_j(x)=v_i/v_jv^i​(x)/v^j​(x)=vi​/vj​

Proved
AssortSearch.HeurEq.estimates_ratio

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

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

Consider the independent assortment search model with preferences v1,…,vn>0v_1,\dots,v_n>0v1​,…,vn​>0, v0>0v_0>0v0​>0 and λ>0\lambda>0λ>0. For an assortment of depth 1≤x≤n1\le x\le n1≤x≤n let v^(x)=(v^0(x),…,v^x(x),v^x+1(n),…,v^n(n))\hat v(x)=(\hat v_0(x),\dots,\hat v_x(x),\hat v_{x+1}(n),\dots,\hat v_n(n))v^(x)=(v^0​(x),…,v^x​(x),v^x+1​(n),…,v^n​(n)) be the preferences the retailer estimates from the observed demands, normalised by v^1(x)=1\hat v_1(x)=1v^1​(x)=1, with depth-test estimates for the variants not carried. Then for all product variants 0<i<j≤n0<i<j\le n0<i<j≤n,

v^i(x)v^j(x)=vivj.\frac{\hat v_i(x)}{\hat v_j(x)}=\frac{v_i}{v_j}.v^j​(x)v^i​(x)​=vj​vi​​.

Given that the preference of variant 1 is held fixed, the iterative procedure therefore estimates every product variant's preference correctly under any assortment; only the no-purchase estimate v^0(x)\hat v_0(x)v^0​(x) is biased.

Formalization Note 0-based indices: the paper's 0<i<j≤n0<i<j\le n0<i<j≤n is i < j in Fin n. The depth xxx satisfies 1≤x≤n1\le x\le n1≤x≤n, the range where the estimates are defined.

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

open RetailVariety.Structure

/-- Iterative assortment planning estimates the relative preferences of the product variants
correctly under any assortment (p. 21): for every depth `1 ≤ x ≤ n` and all variants
`0 < i < j ≤ n` (0-based: `i < j` in `Fin n`), `v̂_i(x) / v̂_j(x) = v_i / v_j`. Variants outside
`x` carry the depth-test estimates `v̂_i(n)`. -/
theorem estimates_ratio {n : ℕ} (lam : ℝ) (v : Fin n → ℝ) (v0 : ℝ)
    (hv : ∀ i, 0 < v i) (hv0 : 0 < v0) (hlam : 0 < lam)
    (x : ℕ) (hx1 : 1 ≤ x) (hxn : x ≤ n) (i j : Fin n) (hij : i < j) :
    estPref lam v v0 x i / estPref lam v v0 x j = v i / v j := 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 v̂_i(x)/v̂_j(x) = v_i/v_j
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