Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5.2 — (5.33) ⟺ (5.41) on càdlàg paths, and (5.41) has a unique càdlàg solution

Proved
ReedGGN.RenewalRep.corollary_5_2

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

diffusion-limithalfin-whittmany-server-queuep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-equation

Let FFF be a service-time distribution: the distribution function of a probability measure μ\muμ on [0,∞)[0,\infty)[0,∞) with mean 111. Let FeF_eFe​ be its equilibrium distribution (5.4) and dMdMdM the renewal measure of the renewal process with interarrival law FFF. Fix a càdlàg driving path ζ\zetaζ on [0,∞)[0,\infty)[0,∞) and β∈R\beta\in\mathbb Rβ∈R, and write y+=max⁡(y,0)y^+=\max(y,0)y+=max(y,0), y−=min⁡(y,0)y^-=\min(y,0)y−=min(y,0).

  1. A càdlàg path qqq solves the diffusion-limit equation
q(t)=ζ(t)−βFe(t)+∫0tq+(t−s) dF(s),t≥0,(5.33)q(t)=\zeta(t)-\beta F_e(t)+\int_0^t q^+(t-s)\,dF(s),\qquad t\ge0,\tag{5.33}q(t)=ζ(t)−βFe​(t)+∫0t​q+(t−s)dF(s),t≥0,(5.33)

if and only if it solves the renewal-function equation

q(t)=ζ(t)+∫0tζ(t−u) dM(u)−βt−∫0tq−(t−u) dM(u),t≥0.(5.41)q(t)=\zeta(t)+\int_0^t\zeta(t-u)\,dM(u)-\beta t-\int_0^t q^-(t-u)\,dM(u),\qquad t\ge0.\tag{5.41}q(t)=ζ(t)+∫0t​ζ(t−u)dM(u)−βt−∫0t​q−(t−u)dM(u),t≥0.(5.41)
  1. Equation (5.41) has a càdlàg solution, and any two càdlàg solutions agree on [0,∞)[0,\infty)[0,∞).

In the paper this is the statement that the diffusion limit Q~F\tilde Q_FQ~​F​ of Theorem 5.1 "may be equivalently expressed as the unique strong solution" of (5.41), with ζ=ζ~=M~Q+Q~I\zeta=\tilde\zeta=\tilde M_Q+\tilde Q_Iζ=ζ~​=M~Q​+Q~​I​. For exponential service, M(t)=tM(t)=tM(t)=t and (5.41) becomes the Halfin–Whitt diffusion.

Formalization Note The statement is pathwise: the paper's claim about the random process follows by applying it to each sample path ζ~(ω)\tilde\zeta(\omega)ζ~​(ω), which lies in D[0,∞)D[0,\infty)D[0,∞) almost surely (p. 30); no probability space is built. "Unique strong solution" is made explicit as existence and uniqueness (on [0,∞)[0,\infty)[0,∞)) among càdlàg paths. The printed proof shows only that the solution of (5.33) satisfies (5.41); the converse and the uniqueness, which the paper asserts without writing out, are part of the statement, and the existence of a solution of (5.33) (Proposition 3.1 with a=0a=0a=0, B=FB=FB=F) is not assumed. All 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

/-- Corollary 5.2, p. 29, pathwise. For a service law `μ` (probability measure on `[0, ∞)` with
mean `1`), every càdlàg driving path `ζ` and every `β ∈ ℝ`:
1. a càdlàg path solves the limit equation (5.33) if and only if it solves the renewal-function
   equation (5.41);
2. (5.41) has a càdlàg solution, unique on `[0, ∞)` among càdlàg paths. -/
theorem corollary_5_2 (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hμ0 : μ (Set.Iio 0) = 0) (hint : Integrable id μ) (hmean : ∫ x, x ∂μ = 1)
    (ζ : ℝ → ℝ) (hζ : ReedGGN.Regulator.IsCadlag ζ) (β : ℝ) :
    (∀ q : ℝ → ℝ, ReedGGN.Regulator.IsCadlag q → (SolvesLimitEq μ ζ β q ↔ SolvesRenewalEq μ ζ β q)) ∧
    ∃ q : ℝ → ℝ, ReedGGN.Regulator.IsCadlag q ∧ SolvesRenewalEq μ ζ β q ∧
      ∀ q' : ℝ → ℝ, ReedGGN.Regulator.IsCadlag q' → SolvesRenewalEq μ ζ β q' → Set.EqOn q' q (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, Corollary 5.2, Eq. (5.41); p. 25, Eq. (5.33)
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