Lemma 2, case (i), p. 1379 — y_n = inf{s ≥ 0 : G(n,s) = 0} is strictly increasing and G changes sign once, − to +
ProvedPriceSwitch.UpOrDown.lemma2_markdowndynamic-pricingmarkdownp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sign-changethreshold-policy
Consider the markdown case (i) for a pair of prices: , and . Let
Then:
- for every , has a zero on , so is well defined;
- , and the sequence is strictly increasing; in particular it is bounded away from zero;
- has a single sign change, from to : for and for .
In §5 this is applied to , i.e. to the pair , which is in case (i). The proof of Theorem 3 uses it at its first step: has a unique sign change from to at .
Formalization Note The page says the sequence is "bounded and strictly increasing". It is not bounded: for fixed , as , so . What the paper uses (proof of Corollary 1, p. 1380) is that it is bounded away from zero, which is what is stated here ( together with monotonicity). The infimum is Lean's sInf, and item 1 guarantees the set is nonempty.
Preamble
import Mathlib import Definitions.Def_PriceSwitch_Markdown_Model
Formal statement
namespace PriceSwitch.UpOrDown
/-- Feng–Gallego (1995), Lemma 2, case (i), p. 1379. The printed word "bounded" is corrected to
bounded away from zero: the thresholds tend to infinity. -/
theorem lemma2_markdown (a la b lb : ℝ) (hpair : PriceSwitch.Markdown.IsMarkdownPair a la b lb) :
let y : ℕ → ℝ := fun n => sInf {s : ℝ | 0 ≤ s ∧ PriceSwitch.Markdown.G a la b lb n s = 0}
(∀ n, 1 ≤ n → ∃ s, 0 ≤ s ∧ PriceSwitch.Markdown.G a la b lb n s = 0) ∧
0 < y 1 ∧
StrictMonoOn y (Set.Ici 1) ∧
(∀ n, 1 ≤ n → ∀ s, 0 ≤ s → s < y n → PriceSwitch.Markdown.G a la b lb n s < 0) ∧
(∀ n, 1 ≤ n → ∀ s, y n < s → 0 < PriceSwitch.Markdown.G a la b lb n s) := by sorry
end PriceSwitch.UpOrDown
Source
Feng & Gallego (1995), Management Science 41(8), Lemma 2, p. 1379
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.