Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — a unique steady state p** solving (3); all price paths converge to it and all state paths converge to it monotonically

Proved
ReferencePricing.PriceMonotone.theorem2_global_stability

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

dynamic-pricingglobal-stabilityp2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1steady-state

Theorem 2 (Global Stability and State-Path Monotonicity), Popescu and Wu 2007, p. 419. In the dynamic pricing problem with reference effects (price set P=[0,pˉ]P = [0,\bar p]P=[0,pˉ​] with pˉ>0\bar p > 0pˉ​>0, memory α∈[0,1)\alpha \in [0,1)α∈[0,1), discount β∈(0,1)\beta \in (0,1)β∈(0,1), demand 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), short-term profit Π(p,r)=p D(p,r)\Pi(p,r) = p\,D(p,r)Π(p,r)=pD(p,r)), assume Assumptions 1–3 and that ddd is differentiable. Let p∗p^*p∗ be the largest-maximizer pricing policy of the Bellman equation (2), q∗(r)=αr+(1−α)p∗(r)q^*(r) = \alpha r + (1-\alpha)p^*(r)q∗(r)=αr+(1−α)p∗(r), and for r0∈Pr_0 \in Pr0​∈P let (rt∗)(r^*_t)(rt∗​) be the state path and (pt∗)(p^*_t)(pt∗​) the pricing path. Then there is a price p∗∗p^{**}p∗∗ such that:

  1. p∗∗p^{**}p∗∗ is a steady state (p∗∗∈Pp^{**} \in Pp∗∗∈P and p∗(p∗∗)=p∗∗p^*(p^{**}) = p^{**}p∗(p∗∗)=p∗∗), and it is the only steady state;
  2. p∗∗p^{**}p∗∗ is characterized by Theorem 1: it solves
π′(p)1−β=p λ(p)1−αβ,(3)\frac{\pi'(p)}{1-\beta} = \frac{p\,\lambda(p)}{1-\alpha\beta}, \tag{3}1−βπ′(p)​=1−αβpλ(p)​,(3)

and it is the only solution of (3) in PPP; 3. for every initial reference price r0∈Pr_0 \in Pr0​∈P, the pricing path pt∗p^*_tpt∗​ converges to p∗∗p^{**}p∗∗, and the state path rt∗r^*_trt∗​ is monotone (nondecreasing or nonincreasing) and converges to p∗∗p^{**}p∗∗.

Here π(p)=p d(p)\pi(p) = p\,d(p)π(p)=pd(p) and λ(r)=Rx(0,r)\lambda(r) = R_x(0,r)λ(r)=Rx​(0,r).

Formalization Note. "Characterized by Theorem 1" is rendered as the pair of clauses in item 2. "Monotonically" means the whole state path is monotone from t=0t = 0t=0. The paper does not assume that ddd is differentiable; that hypothesis is added. This is also Theorem 2 of the companion mission on loss aversion. Draft items cannot import each other, so it is restated here in this mission's namespace.

Preamble
import Mathlib
import Definitions.Def_RobustBooking_Shared_Assumptions
import Definitions.Def_RobustBooking_Shared_optPrice
open RobustBooking.Shared

open Filter Topology
Formal statement
namespace ReferencePricing.PriceMonotone

theorem theorem2_global_stability
    (pbar α β : ℝ) (d : ℝ → ℝ) (R : ℝ → ℝ → ℝ)
    (hpbar : 0 < pbar) (hα₀ : 0 ≤ α) (hα₁ : α < 1) (hβ₀ : 0 < β) (hβ₁ : β < 1)
    (hA1 : Assumption1 pbar d R) (hA2 : Assumption2 R) (hA3 : Assumption3 pbar d R)
    (hd : Differentiable ℝ d) :
    ∃ p : ℝ, IsSteadyState (profit d R) α β pbar p ∧
      (∀ q : ℝ, IsSteadyState (profit d R) α β pbar q → q = p) ∧
      deriv (baseProfit d) p / (1 - β) = p * refSlope R p / (1 - α * β) ∧
      (∀ q ∈ Set.Icc (0 : ℝ) pbar,
        deriv (baseProfit d) q / (1 - β) = q * refSlope R q / (1 - α * β) → q = p) ∧
      ∀ r₀ ∈ Set.Icc (0 : ℝ) pbar,
        Tendsto (pricePath (profit d R) α β pbar r₀) atTop (𝓝 p) ∧
        (Monotone (statePath (profit d R) α β pbar r₀) ∨
          Antitone (statePath (profit d R) α β pbar r₀)) ∧
        Tendsto (statePath (profit d R) α β pbar r₀) atTop (𝓝 p) := by sorry

end ReferencePricing.PriceMonotone
Source
Popescu and Wu, Dynamic Pricing Strategies with Reference Effects, Operations Research 55(3), 2007, p. 419, Theorem 2 (proof: Appendix A.6, p. 426); Equation (3) from Theorem 1, p. 418
Read-back

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

Setting. Let pˉ,α,β∈R\bar p,\alpha,\beta\in\mathbb Rpˉ​,α,β∈R, let d:R→Rd:\mathbb R\to\mathbb Rd:R→R, and let R:R×R→RR:\mathbb R\times\mathbb R\to\mathbb RR:R×R→R.

Hypotheses.

  • pˉ>0\bar p>0pˉ​>0.
  • 0≤α<10\le\alpha<10≤α<1.
  • 0<β<10<\beta<10<β<1.
  • The imported predicates Assumption1 (pˉ,d,R)(\bar p,d,R)(pˉ​,d,R), Assumption2 (R)(R)(R) and Assumption3 (pˉ,d,R)(\bar p,d,R)(pˉ​,d,R) hold. Their definitions are not shown.
  • ddd is differentiable everywhere.

Notation. All of the following are imported and their definitions are not shown:

  • Π\PiΠ = profit d R.
  • π0\pi_0π0​ = baseProfit d, a function R→R\mathbb R\to\mathbb RR→R.
  • sR(q)s_R(q)sR​(q) = refSlope R q, a real number.
  • IsSteadyState (Π,α,β,pˉ,q)(\Pi,\alpha,\beta,\bar p,q)(Π,α,β,pˉ​,q), a predicate on a real number qqq.
  • For a starting value r0r_0r0​, the price path t↦Pr0(t)t\mapsto P_{r_0}(t)t↦Pr0​​(t) = pricePath (Π,α,β,pˉ,r0)(\Pi,\alpha,\beta,\bar p,r_0)(Π,α,β,pˉ​,r0​).
  • For a starting value r0r_0r0​, the state path t↦Sr0(t)t\mapsto S_{r_0}(t)t↦Sr0​​(t) = statePath (Π,α,β,pˉ,r0)(\Pi,\alpha,\beta,\bar p,r_0)(Π,α,β,pˉ​,r0​).

The index type of the two paths is fixed by the hidden definitions and is not shown. The limits below are taken as the index goes to +∞+\infty+∞ in its natural order.

Conclusion. There exists a real number ppp such that all of the following hold:

  1. ppp satisfies IsSteadyState (Π,α,β,pˉ,p)(\Pi,\alpha,\beta,\bar p,p)(Π,α,β,pˉ​,p).
  2. Uniqueness among all reals. Any real qqq that satisfies IsSteadyState equals ppp.
  3. ppp satisfies the equation
π0′(p)1−β  =  p sR(p)1−αβ,\frac{\pi_0'(p)}{1-\beta} \;=\; \frac{p\, s_R(p)}{1-\alpha\beta},1−βπ0′​(p)​=1−αβpsR​(p)​,

where π0′\pi_0'π0′​ is the "derivative or zero" of π0\pi_0π0​: it is 000 at any point where π0\pi_0π0​ is not differentiable. 4. Uniqueness only within [0,pˉ][0,\bar p][0,pˉ​]. Any q∈[0,pˉ]q\in[0,\bar p]q∈[0,pˉ​] that satisfies the same equation equals ppp. This is not a uniqueness claim over all of R\mathbb RR. 5. For every starting value r0∈[0,pˉ]r_0\in[0,\bar p]r0​∈[0,pˉ​]:

  • Pr0(t)→pP_{r_0}(t)\to pPr0​​(t)→p.
  • The path Sr0S_{r_0}Sr0​​ is either non-decreasing over its entire index set or non-increasing over its entire index set. Which of the two can depend on r0r_0r0​.
  • Sr0(t)→pS_{r_0}(t)\to pSr0​​(t)→p.

The statement does not explicitly say that p∈[0,pˉ]p\in[0,\bar p]p∈[0,pˉ​]. That would follow only if the hidden IsSteadyState requires it.

Degenerate cases.

  • The hypotheses give 1−β>01-\beta>01−β>0 and 1−αβ>01-\alpha\beta>01−αβ>0, so neither denominator is zero.
  • If α=0\alpha=0α=0 is allowed, the right-hand denominator is 111.
  • If π0\pi_0π0​ is not differentiable at ppp, the equation in item 3 is evaluated with π0′(p)=0\pi_0'(p)=0π0′​(p)=0.
  • No claim is made for starting values r0∉[0,pˉ]r_0\notin[0,\bar p]r0​∈/[0,pˉ​].
  • If the imported assumptions cannot all hold together, the whole statement is vacuous. That cannot be decided from the visible text.
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