Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(15) — gradient of the expected revenue in the price of a displayed product

Proved
ProductFraming.Pricing.eq_15

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], qualities a∈Rna\in\mathbb R^na∈Rn, a price sensitivity β>0\beta>0β>0 and a price vector r∈Rnr\in\mathbb R^nr∈Rn. Let iii be a displayed product and x(i)∈[m]x(i)\in[m]x(i)∈[m] its page, and write S(l)S(l)S(l) for the products on pages 1,…,l1,\dots,l1,…,l. Then the total expected revenue E[R(r∣S(X))]=∑l=1mλ(l)R(r∣S(l))\mathbf E[R(r\mid S(X))]=\sum_{l=1}^m\lambda(l)R(r\mid S(l))E[R(r∣S(X))]=∑l=1m​λ(l)R(r∣S(l)) is differentiable in rir_iri​ (all other prices held fixed), with

∂ E[R(r∣S(X))]∂ri=β∑l=x(i)mλ(l) P(i,S(l)){1β+R(r∣S(l))−ri}.\frac{\partial\, \mathbf E[R(r\mid S(X))]}{\partial r_i} = \beta \sum_{l=x(i)}^{m} \lambda(l)\,P\big(i,S(l)\big)\Big\{\frac1\beta + R\big(r\mid S(l)\big) - r_i\Big\}.∂ri​∂E[R(r∣S(X))]​=βl=x(i)∑m​λ(l)P(i,S(l)){β1​+R(r∣S(l))−ri​}.

This is the gradient from which the first-order condition (17) and the page-level price structure of Theorem 5 are derived.

Formalization Note. The derivative is stated as HasDerivAt of t↦E[R(r(i←t)∣S(X))]t\mapsto \mathbf E[R(r^{(i\leftarrow t)}\mid S(X))]t↦E[R(r(i←t)∣S(X))] at t=rit=r_it=ri​, where r(i←t)r^{(i\leftarrow t)}r(i←t) replaces the iii-th price by ttt. Only displayed products (1≤x(i)≤m1\le x(i)\le m1≤x(i)≤m) are covered; for an undisplayed product the paper sets x(i)=m+1x(i)=m+1x(i)=m+1 and the sum is empty.

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

theorem eq_15 {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) (r : Fin n → ℝ) (i : Fin n) (hi : 1 ≤ f i) :
    HasDerivAt (fun t : ℝ => totalRevenue m a β lam f (Function.update r i t))
      (β * ∑ l ∈ Icc (f i) m, lam l * mnl a β r (ProductFraming.Nest.consideration f l) i *
        (1 / β + revenue a β r (ProductFraming.Nest.consideration f l) - r i)) (r i) := 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 5, p. 43, eq. (15)
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