Lemma 1, p. 11 — buying greedily in decreasing price-adjusted valuation maximizes the consumer's utility
ProvedAssortRotation.Concealment.lemma_1assortmentconsumer-choicediminishing-marginal-utilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider a fixed assortment of products with prices and realized shocks . Let be a nonnegative, decreasing marginal-utility sequence, and let be a permutation of the products such that
Let . Then buying the products maximizes the consumer's utility (3): for every subset of the products,
This characterizes the consumer's purchase under a fixed assortment, and it is what justifies the revenue formula (4).
Formalization Note. Positions are 0-based in Lean, so the condition reads for . The printed policy has an index slip. The proof (p. 35) and the surrounding text buy the product in position iff , and the statement formalizes that.
Preamble
import Mathlib import Definitions.Def_AssortRotation_Concealment_Model
Formal statement
namespace AssortRotation.Concealment
/-- Lemma 1, p. 11 (proof p. 35). For a fixed assortment of `M` products with prices `p`
and realized shocks `x`, let `σ` order the products by decreasing price-adjusted valuation
`x − p` (Definition 1). With 0-based positions, `D = #{j : v(j) + x_{σ j} − p_{σ j} ≥ 0}`
(the paper's `D^f`, whose 1-based condition is `v(j−1) + X_{σ(j)} − p_{σ(j)} ≥ 0`). Buying
the products at the first `D` positions of σ maximizes the utility (3) over all subsets. -/
theorem lemma_1 {M : ℕ} (v : ℕ → ℝ) (hv : MarginalUtility v) (p x : Fin M → ℝ)
(σ : Equiv.Perm (Fin M)) (hσ : Antitone (fun i => x (σ i) - p (σ i))) (S : Finset (Fin M)) :
utility v p x S ≤
utility v p x
((Finset.univ.filter (fun j : Fin M =>
(j : ℕ) < (Finset.univ.filter (fun i : Fin M =>
0 ≤ v i + x (σ i) - p (σ i))).card)).map σ.toEmbedding) := by sorry
end AssortRotation.Concealment
Source
Ferreira & Goh, HBS Working Paper 17-041 (2020 revision), p. 11, Lemma 1 (proof p. 35); utility (3) p. 8; Definition 1 p. 10
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.