Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 13 — one extra past purchase costs at most the highest remaining price: Rk+1(n)≤Rk(n)≤ρn∗+Rk+1(n)R_{k+1}(n)\le R_k(n)\le\rho^*_n+R_{k+1}(n)Rk+1​(n)≤Rk​(n)≤ρn∗​+Rk+1​(n)

Proved
AssortRotation.Concealment.lemma_2

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

assortmentdiminishing-marginal-utilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequential-assortment

Products are offered sequentially; a consumer who has already bought kkk items buys the current product (p,X)(p,X)(p,X) iff v(k)+X−p≥0v(k)+X-p\ge 0v(k)+X−p≥0, where vvv is nonnegative and decreasing. Let Rk(n)R_k(n)Rk​(n) be the revenue from the last nnn products when the consumer enters them having bought kkk items. Let ρn∗\rho^*_nρn∗​ be the highest price among those nnn products, with ρ0∗=0\rho^*_0=0ρ0∗​=0. If all prices are nonnegative, then for every kkk

Rk+1(n) ≤ Rk(n) ≤ ρn∗+Rk+1(n).R_{k+1}(n)\ \le\ R_k(n)\ \le\ \rho^*_n+R_{k+1}(n).Rk+1​(n) ≤ Rk​(n) ≤ ρn∗​+Rk+1​(n).

A consumer with one more past purchase is less willing to buy. She nonetheless buys at most one product fewer, so she costs the retailer at most one remaining price. This bound drives the interchange argument (Lemma 4) behind Theorem 1.

Formalization Note. The last nnn products are an arbitrary list LLL of (price, shock) pairs, and the statement holds for every realization. The paper's "with probability 1" is thus strengthened to "always". The paper restricts to k≤N−n−1k\le N-n-1k≤N−n−1; the Lean statement holds for every kkk. The purchase rule uses ≥0\ge 0≥0 (as in (5)–(6)) where (7) prints >0>0>0. The printed "ρn∗=max⁡{… }\rho^*_n=\max\{\dots\}ρn∗​=max{…} if n>1n>1n>1" is read as n≥1n\ge 1n≥1, with ρ0∗=0\rho^*_0=0ρ0∗​=0.

Preamble
import Mathlib
import Definitions.Def_AssortRotation_Concealment_Model
Formal statement
namespace AssortRotation.Concealment

/-- Lemma 2, p. 13. For any list `L` of products (the last `n` products of the sequence) with
nonnegative prices and any number `k` of past purchases,
`R_{k+1}(n) ≤ R_k(n) ≤ ρ*_n + R_{k+1}(n)`, where `R_k(n) = seqRev v L k` and
`ρ*_n = rhoStar L` is the highest remaining price (`0` for `n = 0`). -/
theorem lemma_2 (v : ℕ → ℝ) (hv : MarginalUtility v) (L : List (ℝ × ℝ))
    (hp : ∀ a ∈ L, 0 ≤ a.1) (k : ℕ) :
    seqRev v L (k + 1) ≤ seqRev v L k ∧ seqRev v L k ≤ rhoStar L + seqRev v L (k + 1) := by sorry

end AssortRotation.Concealment
Source
Ferreira & Goh, HBS Working Paper 17-041 (2020 revision), p. 13, Lemma 2, (7)–(8)
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