Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 15 — decreasing-price sequential revenue ≥ R∗fR^f_*R∗f​ pathwise, and E[R∗s]≥E[R∗f]\mathbb E[R^s_*]\ge\mathbb E[R^f_*]E[R∗s​]≥E[R∗f​]

Proved
AssortRotation.Concealment.theorem_1

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

assortmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequential-assortmentvalue-of-concealment

A retailer has NNN products with nonnegative prices p1,…,pNp_1,\dots,p_Np1​,…,pN​. Its consumer has realized valuation shocks X1,…,XNX_1,\dots,X_NX1​,…,XN​, which are mutually independent, continuous, integrable random variables on a probability space (Ω,P)(\Omega,\mathbb P)(Ω,P), and a nonnegative, decreasing marginal utility vvv. Let Rf(S)R^f(S)Rf(S) be the fixed-assortment revenue (4) of a subset SSS of products. Let E[R∗f]=max⁡SE[Rf(S)]\mathbb E[R^f_*]=\max_S\mathbb E[R^f(S)]E[R∗f​]=maxS​E[Rf(S)] over all subsets, and E[R∗s]\mathbb E[R^s_*]E[R∗s​] the largest expected sequential revenue over all orders of all NNN products.

  1. (a) Suppose that SSS is an optimized fixed assortment, E[Rf(S)]=E[R∗f]\mathbb E[R^f(S)]=\mathbb E[R^f_*]E[Rf(S)]=E[R∗f​], with M≤NM\le NM≤N products. Let RRR be the revenue of the sequential assortment that offers the same MMM products in decreasing order of prices, p1≥⋯≥pMp_1\ge\cdots\ge p_Mp1​≥⋯≥pM​. Then for every outcome ω\omegaω
R(ω) ≥ R∗f(ω).R(\omega)\ \ge\ R^f_*(\omega).R(ω) ≥ R∗f​(ω).
  1. (b) The retailer's value of concealment is (weakly) positive:
E[R∗s] ≥ E[R∗f].\mathbb E[R^s_*]\ \ge\ \mathbb E[R^f_*].E[R∗s​] ≥ E[R∗f​].

This is the paper's central result. Concealing products and revealing them one at a time is never worse for the retailer than a fixed assortment. The decreasing-price sequence of the optimal fixed assortment already earns at least as much.

Formalization Note. "With probability 1" in (a) is strengthened to every outcome ω\omegaω. Any order among equal prices is allowed in (a). Prices are assumed nonnegative, which is implicit in the paper. Independence, continuity (null singletons for the law of each XiX_iXi​), integrability and measurability are the paper's standing assumptions (§2(d) and Notation, p. 10). They are kept even though the inequality does not use them. R∗f(ω)R^f_*(\omega)R∗f​(ω) is computed with the canonical Definition-1 order (ties broken by index), and other orders differ only on a null tie event. "Positive" is meant in the weak sense, the paper's convention (p. 10).

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

open MeasureTheory ProbabilityTheory

/-- Theorem 1, p. 15. In the model of §2 (`N` products with nonnegative prices `p`,
independent, continuous, integrable valuation shocks `X`, marginal utility `v`):
(a) if `S` is an optimized fixed assortment, then for every outcome `ω` the sequential
revenue `R` of the same products shown in decreasing order of prices (any order among equal
prices) is at least `R^f_*(ω)`;
(b) the value of concealment is (weakly) positive: `E[R^f_*] ≤ E[R^s_*]`. -/
theorem theorem_1 {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    {N : ℕ} (v : ℕ → ℝ) (hv : MarginalUtility v) (p : Fin N → ℝ) (hp : ∀ i, 0 ≤ p i)
    (X : Fin N → Ω → ℝ) (hXm : ∀ i, Measurable (X i)) (hXi : ∀ i, Integrable (X i) μ)
    (hind : iIndepFun X μ) (hcont : ∀ i, NullSingletonClass (μ.map (X i))) :
    (∀ S : Finset (Fin N), (∫ ω, RfSet v p X S ω ∂μ = ERfStar μ v p X) →
      ∀ ω : Ω, ∀ L : List (ℝ × ℝ), L.Perm (products p X S ω) →
        L.Pairwise (fun a b => b.1 ≤ a.1) → RfSet v p X S ω ≤ seqRev v L 0) ∧
    ERfStar μ v p X ≤ ERsStar μ v p X := by sorry

end AssortRotation.Concealment
Source
Ferreira & Goh, HBS Working Paper 17-041 (2020 revision), p. 15, Theorem 1 (proof p. 39); VoC definition p. 12
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