Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — markdown threshold zeros and one sign change

Proved
PriceSwitch.Markdown.lemma2_markdown

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

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

Suppose the initial price aaa exceeds the markdown price bbb, their Poisson rates satisfy 0<λa<λb0<\lambda_a<\lambda_b0<λa​<λb​, and their revenue rates satisfy aλa<bλba\lambda_a<b\lambda_baλa​<bλb​. Define

G(n,t)=aλa−bλb−b(λa−λb)Pr⁡{Poisson⁡(λbt)≥n},yn=inf⁡{s≥0:G(n,s)=0}.G(n,t)=a\lambda_a-b\lambda_b-b(\lambda_a-\lambda_b)\Pr\{\operatorname{Poisson}(\lambda_b t)\ge n\},\qquad y_n=\inf\{s\ge0:G(n,s)=0\}.G(n,t)=aλa​−bλb​−b(λa​−λb​)Pr{Poisson(λb​t)≥n},yn​=inf{s≥0:G(n,s)=0}.

For every n≥1n\ge1n≥1 the defining zero exists. The thresholds satisfy 0<y1<y2<⋯0<y_1<y_2<\cdots0<y1​<y2​<⋯. For each nnn, G(n,s)<0G(n,s)<0G(n,s)<0 on 0≤s<yn0\le s<y_n0≤s<yn​ and G(n,s)>0G(n,s)>0G(n,s)>0 on s>yns>y_ns>yn​. 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: yny_nyn​ 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.

Preamble
import Mathlib
import Definitions.Def_PriceSwitch_Markdown_Model
Formal statement
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
Source
Feng & Gallego (1995), Management Science 41(8), Lemma 2 and preceding definitions, 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