Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — optimal markup at an increasing time-to-go threshold

Disproved
PriceSwitch.Markup.theorem2_markup_threshold

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-pricingmarkupoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1threshold-policy

Start with n≥1n\ge1n≥1 items and charge price p1p_1p1​ until an adaptive switch to p2>p1p_2>p_1p2​>p1​, with Poisson rates λ1>λ2>0\lambda_1>\lambda_2>0λ1​>λ2​>0 and revenue rates p1λ1>p2λ2p_1\lambda_1>p_2\lambda_2p1​λ1​>p2​λ2​. Let J(n,t)J(n,t)J(n,t) be the optimal expected revenue over admissible switch times, and J(n,t;0)J(n,t;0)J(n,t;0) the revenue from switching immediately. There are nondecreasing thresholds (zn)n≥1(z_n)_{n\ge1}(zn​)n≥1​, auxiliary thresholds xnx_nxn​, and functions F,HF,HF,H such that

yn≤xn<zn,J(n,t)={J(n,t;0)+F(n,t),t<zn,J(n,t;0),t≥zn,y_n\le x_n<z_n,\qquad J(n,t)=\begin{cases}J(n,t;0)+F(n,t),&t<z_n,\\J(n,t;0),&t\ge z_n,\end{cases}yn​≤xn​<zn​,J(n,t)={J(n,t;0)+F(n,t),J(n,t;0),​t<zn​,t≥zn​,​

where yny_nyn​ is the first nonnegative zero of G(n,⋅)G(n,\cdot)G(n,⋅), F(0,t)=0F(0,t)=0F(0,t)=0, and F(n,t)=H(n,t)F(n,t)=H(n,t)F(n,t)=H(n,t) below znz_nzn​ and 000 at or above it. For n≥1n\ge1n≥1, H(n,0)=0H(n,0)=0H(n,0)=0 and

∂tH(n,t)=−λ1H(n,t)+L(n,t),L(n,t)=G(n,t)+λ1F(n−1,t),xn=inf⁡{t≥0:L(n,t)=0},zn=inf⁡{t>0:H(n,t)=0}.\partial_tH(n,t)=-\lambda_1H(n,t)+L(n,t),\quad L(n,t)=G(n,t)+\lambda_1F(n-1,t),\quad x_n=\inf\{t\ge0:L(n,t)=0\},\quad z_n=\inf\{t>0:H(n,t)=0\}.∂t​H(n,t)=−λ1​H(n,t)+L(n,t),L(n,t)=G(n,t)+λ1​F(n−1,t),xn​=inf{t≥0:L(n,t)=0},zn​=inf{t>0:H(n,t)=0}.

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 yny_nyn​, xnx_nxn​, and znz_nzn​ are asserted nonempty to prevent a default infimum; the positive-zero condition for znz_nzn​ is retained. Continuity of H(n,⋅)H(n,\cdot)H(n,⋅) 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.

Preamble
import Mathlib
import Definitions.Def_PriceSwitch_Markdown_Model
Formal statement
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
Source
Feng & Gallego (1995), Management Science 41(8), §4.3, Theorem 2, pp. 1382–1383, https://doi.org/10.1287/mnsc.41.8.1371
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me