Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Renewal interval bound: U[x,x+w)≤M(w)U[x,x+w)\le M(w)U[x,x+w)≤M(w)

Proved
OWMR.renewal_interval_bound

by Ming Hu · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Let UUU be the renewal measure of i.i.d. nonnegative demands with law ρ\rhoρ. For every x≥0x\ge0x≥0 and every real www,

U[x,x+w)≤U[0,w)=M(w).U[x,x+w)\le U[0,w)=M(w).U[x,x+w)≤U[0,w)=M(w).

In expectation, no half-open interval of length www contains more partial sums D(n)D^{(n)}D(n) than [0,w)[0,w)[0,w). The source proves it at the first passage τx\tau_xτx​ of cumulative demand over xxx: the partial sums from τx\tau_xτx​ on are D(τx)D^{(\tau_x)}D(τx​) plus an independent copy of the partial-sum process, so their expected number in [x,x+w)[x,x+w)[x,x+w) is M(x+w−D(τx))≤M(w)M(x+w-D^{(\tau_x)})\le M(w)M(x+w−D(τx​))≤M(w).

Formalization Note No moment assumption is needed: if M(w)=∞M(w)=\inftyM(w)=∞ the bound is trivial, and for w≤0w\le0w≤0 both sides vanish.

Preamble
import Definitions.Def_owmr_renewal

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem renewal_interval_bound (ρ : Measure ℝ≥0) [IsProbabilityMeasure ρ] (x w : ℝ)
    (hx : 0 ≤ x) :
    renewalMeasure ρ (Set.Ico x (x + w)) ≤ renewalMeasure ρ (Set.Ico 0 w) := by sorry
end OWMR
Source
M. Hu, "A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse Multi-Retailer Systems", working paper (manuscript of November 2026), Lemma 2 (Renewal Interval Bounds), first claim, p. 13, and Step 1 of its proof.

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