Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3.1, (A.1) — for B concentrated at c > 0, (3.1) is the recursion z = x on [0, c), z(t) = x(t) + (z(t−c)+a)⁺, and the solution is unique

Proved
ReedGGN.Regulator.point_mass_recursion

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

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

Let c>0c>0c>0, a∈Ra\in\mathbb Ra∈R, and let B=1{⋅≥c}B=\mathbf 1\{\cdot\ge c\}B=1{⋅≥c} be the distribution function of the unit mass at ccc.

  1. For any functions x,zx,zx,z, the path zzz solves (3.1),
z(t)=x(t)+∫[0,t](z(t−s)+a)+ dB(s),t≥0,z(t)=x(t)+\int_{[0,t]}(z(t-s)+a)^+\,dB(s),\quad t\ge0,z(t)=x(t)+∫[0,t]​(z(t−s)+a)+dB(s),t≥0,

if and only if

z(t)=x(t)  (0≤t<c)andz(t)=x(t)+(z(t−c)+a)+  (t≥c).z(t)=x(t)\ \ (0\le t<c)\qquad\text{and}\qquad z(t)=x(t)+(z(t-c)+a)^+\ \ (t\ge c).z(t)=x(t)  (0≤t<c)andz(t)=x(t)+(z(t−c)+a)+  (t≥c).
  1. Consequently, for a càdlàg input xxx, two càdlàg solutions of (3.1) coincide on [0,∞)[0,\infty)[0,∞).

This is the degenerate case of the paper's proof of Proposition 3.1, where (3.1) reduces to an explicit recursion with step ccc.

Formalization Note The paper writes "it is clear that the solution to (3.1) satisfies the recursion ... in which case it is clearly unique"; item 1 makes the reduction an equivalence and item 2 states the uniqueness up to equality on [0,∞)[0,\infty)[0,∞) (values at negative times are not part of a path).

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, p. 32, (A.1): when `B` is concentrated on a point `c > 0`,
a function `z` solves (3.1) iff `z = x` on `[0, c)` and `z(t) = x(t) + (z(t − c) + a)^+` for
`t ≥ c`; and two càdlàg solutions agree on `[0, ∞)`. -/
theorem point_mass_recursion (c a : ℝ) (hc : 0 < c) :
    (∀ x z : ℝ → ℝ, SolvesRegulator (Measure.dirac c) a x z ↔
      ((∀ t, 0 ≤ t → t < c → z t = x t) ∧
        (∀ t, c ≤ t → z t = x t + max (z (t - c) + a) 0))) ∧
    (∀ x z₁ z₂ : ℝ → ℝ, IsCadlag x → IsCadlag z₁ → IsCadlag z₂ →
      SolvesRegulator (Measure.dirac c) a x z₁ → SolvesRegulator (Measure.dirac c) a x z₂ →
      Set.EqOn z₁ z₂ (Set.Ici 0)) := by sorry

end ReedGGN.Regulator
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 32, proof of Proposition 3.1, Eq. (A.1)
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