Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.1, (110) — B1∘μe−B2∘μe−B3∘ηB_1\circ\mu e-B_2\circ\mu e-B_3\circ\etaB1​∘μe−B2​∘μe−B3​∘η has the law of 2μ B\sqrt{2\mu}\,B2μ​B

Proved
MartingaleHT.FiniteWaiting.eq_110

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

brownian-motiondiffusion-approximationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let μ>0\mu>0μ>0, let B1,B2,B3B_1,B_2,B_3B1​,B2​,B3​ be independent standard Brownian motions on a probability space (Ω,P)(\Omega,P)(Ω,P), and let BBB be a standard Brownian motion on a probability space (Ω′′,P′′)(\Omega'',P'')(Ω′′,P′′). Write e(t)=te(t)=te(t)=t for the identity map and η(t)≡0\eta(t)\equiv0η(t)≡0 for the zero function. Then, as processes indexed by t≥0t\ge0t≥0,

B1∘μe−B2∘μe−B3∘η =d B1∘μe−B2∘μe−η =d 2μ B,B_1\circ\mu e-B_2\circ\mu e-B_3\circ\eta\ \overset{d}{=}\ B_1\circ\mu e-B_2\circ\mu e-\eta\ \overset{d}{=}\ \sqrt{2\mu}\,B,B1​∘μe−B2​∘μe−B3​∘η =d B1​∘μe−B2​∘μe−η =d 2μ​B,

that is, the three processes t↦B1(μt)−B2(μt)−B3(0)t\mapsto B_1(\mu t)-B_2(\mu t)-B_3(0)t↦B1​(μt)−B2​(μt)−B3​(0), t↦B1(μt)−B2(μt)t\mapsto B_1(\mu t)-B_2(\mu t)t↦B1​(μt)−B2​(μt) and t↦2μ B(t)t\mapsto\sqrt{2\mu}\,B(t)t↦2μ​B(t) have the same law on path space.

This identifies the noise in the heavy-traffic limit: the arrival and service noise combine into a Brownian motion with variance 2μ2\mu2μ, and the abandonment noise vanishes because its time change converges to zero.

Formalization Note The display (110) appears in the proof of Theorem 7.1 (§7.1); the proof of Theorem 1.2 invokes it through "The proof can be much the same as in §7.1" (p. 250). Equality in law is IdentDistrib of the paths indexed by R≥0\mathbb R_{\ge0}R≥0​ (product σ-algebra). μe\mu eμe is realized as t↦μtt\mapsto \mu tt↦μt in R≥0\mathbb R_{\ge0}R≥0​. Brownian motion is ErlangA.Diffusion.IsStandardBM.

Preamble
import Mathlib
import Definitions.Def_ErlangA_Diffusion_SDE

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

open ErlangA.Diffusion

/-- **§7.1, (110)** (p. 250). Let `µ > 0`, let `B₁`, `B₂`, `B₃` be independent standard Brownian
motions on `(Ω, P)`, and let `B` be a standard Brownian motion on `(Ω'', P'')`. With `e(t) = t`
and `η(t) ≡ 0`,
`B₁ ∘ µe − B₂ ∘ µe − B₃ ∘ η =ᵈ B₁ ∘ µe − B₂ ∘ µe − η =ᵈ √(2µ) B`
as processes indexed by `t ≥ 0` (equality of laws on path space). -/
theorem eq_110 (μ : ℝ) (hμ : 0 < μ) {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (B₁ B₂ B₃ : ℝ≥0 → Ω → ℝ)
    (h₁ : IsStandardBM P B₁) (h₂ : IsStandardBM P B₂) (h₃ : IsStandardBM P B₃)
    (hind : iIndepFun (![fun ω (t : ℝ≥0) => B₁ t ω, fun ω (t : ℝ≥0) => B₂ t ω,
      fun ω (t : ℝ≥0) => B₃ t ω] : Fin 3 → Ω → ℝ≥0 → ℝ) P)
    {Ω'' : Type*} [MeasurableSpace Ω''] (P'' : Measure Ω'') [IsProbabilityMeasure P'']
    (B : ℝ≥0 → Ω'' → ℝ) (hB : IsStandardBM P'' B) :
    IdentDistrib (fun ω (t : ℝ≥0) => B₁ (μ.toNNReal * t) ω - B₂ (μ.toNNReal * t) ω - B₃ 0 ω)
      (fun ω (t : ℝ≥0) => B₁ (μ.toNNReal * t) ω - B₂ (μ.toNNReal * t) ω - 0) P P ∧
    IdentDistrib (fun ω (t : ℝ≥0) => B₁ (μ.toNNReal * t) ω - B₂ (μ.toNNReal * t) ω - 0)
      (fun ω (t : ℝ≥0) => Real.sqrt (2 * μ) * B t ω) P P'' := by sorry

end MartingaleHT.FiniteWaiting
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. 250, §7.1, (110)
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