Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Picard iteration (16)–(19): yn→yy^n\to yyn→y uniformly on compacts, yyy the unique solution of (13)–(14)

Proved
HarrisonReimanRBM.Orthant.picard_convergence

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

contractionfixed-pointp2o-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\max_j\sum_i q_{ij}<1maxj​∑i​qij​<1. Fix x∈CSx\in C_Sx∈CS​ and let π(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)]+. Define

y0(t)≡0,yn+1=π(yn),n=0,1,2,…(16)–(18).y^0(t)\equiv0,\qquad y^{n+1}=\pi(y^n),\quad n=0,1,2,\dots\qquad(16)\text{–}(18).y0(t)≡0,yn+1=π(yn),n=0,1,2,…(16)–(18).

Then there is a path yyy such that

  1. y∈C0y\in C_0y∈C0​ (continuous, nondecreasing, y(0)=0y(0)=0y(0)=0) and y(t)=π(y)(t)y(t)=\pi(y)(t)y(t)=π(y)(t) for all t≥0t\ge0t≥0;
  2. every y′∈C0y'\in C_0y′∈C0​ with y′(t)=π(y′)(t)y'(t)=\pi(y')(t)y′(t)=π(y′)(t) for all t≥0t\ge0t≥0 coincides with yyy on [0,∞)[0,\infty)[0,∞);
  3. yn→yy^n\to yyn→y uniformly on compact intervals of [0,∞)[0,\infty)[0,∞) (19).

This gives existence and uniqueness for the fixed-point formulation (13)–(14), together with the explicit construction (16)–(18).

Formalization Note The paper works under ∥Q∥=α<1\|Q\|=\alpha<1∥Q∥=α<1, printed as the maximal row sum; as in the contraction milestone, the norm that makes π\piπ a contraction under the row-vector convention is the maximal column sum, which is assumed here. Uniform convergence on compacts is Reiman84.QueueLength.UocTendsto.

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, pp. 304–305, (16)–(19): if `Q ≥ 0` has zero diagonal and maximal
column sum `< 1`, then for `x ∈ C_S` the system (13)–(14) (`y ∈ C₀`, `y = π(y)` on
`[0, ∞)`) has a unique solution `y`, and the Picard iterates `y⁰ ≡ 0`, `yⁿ⁺¹ = π(yⁿ)`
converge to `y` uniformly on compact intervals. -/
theorem picard_convergence {K : ℕ} (hK : 0 < K) (Q : Matrix (Fin K) (Fin K) ℝ)
    (hQ0 : ∀ i j, 0 ≤ Q i j) (hQd : ∀ j, Q j j = 0) (hcol : maxColSum Q < 1)
    (x : ℝ → Fin K → ℝ) (hx : IsCPlus x) :
    ∃ y : ℝ → Fin K → ℝ, InC0 y ∧ (∀ t, 0 ≤ t → y t = piMap Q x y t) ∧
      (∀ y' : ℝ → Fin K → ℝ, InC0 y' → (∀ t, 0 ≤ t → y' t = piMap Q x y' t) →
        ∀ t, 0 ≤ t → y' t = y t) ∧
      UocTendsto (fun n => picardIter Q x n) y := by sorry

end HarrisonReimanRBM.Orthant
Source
Harrison & Reiman, Reflected Brownian Motion on an Orthant, Ann. Probab. 9(2) (1981), pp. 304–305, proof of Theorem 1, (16)–(19)
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