Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (15): E(Nⁱ − θxⁱ)⁺ ≤ √Var(Nⁱ)/2

Proved
BidPriceControl.Asymptotic.overflow_bound

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

p2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrevenue-management

Assume the standing assumptions of §1, let μ∗\mu^*μ∗ be an optimal solution of (9) for (x,k)(x, k)(x,k), and let θ≥1\theta \ge 1θ≥1 be an integer. In the θ\thetaθ-scaled problem let Ni=∑t=1θk∑j1{Rtj(θ)>μ∗Aj} aijN^i = \sum_{t=1}^{\theta k}\sum_j \mathbf{1}\{R_t^j(\theta) > \mu^* A^j\}\,a_{ij}Ni=∑t=1θk​∑j​1{Rtj​(θ)>μ∗Aj}aij​. Then for every leg iii,

E (Ni−θxi)+≤Var⁡(Ni)2.\mathbb{E}\,(N^i - \theta x^i)^+ \le \frac{\sqrt{\operatorname{Var}(N^i)}}{2}.E(Ni−θxi)+≤2Var(Ni)​​.

The expected overflow of the uncapacitated system on each leg thus grows at most like a standard deviation, that is, like θ\sqrt\thetaθ​, while revenues grow like θ\thetaθ.

Formalization Note. E\mathbb{E}E and Var⁡\operatorname{Var}Var are taken under the product law of the θk\theta kθk scaled periods (pathMeasure). No bound CCC is needed.

Preamble
import Mathlib
import Definitions.Def_BidPriceControl_Asymptotic_Model
Formal statement
namespace BidPriceControl.Asymptotic

open MeasureTheory ProbabilityTheory

/-- Display (15) of the proof of Theorem 1 (pp. 1585–1586): for an optimal solution `μ*` of (9) and
the `θ`-scaled problem, `E(N^i − θx^i)^+ ≤ √Var(N^i) / 2` for every leg `i`, where
`N^i = ∑_{t=1}^{θk} ∑_j 1{R_t^j(θ) > μ*A^j} a_ij`. -/
theorem overflow_bound {m n : ℕ} (A : Fin m → Fin n → ℕ) (F : ℕ → Measure (Fin n → ℝ))
    (k : ℕ) (x : Fin m → ℕ) (hF : ∀ t ∈ Finset.Icc 1 k, IsRequestLaw (F t))
    (μstar : Fin m → ℝ) (hmin : IsRelaxedMinimizer A F k x μstar) (θ : ℕ) (hθ : 1 ≤ θ)
    (i : Fin m) :
    ∫ ω, max (seatsCounted A μstar i ω - (θ : ℝ) * (x i : ℝ)) 0
        ∂(pathMeasure (scaledLaw F θ) (θ * k))
      ≤ Real.sqrt (variance (seatsCounted A μstar i) (pathMeasure (scaledLaw F θ) (θ * k))) / 2 := by sorry

end BidPriceControl.Asymptotic
Source
Talluri, van Ryzin, An Analysis of Bid-Price Controls for Network Revenue Management, Management Sci. 44(11), 1998, pp. 1585–1586, eq. (15)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Data. The theorem takes A=(aij)∈Nm×nA=(a_{ij})\in\mathbb N^{m\times n}A=(aij​)∈Nm×n, measures (Ft)t(F_t)_t(Ft​)t​ on Rn\mathbb R^nRn, k∈Nk\in\mathbb Nk∈N, x∈Nmx\in\mathbb N^mx∈Nm, μ∗∈Rm\mu^*\in\mathbb R^mμ∗∈Rm, θ∈N\theta\in\mathbb Nθ∈N with θ≥1\theta\ge1θ≥1, and a leg iii.

Hypotheses.

  • For t∈{1,…,k}t\in\{1,\dots,k\}t∈{1,…,k}, FtF_tFt​ is a request law: a probability measure, a.s. nonnegative with at most one positive coordinate, no positive-value atoms, and integrable coordinates.
  • μ∗\mu^*μ∗ minimizes Jˉk(x,μ)=∑t=1k∑j∫(rj−μAj)+dFt+∑i′μi′xi′\bar J_k(x,\mu)=\sum_{t=1}^k\sum_j\int(r_j-\mu A^j)^+dF_t+\sum_{i'}\mu_{i'}x_{i'}Jˉk​(x,μ)=∑t=1k​∑j​∫(rj​−μAj)+dFt​+∑i′​μi′​xi′​ over μ≥0\mu\ge0μ≥0, and μ∗≥0\mu^*\ge0μ∗≥0. Here μAj=∑i′μi′ai′j\mu A^j=\sum_{i'}\mu_{i'}a_{i'j}μAj=∑i′​μi′​ai′j​.

Notation.

  • P\mathbb PP is the product measure on (Rn)θk(\mathbb R^n)^{\theta k}(Rn)θk with coordinate sss distributed as F⌈(θk−s)/θ⌉F_{\lceil(\theta k-s)/\theta\rceil}F⌈(θk−s)/θ⌉​.
  • Ni(ω)=∑s∑j1{ωs,j>μ∗Aj}aijN^i(\omega)=\sum_s\sum_j\mathbf 1\{\omega_{s,j}>\mu^*A^j\}a_{ij}Ni(ω)=∑s​∑j​1{ωs,j​>μ∗Aj}aij​.

Conclusion.

∫(Ni−θxi)+ dP  ≤  Var⁡P(Ni)2.\int\big(N^i-\theta x_i\big)^+\,d\mathbb P\;\le\;\frac{\sqrt{\operatorname{Var}_{\mathbb P}(N^i)}}{2}.∫(Ni−θxi​)+dP≤2VarP​(Ni)​​.

Degenerate cases.

  • No minimizer: if none exists, the statement is vacuous.
  • k=0k=0k=0 or n=0n=0n=0: Ni≡0N^i\equiv0Ni≡0 and the claim is 0≤00\le00≤0.
  • Zero variance: in that case the claim is ∫(Ni−θxi)+dP≤0\int(N^i-\theta x_i)^+d\mathbb P\le0∫(Ni−θxi​)+dP≤0, i.e. a.s. Ni≤θxiN^i\le\theta x_iNi≤θxi​.
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

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