Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.44) — every càdlàg solution of (5.33) satisfies the dM-representation with drift −β(Fₑ + Fₑ ∗ dM)

Proved
ReedGGN.RenewalRep.eq_5_44

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

diffusion-limithalfin-whittp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-equation

Let FFF be a service-time distribution (a probability law μ\muμ on [0,∞)[0,\infty)[0,∞) with mean 111), dMdMdM its renewal measure and FeF_eFe​ its equilibrium distribution. Let ζ\zetaζ be a càdlàg path on [0,∞)[0,\infty)[0,∞) and β∈R\beta\in\mathbb Rβ∈R. If qqq is a càdlàg path solving the limit equation (5.33), q(t)=ζ(t)−βFe(t)+∫0tq+(t−s) dF(s)q(t)=\zeta(t)-\beta F_e(t)+\int_0^tq^+(t-s)\,dF(s)q(t)=ζ(t)−βFe​(t)+∫0t​q+(t−s)dF(s) for t≥0t\ge0t≥0, then for every t≥0t\ge 0t≥0

q(t)=ζ(t)+∫0tζ(t−u) dM(u)−β(Fe(t)+∫0tFe(t−s) dM(s))−∫0tq−(t−u) dM(u),q(t)=\zeta(t)+\int_0^t\zeta(t-u)\,dM(u)-\beta\Bigl(F_e(t)+\int_0^tF_e(t-s)\,dM(s)\Bigr)-\int_0^t q^-(t-u)\,dM(u),q(t)=ζ(t)+∫0t​ζ(t−u)dM(u)−β(Fe​(t)+∫0t​Fe​(t−s)dM(s))−∫0t​q−(t−u)dM(u),

where q−=min⁡(q,0)q^-=\min(q,0)q−=min(q,0).

This is the step of the proof of Corollary 5.2 obtained by applying the renewal-type solution formula (5.43) to q+q^+q+; combined with the identity Fe+Fe∗dM=tF_e+F_e*dM=tFe​+Fe​∗dM=t it gives (5.45), i.e. (5.41).

Formalization Note The paper states this for the random limit process Q~F\tilde Q_FQ~​F​ with ζ~=M~Q+Q~I\tilde\zeta=\tilde M_Q+\tilde Q_Iζ~​=M~Q​+Q~​I​; the statement is pathwise, for a fixed càdlàg driving path. 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
import Definitions.Def_ReedGGN_RenewalRep_Equations
Formal statement
namespace ReedGGN.RenewalRep

open MeasureTheory

/-- (5.44), p. 30: for a service law `μ`, a càdlàg driving path `ζ` and `β ∈ ℝ`, every càdlàg
solution `q` of the limit equation (5.33) satisfies, for every `t ≥ 0`,
`q(t) = ζ(t) + ∫_{[0,t]} ζ(t − u) dM(u) − β (F_e(t) + ∫_{[0,t]} F_e(t − s) dM(s))
  − ∫_{[0,t]} q⁻(t − u) dM(u)`, with `q⁻ = min(q, 0)`. -/
theorem eq_5_44 (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hμ0 : μ (Set.Iio 0) = 0) (hint : Integrable id μ) (hmean : ∫ x, x ∂μ = 1)
    (ζ : ℝ → ℝ) (hζ : ReedGGN.Regulator.IsCadlag ζ) (β : ℝ) (q : ℝ → ℝ) (hq : ReedGGN.Regulator.IsCadlag q)
    (hsol : SolvesLimitEq μ ζ β q) :
    ∀ t : ℝ, 0 ≤ t →
      q t = ζ t + (∫ u in Set.Icc 0 t, ζ (t - u) ∂(renewalMeasure μ))
        - β * (ReedGGN.Regulator.Fe μ t + ∫ s in Set.Icc 0 t, ReedGGN.Regulator.Fe μ (t - s) ∂(renewalMeasure μ))
        - ∫ u in Set.Icc 0 t, min (q (t - u)) 0 ∂(renewalMeasure μ) := by sorry

end ReedGGN.RenewalRep
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 30, proof of Corollary 5.2, Eq. (5.44)
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