Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lipschitz bound: ∥ψ(x)−ψ(x′)∥≤∥x−x′∥/(1−α)\|\psi(x)-\psi(x')\|\le\|x-x'\|/(1-\alpha)∥ψ(x)−ψ(x′)∥≤∥x−x′∥/(1−α) on [0,T][0,T][0,T]

Proved
HarrisonReimanRBM.Orthant.lipschitz_bound

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

lipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reflected-brownian-motion

Let K≥1K\ge1K≥1 and let QQQ be a nonnegative K×KK\times KK×K matrix with zeros on the diagonal and maximal column sum α=max⁡j∑iqij<1\alpha=\max_j\sum_i q_{ij}<1α=maxj​∑i​qij​<1. Let x,x′∈CSx,x'\in C_Sx,x′∈CS​, and let (y,z)(y,z)(y,z) and (y′,z′)(y',z')(y′,z′) satisfy (5)–(8) for QQQ with xxx and x′x'x′ respectively, i.e. y=ψ(x)y=\psi(x)y=ψ(x), y′=ψ(x′)y'=\psi(x')y′=ψ(x′). Then for every T>0T>0T>0,

∥y−y′∥≤∥x−x′∥1−α,\|y-y'\|\le\frac{\|x-x'\|}{1-\alpha},∥y−y′∥≤1−α∥x−x′∥​,

where ∥w∥=max⁡1≤j≤Ksup⁡0≤t≤T∣wj(t)∣\|w\|=\max_{1\le j\le K}\sup_{0\le t\le T}|w_j(t)|∥w∥=max1≤j≤K​sup0≤t≤T​∣wj​(t)∣.

This gives the continuity (10) of ψ\psiψ in the topology of uniform convergence on compact intervals, and with (15) that of ϕ\phiϕ.

Formalization Note The paper derives the bound from the one-step inequality ∥yn+1(x)−yn+1(x′)∥≤∥x−x′∥+α∥yn(x)−yn(x′)∥\|y^{n+1}(x)-y^{n+1}(x')\|\le\|x-x'\|+\alpha\|y^n(x)-y^n(x')\|∥yn+1(x)−yn+1(x′)∥≤∥x−x′∥+α∥yn(x)−yn(x′)∥ for the Picard iterates; the final bound is stated here for solutions of (5)–(8), which avoids defining ψ\psiψ by choice. As in the contraction milestone, α\alphaα is the maximal column sum (the printed "row sum" is the column sum under the row-vector convention). The paper takes x,x′∈CS[0,T]x,x'\in C_S[0,T]x,x′∈CS​[0,T]; here they are in CSC_SCS​ on [0,∞)[0,\infty)[0,∞), and by (9) only their restrictions to [0,T][0,T][0,T] matter.

Preamble
import Mathlib
import Definitions.Def_Reiman84_QueueLength_Paths
import Definitions.Def_HarrisonReimanRBM_Orthant_Basic
Formal statement
namespace HarrisonReimanRBM.Orthant

open Reiman84.QueueLength

/-- Proof of Theorem 1, p. 305: if `Q ≥ 0` has zero diagonal and maximal column sum
`α < 1`, then for `x, x' ∈ C_S` with `y = ψ(x)`, `y' = ψ(x')`,
`‖y − y'‖ ≤ ‖x − x'‖ / (1 − α)` in the norm `max_j sup_{0 ≤ t ≤ T} |·_j(t)|`. -/
theorem lipschitz_bound {K : ℕ} (hK : 0 < K) (Q : Matrix (Fin K) (Fin K) ℝ)
    (hQ0 : ∀ i j, 0 ≤ Q i j) (hQd : ∀ j, Q j j = 0) (α : ℝ) (hα : maxColSum Q = α)
    (hα1 : α < 1) (x y z x' y' z' : ℝ → Fin K → ℝ) (h : IsReflectionPair Q x y z)
    (h' : IsReflectionPair Q x' y' z') (T : ℝ) (hT : 0 < T) :
    supNormOn T (y - y') ≤ supNormOn T (x - x') / (1 - α) := by sorry

end HarrisonReimanRBM.Orthant
Source
Harrison & Reiman, Reflected Brownian Motion on an Orthant, Ann. Probab. 9(2) (1981), p. 305, proof of Theorem 1 (continuity property (10))
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