Lemma 3, case (i), p. 1382 — Δ(n,t) = J(n,t;t) − J(n,t;0) changes sign once at t_n, t_n strictly increasing, Δ ↑ (a−b)n
ProvedPriceSwitch.UpOrDown.lemma3_markdowndynamic-pricingmarkdownp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sign-changethreshold-policy
Consider the markdown case (i) for a pair of prices: , and . Let be the expected revenue of charging for time units and afterwards, and let
the difference between never switching and switching at once. Then for every :
- is continuous and has a zero on ;
- it has a unique sign change on at : for and for ;
- the sequence is strictly increasing;
- on , is monotone increasing, and as .
In §5 this is applied to , with the pair . "By repeatedly applying Lemma 3" the paper obtains the unique sign changes at , , that define the thresholds of Theorem 3.
Formalization Note The page writes the limit as in the two-price notation of §4, where is the initial and the second price; here these are and . Continuity is stated on all of (the Poisson means are read as for negative time), which contains the page's claim for .
Preamble
import Mathlib import Definitions.Def_PriceSwitch_Markdown_Model
Formal statement
namespace PriceSwitch.UpOrDown
open Filter Topology
/-- Feng–Gallego (1995), Lemma 3, case (i), p. 1382, for `Δ(n, t) = J(n, t; t) − J(n, t; 0)` and
`t_n = inf{t > 0 : Δ(n, t) = 0}`. -/
theorem lemma3_markdown (a la b lb : ℝ) (hpair : PriceSwitch.Markdown.IsMarkdownPair a la b lb) :
let Δ : ℕ → ℝ → ℝ := fun n t => PriceSwitch.Markdown.switchRevenue a la b lb n t t - PriceSwitch.Markdown.switchRevenue a la b lb n t 0
let tn : ℕ → ℝ := fun n => sInf {t : ℝ | 0 < t ∧ Δ n t = 0}
(∀ n, 1 ≤ n → Continuous (Δ n)) ∧
(∀ n, 1 ≤ n → ∃ t, 0 < t ∧ Δ n t = 0) ∧
(∀ n, 1 ≤ n → ∀ t, 0 < t → t < tn n → Δ n t < 0) ∧
(∀ n, 1 ≤ n → ∀ t, tn n < t → 0 < Δ n t) ∧
StrictMonoOn tn (Set.Ici 1) ∧
(∀ n, 1 ≤ n → MonotoneOn (Δ n) (Set.Ioi (tn n))) ∧
(∀ n, 1 ≤ n → Tendsto (Δ n) atTop (𝓝 ((a - b) * n))) := by sorry
end PriceSwitch.UpOrDown
Source
Feng & Gallego (1995), Management Science 41(8), Lemma 3, p. 1382 (proof: Appendix, pp. 1390–1391)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.