Theorem 3 (Global Price Monotonicity) — under any condition of Lemma 3, every optimal pricing path converges monotonically to the unique steady state p**
ProvedReferencePricing.PriceMonotone.theorem3_global_price_monotonicityTheorem 3 (Global Price Monotonicity), Popescu and Wu 2007, p. 420. Consider the dynamic pricing problem with reference effects. Prices lie in with . The reference price evolves as with memory , and profits are discounted by . Demand is and the short-term profit is . Let be the value function, the largest maximizer over of , and . For the state path is , , and the optimal pricing path is .
Assume Assumptions 1–3 and that is differentiable. Assume also that at least one of the alternative conditions of Lemma 3 holds: (a) ; (b) is convex in on for every ; (c) is strongly concave on and, for one constant , and there.
Then there is a price with the following properties. It is the unique steady state of the problem. It is the unique solution in of
where and . And for every initial reference price , the optimal pricing path is monotone (nondecreasing or nonincreasing) and converges to .
Consequently only three pricing strategies can be optimal: skimming (prices decreasing), penetration (prices increasing), and constant pricing.
Formalization Note. The hypothesis is the disjunction LemmaThreeCondition, as the paper's "alternative conditions" require. "Monotonically" means the whole pricing path is monotone from , not only eventually. "The unique steady-state price , characterized by Theorem 1" is rendered as existence and uniqueness of the steady state, together with being the unique solution of (3) in . Differentiable ℝ d is added because the paper writes without assuming it exists.
Condition (c) is kept exactly as printed, although on it can rarely hold. Strong concavity forces on the whole open square. But , which tends to as whenever stays bounded. The paper's own use of (c) (linear relative-difference models) is on a price range with a positive lower bound. A near-vacuous disjunct only weakens the hypothesis, so it does not trivialize the theorem, whose content comes from (a) and (b). The hypotheses are jointly satisfiable: , , satisfies Assumptions 1–3 and condition (b) for every and .
import Mathlib import Definitions.Def_RobustBooking_Shared_Assumptions import Definitions.Def_RobustBooking_Shared_optPrice import Definitions.Def_ReferencePricing_PriceMonotone_LemmaThreeCondition open RobustBooking.Shared open Filter Topology
namespace ReferencePricing.PriceMonotone
theorem theorem3_global_price_monotonicity
(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)
(hL3 : LemmaThreeCondition pbar α d R) :
∃ 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,
(Monotone (pricePath (profit d R) α β pbar r₀) ∨
Antitone (pricePath (profit d R) α β pbar r₀)) ∧
Tendsto (pricePath (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
Read-back for theorem3_global_price_monotonicity
This theorem uses eight definitions from the imported bundle files: Assumption1, Assumption2, Assumption3, LemmaThreeCondition, profit, baseProfit, refSlope, IsSteadyState and pricePath. Their bodies are not shown here, so this read-back does not unfold them. Each is treated as an opaque named predicate or function, and every claim below holds only in terms of what those definitions actually say.
Data. The statement takes:
- real numbers , and ;
- a real function ;
- a real function of two real variables , written .
Hypotheses. All of the following are assumed:
- ;
- ;
- ;
- , and satisfy the predicate
Assumption1; - satisfies the predicate
Assumption2; - , and satisfy the predicate
Assumption3; - is differentiable at every real number;
- , , and satisfy the predicate
LemmaThreeCondition.
Notation. Write:
- , a function built from and ;
- , a real function built from ;
- , a real number built from and ;
- for the predicate " is a steady state for with parameters " (
IsSteadyState); - for the path started from . It is a real-valued function of an ordered time index. The index type is fixed by the definition and not shown here.
Conclusion. There exists a real number with all five of the following properties.
- holds.
- Every real with equals . So is the unique steady state among all real numbers, not just those in .
- satisfies the equation
Here is the derivative of . If is not differentiable at a point, its derivative there is taken to be . 4. Every that satisfies the same equation, , equals . The statement does not itself say that . It only says that no point of other than solves the equation. 5. For every starting value , both of the following hold:
- the path is monotone non-decreasing or monotone non-increasing (weak monotonicity, so a constant path counts);
- as .
Degenerate and edge cases.
- Division by zero cannot occur. The hypotheses give and , so and both denominators are strictly positive.
- is allowed. The right-hand denominator is then and the equation reads .
- The interval is never trivial. Because , has more than one point, so the claims about all and in it are never vacuous for lack of points.
- Derivatives default to zero. The hypotheses make differentiable, but not necessarily . At any point where fails to be differentiable, the equation is read with there. The equation then becomes , which satisfies automatically.
- Unconstrained real inputs. Items 2 and 4 quantify over real numbers, so the definitions of , , , and the path are applied to arbitrary reals. That includes negative values and values above , where their values are whatever the definitions assign.
- Possible vacuity. Whether
Assumption1–Assumption3andLemmaThreeConditioncan all hold together cannot be determined from this code. If they cannot, the theorem is vacuously true.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.