Theorem 1: some most-popular set maximizes store profit, under both demand models
ProvedRetailVariety.Structure.theorem_1Let the category have variants with preferences sorted in decreasing order, , and no-purchase preference . Let the price and unit cost satisfy , and let , , . Write for the set of the most popular variants ().
- Independent population model. There is with such that
- Trend-following population model. There is with such that
Here and are the store profits (7) and (8). Thus the retailer's choice among assortments reduces to a choice among the (respectively ) nested most-popular sets, even though the most profitable assortment of a given size need not consist of the most popular variants.
Formalization Note The paper states for both models. In the independent model is negative for small , and then the empty assortment (profit ) is the unique optimum over all ; the formal statement therefore allows there. In the trend-following model , and the printed range is kept. The sorting (the paper's "without loss of generality", §3.1) is the hypothesis Antitone v.
import Mathlib import Definitions.Def_RetailVariety_Structure_Model
namespace RetailVariety.Structure
/-- Theorem 1, p. 1503: with the variants sorted by decreasing preference, some most-popular set
`A_i = {1, …, i}` maximizes store profit over all assortments `S ⊆ N`, for each of the two
demand models. Independent model: `0 ≤ i ≤ n` (`A_0 = ∅` is needed when every nonempty
assortment loses money). Trend-following model: `1 ≤ i ≤ n`, as printed. -/
theorem theorem_1 (n : ℕ) (hn : 0 < n) (v : Fin n → ℝ) (v0 : ℝ) (hv : ∀ j, 0 < v j)
(hv0 : 0 < v0) (hanti : Antitone v) (p c lam σ β : ℝ) (hc : 0 < c) (hcp : c < p)
(hlam : 0 < lam) (hσ : 0 < σ) (hβ0 : 0 ≤ β) (hβ1 : β < 1) :
(∃ i : ℕ, i ≤ n ∧ ∀ S : Finset (Fin n),
profitI p c lam σ β v v0 S ≤ profitI p c lam σ β v v0 (popularSet n i)) ∧
(∃ i : ℕ, 1 ≤ i ∧ i ≤ n ∧ ∀ S : Finset (Fin n),
profitT p c lam v v0 S ≤ profitT p c lam v v0 (popularSet n i)) := by sorry
end RetailVariety.Structure
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.