Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Key observation: (5)–(8) are equivalent to (13) y∈C0y\in C_0y∈C0​, (14) y=π(y)y=\pi(y)y=π(y), (15) z=x+y(I−Q)z=x+y(I-Q)z=x+y(I−Q)

Proved
HarrisonReimanRBM.Orthant.key_observation

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

fixed-pointp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reflected-brownian-motionskorokhod-problem

Let K≥1K\ge1K≥1 and let QQQ be a nonnegative K×KK\times KK×K matrix with zeros on the diagonal and spectral radius strictly less than unity. Fix x∈CSx\in C_Sx∈CS​ (continuous on [0,∞)[0,\infty)[0,∞) with x(0)≥0x(0)\ge0x(0)≥0) and let y,zy,zy,z be continuous on [0,∞)[0,\infty)[0,∞). Let π\piπ be the map

π(y)(t)=sup⁡0≤s≤t [y(s)Q−x(s)]+(componentwise).\pi(y)(t)=\sup_{0\le s\le t}\,[y(s)Q-x(s)]^+\quad\text{(componentwise)}.π(y)(t)=0≤s≤tsup​[y(s)Q−x(s)]+(componentwise).

Then (y,z)(y,z)(y,z) satisfies (5)–(8) for QQQ and xxx if and only if

  1. (13) y∈C0y\in C_0y∈C0​: yyy is nondecreasing with y(0)=0y(0)=0y(0)=0;
  2. (14) y(t)=π(y)(t)y(t)=\pi(y)(t)y(t)=π(y)(t) for all t≥0t\ge0t≥0;
  3. (15) z(t)=x(t)+y(t)(I−Q)z(t)=x(t)+y(t)(I-Q)z(t)=x(t)+y(t)(I−Q) for all t≥0t\ge0t≥0.

This turns the Skorokhod problem (5)–(8) into a fixed-point equation for yyy alone, to which the contraction argument is then applied.

Formalization Note The paper proves this after assuming, without loss of generality, that ∥Q∥<1\|Q\|<1∥Q∥<1; the argument does not use that assumption, and it is not made here (a weaker hypothesis, so a stronger statement). Continuity of yyy and zzz is assumed on both sides, as the paper's y,z∈Cy,z\in Cy,z∈C; it keeps the suprema in π\piπ finite. (8) is "yjy_jyj​ is constant on every interval on which zj>0z_j>0zj​>0", as in Reiman84.QueueLength.IsReflectionPair.

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, (13)–(15): for `x ∈ C_S` and `y, z` continuous on `[0, ∞)`,
conditions (5)–(8) are equivalent to (13) `y ∈ C₀`, (14) `y = π(y)` and
(15) `z = x + y(I − Q)` (on `t ≥ 0`). -/
theorem key_observation {K : ℕ} (hK : 0 < K) (Q : Matrix (Fin K) (Fin K) ℝ)
    (hQ : IsReflectionMatrix Q) (x y z : ℝ → Fin K → ℝ) (hx : IsCPlus x)
    (hy : ContinuousOn y (Set.Ici 0)) (hz : ContinuousOn z (Set.Ici 0)) :
    IsReflectionPair Q x y z ↔
      (InC0 y ∧ (∀ t, 0 ≤ t → y t = piMap Q x y t) ∧
        ∀ t, 0 ≤ t → z t = x t + Matrix.vecMul (y t) (1 - Q)) := 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, (12)–(15)
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