(2), p. 226 — E{Yₙ(t)} = λtE{Σ_{k<n} U(kt/n)/n} under LAA
ProvedWolffPASTA.Main.eq_2expectationlack-of-anticipationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pastapoisson-process
Throughout, is a probability space; is a process with values in a measurable space ; is a Poisson process at rate ; is a set with for every ; ; and the Lack of Anticipation Assumption (LAA) holds: for each , and are independent. (Path regularity and joint measurability are not needed here.)
For and let be the grid approximation (1) of . Then is integrable and
This is display (2) of Wolff's proof of Theorem 1: under LAA each grid increment of is independent of the value of at its left endpoint. Letting gives (3).
Preamble
import Mathlib import Definitions.Def_WolffPASTA_Main_Setting open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace WolffPASTA.Main
/-- Display (2), p. 226: from LAA, `E{Yₙ(t)} = λ t E{∑_{k=0}^{n-1} U(kt/n)/n}`. -/
theorem eq_2
{Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
{S : Type*} [MeasurableSpace S] (N : ℝ → Ω → S)
(A : ℝ → Ω → ℕ) (lam : ℝ) (hlam : 0 < lam) (hA : IsPoissonProcess P A lam)
(B : Set S) (hB : ∀ t, 0 ≤ t → MeasurableSet {ω | N t ω ∈ B})
(hLAA : LAA P A (U N B))
(n : ℕ) (hn : 1 ≤ n) (t : ℝ) (ht : 0 < t) :
Integrable (Yn (U N B) A n t) P ∧
∫ ω, Yn (U N B) A n t ω ∂P =
lam * t * ∫ ω, (∑ k ∈ Finset.range n, U N B (k * t / n) ω / n) ∂P := by sorry
end WolffPASTA.Main
Source
Wolff, Poisson Arrivals See Time Averages, Oper. Res. 30 (1982), DOI 10.1287/opre.30.2.223, p. 226, display (2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.