Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, case (ii), p. 1382 — Δ(n,t) = J(n,t;t) − J(n,t;0) changes sign once at t_n, t_n strictly increasing, Δ ↓ (a−b)n

Proved
PriceSwitch.UpOrDown.lemma3_markup

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

dynamic-pricingmarkupp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sign-changethreshold-policy

Consider the markup case (ii) for a pair of prices: 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​. Let J(n,t;s)J(n,t;s)J(n,t;s) be the expected revenue of charging aaa for sss time units and bbb afterwards, and let

Δ(n,t)=J(n,t;t)−J(n,t;0),tn=inf⁡{t>0:Δ(n,t)=0}.\Delta(n,t) = J(n,t;t) - J(n,t;0), \qquad t_n = \inf\{t > 0 : \Delta(n,t) = 0\}.Δ(n,t)=J(n,t;t)−J(n,t;0),tn​=inf{t>0:Δ(n,t)=0}.

Then for every n≥1n \ge 1n≥1:

  1. Δ(n,⋅)\Delta(n,\cdot)Δ(n,⋅) is continuous and has a zero on (0,∞)(0,\infty)(0,∞);
  2. it has a unique sign change on {t>0}\{t > 0\}{t>0} at tnt_ntn​: Δ(n,t)>0\Delta(n,t) > 0Δ(n,t)>0 for 0<t<tn0 < t < t_n0<t<tn​ and Δ(n,t)<0\Delta(n,t) < 0Δ(n,t)<0 for t>tnt > t_nt>tn​;
  3. the sequence (tn)n≥1(t_n)_{n \ge 1}(tn​)n≥1​ is strictly increasing;
  4. on t>tnt > t_nt>tn​, Δ(n,t)\Delta(n,t)Δ(n,t) is monotone decreasing, and Δ(n,t)→(a−b)n\Delta(n,t) \to (a - b)nΔ(n,t)→(a−b)n as t→∞t \to \inftyt→∞.

In §5 this is applied twice: to Δ2\Delta^2Δ2 with the pair (p,p2)(p, p_2)(p,p2​), and to Δ=J1(⋅;0)−J2(⋅;0)\Delta = J^1(\cdot;0) - J^2(\cdot;0)Δ=J1(⋅;0)−J2(⋅;0) with the pair (p1,p2)(p_1, p_2)(p1​,p2​), both in case (ii).

Formalization Note The page proves Lemma 3 for case (i) only and states that "the proof for case (ii) is entirely analogous" (p. 1390); the statement here is the lemma's case (ii) as printed. The limit (p1−p2)n(p_1 - p_2)n(p1​−p2​)n of the page is (a−b)n(a - b)n(a−b)n in the generic pair. Continuity is stated on all of R\mathbb RR.

Preamble
import Mathlib
import Definitions.Def_PriceSwitch_Markdown_Model
Formal statement
namespace PriceSwitch.UpOrDown

open Filter Topology

/-- Feng–Gallego (1995), Lemma 3, case (ii), p. 1382, for `Δ(n, t) = J(n, t; t) − J(n, t; 0)` and
`t_n = inf{t > 0 : Δ(n, t) = 0}`. -/
theorem lemma3_markup (a la b lb : ℝ) (hpair : PriceSwitch.Markdown.IsMarkupPair a la b lb) :
    let Δ : ℕ → ℝ → ℝ := fun n t => PriceSwitch.Markdown.switchRevenue a la b lb n t t - PriceSwitch.Markdown.switchRevenue a la b lb n t 0
    let tn : ℕ → ℝ := fun n => sInf {t : ℝ | 0 < t ∧ Δ n t = 0}
    (∀ n, 1 ≤ n → Continuous (Δ n)) ∧
    (∀ n, 1 ≤ n → ∃ t, 0 < t ∧ Δ n t = 0) ∧
    (∀ n, 1 ≤ n → ∀ t, 0 < t → t < tn n → 0 < Δ n t) ∧
    (∀ n, 1 ≤ n → ∀ t, tn n < t → Δ n t < 0) ∧
    StrictMonoOn tn (Set.Ici 1) ∧
    (∀ n, 1 ≤ n → AntitoneOn (Δ n) (Set.Ioi (tn n))) ∧
    (∀ n, 1 ≤ n → Tendsto (Δ n) atTop (𝓝 ((a - b) * n))) := by sorry

end PriceSwitch.UpOrDown
Source
Feng & Gallego (1995), Management Science 41(8), Lemma 3, p. 1382 (case (ii): "entirely analogous", Appendix, p. 1390)
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