Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3.1, Measurability — Ψᵃ_B maps D[0,∞) into D[0,∞)

Proved
ReedGGN.Regulator.psi_cadlag

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

cadlagp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1regulator-map

Let BBB be a distribution function on R\mathbb RR with law μ\muμ, and a∈Ra\in\mathbb Ra∈R. For every path uuu that is càdlàg on [0,∞)[0,\infty)[0,∞), the path

ΨBa(u)(t)=∫[0,t](u(t−s)+a)+ dB(s),t≥0,\Psi^a_B(u)(t)=\int_{[0,t]}(u(t-s)+a)^+\,dB(s),\qquad t\ge 0,ΨBa​(u)(t)=∫[0,t]​(u(t−s)+a)+dB(s),t≥0,

is again càdlàg on [0,∞)[0,\infty)[0,∞).

The paper defines ΨBa\Psi^a_BΨBa​ as a map D[0,∞)→D[0,∞)D[0,\infty)\to D[0,\infty)D[0,∞)→D[0,∞) without comment; this statement is that claim.

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, Measurability (p. 34): `Ψ^a_B` maps `D[0,∞)` into `D[0,∞)`:
for every càdlàg `u`, `t ↦ ∫_0^t (u(t − s) + a)^+ dB(s)` is càdlàg. -/
theorem psi_cadlag (μ : Measure ℝ) [IsProbabilityMeasure μ] (a : ℝ) (u : ℝ → ℝ)
    (hu : IsCadlag u) : IsCadlag (psi μ a u) := 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 (Measurability), definition of Ψᵃ_B
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