Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, first claim (§A.1, first paragraph) — the optimal price dominates the myopic price: p*(r) ≥ p̃(r)

Proved
ReferencePricing.Myopic.myopicPrice_le_optPrice

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

dynamic-pricingmonotone-comparative-staticsmyopic-policyp2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the standing assumptions of §4 (pˉ>0\bar p > 0pˉ​>0, α∈[0,1)\alpha \in [0,1)α∈[0,1), β∈(0,1)\beta \in (0,1)β∈(0,1), Assumptions 1–3, R(0,r)=0R(0,r)=0R(0,r)=0, ddd differentiable), for every reference price r∈Pr \in Pr∈P,

p~(r)=arg max⁡p∈PΠ(p,r)  ≤  arg max⁡p∈P{Π(p,r)+βV(αr+(1−α)p)}=p∗(r),\tilde p(r) = \operatorname*{arg\,max}_{p\in P} \Pi(p, r) \;\le\; \operatorname*{arg\,max}_{p\in P}\{\Pi(p,r) + \beta V(\alpha r + (1-\alpha) p)\} = p^*(r),p~​(r)=p∈Pargmax​Π(p,r)≤p∈Pargmax​{Π(p,r)+βV(αr+(1−α)p)}=p∗(r),

where both argmax are largest maximizers.

The myopic firm underprices at every state: taking into account the future value of a higher reference price can only raise the price. This is the first sentence of Proposition 1, stated separately as the base case of the path comparison.

Formalization Note. Both policies are largest maximizers (the paper's convention); with arbitrary maximizers the inequality can fail. Differentiability of ddd is added as in the rest of §4.

Preamble
import Mathlib
import Definitions.Def_ReferencePricing_Myopic_Assumptions
import Definitions.Def_ReferencePricing_Myopic_optPrice
import Definitions.Def_ReferencePricing_Myopic_myopicPrice
Formal statement
namespace ReferencePricing.Myopic

/-- Proposition 1, first sentence, as proved in §A.1, first paragraph (pp. 418, 425): for every
reference price `r ∈ P`, the myopic price is at most the optimal price, `p̃(r) ≤ p*(r)`
(both the largest maximizers of their objectives over `P = [0, p̄]`). -/
theorem myopicPrice_le_optPrice (d : ℝ → ℝ) (R : ℝ → ℝ → ℝ) (α β pbar : ℝ)
    (hpbar : 0 < pbar) (hα₀ : 0 ≤ α) (hα₁ : α < 1) (hβ₀ : 0 < β) (hβ₁ : β < 1)
    (hR0 : ∀ r, R 0 r = 0) (hd : Differentiable ℝ d)
    (hA1 : Assumption1 d R pbar) (hA2 : Assumption2 R) (hA3 : Assumption3 d R pbar) :
    ∀ r ∈ Set.Icc (0 : ℝ) pbar,
      myopicPrice (profit d R) pbar r ≤ optPrice (profit d R) α β pbar r := by sorry

end ReferencePricing.Myopic
Source
Popescu and Wu, Dynamic Pricing Strategies with Reference Effects, Operations Research 55(3), 2007, p. 418, Proposition 1 (first sentence) and p. 425, §A.1, first paragraph
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Data.

  • d:R→Rd:\mathbb R\to\mathbb Rd:R→R and R:R×R→RR:\mathbb R\times\mathbb R\to\mathbb RR:R×R→R are arbitrary functions.
  • α,β,pˉ\alpha,\beta,\bar pα,β,pˉ​ are reals, and P=[0,pˉ]P=[0,\bar p]P=[0,pˉ​].
  • D(p,r)=d(p)+R(r−p,r)D(p,r)=d(p)+R(r-p,r)D(p,r)=d(p)+R(r−p,r) and Π(p,r)=p D(p,r)\Pi(p,r)=p\,D(p,r)Π(p,r)=pD(p,r).
  • π(p)=p d(p)\pi(p)=p\,d(p)π(p)=pd(p) and ΠR(p,r)=p R(r−p,r)\Pi^R(p,r)=p\,R(r-p,r)ΠR(p,r)=pR(r−p,r).
  • λ(r)\lambda(r)λ(r) is the derivative of x↦R(x,r)x\mapsto R(x,r)x↦R(x,r) at 000, or 000 if it does not exist.

The two prices being compared are defined as follows.

  • Myopic price p~(r)\tilde p(r)p~​(r): the supremum of the set of maximizers over PPP of p↦Π(p,r)p\mapsto\Pi(p,r)p↦Π(p,r), or 000 if that set is empty.
  • Value V(s)V(s)V(s): the supremum over all sequences (pt)(p_t)(pt​) in PPP of ∑tβtΠ(pt,rt)\sum_t\beta^t\Pi(p_t,r_t)∑t​βtΠ(pt​,rt​), along r0=sr_0=sr0​=s, rt+1=αrt+(1−α)ptr_{t+1}=\alpha r_t+(1-\alpha)p_trt+1​=αrt​+(1−α)pt​. A non-summable series counts as 000, and an unbounded-above supremum as 000.
  • Bellman objective W(p,r)=Π(p,r)+βV(αr+(1−α)p)W(p,r)=\Pi(p,r)+\beta V(\alpha r+(1-\alpha)p)W(p,r)=Π(p,r)+βV(αr+(1−α)p).
  • Optimal price p∗(r)p^*(r)p∗(r): the supremum of the set of maximizers over PPP of p↦W(p,r)p\mapsto W(p,r)p↦W(p,r), or 000 if that set is empty.

Hypotheses.

  • pˉ>0\bar p>0pˉ​>0;
  • 0≤α<10\le\alpha<10≤α<1;
  • 0<β<10<\beta<10<β<1;
  • R(0,r)=0R(0,r)=0R(0,r)=0 for all real rrr;
  • ddd is differentiable everywhere;
  • Assumption 1: on P×PP\times PP×P, DDD is nonnegative, bounded above and jointly continuous; it is non-increasing in ppp and non-decreasing in rrr; and x↦R(x,r)x\mapsto R(x,r)x↦R(x,r) is non-decreasing on [r−pˉ,r][r-\bar p,r][r−pˉ​,r] for each r∈Pr\in Pr∈P;
  • Assumption 2: RRR is differentiable on R2\mathbb R^2R2, and so is its derivative map;
  • Assumption 3:
    • π\piπ is neither non-decreasing nor non-increasing on PPP, and is concave on PPP;
    • r↦π′(r)−rλ(r)r\mapsto\pi'(r)-r\lambda(r)r↦π′(r)−rλ(r) is strictly decreasing on PPP;
    • ΠR(⋅,r)\Pi^R(\cdot,r)ΠR(⋅,r) is concave on PPP for each r∈Pr\in Pr∈P;
    • ΠR\Pi^RΠR has increasing differences on P×PP\times PP×P, as in the inequality of the previous declaration.

Conclusion. For every r∈[0,pˉ]r\in[0,\bar p]r∈[0,pˉ​]:

p~(r) ≤ p∗(r).\tilde p(r)\ \le\ p^*(r).p~​(r) ≤ p∗(r).

Degenerate cases:

  • pˉ>0\bar p>0pˉ​>0 and the ranges of α,β\alpha,\betaα,β exclude the empty price set, α≥1\alpha\ge1α≥1, and β∉(0,1)\beta\notin(0,1)β∈/(0,1). α=0\alpha=0α=0 is permitted.
  • The comparison is between the two numbers exactly as defined. If W(⋅,r)W(\cdot,r)W(⋅,r) had no maximizer on PPP, p∗(r)p^*(r)p∗(r) would be the junk value 000, and the statement would then require p~(r)≤0\tilde p(r)\le0p~​(r)≤0, i.e. p~(r)=0\tilde p(r)=0p~​(r)=0.
  • VVV inside WWW carries its own conventions: non-summable sums count as 000, and an unbounded supremum counts as 000.
  • Neither price is asserted to be an actual maximizer.
  • Only a weak inequality is claimed, and only for r∈[0,pˉ]r\in[0,\bar p]r∈[0,pˉ​].
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

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