Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, case (ii) — unique sign change and increasing roots

Proved
PriceSwitch.Markup.lemma2_markup

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

dynamic-pricingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-processthreshold-policy

Consider a markup pair: 0<a<b0<a<b0<a<b, 0<λb<λa0<\lambda_b<\lambda_a0<λb​<λa​, and bλb<aλab\lambda_b<a\lambda_abλb​<aλa​. Define G(n,t)=aλa−bλb−b(λa−λb)Pr⁡{Nb(t)≥n}G(n,t)=a\lambda_a-b\lambda_b-b(\lambda_a-\lambda_b)\Pr\{N_b(t)\ge n\}G(n,t)=aλa​−bλb​−b(λa​−λb​)Pr{Nb​(t)≥n} and yn=inf⁡{t≥0:G(n,t)=0}y_n=\inf\{t\ge0:G(n,t)=0\}yn​=inf{t≥0:G(n,t)=0}. For each n≥1n\ge1n≥1 the defining set is nonempty, y1>0y_1>0y1​>0, and (yn)n≥1(y_n)_{n\ge1}(yn​)n≥1​ is strictly increasing. Moreover,

G(n,t)>0(0≤t<yn),G(n,t)<0(t>yn).G(n,t)>0\quad(0\le t<y_n),\qquad G(n,t)<0\quad(t>y_n).G(n,t)>0(0≤t<yn​),G(n,t)<0(t>yn​).

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 yn→∞y_n\to\inftyyn​→∞; 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
  • 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