Lemma 4, p. 38 — swapping a top-priced first product with a better-valued second product does not raise revenue
ProvedAssortRotation.Concealment.lemma_4Products are offered sequentially in this order to a consumer with nonnegative, decreasing marginal utility . She buys product iff , where is the number of items already bought. All prices are nonnegative, and the first product has the highest price,
Let be the retailer's revenue for this sequence, and the revenue when products 1 and 2 (prices and realized valuations) are interchanged. If , then
Moving the higher-valued but cheaper second product ahead of the most expensive one cannot help the retailer. This is the single interchange step of the proof of Theorem 1(a).
Formalization Note. In the paper interchanges the products only on the event , and elsewhere, so the content of is the inequality on that event. The statement is pathwise, for every realization. The consumer starts with no purchases. A mid-sequence use with prior purchases is the same statement for the shifted sequence , which is again nonnegative and decreasing.
import Mathlib import Definitions.Def_AssortRotation_Concealment_Model
namespace AssortRotation.Concealment
/-- Lemma 4, p. 38. Let the first product `a₁ = (p₁, X₁)` have the highest price of the
sequence `a₁, a₂, t` (all prices nonnegative). On the event `X₁ − p₁ ≤ X₂ − p₂`, interchanging
the first two products (prices and realized valuations) does not increase the sequential
revenue: `R̂ ≤ R`. (Off that event `R̂ = R` by definition.) -/
theorem lemma_4 (v : ℕ → ℝ) (hv : MarginalUtility v) (a₁ a₂ : ℝ × ℝ) (t : List (ℝ × ℝ))
(hp : ∀ b ∈ a₁ :: a₂ :: t, 0 ≤ b.1) (h₂ : a₂.1 ≤ a₁.1) (ht : ∀ b ∈ t, b.1 ≤ a₁.1)
(hX : a₁.2 - a₁.1 ≤ a₂.2 - a₂.1) :
seqRev v (a₂ :: a₁ :: t) 0 ≤ seqRev v (a₁ :: a₂ :: t) 0 := by sorry
end AssortRotation.Concealment
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.