Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition B.1 — the one-dimensional Skorokhod problem

Proved
BellWilliams2001.ThresholdPolicy.skorokhod_problem_1d

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

p2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1reflection-mapskorokhod-problem

Let x∈Dx\in\mathbf Dx∈D with x(0)=0x(0)=0x(0)=0. Then there is a unique pair (w,v)∈D2(w,v)\in\mathbf D^2(w,v)∈D2 such that

  1. w(t)=x(t)+v(t)≥0w(t)=x(t)+v(t)\ge0w(t)=x(t)+v(t)≥0 for all t≥0t\ge0t≥0,
  2. vvv is nondecreasing and v(0)=0v(0)=0v(0)=0,
  3. ∫[0,∞)1(0,∞)(w(t)) dv(t)=0\int_{[0,\infty)}1_{(0,\infty)}(w(t))\,dv(t)=0∫[0,∞)​1(0,∞)​(w(t))dv(t)=0.

This solution is (w∗,v∗)(w^*,v^*)(w∗,v∗), where for t≥0t\ge0t≥0

v∗(t)=−inf⁡0≤s≤tx(s),w∗(t)=x(t)+v∗(t).v^*(t)=-\inf_{0\le s\le t}x(s),\qquad w^*(t)=x(t)+v^*(t).v∗(t)=−0≤s≤tinf​x(s),w∗(t)=x(t)+v∗(t).

Moreover every pair (w,v)∈D2(w,v)\in\mathbf D^2(w,v)∈D2 satisfying 1 and 2 has v(t)≥v∗(t)v(t)\ge v^*(t)v(t)≥v∗(t) and w(t)≥w∗(t)w(t)\ge w^*(t)w(t)≥w∗(t) for all t≥0t\ge0t≥0.

The reflection map is how (41) produces the reflected Brownian motion W~∗\tilde W^*W~∗, and the minimality (197) gives the pathwise lower bound behind the inequality in Theorem 5.3.

Formalization Note Condition 3 is stated through the Lebesgue–Stieltjes measure of the nondecreasing right-continuous function vvv extended by v(0)=0v(0)=0v(0)=0 to negative times: the dvdvdv-measure of {t≥0:w(t)>0}\{t\ge0: w(t)>0\}{t≥0:w(t)>0} vanishes. Uniqueness is equality on [0,∞)[0,\infty)[0,∞).

Preamble
import Mathlib
import Definitions.Def_BellWilliams2001_ThresholdPolicy_Paths

open MeasureTheory
Formal statement
namespace BellWilliams2001.ThresholdPolicy

/-- Proposition B.1 (p. 647): the one-dimensional Skorokhod problem. For a Skorokhod path `x`
with `x(0) = 0`, the pair `(w*, v*)`, `v*(t) = −inf_{0≤s≤t} x(s)`, `w* = x + v*`, is the unique
pair `(w, v)` of Skorokhod paths with (i) `w = x + v ≥ 0`, (ii) `v` nondecreasing with `v(0) = 0`,
(iii) `∫_{[0,∞)} 1_{(0,∞)}(w(t)) dv(t) = 0`; and every pair satisfying (i) and (ii) dominates
`(w*, v*)`. Condition (iii) is stated with the Lebesgue–Stieltjes measure `dv` of the
nondecreasing right-continuous function `v` extended by `v(0) = 0` to negative times: the
`dv`-measure of `{t ≥ 0 : w(t) > 0}` is zero. -/
theorem skorokhod_problem_1d (x : ℝ → ℝ) (hx : IsCadlag x) (hx0 : x 0 = 0) :
    let vstar : ℝ → ℝ := fun t => -(⨅ s : Set.Icc (0 : ℝ) t, x s)
    let wstar : ℝ → ℝ := fun t => x t + vstar t
    let Cond : (ℝ → ℝ) → (ℝ → ℝ) → Prop := fun w v =>
      IsCadlag w ∧ IsCadlag v ∧
      (∀ t : ℝ, 0 ≤ t → w t = x t + v t ∧ 0 ≤ w t) ∧
      MonotoneOn v (Set.Ici 0) ∧ v 0 = 0
    let Compl : (ℝ → ℝ) → (ℝ → ℝ) → Prop := fun w v =>
      ∃ F : StieltjesFunction ℝ, (∀ t : ℝ, F t = v (max t 0)) ∧
        F.measure {s : ℝ | 0 ≤ s ∧ 0 < w s} = 0
    (∀ w v : ℝ → ℝ, Cond w v → Compl w v → ∀ t : ℝ, 0 ≤ t → w t = wstar t ∧ v t = vstar t) ∧
    Cond wstar vstar ∧ Compl wstar vstar ∧
    (∀ w v : ℝ → ℝ, Cond w v → ∀ t : ℝ, 0 ≤ t → vstar t ≤ v t ∧ wstar t ≤ w t) := by sorry

end BellWilliams2001.ThresholdPolicy
Source
Bell and Williams, Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling, Ann. Appl. Probab. 11 (2001), p. 647, Appendix B, Proposition B.1, (196)–(197)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by WillR · Nov 15, 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