Lipschitz bound: on
ProvedHarrisonReimanRBM.Orthant.lipschitz_boundLet and let be a nonnegative matrix with zeros on the diagonal and maximal column sum . Let , and let and satisfy (5)–(8) for with and respectively, i.e. , . Then for every ,
where .
This gives the continuity (10) of in the topology of uniform convergence on compact intervals, and with (15) that of .
Formalization Note The paper derives the bound from the one-step inequality for the Picard iterates; the final bound is stated here for solutions of (5)–(8), which avoids defining by choice. As in the contraction milestone, is the maximal column sum (the printed "row sum" is the column sum under the row-vector convention). The paper takes ; here they are in on , and by (9) only their restrictions to matter.
import Mathlib import Definitions.Def_Reiman84_QueueLength_Paths import Definitions.Def_HarrisonReimanRBM_Orthant_Basic
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.