Key observation: (5)–(8) are equivalent to (13) , (14) , (15)
ProvedHarrisonReimanRBM.Orthant.key_observationLet and let be a nonnegative matrix with zeros on the diagonal and spectral radius strictly less than unity. Fix (continuous on with ) and let be continuous on . Let be the map
Then satisfies (5)–(8) for and if and only if
- (13) : is nondecreasing with ;
- (14) for all ;
- (15) for all .
This turns the Skorokhod problem (5)–(8) into a fixed-point equation for alone, to which the contraction argument is then applied.
Formalization Note The paper proves this after assuming, without loss of generality, that ; the argument does not use that assumption, and it is not made here (a weaker hypothesis, so a stronger statement). Continuity of and is assumed on both sides, as the paper's ; it keeps the suprema in finite. (8) is " is constant on every interval on which ", as in Reiman84.QueueLength.IsReflectionPair.
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. 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.