Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 1, p. 12 — appending a product never lowers the sequential revenue RsR^sRs

Proved
AssortRotation.Concealment.remark_1

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

assortmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequential-assortment

Products are offered sequentially to a consumer with nonnegative, decreasing marginal utility vvv, who buys product iii iff v(k)+Xi−pi≥0v(k)+X_i-p_i\ge0v(k)+Xi​−pi​≥0 with kkk her past purchases. Let Rs(M)R^s(M)Rs(M) be the revenue from a sequence of MMM products. Appending a further product (pM+1,XM+1)(p_{M+1},X_{M+1})(pM+1​,XM+1​) with pM+1≥0p_{M+1}\ge 0pM+1​≥0 at the end cannot decrease the revenue:

Rs(M) ≤ Rs(M+1).R^s(M)\ \le\ R^s(M+1).Rs(M) ≤ Rs(M+1).

Consequently an optimized sequential assortment may be taken to include all NNN products. The optimized sequential revenue E[R∗s]\mathbb E[R^s_*]E[R∗s​] is therefore a maximum over orders of all NNN products.

Formalization Note. The statement is pathwise, for an arbitrary list of (price, shock) pairs.

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

/-- Remark 1, p. 12. Appending one more product (with a nonnegative price) at the end of a
sequential assortment never lowers the sequential revenue `R^s` of (6). -/
theorem remark_1 (v : ℕ → ℝ) (hv : MarginalUtility v) (L : List (ℝ × ℝ)) (a : ℝ × ℝ)
    (ha : 0 ≤ a.1) :
    seqRev v L 0 ≤ seqRev v (L ++ [a]) 0 := by sorry

end AssortRotation.Concealment
Source
Ferreira & Goh, HBS Working Paper 17-041 (2020 revision), p. 12, Remark 1
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