Proof of Proposition 3.1, Uniqueness — if B(y+δ) − B(y) < ε < 1 for all y ≥ 0, two càdlàg solutions of (3.1) coincide
ProvedReedGGN.Regulator.uniquenessp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1regulator-mapuniquenessvolterra-equation
Let be a distribution function on with law , and . Suppose there are and such that
Let be càdlàg and let be càdlàg solutions of (3.1) with input . Then for all .
This is the uniqueness half of Proposition 3.1 in the non-degenerate case of the paper's proof.
Formalization Note is . The second condition, , is the bound the proof uses on the first window (it writes in (A.7)); with integrals over the closed interval it is the mass of , an atom at included, and it is stated separately because the paper's condition is only about half-open windows .
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, Uniqueness (p. 34): if `B(y + δ) − B(y) < ε` for all `y ≥ 0`
(and the first window `[0, δ]`, atom at `0` included, has mass `< ε`), with `0 < ε < 1`,
then two càdlàg solutions of (3.1) for the same càdlàg input agree on `[0, ∞)`. -/
theorem uniqueness (μ : Measure ℝ) [IsProbabilityMeasure μ] (a δ ε : ℝ)
(hδ : 0 < δ) (hε₀ : 0 < ε) (hε₁ : ε < 1)
(hB₀ : μ (Set.Icc 0 δ) < ENNReal.ofReal ε)
(hB : ∀ y, 0 ≤ y → μ (Set.Ioc y (y + δ)) < ENNReal.ofReal ε)
(x u v : ℝ → ℝ) (hx : IsCadlag x) (hu : IsCadlag u) (hv : IsCadlag v)
(hsu : SolvesRegulator μ a x u) (hsv : SolvesRegulator μ a x v) :
Set.EqOn u v (Set.Ici 0) := by sorry
end ReedGGN.Regulator
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 34, proof of Proposition 3.1 (Uniqueness); standing hypothesis p. 32
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.