Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (8): 1−ϕ(p)=hb+p+h=Pr⁡[ε≥zp]=Pr⁡[(zp′−ε)+≤zp′−zp]1-\phi(p)=\frac{h}{b+p+h}=\Pr[\varepsilon\ge z_p]=\Pr[(z_{p'}-\varepsilon)^+\le z_{p'}-z_p]1−ϕ(p)=b+p+hh​=Pr[ε≥zp​]=Pr[(zp′​−ε)+≤zp′​−zp​]

Proved
PricingInvCensored.eq_8

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

operations-researchp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Assume Assumption 1, let p<p′p<p'p<p′ be prices in [p‾,p‾][\underline p,\overline p][p​,p​], and let zp,zp′z_p,z_{p'}zp​,zp′​ satisfy Fμ(zp)=ϕ(p)F_\mu(z_p)=\phi(p)Fμ​(zp​)=ϕ(p) and Fμ(zp′)=ϕ(p′)F_\mu(z_{p'})=\phi(p')Fμ​(zp′​)=ϕ(p′), where ϕ(p)=b+pb+p+h\phi(p)=\frac{b+p}{b+p+h}ϕ(p)=b+p+hb+p​. Then zp<zp′z_p<z_{p'}zp​<zp′​ and, for ε∼μ\varepsilon\sim\muε∼μ,

1−ϕ(p)=hb+p+h=Pr⁡[ε≥zp]=Pr⁡[(zp′−ε)+≤zp′−zp].1-\phi(p)=\frac{h}{b+p+h}=\Pr[\varepsilon\ge z_p]=\Pr\big[(z_{p'}-\varepsilon)^+\le z_{p'}-z_p\big].1−ϕ(p)=b+p+hh​=Pr[ε≥zp​]=Pr[(zp′​−ε)+≤zp′​−zp​].

The last probability involves only the leftover stock (zp′−ε)+(z_{p'}-\varepsilon)^+(zp′​−ε)+ at the level y∗(p′)y^*(p')y∗(p′), which is observable under censoring; inverting its empirical distribution at level hb+p+h\frac{h}{b+p+h}b+p+hh​ estimates zp′−zpz_{p'}-z_pzp′​−zp​ (Algorithm 2).

Differences from the source:

  • reading: "(∗) holds because zp′>zpz_{p'}>z_pzp′​>zp​", with zp<zp′z_p<z_{p'}zp​<zp′​ stated on p. 15 → zp<zp′z_p<z_{p'}zp​<zp′​ is a conclusion of the theorem; reason: it is the page's justification of (∗), stated so that the item carries it.
  • encoding: costs b,hb,hb,h and the bound ∣fμ′(u)∣≤K|f_\mu'(u)|\le K∣fμ′​(u)∣≤K of Assumption 1 → b≥0b\ge0b≥0, h>0h>0h>0, and fμf_\mufμ​ differentiable at every uuu of the band; reason: b,hb,hb,h are per-unit penalty and holding costs (p. 5), h>0h>0h>0 is forced by Assumption 1(3) with compact support, and a bound on fμ′(u)f_\mu'(u)fμ′​(u) presupposes the derivative.
Preamble
import Mathlib
import Definitions.Def_PricingInvCensored_Model

open MeasureTheory Set
Formal statement
namespace PricingInvCensored

/-- **Eq. (8)**, Chen, Wang & Zhou, SSRN 3750413 (2022-10-19), p.16 (with p.15). Under
Assumption 1, for prices `p < p′` in `[p̲, p̄]` and `z_p`, `z_{p′}` with `F_µ(z_p) = φ(p)`,
`F_µ(z_{p′}) = φ(p′)`: `z_p < z_{p′}` and
`1 − φ(p) = h/(b + p + h) = Pr[ε ≥ z_p] = Pr[(z_{p′} − ε)⁺ ≤ z_{p′} − z_p]`.

**Formalization Note.** Probabilities are `µ`-measures of the events, as real numbers. -/
theorem eq_8 (I : Instance) (pStar yStar : ℝ) (hA : Assumption1 I pStar yStar) (p p' : ℝ)
    (hp : p ∈ Icc I.market.low I.market.high) (hp' : p' ∈ Icc I.market.low I.market.high)
    (hpp' : p < p') (z z' : ℝ) (hz : I.market.cdf z = I.market.quantileLevel p)
    (hz' : I.market.cdf z' = I.market.quantileLevel p') :
    z < z' ∧
      1 - I.market.quantileLevel p = I.market.h / (I.market.b + p + I.market.h) ∧
      I.market.h / (I.market.b + p + I.market.h) = (I.market.noise (Ici z)).toReal ∧
      (I.market.noise (Ici z)).toReal =
        (I.market.noise {ε : ℝ | max (z' - ε) 0 ≤ z' - z}).toReal := by sorry

end PricingInvCensored
Source
Chen, Wang & Zhou, Optimal Policies for Dynamic Pricing and Inventory Control with Nonparametric Censored Demands, SSRN 3750413 (2022-10-19), Eq. (8), p.16 (with "Since p < p′, we have zp < zp′", p.15)
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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