Corollary 5.2 — (5.33) ⟺ (5.41) on càdlàg paths, and (5.41) has a unique càdlàg solution
ProvedReedGGN.RenewalRep.corollary_5_2Let be a service-time distribution: the distribution function of a probability measure on with mean . Let be its equilibrium distribution (5.4) and the renewal measure of the renewal process with interarrival law . Fix a càdlàg driving path on and , and write , .
- A càdlàg path solves the diffusion-limit equation
if and only if it solves the renewal-function equation
- Equation (5.41) has a càdlàg solution, and any two càdlàg solutions agree on .
In the paper this is the statement that the diffusion limit of Theorem 5.1 "may be equivalently expressed as the unique strong solution" of (5.41), with . For exponential service, 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 , which lies in almost surely (p. 30); no probability space is built. "Unique strong solution" is made explicit as existence and uniqueness (on ) 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 , ) is not assumed. All integrals are over the closed interval .
import Mathlib import Definitions.Def_ReedGGN_RenewalRep_Basic import Definitions.Def_ReedGGN_RenewalRep_RenewalFunction import Definitions.Def_ReedGGN_RenewalRep_Equations
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.