Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(17) — first-order condition: an optimal price is a weighted average of 1/β+R(r∣S(l))1/\beta + R(r\mid S(l))1/β+R(r∣S(l))

Proved
ProductFraming.Pricing.eq_17

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 and β>0\beta>0β>0. Let r∈Rnr\in\mathbb R^nr∈Rn be an optimal price vector for this framing, i.e. E[R(r′∣S(X))]≤E[R(r∣S(X))]\mathbf E[R(r'\mid S(X))]\le \mathbf E[R(r\mid S(X))]E[R(r′∣S(X))]≤E[R(r∣S(X))] for every r′∈Rnr'\in\mathbb R^nr′∈Rn. Then for every displayed product iii, with page x(i)x(i)x(i), that some consumer sees, i.e. Λ(x(i))=P[X≥x(i)]>0\Lambda(x(i))=\mathbf P[X\ge x(i)]>0Λ(x(i))=P[X≥x(i)]>0,

ri=∑l=x(i)mλ(l) P(i,S(l)){1β+R(r∣S(l))}∑l=x(i)mλ(l) P(i,S(l)).r_i = \frac{\sum_{l=x(i)}^{m}\lambda(l)\,P\big(i,S(l)\big)\big\{\frac1\beta + R\big(r\mid S(l)\big)\big\}}{\sum_{l=x(i)}^{m}\lambda(l)\,P\big(i,S(l)\big)}.ri​=∑l=x(i)m​λ(l)P(i,S(l))∑l=x(i)m​λ(l)P(i,S(l)){β1​+R(r∣S(l))}​.

Thus each optimal price is the constant 1/β1/\beta1/β plus a weighted average of the revenues of the consumers who see the product. Since the weights of all products on one page agree up to a common factor, this gives the within-page part of Theorem 5.

Formalization Note. Prices are finite, so P(i,S(l))>0P(i,S(l))>0P(i,S(l))>0 whenever i∈S(l)i\in S(l)i∈S(l), and the paper's "priced out" branch (ri=+∞r_i=+\inftyri​=+∞) does not arise; a priced-out product is the same as an undisplayed one. The hypothesis Λ(x(i))>0\Lambda(x(i))>0Λ(x(i))>0 is added: it is exactly the condition that the denominator is positive (so Lean's convention x/0=0x/0=0x/0=0 never applies); a product that no consumer ever sees has an arbitrary price at an optimum, and the paper does not consider that case. The statement is about every maximizer; it does not assert that one exists.

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

theorem eq_17 {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 → ℝ)
    (hr : ∀ r' : Fin n → ℝ, totalRevenue m a β lam f r' ≤ totalRevenue m a β lam f r)
    (i : Fin n) (hi : 1 ≤ f i) (hreach : 0 < ProductFraming.Nest.tail m lam (f i)) :
    r i = (∑ 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))) /
          (∑ l ∈ Icc (f i) m, lam l * mnl a β r (ProductFraming.Nest.consideration f l) 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, eqs. (16)–(17)
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