Lemma 2 — markdown threshold zeros and one sign change
ProvedPriceSwitch.Markdown.lemma2_markdownSuppose the initial price exceeds the markdown price , their Poisson rates satisfy , and their revenue rates satisfy . Define
For every the defining zero exists. The thresholds satisfy . For each , on and on . Thus there is exactly one sign change, from negative to positive.
The threshold and sign facts supply the base comparison used in the markdown result.
Formalization Note This states case (i) of Lemma 2; case (ii) belongs to the markup mission. The printed word “bounded” is a slip: grows without bound. The formal claim says the sequence is bounded away from zero and is strictly increasing. The nonempty zero set prevents a default value for the infimum. Positive prices and rates are the paper's working convention. Poisson tails use a nonnegative mean.
import Mathlib import Definitions.Def_PriceSwitch_Markdown_Model
namespace PriceSwitch.Markdown
/-- 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 : IsMarkdownPair a la b lb) :
let y : ℕ → ℝ := fun n => sInf {s : ℝ | 0 ≤ s ∧ G a la b lb n s = 0}
(∀ n, 1 ≤ n → ∃ s, 0 ≤ s ∧ 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 → G a la b lb n s < 0) ∧
(∀ n, 1 ≤ n → ∀ s, y n < s → 0 < G a la b lb n s) := by sorry
end PriceSwitch.Markdown
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.