Theorem 2 — optimal markup at an increasing time-to-go threshold
DisprovedPriceSwitch.Markup.theorem2_markup_thresholdStart with items and charge price until an adaptive switch to , with Poisson rates and revenue rates . Let be the optimal expected revenue over admissible switch times, and the revenue from switching immediately. There are nondecreasing thresholds , auxiliary thresholds , and functions such that
where is the first nonnegative zero of , , and below and at or above it. For , and
These thresholds specify when an immediate price increase is optimal and how the continuation value varies with inventory and time-to-go.
Formalization Note The stopping value uses the independent Poisson count sum through its Poisson law. The zero sets defining , , and are asserted nonempty to prevent a default infimum; the positive-zero condition for is retained. Continuity of at zero connects its boundary value to the ODE. The probability-measure assumption is explicit but follows from the exponential interarrival law. The theorem itself assumes no verification equation, sign-change conclusion, or revenue identity.
import Mathlib import Definitions.Def_PriceSwitch_Markdown_Model
namespace PriceSwitch.Markup
open MeasureTheory QueueingFundamentals.Foundations
variable {Ω : Type*} [MeasurableSpace Ω]
/-- Feng–Gallego (1995), Theorem 2, pp. 1382–1383. -/
theorem theorem2_markup_threshold
(P : Measure Ω) [IsProbabilityMeasure P] (T : ℕ → Ω → ℝ)
(p₁ lam₁ p₂ lam₂ : ℝ) (hpair : PriceSwitch.Markdown.IsMarkupPair p₁ lam₁ p₂ lam₂)
(hT : IsExpInterarrivals P lam₁ T) :
∃ (x z : ℕ → ℝ) (F H : ℕ → ℝ → ℝ),
MonotoneOn z (Set.Ici 1) ∧
(∀ n, 1 ≤ n →
(∃ s, 0 ≤ s ∧ PriceSwitch.Markdown.G p₁ lam₁ p₂ lam₂ n s = 0) ∧
sInf {s : ℝ | 0 ≤ s ∧ PriceSwitch.Markdown.G p₁ lam₁ p₂ lam₂ n s = 0} ≤ x n ∧ x n < z n) ∧
(∀ t, 0 ≤ t → F 0 t = 0) ∧
(∀ n, 1 ≤ n →
H n 0 = 0 ∧
ContinuousWithinAt (H n) (Set.Ici 0) 0 ∧
(∀ t, 0 < t → HasDerivAt (H n)
(-lam₁ * H n t + (PriceSwitch.Markdown.G p₁ lam₁ p₂ lam₂ n t + lam₁ * F (n - 1) t)) t) ∧
(∃ t, 0 ≤ t ∧ PriceSwitch.Markdown.G p₁ lam₁ p₂ lam₂ n t + lam₁ * F (n - 1) t = 0) ∧
x n = sInf {t : ℝ | 0 ≤ t ∧
PriceSwitch.Markdown.G p₁ lam₁ p₂ lam₂ n t + lam₁ * F (n - 1) t = 0} ∧
(∃ t, 0 < t ∧ H n t = 0) ∧
z n = sInf {t : ℝ | 0 < t ∧ H n t = 0} ∧
(∀ t, 0 ≤ t → F n t = if t < z n then H n t else 0)) ∧
(∀ n, 1 ≤ n → ∀ t, 0 ≤ t →
PriceSwitch.Markdown.optRevenue P T p₁ lam₁ p₂ lam₂ n t =
if t < z n then PriceSwitch.Markdown.switchRevenue p₁ lam₁ p₂ lam₂ n t 0 + F n t
else PriceSwitch.Markdown.switchRevenue p₁ lam₁ p₂ lam₂ n t 0) := by sorry
end PriceSwitch.Markup
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.