Remark 4.3, (4.4) — integration by parts for ∫_[0,t] f(t−s)(1−G(t−s)) dZ(s)
DisprovedManyServerFluid.Uniqueness.remark_4_3fluid-limitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstieltjes-integral
Let be a càdlàg function of bounded variation on bounded intervals with , let and . Then
This rewrites the Stieltjes term of the representation (4.3) through itself rather than ; it is what makes the term continuous in for the supremum norm, and so drives Lemma 4.5 and Theorem 4.6.
Formalization Note. is with and ; is a function on with bounded on (a function, one-sided at , extends to one).
Preamble
import Mathlib import Definitions.Def_ManyServerFluid_Uniqueness_Model import Definitions.Def_ManyServerFluid_Uniqueness_AgeEquation open MeasureTheory Filter Topology Set open scoped ENNReal
Formal statement
namespace ManyServerFluid.Uniqueness
/-- Remark 4.3, (4.4), p. 52: for Z = Z₁ − Z₂ ∈ BV_0[0, ∞), f ∈ C_b^1(R₊) and t ≥ 0,
∫_[0,t] f(t − s)(1 − G(t − s)) dZ(s)
= f(0)Z(t) + ∫_[0,t] f′(t − s)(1 − G(t − s)) Z(s) ds − ∫_[0,t] f(t − s) g(t − s) Z(s) ds. -/
theorem remark_4_3 (S : ServiceLaw) (Z₁ Z₂ : ℝ → ℝ) (hZ₁ : ServiceLaw.IsI0 Z₁)
(hZ₂ : ServiceLaw.IsI0 Z₂) (f : ℝ → ℝ) (hf : IsCb1 f) (t : ℝ) (ht : 0 ≤ t) :
bvInt Z₁ Z₂ (Icc 0 t) (fun s => f (t - s) * (1 - S.G (t - s))) =
f 0 * (Z₁ t - Z₂ t)
+ ∫ s in Icc 0 t, deriv f (t - s) * (1 - S.G (t - s)) * (Z₁ s - Z₂ s)
- ∫ s in Icc 0 t, f (t - s) * S.g (t - s) * (Z₁ s - Z₂ s) := by sorry
end ManyServerFluid.Uniqueness
Source
Kaspi and Ramanan, Law of Large Numbers Limits for Many-Server Queues, Ann. Appl. Probab. 21(1) (2011), p. 52, Remark 4.3, (4.4)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.