Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(19) — the optimal expected revenue is nondecreasing in the quality of a displayed product

Proved
ProductFraming.Pricing.eq_19_monotone

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

mnlp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pricingproduct-framing

Fix a feasible framing on m≥1m\ge1m≥1 pages of capacity p≥1p\ge1p≥1, a page-count law λ\lambdaλ on [m][m][m] and β>0\beta>0β>0. For a quality vector a∈Rna\in\mathbb R^na∈Rn let

R(a)=sup⁡r∈Rn∑x=1mλ(x) R(r∣S(x))R(a)=\sup_{r\in\mathbb R^n}\sum_{x=1}^m\lambda(x)\,R\big(r\mid S(x)\big)R(a)=r∈Rnsup​x=1∑m​λ(x)R(r∣S(x))

be the optimal expected revenue of the framing. Let iii be a displayed product and let a′a'a′ agree with aaa except that ai′=t≥aia'_i = t \ge a_iai′​=t≥ai​. Then both suprema are finite (the revenues are bounded above) and

R(a)≤R(a′).R(a)\le R(a').R(a)≤R(a′).

In the paper this is the conclusion drawn from the envelope formula (19), ∂R(a)/∂ai=1β∑l=x(i)mλ(l)P(i,S(l))≥0\partial R(a)/\partial a_i=\frac1\beta\sum_{l=x(i)}^m\lambda(l)P(i,S(l))\ge0∂R(a)/∂ai​=β1​∑l=x(i)m​λ(l)P(i,S(l))≥0: the total expected revenue increases in the quality of any displayed product. It is what makes filling pages with the best products optimal in Theorem 6.

Formalization Note. The envelope identity (19) itself presupposes a differentiable selection of optimal prices r(a)r(a)r(a), which the paper does not establish; the milestone states its stated consequence, the monotonicity of the optimal value, instead. "Increases" is read weakly. The boundedness clauses make the real supremum meaningful.

Preamble
import Mathlib
import Definitions.Def_ProductFraming_Pricing_MNL
import Definitions.Def_ProductFraming_Pricing_Model
open Finset
Formal statement
namespace ProductFraming.Pricing

theorem eq_19_monotone {n m p : ℕ} (a : Fin n → ℝ) (β : ℝ) (lam : ℕ → ℝ)
    (hβ : 0 < β) (hm : 1 ≤ m) (hp : 1 ≤ p) (hlam : ProductFraming.Nest.IsPageLaw m lam)
    (f : Fin n → ℕ) (hf : ProductFraming.Trunc.Feasible m p f) (i : Fin n) (hi : 1 ≤ f i) (t : ℝ) (ht : a i ≤ t) :
    BddAbove (Set.range (totalRevenue m a β lam f)) ∧
      BddAbove (Set.range (totalRevenue m (Function.update a i t) β lam f)) ∧
      optRevenue m a β lam f ≤ optRevenue m (Function.update a i t) β lam f := by sorry

end ProductFraming.Pricing
Source
Gallego, Li, Truong, Wang, Approximation Algorithms for Product Framing and Pricing, Operations Research (2020), DOI 10.1287/opre.2019.1875, authors' accepted manuscript, A.5, Proof of Theorem 6, p. 44, eq. (19) and the sentence following it
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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