Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.39) — the renewal function is finite and the unique locally bounded solution of M = F + M ∗ dF

Proved
ReedGGN.RenewalRep.renewal_equation

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-equationrenewal-theory

Let FFF be a service-time distribution: the distribution function of a probability measure μ\muμ on [0,∞)[0,\infty)[0,∞) with finite mean ∫x dμ(x)=1\int x\,d\mu(x)=1∫xdμ(x)=1. Let M(t)=∑n≥1F∗n(t)M(t)=\sum_{n\ge1}F^{*n}(t)M(t)=∑n≥1​F∗n(t) be its renewal function and dMdMdM its renewal measure. Then:

  1. MMM is finite: dM((−∞,t])<∞dM((-\infty,t])<\inftydM((−∞,t])<∞ for every ttt;
  2. MMM solves the renewal equation
M(t)=F(t)+∫0tM(t−u) dF(u)for t≥0;M(t)=F(t)+\int_0^t M(t-u)\,dF(u)\qquad\text{for } t\ge 0;M(t)=F(t)+∫0t​M(t−u)dF(u)for t≥0;
  1. MMM is its unique solution: every measurable function mmm that is bounded on each interval [0,T][0,T][0,T] and satisfies m(t)=F(t)+∫0tm(t−u) dF(u)m(t)=F(t)+\int_0^t m(t-u)\,dF(u)m(t)=F(t)+∫0t​m(t−u)dF(u) for all t≥0t\ge 0t≥0 coincides with MMM on [0,∞)[0,\infty)[0,∞).

The paper cites this from Ross (Exercise 3.4) as the characterization of MMM used in Corollary 5.2.

Formalization Note The integral is over the closed interval [0,t][0,t][0,t]; at t=0t=0t=0 the equation reads M(0)=F(0)+M(0)F(0)M(0)=F(0)+M(0)F(0)M(0)=F(0)+M(0)F(0), so M(0)=F(0)/(1−F(0))M(0)=F(0)/(1-F(0))M(0)=F(0)/(1−F(0)). Finiteness needs F(0)<1F(0)<1F(0)<1, which follows from mean 111 and nonnegativity; the mean-111 hypothesis is otherwise unused. "Unique solution" is made explicit as uniqueness among measurable, locally bounded functions, on [0,∞)[0,\infty)[0,∞); measurability makes the integrals meaningful.

Preamble
import Mathlib
import Definitions.Def_ReedGGN_RenewalRep_Basic
import Definitions.Def_ReedGGN_RenewalRep_RenewalFunction
Formal statement
namespace ReedGGN.RenewalRep

open MeasureTheory ProbabilityTheory

/-- (5.39), p. 29 (cited from Ross, Exercise 3.4). For a service law `μ` (probability measure
on `[0, ∞)` with mean `1`), the renewal function `M(t) = ∑_{n≥1} F^{∗n}(t)`
(a) is finite: `dM((-∞, t]) < ∞` for every `t`;
(b) solves the renewal equation `M(t) = F(t) + ∫_{[0,t]} M(t − u) dF(u)` for `t ≥ 0`;
(c) is its unique solution among measurable functions bounded on every `[0, T]`, on `[0, ∞)`. -/
theorem renewal_equation (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hμ0 : μ (Set.Iio 0) = 0) (hint : Integrable id μ) (hmean : ∫ x, x ∂μ = 1) :
    (∀ t : ℝ, renewalMeasure μ (Set.Iic t) < ⊤) ∧
    (∀ t : ℝ, 0 ≤ t →
      renewalFn μ t = cdf μ t + ∫ u in Set.Icc 0 t, renewalFn μ (t - u) ∂μ) ∧
    (∀ m : ℝ → ℝ, Measurable m → IsLocallyBounded m →
      (∀ t : ℝ, 0 ≤ t → m t = cdf μ t + ∫ u in Set.Icc 0 t, m (t - u) ∂μ) →
      Set.EqOn m (renewalFn μ) (Set.Ici 0)) := by sorry

end ReedGGN.RenewalRep
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 29, Eq. (5.39) (cited from Ross, Stochastic Processes, Exercise 3.4)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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