Proof of Proposition 3.1, (A.1) — for B concentrated at c > 0, (3.1) is the recursion z = x on [0, c), z(t) = x(t) + (z(t−c)+a)⁺, and the solution is unique
ProvedReedGGN.Regulator.point_mass_recursionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1regulator-mapvolterra-equation
Let , , and let be the distribution function of the unit mass at .
- For any functions , the path solves (3.1),
if and only if
- Consequently, for a càdlàg input , two càdlàg solutions of (3.1) coincide on .
This is the degenerate case of the paper's proof of Proposition 3.1, where (3.1) reduces to an explicit recursion with step .
Formalization Note The paper writes "it is clear that the solution to (3.1) satisfies the recursion ... in which case it is clearly unique"; item 1 makes the reduction an equivalence and item 2 states the uniqueness up to equality on (values at negative times are not part of a path).
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.1): when `B` is concentrated on a point `c > 0`,
a function `z` solves (3.1) iff `z = x` on `[0, c)` and `z(t) = x(t) + (z(t − c) + a)^+` for
`t ≥ c`; and two càdlàg solutions agree on `[0, ∞)`. -/
theorem point_mass_recursion (c a : ℝ) (hc : 0 < c) :
(∀ x z : ℝ → ℝ, SolvesRegulator (Measure.dirac c) a x z ↔
((∀ t, 0 ≤ t → t < c → z t = x t) ∧
(∀ t, c ≤ t → z t = x t + max (z (t - c) + a) 0))) ∧
(∀ x z₁ z₂ : ℝ → ℝ, IsCadlag x → IsCadlag z₁ → IsCadlag z₂ →
SolvesRegulator (Measure.dirac c) a x z₁ → SolvesRegulator (Measure.dirac c) a x z₂ →
Set.EqOn z₁ z₂ (Set.Ici 0)) := 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.1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.