Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 1, p. 225 — under LAA, V(t) → V(∞) w.p. 1 iff Z(t) → V(∞) w.p. 1 (PASTA)

Proved
WolffPASTA.Main.theorem_1

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

almost-sure-convergencelack-of-anticipationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pastapoisson-processqueueing

Poisson Arrivals See Time Averages (PASTA).

Throughout, (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) is a probability space; N={N(t),t≥0}N=\{N(t),t\ge0\}N={N(t),t≥0} is a process with values in a measurable space SSS; A={A(t),t≥0}A=\{A(t),t\ge0\}A={A(t),t≥0} is a Poisson process at rate λ>0\lambda>0λ>0; B⊆SB\subseteq SB⊆S is a set with {N(t)∈B}∈F\{N(t)\in B\}\in\mathcal F{N(t)∈B}∈F for every t≥0t\ge0t≥0; U(t)=1{N(t)∈B}U(t)=\mathbf 1\{N(t)\in B\}U(t)=1{N(t)∈B}; the sample paths of UUU are left continuous with right-hand limits w.p. 1; UUU is jointly measurable on Ω×[0,∞)\Omega\times[0,\infty)Ω×[0,∞); and lack of anticipation holds with respect to the joint history: for each t≥0t\ge0t≥0, {A(t+u)−A(t),u≥0}\{A(t+u)-A(t),u\ge0\}{A(t+u)−A(t),u≥0} is independent of Ft\mathcal F_tFt​, the σ-field generated by {A(s),U(s);0≤s≤t}\{A(s),U(s);0\le s\le t\}{A(s),U(s);0≤s≤t}.

Let V(t)=t−1∫0tU(s) dsV(t)=t^{-1}\int_0^tU(s)\,dsV(t)=t−1∫0t​U(s)ds be the fraction of time in [0,t][0,t][0,t] that NNN is in BBB, and Z(t)=Y(t)/A(t)Z(t)=Y(t)/A(t)Z(t)=Y(t)/A(t), with Y(t)=∫0tU(s) dA(s)Y(t)=\int_0^tU(s)\,dA(s)Y(t)=∫0t​U(s)dA(s), the fraction of arrivals in (0,t](0,t](0,t] who find NNN in BBB. For every random variable V(∞)V(\infty)V(∞),

V(t)→V(∞) w.p. 1⟺Z(t)→V(∞) w.p. 1,t→∞.V(t)\to V(\infty)\ \text{w.p. 1}\quad\Longleftrightarrow\quad Z(t)\to V(\infty)\ \text{w.p. 1},\qquad t\to\infty.V(t)→V(∞) w.p. 1⟺Z(t)→V(∞) w.p. 1,t→∞.

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 V(∞)V(\infty)V(∞) may be random.

Formalization Note V(∞)V(\infty)V(∞) is an arbitrary function Ω→R\Omega\to\mathbb RΩ→R, the same on both sides of the equivalence; it need not be assumed measurable. Z(t)=0Z(t)=0Z(t)=0 when A(t)=0A(t)=0A(t)=0, which does not affect the limit. Lack of anticipation is assumed against Ft\mathcal F_tFt​ rather than against {U(s),0≤s≤t}\{U(s),0\le s\le t\}{U(s),0≤s≤t} 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 Ft\mathcal F_tFt​"), and the printed LAA together with independent increments does not give it: with U=1U=1U=1 on [0,1][0,1][0,1], U=GU=GU=G on (1,2](1,2](1,2], U=0U=0U=0 afterwards, where GGG is the parity of A(2)−A(1)A(2)-A(1)A(2)−A(1) masked by a fair bit computed from the arrival times in [0,1][0,1][0,1], GGG is independent of the future increments after time 111, so the printed LAA holds, yet E{R(2)−R(1)∣R(s),s≤1}=±λe−2λ≠0E\{R(2)-R(1)\mid R(s),s\le1\}=\pm\lambda e^{-2\lambda}\ne0E{R(2)−R(1)∣R(s),s≤1}=±λe−2λ=0 on an event of positive probability. The joint condition implies the printed one.

Preamble
import Mathlib
import Definitions.Def_WolffPASTA_Main_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
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
Source
Wolff, Poisson Arrivals See Time Averages, Oper. Res. 30 (1982), DOI 10.1287/opre.30.2.223, p. 225, THEOREM 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me