Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1.2.25) — the inversion formula of Ryll-Nardzewski and Slivnyak

Proved
PalmQueueing.Palm.inversion_formula

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

palm-calculuspoint-processqueueingstationary-process

The inversion formula of Ryll-Nardzewski and Slivnyak. The original (θt\theta_tθt​-invariant) probability can be recovered from the Palm probability by averaging over one inter-point interval: for all non-negative random variables fff,

E[f]  =  λ EN0[∫0T1(f∘θt) dt].(1.2.25)E[f] \;=\; \lambda\, E^0_N \Big[ \int_0^{T_1} (f \circ \theta_t)\, dt \Big] . \tag{1.2.25}E[f]=λEN0​[∫0T1​​(f∘θt​)dt].(1.2.25)

The book derives it from Mecke's formula applied to v(ω,t)=h(θ−tω,t)f(θ−tω)v(\omega, t) = h(\theta_{-t}\omega, t) f(\theta_{-t}\omega)v(ω,t)=h(θ−t​ω,t)f(θ−t​ω) for any hhh with ∫Rh(ω,t)N(ω,dt)=1\int_{\mathbb{R}} h(\omega, t) N(\omega, dt) = 1∫R​h(ω,t)N(ω,dt)=1 PPP-a.s. (1.2.23), specialized to h(ω,t)=1[T0(ω),0)(t)h(\omega, t) = \mathbf{1}_{[T_0(\omega), 0)}(t)h(ω,t)=1[T0​(ω),0)​(t) and using that −T0∘θu=u-T_0 \circ \theta_u = u−T0​∘θu​=u PN0P^0_NPN0​-a.s. for all u∈[0,T1)u \in [0, T_1)u∈[0,T1​).

Two specializations appear on the same page: f=1Af = \mathbf{1}_Af=1A​ gives P(A)=λ∫0∞PN0(T1>t, θt∈A) dtP(A) = \lambda \int_0^\infty P^0_N(T_1 > t,\ \theta_t \in A)\, dtP(A)=λ∫0∞​PN0​(T1​>t, θt​∈A)dt (1.2.26), and f=1f = 1f=1 gives

λEN0[T1]=1.(1.2.27)\lambda E^0_N[T_1] = 1 . \tag{1.2.27}λEN0​[T1​]=1.(1.2.27)

It is stated for all non-negative random variables, not only bounded ones; restricting it to bounded fff would be a strictly weaker statement than the book's.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Palm_PointProcess

/-!
# Eq. (1.2.25): the inversion formula of Ryll-Nardzewski and Slivnyak (p.20)
-/
Formal statement
namespace PalmQueueing.Palm

open MeasureTheory

variable {Ω : Type*} [MeasurableSpace Ω]

/-- **The inversion formula of Ryll-Nardzewski and Slivnyak**, Eq. (1.2.25) (p.20): the
`θ_t`-invariant probability is recovered from the Palm probability by averaging over one inter-point
interval,

`E[f] = λ E⁰_N [ ∫_0^{T₁} (f ∘ θ_t) dt ]`,

for **all** non-negative random variables `f` — not only bounded ones. Taking `f = 1` gives
`λ E⁰_N[T₁] = 1` (1.2.27), and `f = 1_A` gives
`P(A) = λ ∫_0^∞ P⁰_N(T₁ > t, θ_t ∈ A) dt` (1.2.26). -/
theorem inversion_formula (S : PalmSetting Ω) (f : Ω → ENNReal) (hf : Measurable f) :
    ∫⁻ ω, f ω ∂S.P
      = ENNReal.ofReal S.lam *
          ∫⁻ ω, ∫⁻ t in Set.Ioc (0 : ℝ) (S.N.T 1 ω), f (S.θ t ω) ∂(volume : Measure ℝ) ∂S.P0 := by sorry

end PalmQueueing.Palm
Source
Baccelli & Bremaud, Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences, 2nd ed., Springer 2003, p. 20, Eq. (1.2.25)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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