Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — the myopic (single-period profit-maximizing) price p̃(r) is increasing in r

Proved
ReferencePricing.Myopic.lemma1_myopicPrice_monotone

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

dynamic-pricingmonotone-comparative-staticsp2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1supermodularity

Under the standing assumptions of §4 — pˉ>0\bar p > 0pˉ​>0, Assumptions 1, 2 and 3, R(0,r)=0R(0,r)=0R(0,r)=0, and ddd differentiable — the single-period profit-maximizing price

p~(r)=arg max⁡p∈PΠ(p,r)\tilde p(r) = \operatorname*{arg\,max}_{p \in P} \Pi(p, r)p~​(r)=p∈Pargmax​Π(p,r)

(the largest maximizer) is increasing in rrr on P=[0,pˉ]P = [0, \bar p]P=[0,pˉ​].

A myopic firm charges more when consumers expect higher prices. The paper obtains this from supermodularity of the profit (Assumption 3(c)) through Topkis' monotonicity theorem; it drives the monotone behaviour of the myopic path.

Formalization Note. Assumptions 2 and 3 are standing throughout §§4.1–4.3 and are kept as hypotheses. Differentiability of ddd is added: Assumption 3(b) refers to π′\pi'π′, and Lean's deriv is 000 at points of non-differentiability.

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

/-- Lemma 1 (p. 418): under the standing assumptions of §4 (Assumptions 1–3), the single-period
profit-maximizing price `p̃(r) = argmax_{p ∈ P} Π(p, r)` (largest maximizer) is increasing in `r`
on `P = [0, p̄]`. -/
theorem lemma1_myopicPrice_monotone (d : ℝ → ℝ) (R : ℝ → ℝ → ℝ) (pbar : ℝ)
    (hpbar : 0 < pbar) (hR0 : ∀ r, R 0 r = 0) (hd : Differentiable ℝ d)
    (hA1 : Assumption1 d R pbar) (hA2 : Assumption2 R) (hA3 : Assumption3 d R pbar) :
    MonotoneOn (myopicPrice (profit d R) pbar) (Set.Icc 0 pbar) := by sorry

end ReferencePricing.Myopic
Source
Popescu and Wu, Dynamic Pricing Strategies with Reference Effects, Operations Research 55(3), 2007, p. 418, Lemma 1
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ˉ\bar ppˉ​ is a real, 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 two-sided derivative of x↦R(x,r)x\mapsto R(x,r)x↦R(x,r) at 000, or 000 if it does not exist.
  • p~(r)\tilde p(r)p~​(r) is the supremum of the set of maximizers of p↦Π(p,r)p\mapsto\Pi(p,r)p↦Π(p,r) over PPP, and is 000 if there is no maximizer.

Hypotheses.

  1. pˉ>0\bar p>0pˉ​>0.
  2. R(0,r)=0R(0,r)=0R(0,r)=0 for all real rrr.
  3. ddd is differentiable at every real point.
  4. Assumption 1 holds on PPP:
    • D≥0D\ge0D≥0 on P×PP\times PP×P;
    • DDD is bounded above on P×PP\times PP×P;
    • DDD is jointly continuous on P×PP\times PP×P;
    • DDD is non-increasing in p∈Pp\in Pp∈P for each r∈Pr\in Pr∈P;
    • DDD is non-decreasing in r∈Pr\in Pr∈P for each p∈Pp\in Pp∈P;
    • 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.
  5. Assumption 2 holds: RRR, as a map R2→R\mathbb R^2\to\mathbb RR2→R, is differentiable everywhere, and so is its derivative map.
  6. Assumption 3 holds on PPP:
    • π\piπ is neither non-decreasing nor non-increasing on PPP;
    • π\piπ is concave on PPP;
    • r↦π′(r)−rλ(r)r\mapsto\pi'(r)-r\lambda(r)r↦π′(r)−rλ(r) is strictly decreasing on PPP, where π′\pi'π′ is the two-sided derivative on R\mathbb RR;
    • for each r∈Pr\in Pr∈P, p↦ΠR(p,r)p\mapsto\Pi^R(p,r)p↦ΠR(p,r) is concave on PPP;
    • for all p1≤p2p_1\le p_2p1​≤p2​ and r1≤r2r_1\le r_2r1​≤r2​ in PPP: ΠR(p2,r1)+ΠR(p1,r2)≤ΠR(p2,r2)+ΠR(p1,r1)\Pi^R(p_2,r_1)+\Pi^R(p_1,r_2)\le\Pi^R(p_2,r_2)+\Pi^R(p_1,r_1)ΠR(p2​,r1​)+ΠR(p1​,r2​)≤ΠR(p2​,r2​)+ΠR(p1​,r1​).

Conclusion. p~\tilde pp~​ is non-decreasing (weakly) on PPP: for all 0≤r≤r′≤pˉ0\le r\le r'\le\bar p0≤r≤r′≤pˉ​,

p~(r)≤p~(r′).\tilde p(r)\le\tilde p(r').p~​(r)≤p~​(r′).

Degenerate cases:

  • pˉ>0\bar p>0pˉ​>0 excludes an empty or singleton price set.
  • If for some r∈Pr\in Pr∈P no maximizer of Π(⋅,r)\Pi(\cdot,r)Π(⋅,r) on PPP existed, p~(r)\tilde p(r)p~​(r) would be the junk value 000. The conclusion is stated for p~\tilde pp~​ including that convention.
  • p~(r)\tilde p(r)p~​(r) is the supremum of the maximizer set and is not asserted to be a maximizer.
  • Strict increase is not claimed. Nothing is claimed for rrr outside [0,pˉ][0,\bar p][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