Lemma 1 — the reflection mapping (ψ, φ) on C₊: existence, uniqueness, (18) and (19)
ProvedReiman84.QueueLength.lemma_1Let be a nonnegative matrix with spectral radius strictly less than one, the space of continuous functions and the subset with . For each there exists a unique pair satisfying, for ,
is nondecreasing with (16), and increases only at times where (17). Writing , :
- (18) the restrictions of and to depend only on the restriction of to ;
- (19) and are continuous mappings .
is the limit process of Theorem 1, and (19) is what lets the continuous mapping theorem carry convergence of over to .
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 " (as ) are those of §2 and of Proposition 1. carries the topology of uniform convergence on compact subsets of (not stated on the page); (19) is stated as sequential continuity, which is equivalent since that topology is metrizable. Condition (17) is: is constant on every interval on which .
import Mathlib import Definitions.Def_Reiman84_QueueLength_Paths
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.