Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1(i) — the integral representation x=b+y+∫0⋅h(x)x=b+y+\int_0^\cdot h(x)x=b+y+∫0⋅​h(x) has a unique solution in DDD, continuous in (y,b)(y,b)(y,b) for u.o.c. convergence

Proved
MartingaleHT.InfiniteServer.theorem_4_1_i

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

continuous-mappingintegral-equationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let h:R→Rh:\mathbb R\to\mathbb Rh:R→R satisfy h(0)=0h(0)=0h(0)=0 and the Lipschitz condition (62): there is c>0c>0c>0 with ∣h(s1)−h(s2)∣≤c∣s1−s2∣|h(s_1)-h(s_2)|\le c|s_1-s_2|∣h(s1​)−h(s2​)∣≤c∣s1​−s2​∣ for all s1,s2s_1,s_2s1​,s2​. Consider

x(t)=b+y(t)+∫0th(x(s)) ds,t≥0.(63)x(t)=b+y(t)+\int_0^th(x(s))\,ds,\qquad t\ge0. \tag{63}x(t)=b+y(t)+∫0t​h(x(s))ds,t≥0.(63)
  1. For every y∈Dy\in Dy∈D (right-continuous with left limits) and b∈Rb\in\mathbb Rb∈R, (63) has a solution x∈Dx\in Dx∈D, and any two solutions in DDD agree on [0,∞)[0,\infty)[0,∞).
  2. If yyy is continuous on [0,∞)[0,\infty)[0,∞), so is the solution.
  3. The solution map f:(y,b)↦xf:(y,b)\mapsto xf:(y,b)↦x is continuous when DDD carries the topology of uniform convergence on bounded intervals: if bn→bb_n\to bbn​→b and yn→yy_n\to yyn​→y uniformly on [0,T][0,T][0,T] for every T≥0T\ge0T≥0, then the solutions xn→xx_n\to xxn​→x uniformly on [0,T][0,T][0,T] for every T≥0T\ge0T≥0.

With h(s)=−μsh(s)=-\mu sh(s)=−μs this turns the martingale representation (32) into a continuous function of the martingales and the initial value.

Formalization Note Only part (i), the topology of uniform convergence over bounded intervals, is formalized; part (ii), the Skorohod J1J_1J1​ topology, needs a J1J_1J1​ notion on D[0,∞)D[0,\infty)D[0,∞) that the mission does not define. Continuity is stated sequentially, which suffices because that topology is metrizable.

Preamble
import Mathlib
import Definitions.Def_BellWilliams2001_ThresholdPolicy_Paths
import Definitions.Def_ManyServerQED_Scheduling_Model
import Definitions.Def_ErlangA_Diffusion_SDE
import Definitions.Def_ErlangA_Diffusion_Queue
import Definitions.Def_MartingaleHT_InfiniteServer_Model
import Definitions.Def_MartingaleHT_InfiniteServer_Toolkit

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal BoundedContinuousFunction
Formal statement
namespace MartingaleHT.InfiniteServer

open BellWilliams2001.ThresholdPolicy ManyServerQED.Scheduling ErlangA.Diffusion

/-- **Theorem 4.1, part (i)** (continuity of the integral representation, p. 225). Let
`h : ℝ → ℝ` satisfy `h(0) = 0` and the Lipschitz condition (62) with a constant `c > 0`. Then:
1. for every `y ∈ D` and `b ∈ ℝ` the integral representation (63),
   `x(t) = b + y(t) + ∫₀ᵗ h(x(s)) ds`, `t ≥ 0`, has a solution `x ∈ D`, and any two solutions in
   `D` agree on `[0, ∞)`;
2. if `y` is continuous on `[0, ∞)`, so is the solution;
3. the solution map `(y, b) ↦ x` is continuous for the topology of uniform convergence on
   bounded intervals: if `bₙ → b` and `yₙ → y` uniformly on `[0, T]` for every `T`, then the
   solutions `xₙ → x` uniformly on `[0, T]` for every `T`. -/
theorem theorem_4_1_i (h : ℝ → ℝ) (c : ℝ) (hc : 0 < c)
    (hLip : ∀ s₁ s₂ : ℝ, |h s₁ - h s₂| ≤ c * |s₁ - s₂|) (h0 : h 0 = 0) :
    (∀ (y : ℝ → ℝ) (b : ℝ), IsCadlag y →
      (∃ x : ℝ → ℝ, SolvesIntegralRep h b y x) ∧
      (∀ x₁ x₂ : ℝ → ℝ, SolvesIntegralRep h b y x₁ → SolvesIntegralRep h b y x₂ →
        ∀ t : ℝ, 0 ≤ t → x₁ t = x₂ t) ∧
      (ContinuousOn y (Set.Ici 0) → ∀ x : ℝ → ℝ, SolvesIntegralRep h b y x →
        ContinuousOn x (Set.Ici 0))) ∧
    ∀ (yn : ℕ → ℝ → ℝ) (bn : ℕ → ℝ) (xn : ℕ → ℝ → ℝ) (y : ℝ → ℝ) (b : ℝ) (x : ℝ → ℝ),
      (∀ n, IsCadlag (yn n)) → IsCadlag y →
      (∀ n, SolvesIntegralRep h (bn n) (yn n) (xn n)) → SolvesIntegralRep h b y x →
      Tendsto bn atTop (𝓝 b) →
      (∀ T : ℝ, 0 ≤ T → TendstoUniformlyOn yn y atTop (Set.Icc 0 T)) →
      ∀ T : ℝ, 0 ≤ T → TendstoUniformlyOn xn x atTop (Set.Icc 0 T) := by sorry

end MartingaleHT.InfiniteServer
Source
Pang, Talreja & Whitt, Martingale Proofs of Many-Server Heavy-Traffic Limits for Markovian Queues, arXiv:0712.4211v1 (reprint of Probab. Surveys 4 (2007) 193–267), p. 225, Theorem 4.1 (part (i)), (62)–(63)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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