Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Contraction: ∥π(y)−π(y′)∥≤α∥y−y′∥\|\pi(y)-\pi(y')\|\le\alpha\|y-y'\|∥π(y)−π(y′)∥≤α∥y−y′∥ on [0,T][0,T][0,T] when the maximal column sum of QQQ is α<1\alpha<1α<1

Proved
HarrisonReimanRBM.Orthant.contraction

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

contractionp2o-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 whose maximal column sum satisfies

α=max⁡1≤j≤K∑i=1Kqij<1.\alpha=\max_{1\le j\le K}\sum_{i=1}^K q_{ij}<1.α=1≤j≤Kmax​i=1∑K​qij​<1.

Fix x∈CSx\in C_Sx∈CS​, T>0T>0T>0, and let π\piπ be the map π(y)(t)=sup⁡0≤s≤t[y(s)Q−x(s)]+\pi(y)(t)=\sup_{0\le s\le t}[y(s)Q-x(s)]^+π(y)(t)=sup0≤s≤t​[y(s)Q−x(s)]+ (componentwise). Equip paths on [0,T][0,T][0,T] with the norm ∥y∥=max⁡1≤j≤Ksup⁡0≤t≤T∣yj(t)∣\|y\|=\max_{1\le j\le K}\sup_{0\le t\le T}|y_j(t)|∥y∥=max1≤j≤K​sup0≤t≤T​∣yj​(t)∣. Then for all paths y,y′y,y'y,y′ continuous on [0,T][0,T][0,T],

∥π(y)−π(y′)∥≤α ∥y−y′∥.\|\pi(y)-\pi(y')\|\le\alpha\,\|y-y'\|.∥π(y)−π(y′)∥≤α∥y−y′∥.

Hence π\piπ is a contraction of the complete metric space C0[0,T]C_0[0,T]C0​[0,T], which yields the unique fixed point of (13)–(14).

Formalization Note The paper writes ∥Q∥=α<1\|Q\|=\alpha<1∥Q∥=α<1 with ∥⋅∥\|\cdot\|∥⋅∥ the maximal row sum. Under the paper's row-vector convention (yQ)j=∑iyiqij(yQ)_j=\sum_i y_iq_{ij}(yQ)j​=∑i​yi​qij​, the Lipschitz constant of y↦yQy\mapsto yQy↦yQ in the max-norm is the maximal column sum, and with the printed reading the inequality is false: for K=3K=3K=3, q13=q23=0.9q_{13}=q_{23}=0.9q13​=q23​=0.9 and all other entries 000 (spectral radius 000, row sums ≤0.9\le0.9≤0.9), x≡0x\equiv0x≡0, y(s)=(s,s,0)y(s)=(s,s,0)y(s)=(s,s,0), y′≡0y'\equiv0y′≡0 on [0,1][0,1][0,1] gives π3(y)(1)=1.8\pi_3(y)(1)=1.8π3​(y)(1)=1.8 while ∥y−y′∥=1\|y-y'\|=1∥y−y′∥=1. The statement therefore assumes the maximal column sum is α<1\alpha<1α<1; the Veinott step applied to Q⊤Q^\topQ⊤ provides such a rescaling. The paper restricts y,y′y,y'y,y′ to C0[0,T]C_0[0,T]C0​[0,T]; the inequality holds for all continuous y,y′y,y'y,y′ on [0,T][0,T][0,T], and that stronger form is stated.

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. 304: if `Q ≥ 0` has zero diagonal and maximal column sum
`α < 1` (the norm for which `y ↦ yQ` is a contraction under the row-vector convention), then
for `x ∈ C_S` and `y, y'` continuous on `[0, T]`,
`‖π(y) − π(y')‖ ≤ α ‖y − y'‖` in the norm `max_j sup_{0 ≤ t ≤ T} |·_j(t)|`. -/
theorem contraction {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 : ℝ → Fin K → ℝ) (hx : IsCPlus x) (T : ℝ) (hT : 0 < T)
    (y y' : ℝ → Fin K → ℝ) (hy : ContinuousOn y (Set.Icc 0 T))
    (hy' : ContinuousOn y' (Set.Icc 0 T)) :
    supNormOn T (piMap Q x y - piMap Q x y') ≤ α * supNormOn T (y - y') := by sorry

end HarrisonReimanRBM.Orthant
Source
Harrison & Reiman, Reflected Brownian Motion on an Orthant, Ann. Probab. 9(2) (1981), p. 304, proof of Theorem 1 (the contraction inequality following the definition of the norm on C[0, T])
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