Lemma 1 — and are quasi-convex on
ProvedRetailVariety.Fashion.lemma_1assortment-planningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quasiconvexity
Consider a category with preferences , , no-purchase preference , and model parameters , , , . Let be any set of variants, and let , , , , be the functions (9)–(11) of Lemma 1. Then
that is, for every the sets are intervals.
Quasi-convexity means that the profit of adding a variant to , as a function of the added preference, is maximized at an end point. In the proof of Theorem 3 it is applied to the category with .
Formalization Note. This restates Lemma 1 of mission I of this series inside this mission's namespace (draft items cannot import each other). The decreasing order of §3.1 is a hypothesis, so that (index 0 in Lean) is the largest preference. is allowed.
Preamble
import Mathlib import Definitions.Def_RetailVariety_Fashion_Lemma1Functions
Formal statement
namespace RetailVariety.Fashion
/-- Lemma 1 (p. 1503), restated: for preferences sorted decreasingly (§3.1), any set `S` of
variants and `0 ≤ δ ≤ v_1`, the functions `h_I = g_I/f` and `h_T = g_T/f` are quasi-convex in `δ`. -/
theorem lemma_1 {n : ℕ} (p c lam σ β v0 : ℝ) (hc : 0 < c) (hcp : c < p) (hlam : 0 < lam)
(hσ : 0 < σ) (hβ0 : 0 ≤ β) (hβ1 : β < 1) (hv0 : 0 < v0)
(v : Fin n → ℝ) (hv : ∀ j, 0 ≤ v j) (hva : Antitone v) (hn : 0 < n) (S : Finset (Fin n)) :
QuasiconvexOn ℝ (Set.Icc 0 (v ⟨0, hn⟩)) (hI p c lam σ β v v0 S) ∧
QuasiconvexOn ℝ (Set.Icc 0 (v ⟨0, hn⟩)) (hT p c lam v v0 S) := by sorry
end RetailVariety.Fashion
Source
van Ryzin & Mahajan, On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments, Management Science 45(11), 1999, p. 1503, Lemma 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.