Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 3, case λ*t > n — J^FP(n,t) ≥ np⁰(1 − 1/(2√n)) = r⁰t(1 − 1/(2√n))

Proved
GVRPricing.FixedPrice.fp_scarce_bound

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

fixed-pricep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1performance-guaranteerevenue-management

Let (Λ,p,λ∗)(\Lambda,p,\lambda^*)(Λ,p,λ∗) be a regular demand function, n≥1n\ge1n≥1 a stock and t>0t>0t>0 a horizon with λ∗t>n\lambda^*t>nλ∗t>n, the case in which items are scarce. The fixed-price heuristic then uses the run-out price p0=p(n/t)p^0=p(n/t)p0=p(n/t), and with r0=r(n/t)r^0=r(n/t)r0=r(n/t),

JFP(n,t) ≥ np0(1−12n)=r0t(1−12n).J^{FP}(n,t)\ \ge\ np^0\Big(1-\frac{1}{2\sqrt n}\Big)=r^0t\Big(1-\frac{1}{2\sqrt n}\Big).JFP(n,t) ≥ np0(1−2n​1​)=r0t(1−2n​1​).

This is one of the two cases of Theorem 3. Compared with JD(n,t)=r0tJ^D(n,t)=r^0tJD(n,t)=r0t (Proposition 2), it gives the ratio 1−1/(2n)1-1/(2\sqrt n)1−1/(2n​).

Formalization Note JFP(n,t)J^{FP}(n,t)JFP(n,t) is the expected revenue of the constant-price policy at λD=min⁡{λ∗,n/t}=n/t\lambda^D=\min\{\lambda^*,n/t\}=n/tλD=min{λ∗,n/t}=n/t, in [0,∞][0,\infty][0,∞]; the bound is stated for its embedding. The hypothesis n≥1n\ge1n≥1 makes 1/(2n)1/(2\sqrt n)1/(2n​) defined; λ∗t>n\lambda^*t>nλ∗t>n with n≥1n\ge1n≥1 is the page's case.

Preamble
import Mathlib
import Definitions.Def_GVRPricing_FixedPrice_Model
import Definitions.Def_GVRPricing_FixedPrice_SalesProcess

open MeasureTheory ProbabilityTheory Set
open scoped ENNReal
Formal statement
namespace GVRPricing.FixedPrice

/-- **Proof of Theorem 3, scarce case** (p. 1008). If `λ* t > n ≥ 1` (`t > 0`), the fixed-price
heuristic uses the run-out price `p⁰ = p(n/t)` and
`J^FP(n, t) ≥ n p⁰ (1 − 1/(2√n)) = r⁰ t (1 − 1/(2√n))` with `r⁰ = r(n/t)`. -/
theorem fp_scarce_bound (M : Model) (n : ℕ) (t : ℝ) (hn : 1 ≤ n) (ht : 0 < t)
    (h : (n : ℝ) < M.lstar * t) :
    ENNReal.ofReal (n * M.p (n / t) * (1 - 1 / (2 * Real.sqrt n))) ≤ fpValue M n t ∧
    n * M.p (n / t) * (1 - 1 / (2 * Real.sqrt n)) =
      M.r (n / t) * t * (1 - 1 / (2 * Real.sqrt n)) := by sorry

end GVRPricing.FixedPrice
Source
Gallego, van Ryzin, Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons, Management Science 40(8) (1994), p. 1008 (PDF 10), §3.3, Proof of Theorem 3, display after (18)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me