Proof of Proposition 3.1, (A.2) — for B concentrated at c > 0, ‖z₁ − z₂‖_t = ‖x₁ − x₂‖_t on [0, c) and ‖z₁ − z₂‖_t ≤ k ‖x₁ − x₂‖_t for (k−1)c ≤ t < kc
ProvedReedGGN.Regulator.point_mass_lipschitzlipschitz-continuityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1regulator-map
Let , , and . Let be càdlàg inputs and càdlàg solutions of (3.1) with inputs respectively. Write . Then
- on the first window, for ;
- for every integer and every with ,
This is the Lipschitz continuity of the regulator map on bounded intervals in the point-mass case, with constant on .
Formalization Note The paper's induction step is written "for "; it means , the next window of (A.2), and that is what is stated (for all at once).
Preamble
import Mathlib import Definitions.Def_ReedGGN_Regulator_PathSpace import Definitions.Def_ReedGGN_Regulator_Equation
Formal statement
namespace ReedGGN.Regulator
open MeasureTheory
/-- Proof of Proposition 3.1, p. 32, (A.2): when `B` is concentrated on `c > 0`, for càdlàg
solutions `z₁, z₂` of (3.1) with càdlàg inputs `x₁, x₂`: `‖z₁ − z₂‖_t = ‖x₁ − x₂‖_t` for
`0 ≤ t < c`, and for every integer `k ≥ 1` and every `(k − 1)c ≤ t < kc`,
`‖z₁ − z₂‖_t ≤ k ‖x₁ − x₂‖_t`. -/
theorem point_mass_lipschitz (c a : ℝ) (hc : 0 < c) (x₁ x₂ z₁ z₂ : ℝ → ℝ)
(hx₁ : IsCadlag x₁) (hx₂ : IsCadlag x₂) (hz₁ : IsCadlag z₁) (hz₂ : IsCadlag z₂)
(h₁ : SolvesRegulator (Measure.dirac c) a x₁ z₁)
(h₂ : SolvesRegulator (Measure.dirac c) a x₂ z₂) :
(∀ t : ℝ, 0 ≤ t → t < c → supNorm t (z₁ - z₂) = supNorm t (x₁ - x₂)) ∧
∀ k : ℕ, 1 ≤ k → ∀ t : ℝ, ((k : ℝ) - 1) * c ≤ t → t < k * c →
supNorm t (z₁ - z₂) ≤ k * supNorm t (x₁ - x₂) := by sorry
end ReedGGN.Regulator
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 32, proof of Proposition 3.1, Eq. (A.2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.