Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 38 — swapping a top-priced first product with a better-valued second product does not raise revenue

Proved
AssortRotation.Concealment.lemma_4

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

assortmentinterchange-argumentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequential-assortment

Products (p1,X1),(p2,X2),…,(pN,XN)(p_1,X_1),(p_2,X_2),\dots,(p_N,X_N)(p1​,X1​),(p2​,X2​),…,(pN​,XN​) are offered sequentially in this order to a consumer with nonnegative, decreasing marginal utility vvv. She buys product iii iff v(k)+Xi−pi≥0v(k)+X_i-p_i\ge0v(k)+Xi​−pi​≥0, where kkk is the number of items already bought. All prices are nonnegative, and the first product has the highest price,

p1 ≥ max⁡{p2,…,pN}.p_1\ \ge\ \max\{p_2,\dots,p_N\}.p1​ ≥ max{p2​,…,pN​}.

Let RRR be the retailer's revenue for this sequence, and R^\hat RR^ the revenue when products 1 and 2 (prices and realized valuations) are interchanged. If X1−p1≤X2−p2X_1-p_1\le X_2-p_2X1​−p1​≤X2​−p2​, then

R^ ≤ R.\hat R\ \le\ R .R^ ≤ R.

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 R^\hat RR^ interchanges the products only on the event X1−p1≤X2−p2X_1-p_1\le X_2-p_2X1​−p1​≤X2​−p2​, and R^=R\hat R=RR^=R elsewhere, so the content of R≥R^R\ge\hat RR≥R^ is the inequality on that event. The statement is pathwise, for every realization. The consumer starts with no purchases. A mid-sequence use with kkk prior purchases is the same statement for the shifted sequence v(⋅+k)v(\cdot+k)v(⋅+k), which is again nonnegative and decreasing.

Preamble
import Mathlib
import Definitions.Def_AssortRotation_Concealment_Model
Formal statement
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
Source
Ferreira & Goh, HBS Working Paper 17-041 (2020 revision), p. 38, Lemma 4
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me