Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, item 1, p. 1125 — optimal root price is nonincreasing in inventory

Proved
ChenFarias.SimplePolicy.price_antitone

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

dynamic-pricingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrevenue-management

Let λ>0\lambda>0λ>0 be the customer-arrival rate, fff the nonnegative valuation density of total mass one on [0,∞)[0,\infty)[0,∞), Fˉ(p)=∫p∞f(v) dv\bar F(p)=\int_p^\infty f(v)\,dvFˉ(p)=∫p∞​f(v)dv its tail, VVV the discounted Bellman value at rate β>0\beta>0β>0, and π\piπ its unique-root inventory price. Assume the paper’s Assumption 1 and the disclosed full-support condition f(p)>0f(p)>0f(p)>0 for p≥0p\ge0p≥0.

For inventory levels 1≤x≤y1\le x\le y1≤x≤y, the root prices satisfy

π(y)≤π(x).\pi(y)\le\pi(x).π(y)≤π(x).

Since inventory only falls, this makes the posted price π^tβ=π(Xt−)\hat\pi^\beta_t=\pi(X_{t-})π^tβ​=π(Xt−​) nondecreasing in time whatever the customers do (§3.1, item 1). It is the first claim of Lemma 7.

Formalization Note “Decreasing” on the page is read as nonincreasing. Only positive inventory is priced; the zero-inventory price is represented separately as infinity. The root predicate includes uniqueness as disclosed in the model.

Preamble
import Mathlib
import Definitions.Def_ChenFarias_SimplePolicy_Model
Formal statement
namespace ChenFarias.SimplePolicy

/-- Section 3.1, item 1: the root price decreases with inventory. -/
theorem price_antitone (lam β : ℝ) (f : ℝ → ℝ) (V : ℕ → ℝ) (π : ℕ → ℝ)
    (hlam : 0 < lam) (hβ : 0 < β) (hf : Assumption1 f)
    (hV : IsValueFn lam β f V) (hπ : IsRootPolicy f V π) :
    AntitoneOn π (Set.Ici 1) := by sorry

end ChenFarias.SimplePolicy
Source
Chen and Farias, Robust Dynamic Pricing with Strategic Customers, Mathematics of Operations Research 43(4) (2018), p. 1125, §3.1, item 1
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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