Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(11), p. 227 — R(nh) − λh ≤ R(t) ≤ R((n+1)h) + λh for t ∈ [nh, (n+1)h]

Proved
WolffPASTA.Main.eq_11

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pastapoisson-processsample-path

Let AAA be a Poisson process at rate λ>0\lambda>0λ>0 on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P), and let UUU be a process with 0≤U(s)≤10\le U(s)\le10≤U(s)≤1 for s≥0s\ge0s≥0 that is jointly measurable on Ω×[0,∞)\Omega\times[0,\infty)Ω×[0,∞). With V(t)=t−1∫0tU(s) dsV(t)=t^{-1}\int_0^tU(s)\,dsV(t)=t−1∫0t​U(s)ds, Y(t)=∫0tU dAY(t)=\int_0^tU\,dAY(t)=∫0t​UdA and R(t)=Y(t)−λtV(t)R(t)=Y(t)-\lambda tV(t)R(t)=Y(t)−λtV(t), for every sample point ω\omegaω, every h>0h>0h>0 and every n=0,1,2,…n=0,1,2,\dotsn=0,1,2,…,

R(nh)−λh≤R(t)≤R((n+1)h)+λh,t∈[nh,(n+1)h].R(nh)-\lambda h\le R(t)\le R((n+1)h)+\lambda h,\qquad t\in[nh,(n+1)h].R(nh)−λh≤R(t)≤R((n+1)h)+λh,t∈[nh,(n+1)h].

The inequality holds path by path because YYY is non-decreasing and tV(t)=∫0tU(s) dstV(t)=\int_0^tU(s)\,dstV(t)=∫0t​U(s)ds changes by at most hhh on an interval of length hhh. It lets the grid strong law (10) be extended to all ttt in Lemma 2.

Formalization Note The statement is made for any jointly measurable process with values in [0,1][0,1][0,1] (the page's UUU is an indicator); joint measurability makes each path integrable on bounded intervals, so ∫0tU(s) ds\int_0^tU(s)\,ds∫0t​U(s)ds is additive in ttt. 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
  • 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