Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3.1, Uniqueness — if B(y+δ) − B(y) < ε < 1 for all y ≥ 0, two càdlàg solutions of (3.1) coincide

Proved
ReedGGN.Regulator.uniqueness

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1regulator-mapuniquenessvolterra-equation

Let BBB be a distribution function on R\mathbb RR with law μ\muμ, and a∈Ra\in\mathbb Ra∈R. Suppose there are δ>0\delta>0δ>0 and 0<ε<10<\varepsilon<10<ε<1 such that

B(y+δ)−B(y)<εfor all y≥0,andμ([0,δ])<ε.B(y+\delta)-B(y)<\varepsilon\quad\text{for all } y\ge0,\qquad\text{and}\qquad \mu([0,\delta])<\varepsilon .B(y+δ)−B(y)<εfor all y≥0,andμ([0,δ])<ε.

Let xxx be càdlàg and let u,vu,vu,v be càdlàg solutions of (3.1) with input xxx. Then u(t)=v(t)u(t)=v(t)u(t)=v(t) for all t≥0t\ge0t≥0.

This is the uniqueness half of Proposition 3.1 in the non-degenerate case of the paper's proof.

Formalization Note B(y+δ)−B(y)B(y+\delta)-B(y)B(y+δ)−B(y) is μ((y,y+δ])\mu((y,y+\delta])μ((y,y+δ]). The second condition, μ([0,δ])<ε\mu([0,\delta])<\varepsilonμ([0,δ])<ε, is the bound the proof uses on the first window (it writes B(δ)<εB(\delta)<\varepsilonB(δ)<ε in (A.7)); with integrals over the closed interval [0,t][0,t][0,t] it is the mass of [0,δ][0,\delta][0,δ], an atom at 000 included, and it is stated separately because the paper's condition is only about half-open windows (y,y+δ](y,y+\delta](y,y+δ].

Preamble
import Mathlib
import Definitions.Def_ReedGGN_Regulator_PathSpace
import Definitions.Def_ReedGGN_Regulator_Equation
Formal statement
namespace ReedGGN.Regulator

open MeasureTheory

/-- Proof of Proposition 3.1, Uniqueness (p. 34): if `B(y + δ) − B(y) < ε` for all `y ≥ 0`
(and the first window `[0, δ]`, atom at `0` included, has mass `< ε`), with `0 < ε < 1`,
then two càdlàg solutions of (3.1) for the same càdlàg input agree on `[0, ∞)`. -/
theorem uniqueness (μ : Measure ℝ) [IsProbabilityMeasure μ] (a δ ε : ℝ)
    (hδ : 0 < δ) (hε₀ : 0 < ε) (hε₁ : ε < 1)
    (hB₀ : μ (Set.Icc 0 δ) < ENNReal.ofReal ε)
    (hB : ∀ y, 0 ≤ y → μ (Set.Ioc y (y + δ)) < ENNReal.ofReal ε)
    (x u v : ℝ → ℝ) (hx : IsCadlag x) (hu : IsCadlag u) (hv : IsCadlag v)
    (hsu : SolvesRegulator μ a x u) (hsv : SolvesRegulator μ a x v) :
    Set.EqOn u v (Set.Ici 0) := by sorry

end ReedGGN.Regulator
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 34, proof of Proposition 3.1 (Uniqueness); standing hypothesis p. 32
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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