Theorem 7.4 (118)–(119) — the scaled martingales of the model are square-integrable with the stated predictable quadratic variations
OpenMartingaleHT.FiniteWaiting.theorem_7_4_martingalesLet and let be the number in system of the queue with servers, waiting room , arrival rate , service rate and abandonment rate , constructed by the random time changes (113) from independent rate-1 Poisson processes , , and an independent initial value . Let be the scaled martingales of (102),
and let be the σ-algebra (118) generated by and the three time-changed Poisson processes up to time , augmented by the null sets. Then the , , form a filtration , and each is a square-integrable -martingale with predictable quadratic variation
with for all and .
This is the second half of Theorem 7.4 (the martingale and quadratic-variation claims (118)–(119)); the first half, the representation identity (116), is a pathwise algebraic consequence of (113).
Formalization Note Identical to the second conjunct of MartingaleHT.FiniteWaiting.theorem_7_4, with the same hypotheses. The filtration is (118) augmented by the measurable -null sets (genSigma). "Predictable quadratic variation" is rendered by HasPQV: adapted, continuous, nondecreasing and nonnegative, with a martingale.
import Mathlib import Definitions.Def_ErlangA_Diffusion_Queue import Definitions.Def_MartingaleHT_FiniteWaiting_Model open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal NNReal
namespace MartingaleHT.FiniteWaiting
open ErlangA.Diffusion
/-- **Theorem 7.4, martingale part (118)–(119)** (p. 252). Let `n ≥ 1` and let `Qₙ` be the
`n`-th `M/M/n/mₙ + M` system with arrival rate `λₙ`, service rate `µ` and abandonment rate `θ`,
built from unit-rate Poisson processes `A`, `S`, `R`. Then the σ-algebras `ℱₙ,ₜ` of (118),
augmented by the `P`-null sets, form a filtration, and with respect to it each scaled martingale
`Mₙ,ᵢ` of (102) is a square-integrable martingale with predictable quadratic variation (119):
`⟨Mₙ,₁⟩(t) = λₙt/n`, `⟨Mₙ,₂⟩(t) = (µ/n)∫₀ᵗ (Qₙ(s) ∧ n) ds`,
`⟨Mₙ,₃⟩(t) = (θ/n)∫₀ᵗ (Qₙ(s) − n)⁺ ds`, and `E[⟨Mₙ,ᵢ⟩(t)] < ∞`. -/
theorem theorem_7_4_martingales (n : ℕ) (hn : 1 ≤ n) (m : ℕ) (lam μ θ : ℝ)
{Ω : Type*} [mΩ : MeasurableSpace Ω] (P : Measure Ω) (A S R : Ω → ℝ → ℝ) (Q : Ω → ℝ → ℕ)
(hsys : IsFiniteWaitingSystem P n m lam μ θ A S R Q) :
∃ ℱ : Filtration ℝ≥0 mΩ, (∀ t, ℱ t = genSigma P n lam μ θ A S R Q t) ∧
(HasPQV ℱ P (fun t ω => scaledMart1 n lam A ω t) (fun t _ => lam * t / n) ∧
∀ t : ℝ≥0, Integrable (fun _ : Ω => lam * t / n) P) ∧
(HasPQV ℱ P (fun t ω => scaledMart2 n μ S Q ω t) (fun t ω => μ / n * busyTime n Q ω t) ∧
∀ t : ℝ≥0, Integrable (fun ω => μ / n * busyTime n Q ω t) P) ∧
(HasPQV ℱ P (fun t ω => scaledMart3 n θ R Q ω t) (fun t ω => θ / n * waitTime n Q ω t) ∧
∀ t : ℝ≥0, Integrable (fun ω => θ / n * waitTime n Q ω t) P) := by sorry
end MartingaleHT.FiniteWaiting