Lemma 2, case (ii) — unique sign change and increasing roots
ProvedPriceSwitch.Markup.lemma2_markupdynamic-pricingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-processthreshold-policy
Consider a markup pair: , , and . Define and . For each the defining set is nonempty, , and is strictly increasing. Moreover,
Thus every inventory level has one transition from positive to negative switching advantage, and the transition occurs later for larger inventories.
Formalization Note The paper's word “bounded” is inconsistent with ; the statement records the positive lower bound used later. This is the case-(ii) half of the paper's lemma. The Poisson tail uses the independent count's Poisson law.
Preamble
import Mathlib import Definitions.Def_PriceSwitch_Markdown_Model
Formal statement
namespace PriceSwitch.Markup
/-- Feng–Gallego (1995), Lemma 2, case (ii), p. 1379. The printed word "bounded" is replaced
by bounded away from zero, as required by the surrounding text and the actual sign pattern. -/
theorem lemma2_markup (a la b lb : ℝ) (hpair : PriceSwitch.Markdown.IsMarkupPair a la b lb) :
(∀ n : ℕ, 1 ≤ n → ∃ s : ℝ, 0 ≤ s ∧ PriceSwitch.Markdown.G a la b lb n s = 0) ∧
0 < sInf {s : ℝ | 0 ≤ s ∧ PriceSwitch.Markdown.G a la b lb 1 s = 0} ∧
StrictMonoOn (fun n : ℕ => sInf {s : ℝ | 0 ≤ s ∧ PriceSwitch.Markdown.G a la b lb n s = 0})
(Set.Ici 1) ∧
(∀ n : ℕ, 1 ≤ n → ∀ s : ℝ, 0 ≤ s →
s < sInf {u : ℝ | 0 ≤ u ∧ PriceSwitch.Markdown.G a la b lb n u = 0} → 0 < PriceSwitch.Markdown.G a la b lb n s) ∧
(∀ n : ℕ, 1 ≤ n → ∀ s : ℝ,
sInf {u : ℝ | 0 ≤ u ∧ PriceSwitch.Markdown.G a la b lb n u = 0} < s → PriceSwitch.Markdown.G a la b lb n s < 0) := by sorry
end PriceSwitch.Markup
Source
Feng & Gallego (1995), Management Science 41(8), §4.1, Lemma 2, p. 1379, https://doi.org/10.1287/mnsc.41.8.1371
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.