Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.42)–(5.43) — r = H + H ∗ dM is the unique locally bounded solution of r = H + r ∗ dF

Proved
ReedGGN.RenewalRep.renewal_type_equation

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-equationrenewal-theoryvolterra-equation

Let FFF be the distribution function of a probability measure μ\muμ on [0,∞)[0,\infty)[0,∞) with F(0)=μ({0})<1F(0)=\mu(\{0\})<1F(0)=μ({0})<1, let dM=∑n≥1μ∗ndM=\sum_{n\ge1}\mu^{*n}dM=∑n≥1​μ∗n be its renewal measure, and let HHH be a measurable function bounded on every interval [0,T][0,T][0,T]. Define

r(t)=H(t)+∫0tH(t−u) dM(u).(5.43)r(t)=H(t)+\int_0^t H(t-u)\,dM(u).\tag{5.43}r(t)=H(t)+∫0t​H(t−u)dM(u).(5.43)

Then:

  1. rrr is bounded on every interval [0,T][0,T][0,T];
  2. rrr solves the integral equation of renewal type
r(t)=H(t)+∫0tr(t−u) dF(u)for t≥0;(5.42)r(t)=H(t)+\int_0^t r(t-u)\,dF(u)\qquad\text{for } t\ge 0;\tag{5.42}r(t)=H(t)+∫0t​r(t−u)dF(u)for t≥0;(5.42)
  1. every measurable function r′r'r′ bounded on every [0,T][0,T][0,T] that solves (5.42) coincides with rrr on [0,∞)[0,\infty)[0,∞).

This is the solution theory of renewal-type equations that the paper cites from Karlin and Taylor; in the proof of Corollary 5.2 it is applied with r=Q~F+r=\tilde Q_F^+r=Q~​F+​ and H=ζ~−βFe−Q~F−H=\tilde\zeta-\beta F_e-\tilde Q_F^-H=ζ~​−βFe​−Q~​F−​.

Formalization Note The paper prints (5.42) as r(t)=H(t)+∫0tr(t) dF(t−u)r(t)=H(t)+\int_0^t r(t)\,dF(t-u)r(t)=H(t)+∫0t​r(t)dF(t−u); the renewal-type equation, as in Karlin–Taylor and as (5.43) requires, is r(t)=H(t)+∫0tr(t−u) dF(u)r(t)=H(t)+\int_0^t r(t-u)\,dF(u)r(t)=H(t)+∫0t​r(t−u)dF(u), which is what is stated. The paper says "a distribution function"; the statement assumes the hypotheses under which the cited result holds, namely FFF carried by [0,∞)[0,\infty)[0,∞) with F(0)<1F(0)<1F(0)<1 (for F=δ0F=\delta_0F=δ0​ the equation r=H+rr=H+rr=H+r has no solution unless H=0H=0H=0). "Locally bounded" is made explicit as bounded on every [0,T][0,T][0,T], and measurability of HHH and of competing solutions is added so the integrals are meaningful. Integrals are over the closed interval [0,t][0,t][0,t].

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

open MeasureTheory

/-- (5.42)–(5.43), p. 29 (cited from Karlin–Taylor). Let `F` be the distribution function of a
probability measure `μ` carried by `[0, ∞)` with `F(0) = μ {0} < 1`, and let `H` be measurable
and bounded on every `[0, T]`. Then `r(t) = H(t) + ∫_{[0,t]} H(t − u) dM(u)` (5.43) is bounded
on every `[0, T]`, solves the renewal-type equation `r(t) = H(t) + ∫_{[0,t]} r(t − u) dF(u)` for
`t ≥ 0`, and every measurable solution bounded on every `[0, T]` agrees with it on `[0, ∞)`.
(The paper prints `∫_0^t r(t) dF(t − u)` in (5.42); the corrected form is stated.) -/
theorem renewal_type_equation (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hμ0 : μ (Set.Iio 0) = 0) (hatom : μ {0} < 1)
    (H : ℝ → ℝ) (hHm : Measurable H) (hHb : IsLocallyBounded H) :
    let r : ℝ → ℝ := fun t => H t + ∫ u in Set.Icc 0 t, H (t - u) ∂(renewalMeasure μ)
    IsLocallyBounded r ∧
    (∀ t : ℝ, 0 ≤ t → r t = H t + ∫ u in Set.Icc 0 t, r (t - u) ∂μ) ∧
    (∀ r' : ℝ → ℝ, Measurable r' → IsLocallyBounded r' →
      (∀ t : ℝ, 0 ≤ t → r' t = H t + ∫ u in Set.Icc 0 t, r' (t - u) ∂μ) →
      Set.EqOn r' r (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, proof of Corollary 5.2, Eqs. (5.42)–(5.43) (cited from Karlin–Taylor, A First Course in Stochastic Processes)
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