Theorem 3, pp. 1385–1386 — one markdown or markup: strictly increasing thresholds x_n < t¹_n < t_n < t²_n < z_n with J(n,t) = V(n,t)
DisprovedPriceSwitch.UpOrDown.theorem3_markup_or_markdown_thresholdsSales start at price with Poisson demand of intensity , and once during the horizon the price may be changed either down to or up to , where
all positive. Let be the revenue of switching at once to , , the revenue of keeping , and the optimal expected revenue over all non-anticipating switching times. Let , , , and .
Assumption (as on p. 1385): for every .
Theorem. There exist two strictly increasing sequences and of time thresholds with
such that for all and , where and, for ,
with . Here, with :
- solves with ;
- solves with ;
- and , both sets being nonempty.
In words: with items left, it is optimal to mark down to immediately when the time-to-go is below , to mark up to immediately when it is above , and in between to keep , the stopping value exceeding the switch-at-once revenue by . This is the main result of §5.
Formalization Note The sequences, , , and are existentially quantified; is tied to and to by explicit equations, each is pinned by its linear ODE (imposed at every ) and its boundary value, and by their defining infima, so the existential determines the paper's objects; is a separate witness only because reads . At , , as the page's " for " gives. The page's closed intervals overlap at , where the two branches of agree by the boundary condition of ; the formalization keeps the page's inequalities with the first branch taking precedence. The page's assumption is a hypothesis, as on the page; the three infima are Lean sInfs, whose sets are nonempty by Lemma 3. In §5 the low price is and the high price , with initial price (in §4, was the initial price). The demand at is the referenced exponential-interarrival counting process (IsExpInterarrivals P lam T); IsProbabilityMeasure P is redundant given it. The sum of independent Poisson counts in is written through its Poisson law.
import Mathlib import Definitions.Def_PriceSwitch_UpOrDown_ThreePrice
namespace PriceSwitch.UpOrDown
open MeasureTheory ProbabilityTheory QueueingFundamentals.Foundations
/-- Feng–Gallego (1995), Theorem 3, pp. 1385–1386: with one markdown (to `p₁`) or one markup (to `p₂`)
allowed from the initial price `p`, and under the page's assumption `t¹_n < t_n < t²_n`, there are strictly
increasing thresholds `x_n < t¹_n < t_n < t²_n < z_n` with `J(n, t) = V(n, t)`. -/
theorem theorem3_markup_or_markdown_thresholds
{Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P] (T : ℕ → Ω → ℝ)
(p₁ lam₁ p lam p₂ lam₂ : ℝ)
(h3 : IsThreePrice p₁ lam₁ p lam p₂ lam₂)
(hT : IsExpInterarrivals P lam T)
(hassume : ∀ n : ℕ, 1 ≤ n →
tThr1 p₁ lam₁ p lam p₂ lam₂ n < tThr p₁ lam₁ p lam p₂ lam₂ n ∧
tThr p₁ lam₁ p lam p₂ lam₂ n < tThr2 p₁ lam₁ p lam p₂ lam₂ n) :
∃ (x z : ℕ → ℝ) (F H₁ H₂ V : ℕ → ℝ → ℝ),
let L₁ : ℕ → ℝ → ℝ := fun n t =>
PriceSwitch.Markdown.G p lam p₁ lam₁ n t + lam * (V (n - 1) t - PriceSwitch.Markdown.switchRevenue p lam p₁ lam₁ (n - 1) t 0)
let L₂ : ℕ → ℝ → ℝ := fun n t =>
PriceSwitch.Markdown.G p lam p₂ lam₂ n t + lam * (V (n - 1) t - PriceSwitch.Markdown.switchRevenue p lam p₂ lam₂ (n - 1) t 0)
StrictMonoOn x (Set.Ici 1) ∧ StrictMonoOn z (Set.Ici 1) ∧
(∀ n, 1 ≤ n →
x n < tThr1 p₁ lam₁ p lam p₂ lam₂ n ∧
tThr1 p₁ lam₁ p lam p₂ lam₂ n < tThr p₁ lam₁ p lam p₂ lam₂ n ∧
tThr p₁ lam₁ p lam p₂ lam₂ n < tThr2 p₁ lam₁ p lam p₂ lam₂ n ∧
tThr2 p₁ lam₁ p lam p₂ lam₂ n < z n) ∧
(∀ t, V 0 t = 0) ∧
(∀ n, 1 ≤ n → ∀ t, V n t =
if x n ≤ t ∧ t ≤ z n then switchNowMax p₁ lam₁ p lam p₂ lam₂ n t + F n t
else switchNowMax p₁ lam₁ p lam p₂ lam₂ n t) ∧
(∀ t, F 0 t = 0) ∧
(∀ n, 1 ≤ n →
(∀ t, 0 < t → HasDerivAt (H₁ n) (-lam * H₁ n t + L₁ n t) t) ∧
H₁ n (x n) = 0 ∧
(∀ t, 0 < t → HasDerivAt (H₂ n) (-lam * H₂ n t + L₂ n t) t) ∧
H₂ n (tThr p₁ lam₁ p lam p₂ lam₂ n) = H₁ n (tThr p₁ lam₁ p lam p₂ lam₂ n) ∧
(∃ t, 0 ≤ t ∧ L₁ n t = 0) ∧
x n = sInf {t : ℝ | 0 ≤ t ∧ L₁ n t = 0} ∧
(∃ t, tThr p₁ lam₁ p lam p₂ lam₂ n ≤ t ∧ H₂ n t ≤ 0) ∧
z n = sInf {t : ℝ | tThr p₁ lam₁ p lam p₂ lam₂ n ≤ t ∧ H₂ n t ≤ 0} ∧
(∀ t, F n t =
if x n ≤ t ∧ t ≤ tThr p₁ lam₁ p lam p₂ lam₂ n then H₁ n t
else if tThr p₁ lam₁ p lam p₂ lam₂ n ≤ t ∧ t ≤ z n then H₂ n t
else 0)) ∧
(∀ n t, 0 ≤ t → optRevenue3 P T p₁ lam₁ p lam p₂ lam₂ n t = V n t) := by sorry
end PriceSwitch.UpOrDown
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.