§A.7(b) — if demand D(p, r) is convex in r, the value function V(r) is convex in r
ProvedReferencePricing.PriceMonotone.value_convex_of_demand_convexConvexity of the value function (Popescu and Wu 2007, Appendix A.7(b), p. 426). 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. Suppose that demand is convex in the reference price: for every , is convex on . Then the value function
is convex on .
This is the step of the proof of Lemma 3(b) that makes the Bellman objective supermodular. The paper attributes it to Smith and McCardle (2002, Proposition 5).
Formalization Note. Convexity is required on the price set , the domain of the reference price. is the supremum over price sequences (see the definition value). Differentiable ℝ d is added, as in every item of the mission.
import Mathlib import Definitions.Def_RobustBooking_Shared_Assumptions import Definitions.Def_RobustBooking_Shared_optPrice open RobustBooking.Shared
namespace ReferencePricing.PriceMonotone
theorem value_convex_of_demand_convex
(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)
(hconv : ∀ p ∈ Set.Icc (0 : ℝ) pbar,
ConvexOn ℝ (Set.Icc (0 : ℝ) pbar) (fun r => demand d R p r)) :
ConvexOn ℝ (Set.Icc (0 : ℝ) pbar) (value (profit d R) α β pbar) := 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.
- For every , the function is convex on , where is the imported
demand d R p r(definition not shown).
Conclusion. Let be the imported profit d R, and let be the imported value . Neither definition is shown. The theorem asserts that is convex on : for all and all ,
Nothing is claimed outside .
Degenerate cases.
- The interval is non-degenerate, and is allowed.
- The convexity hypothesis on applies only for and in .
- Any default value that
valuereturns, for example a supremum of an unbounded or empty set, is fixed by the hidden definition and cannot be seen here. - If the hypotheses cannot all hold together, the theorem is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.