THEOREM 1, p. 225 — under LAA, V(t) → V(∞) w.p. 1 iff Z(t) → V(∞) w.p. 1 (PASTA)
ProvedWolffPASTA.Main.theorem_1Poisson Arrivals See Time Averages (PASTA).
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 ; ; the sample paths of are left continuous with right-hand limits w.p. 1; is jointly measurable on ; and lack of anticipation holds with respect to the joint history: for each , is independent of , the σ-field generated by .
Let be the fraction of time in that is in , and , with , the fraction of arrivals in who find in . For every random variable ,
So whenever either long-run fraction exists, the other exists and coincides with it: Poisson arrivals see time averages. No stationarity, regeneration or ergodicity is assumed; the only link between arrivals and system is that the system does not anticipate future arrivals. The limit may be random.
Formalization Note is an arbitrary function , the same on both sides of the equivalence; it need not be assumed measurable. when , which does not affect the limit. Lack of anticipation is assumed against rather than against alone as in the printed LAA (p. 225). The page's proof of (6) uses this joint independence ("from LAA and the independent-increments property … for any set in "), and the printed LAA together with independent increments does not give it: with on , on , afterwards, where is the parity of masked by a fair bit computed from the arrival times in , is independent of the future increments after time , so the printed LAA holds, yet on an event of positive probability. The joint condition implies the printed one.
import Mathlib import Definitions.Def_WolffPASTA_Main_Setting open MeasureTheory ProbabilityTheory Filter Topology
namespace WolffPASTA.Main
/-- THEOREM 1 (Wolff 1982, p. 225). Under LAA, `V(t) → V(∞)` w.p. 1 if and only if
`Z(t) → V(∞)` w.p. 1, as `t → ∞`.
Lack of anticipation is taken against the joint history `ℱₜ` (`LAAJoint`), the independence the
page's proof of (6) uses; the printed LAA (future increments independent of the past of `U` only)
does not imply (6) or LEMMA 1 (see the Formalization Note). -/
theorem theorem_1
{Ω : 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})
(hpath : PathRegular P (U N B))
(hjoint : JointlyMeasurable (U N B))
(hLAA : LAAJoint P A (U N B))
(Vinf : Ω → ℝ) :
(∀ᵐ ω ∂P, Tendsto (fun t => V (U N B) t ω) atTop (𝓝 (Vinf ω))) ↔
(∀ᵐ ω ∂P, Tendsto (fun t => Z (U N B) A t ω) atTop (𝓝 (Vinf ω))) := by sorry
end WolffPASTA.Main
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.