Theorem 2 — a unique steady state p** solving (3); all price paths converge to it and all state paths converge to it monotonically
ProvedReferencePricing.PriceMonotone.theorem2_global_stabilityTheorem 2 (Global Stability and State-Path Monotonicity), Popescu and Wu 2007, p. 419. In the dynamic pricing problem with reference effects (price set with , memory , discount , demand , short-term profit ), assume Assumptions 1–3 and that is differentiable. Let be the largest-maximizer pricing policy of the Bellman equation (2), , and for let be the state path and the pricing path. Then there is a price such that:
- is a steady state ( and ), and it is the only steady state;
- is characterized by Theorem 1: it solves
and it is the only solution of (3) in ; 3. for every initial reference price , the pricing path converges to , and the state path is monotone (nondecreasing or nonincreasing) and converges to .
Here and .
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 . The paper does not assume that 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.
import Mathlib import Definitions.Def_RobustBooking_Shared_Assumptions import Definitions.Def_RobustBooking_Shared_optPrice open RobustBooking.Shared open Filter Topology
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let , let , and let .
Hypotheses.
- .
- .
- .
- The imported predicates
Assumption1,Assumption2andAssumption3hold. Their definitions are not shown. - is differentiable everywhere.
Notation. All of the following are imported and their definitions are not shown:
- =
profit d R. - =
baseProfit d, a function . - =
refSlope R q, a real number. IsSteadyState, a predicate on a real number .- For a starting value , the price path =
pricePath. - For a starting value , the state path =
statePath.
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 in its natural order.
Conclusion. There exists a real number such that all of the following hold:
- satisfies
IsSteadyState. - Uniqueness among all reals. Any real that satisfies
IsSteadyStateequals . - satisfies the equation
where is the "derivative or zero" of : it is at any point where is not differentiable. 4. Uniqueness only within . Any that satisfies the same equation equals . This is not a uniqueness claim over all of . 5. For every starting value :
- .
- The path is either non-decreasing over its entire index set or non-increasing over its entire index set. Which of the two can depend on .
- .
The statement does not explicitly say that . That would follow only if the hidden IsSteadyState requires it.
Degenerate cases.
- The hypotheses give and , so neither denominator is zero.
- If is allowed, the right-hand denominator is .
- If is not differentiable at , the equation in item 3 is evaluated with .
- No claim is made for starting values .
- If the imported assumptions cannot all hold together, the whole statement is vacuous. That cannot be decided from the visible text.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.