(11), p. 227 — R(nh) − λh ≤ R(t) ≤ R((n+1)h) + λh for t ∈ [nh, (n+1)h]
ProvedWolffPASTA.Main.eq_11p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pastapoisson-processsample-path
Let be a Poisson process at rate on a probability space , and let be a process with for that is jointly measurable on . With , and , for every sample point , every and every ,
The inequality holds path by path because is non-decreasing and changes by at most on an interval of length . It lets the grid strong law (10) be extended to all in Lemma 2.
Formalization Note The statement is made for any jointly measurable process with values in (the page's is an indicator); joint measurability makes each path integrable on bounded intervals, so is additive in . LAA and path regularity are not needed.
Preamble
import Mathlib import Definitions.Def_WolffPASTA_Main_Setting open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace WolffPASTA.Main
/-- Display (11), p. 227: pathwise, `R(nh) - λh ≤ R(t) ≤ R((n + 1)h) + λh` for
`t ∈ [nh, (n + 1)h]`, for any jointly measurable process `U` with values in `[0, 1]`. -/
theorem eq_11
{Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
(A : ℝ → Ω → ℕ) (lam : ℝ) (hlam : 0 < lam) (hA : IsPoissonProcess P A lam)
(U : ℝ → Ω → ℝ) (hU : ∀ s ω, 0 ≤ s → 0 ≤ U s ω ∧ U s ω ≤ 1)
(hjoint : JointlyMeasurable U) :
∀ ω, ∀ h : ℝ, 0 < h → ∀ (n : ℕ) (t : ℝ), n * h ≤ t → t ≤ (n + 1) * h →
R U A lam (n * h) ω - lam * h ≤ R U A lam t ω ∧
R U A lam t ω ≤ R U A lam ((n + 1) * h) ω + lam * h := by sorry
end WolffPASTA.Main
Source
Wolff, Poisson Arrivals See Time Averages, Oper. Res. 30 (1982), DOI 10.1287/opre.30.2.223, p. 227, display (11) in the proof of LEMMA 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.