Lemma 3, case (ii), 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_markupdynamic-pricingmarkupp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sign-changethreshold-policy
Consider the markup case (ii) for a pair of prices: , and . Let be the expected revenue of charging for time units and afterwards, and let
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 decreasing, and as .
In §5 this is applied twice: to with the pair , and to with the pair , both in case (ii).
Formalization Note The page proves Lemma 3 for case (i) only and states that "the proof for case (ii) is entirely analogous" (p. 1390); the statement here is the lemma's case (ii) as printed. The limit of the page is in the generic pair. Continuity is stated on all of .
Preamble
import Mathlib import Definitions.Def_PriceSwitch_Markdown_Model
Formal statement
namespace PriceSwitch.UpOrDown
open Filter Topology
/-- Feng–Gallego (1995), Lemma 3, case (ii), p. 1382, for `Δ(n, t) = J(n, t; t) − J(n, t; 0)` and
`t_n = inf{t > 0 : Δ(n, t) = 0}`. -/
theorem lemma3_markup (a la b lb : ℝ) (hpair : PriceSwitch.Markdown.IsMarkupPair 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 → 0 < Δ n t) ∧
(∀ n, 1 ≤ n → ∀ t, tn n < t → Δ n t < 0) ∧
StrictMonoOn tn (Set.Ici 1) ∧
(∀ n, 1 ≤ n → AntitoneOn (Δ 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 (case (ii): "entirely analogous", Appendix, p. 1390)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.