Theorem 1(a), p. 15 (for every fixed assortment, as proved on p. 39) — decreasing-price sequential revenue pathwise
ProvedAssortRotation.Concealment.theorem_1_aTake any fixed assortment of products with nonnegative prices and realized shocks . The marginal utility is nonnegative and decreasing. Let be the retailer's revenue when the same products are offered sequentially in decreasing order of prices, , with any order among equal prices. Let be the fixed-assortment revenue (4), computed along any order of decreasing price-adjusted valuation (Definition 1). Then
Applied to an optimized fixed assortment, this is part (a) of Theorem 1. The decreasing-price sequence is thus a concrete heuristic that never earns less than the fixed assortment on the same products.
Formalization Note. The inequality is stated for every realization, not only with probability 1. It is stated for every fixed assortment, not only an optimized one, because the proof on p. 39 never uses optimality. Both orders are arbitrary lists: any ordering consistent with decreasing prices, and any ordering consistent with decreasing price-adjusted valuations.
import Mathlib import Definitions.Def_AssortRotation_Concealment_Model
namespace AssortRotation.Concealment
/-- Theorem 1(a), p. 15, for every fixed assortment (as proved on p. 39). Let `L` list the
`M` products of a fixed assortment in decreasing order of prices, `p₁ ≥ ⋯ ≥ p_M`, all
nonnegative, and let `L'` be the same products in any Definition-1 order σ (decreasing
`X − p`). Then the sequential revenue `R` of `L` is at least the fixed revenue `R^f` (4). -/
theorem theorem_1_a (v : ℕ → ℝ) (hv : MarginalUtility v) (L : List (ℝ × ℝ))
(hp : ∀ a ∈ L, 0 ≤ a.1) (hdec : L.Pairwise (fun a b => b.1 ≤ a.1)) (L' : List (ℝ × ℝ))
(hperm : L'.Perm L) (hσ : L'.Pairwise (fun a b => b.2 - b.1 ≤ a.2 - a.1)) :
fixedRev v L' ≤ seqRev v L 0 := by sorry
end AssortRotation.Concealment
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.