Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4(i) — Lipschitz dependence of the controlled diffusion on its initial point

Proved
ManyServerQED.Scheduling.proposition_4_i

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

diffusiongronwallp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-differential-equations

Let (ℓ,μ,θ,r)(\ell,\mu,\theta,r)(ℓ,μ,θ,r) be diffusion data. There is a constant ccc, depending only on these data, with the following property. For every admissible system π\piπ, all x,xˉ∈Rkx,\bar x\in\mathbb R^kx,xˉ∈Rk, and controlled processes XXX (for xxx and π\piπ) and Xˉ\bar XXˉ (for xˉ\bar xxˉ and the same π\piπ),

∥Xt−Xˉt∥≤∥x−xˉ∥ (1+ect),t≥0,P-a.s.\|X_t-\bar X_t\|\le\|x-\bar x\|\,(1+e^{ct}),\qquad t\ge0,\quad P\text{-a.s.}∥Xt​−Xˉt​∥≤∥x−xˉ∥(1+ect),t≥0,P-a.s.

Here ∥⋅∥\|\cdot\|∥⋅∥ is the ℓ1\ell^1ℓ1 norm.

This estimate is the input to the continuity of the value function (Proposition 5(ii)).

Formalization Note The paper writes ∣Xt−Xˉt∣|X_t-\bar X_t|∣Xt​−Xˉt​∣ and ∣x−xˉ∣|x-\bar x|∣x−xˉ∣ for vectors; we read ∣⋅∣|\cdot|∣⋅∣ as the paper's norm ∥⋅∥\|\cdot\|∥⋅∥. The constant is quantified before the system, the initial points and the time.

Preamble
import Mathlib
import Definitions.Def_ManyServerQED_Scheduling_Diffusion

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

/-- Proposition 4(i) (p. 23): there is a constant `c`, depending only on the diffusion data, such that
for every admissible system `π` and controlled processes `X`, `X̄` associated with `(x, π)` and
`(x̄, π)`, `P`-a.s. `‖X_t − X̄_t‖ ≤ ‖x − x̄‖(1 + e^{ct})` for all `t ≥ 0` (ℓ¹ norm). -/
theorem proposition_4_i {k : ℕ} [NeZero k] (D : DiffusionData k) :
    ∃ c : ℝ, ∀ (π : AdmissibleSystem k) (x xbar : Fin k → ℝ) (X Xbar : ℝ≥0 → π.Ω → Fin k → ℝ),
      IsControlledProcess D π x X → IsControlledProcess D π xbar Xbar →
        ∀ᵐ ω ∂π.P, ∀ t : ℝ≥0,
          l1norm (X t ω - Xbar t ω) ≤ l1norm (x - xbar) * (1 + Real.exp (c * t)) := 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. 23, Proposition 4(i)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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