Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2 (existence part), p. 17 — a controlled process exists

Proved
ManyServerQED.Scheduling.proposition_2_existence

by tianyipeng · Nov 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

diffusionheavy-trafficmany-serverqueueingsde

Let (ℓ,μ,θ,r)(\ell,\mu,\theta,r)(ℓ,μ,θ,r) be diffusion data and b(x,u)=ℓ+(μ−θ)(1⋅x)+u−μxb(x,u)=\ell+(\mu-\theta)(\mathbb 1\cdot x)^+u-\mu xb(x,u)=ℓ+(μ−θ)(1⋅x)+u−μx the drift (26). For every initial point x∈Rkx\in\mathbb R^kx∈Rk and every admissible system π=(Ω,F,(Ft),P,u,W)\pi=(\Omega,\mathcal F,(\mathcal F_t),P,u,W)π=(Ω,F,(Ft​),P,u,W) there exists a controlled process XXX associated with xxx and π\piπ: a process with continuous paths, adapted to (Ft)(\mathcal F_t)(Ft​), with ∫0t∣b(X(s),u(s))∣ ds<∞\int_0^t|b(X(s),u(s))|\,ds<\infty∫0t​∣b(X(s),u(s))∣ds<∞ for all ttt a.s., and

X(t)=x+rW(t)+∫0tb(X(s),u(s)) ds,0≤t<∞,P-a.s.(27)X(t)=x+rW(t)+\int_0^t b(X(s),u(s))\,ds,\qquad 0\le t<\infty,\quad P\text{-a.s.}\qquad(27)X(t)=x+rW(t)+∫0t​b(X(s),u(s))ds,0≤t<∞,P-a.s.(27)

This is the existence half of Proposition 2 (a strong solution of (27) exists). The uniqueness half follows from Proposition 4(i).

Formalization note. The objects are exactly those of the milestone proposition_2: IsControlledProcess requires every path to be continuous and X(t)X(t)X(t) to be Ft\mathcal F_tFt​-measurable, and (27) to hold almost surely.

Preamble
import Mathlib
import Definitions.Def_ManyServerQED_Scheduling_Diffusion

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal
Formal statement
namespace ManyServerQED.Scheduling

/-- Proposition 2 (p. 17), existence part (proof in Appendix A.1, p. 43): for every initial point
`x` and admissible system `π` there is a controlled process associated with `x` and `π`
(a strong solution of (27)). -/
theorem proposition_2_existence {k : ℕ} [NeZero k] (D : DiffusionData k) (π : AdmissibleSystem k)
    (x : Fin k → ℝ) :
    ∃ X : ℝ≥0 → π.Ω → Fin k → ℝ, IsControlledProcess D π x X := by sorry

end ManyServerQED.Scheduling
Source
Atar, Mandelbaum & Reiman, Scheduling a Multi Class Queue with Many Exponential Servers: Asymptotic Optimality in Heavy Traffic, arXiv:math/0407058v1 (reprint of Ann. Appl. Probab. 14(3), 2004), p. 17, Proposition 2 (existence); proof in Appendix A.1, p. 43

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