Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — the reflection mapping (ψ, φ) on C₊: existence, uniqueness, (18) and (19)

Proved
Reiman84.QueueLength.lemma_1

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

p2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1reflection-mapskorohod-problem

Let PPP be a nonnegative K×KK\times KK×K matrix with spectral radius strictly less than one, CCC the space of continuous functions x:[0,∞)→RKx:[0,\infty)\to\mathbb R^Kx:[0,∞)→RK and C+C_+C+​ the subset with x(0)∈R+Kx(0)\in\mathbb R^K_+x(0)∈R+K​. For each x∈C+x\in C_+x∈C+​ there exists a unique pair y,z∈Cy,z\in Cy,z∈C satisfying, for j=1,…,Kj=1,\dots,Kj=1,…,K,

zj(t)=xj(t)+yj(t)−∑i=1Kpijyi(t),t≥0,(14)z_j(t)=x_j(t)+y_j(t)-\sum_{i=1}^Kp_{ij}y_i(t),\quad t\ge0,\qquad(14)zj​(t)=xj​(t)+yj​(t)−i=1∑K​pij​yi​(t),t≥0,(14) zj(t)≥0,t≥0,(15)z_j(t)\ge0,\quad t\ge0,\qquad(15)zj​(t)≥0,t≥0,(15)

yjy_jyj​ is nondecreasing with yj(0)=0y_j(0)=0yj​(0)=0 (16), and yjy_jyj​ increases only at times ttt where zj(t)=0z_j(t)=0zj​(t)=0 (17). Writing y=ψ(x)y=\psi(x)y=ψ(x), z=ϕ(x)z=\phi(x)z=ϕ(x):

  1. (18) the restrictions of yyy and zzz to [0,T][0,T][0,T] depend only on the restriction of xxx to [0,T][0,T][0,T];
  2. (19) ψ\psiψ and ϕ\phiϕ are continuous mappings C+→CC_+\to CC+​→C.

Z=ϕ(ξ)Z=\phi(\xi)Z=ϕ(ξ) is the limit process of Theorem 1, and (19) is what lets the continuous mapping theorem carry convergence of ζ~n\tilde\zeta^nζ~​n over to ZnZ^nZn.

Formalization Note The result is Theorem 1 of Harrison and Reiman (1981a), cited in this paper. The paper states it for the routing matrix of §2; the hypotheses "nonnegative, spectral radius <1<1<1" (as Pm→0P^m\to0Pm→0) are those of §2 and of Proposition 1. CCC carries the topology of uniform convergence on compact subsets of [0,∞)[0,\infty)[0,∞) (not stated on the page); (19) is stated as sequential continuity, which is equivalent since that topology is metrizable. Condition (17) is: yjy_jyj​ is constant on every interval on which zj>0z_j>0zj​>0.

Preamble
import Mathlib
import Definitions.Def_Reiman84_QueueLength_Paths
Formal statement
namespace Reiman84.QueueLength

open Filter Topology

/-- Lemma 1, p. 445 (Harrison and Reiman 1981a, Theorem 1), for a nonnegative `P` with spectral
radius strictly less than one (`Pᵐ → 0`):
* for each `x ∈ C_+` there is a unique pair `(y, z) = (ψ(x), φ(x))` of continuous paths on
  `[0, ∞)` satisfying (14)–(17);
* (18) the restrictions of `y` and `z` to `[0, T]` depend only on the restriction of `x` to
  `[0, T]`;
* (19) `ψ` and `φ` are continuous `C_+ → C` for uniform convergence on compacts. -/
theorem lemma_1 {K : ℕ} (P : Matrix (Fin K) (Fin K) ℝ) (hP0 : ∀ i j, 0 ≤ P i j)
    (hP : Tendsto (fun m : ℕ => P ^ m) atTop (𝓝 0)) :
    (∀ x : ℝ → Fin K → ℝ, IsCPlus x →
      ∃ y z, IsReflectionPair P x y z ∧
        ∀ y' z', IsReflectionPair P x y' z' → ∀ t, 0 ≤ t → y' t = y t ∧ z' t = z t) ∧
    (∀ (T : ℝ) (x y z x' y' z' : ℝ → Fin K → ℝ), IsReflectionPair P x y z →
      IsReflectionPair P x' y' z' → (∀ t ∈ Set.Icc (0 : ℝ) T, x t = x' t) →
      ∀ t ∈ Set.Icc (0 : ℝ) T, y t = y' t ∧ z t = z' t) ∧
    (∀ (xs ys zs : ℕ → ℝ → Fin K → ℝ) (x y z : ℝ → Fin K → ℝ),
      (∀ n, IsReflectionPair P (xs n) (ys n) (zs n)) → IsReflectionPair P x y z →
      UocTendsto xs x → UocTendsto ys y ∧ UocTendsto zs z) := by sorry

end Reiman84.QueueLength
Source
Reiman, Open Queueing Networks in Heavy Traffic, Math. Oper. Res. 9(3) (1984), p. 445, Lemma 1, Eqs. (14)–(19) (Harrison and Reiman 1981a, Theorem 1)
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).

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