Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1.3.4) — the Neveu exchange formula

Proved
PalmQueueing.Palm.neveu_exchange_formula

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

palm-calculuspoint-processqueueingstationary-process

The Neveu exchange formula. Let (N,θt,P)(N, \theta_t, P)(N,θt​,P) and (N′,θt,P)(N', \theta_t, P)(N′,θt​,P) be two stationary point processes with finite intensities λ\lambdaλ and λ′\lambda'λ′ respectively. They are jointly stationary, in the sense that their stationarity is relative to the same quadruple (Ω,F,P,θt)(\Omega, \mathcal{F}, P, \theta_t)(Ω,F,P,θt​). Then

λEN0[f]  =  λ′EN′0[∫(0,T1′](f∘θt) N(dt)](1.3.4)\lambda E^0_N[f] \;=\; \lambda' E^0_{N'}\Big[ \int_{(0, T'_1]} (f \circ \theta_t)\, N(dt) \Big] \tag{1.3.4}λEN0​[f]=λ′EN′0​[∫(0,T1′​]​(f∘θt​)N(dt)](1.3.4)

for all non-negative measurable functions f:(Ω,F)→(R,B)f : (\Omega, \mathcal{F}) \to (\mathbb{R}, \mathcal{B})f:(Ω,F)→(R,B), where Tn′T'_nTn′​ is the nnn-th point of N′N'N′.

The formula exchanges the roles of the two processes: it converts an NNN-Palm expectation into an N′N'N′-Palm expectation of a sum over the points of NNN falling in one N′N'N′-cycle. Taking N′=NN' = NN′=N recovers the trivial identity; taking f=1f = 1f=1 gives λ=λ′EN′0[N((0,T1′])]\lambda = \lambda' E^0_{N'}[N((0,T'_1])]λ=λ′EN′0​[N((0,T1′​])], the intensity ratio.

The two hypotheses that the flows and the stationary probabilities of the two settings agree are what "jointly stationary, relative to the same quadruple" means.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Palm_PointProcess

/-!
# Eq. (1.3.4): the Neveu exchange formula (§1.3.2, p.21)
-/
Formal statement
namespace PalmQueueing.Palm

open MeasureTheory

variable {Ω : Type*} [MeasurableSpace Ω]

/-- **The Neveu exchange formula**, Eq. (1.3.4) (§1.3.2, p.21). Let `(N, θ_t, P)` and
`(N', θ_t, P)` be two stationary point processes with finite intensities `λ` and `λ'`, *jointly*
stationary in the sense that their stationarity is relative to the same quadruple
`(Ω, F, P, θ_t)`. Then

`λ E⁰_N[f] = λ' E⁰_{N'} [ ∫_{(0, T'₁]} (f ∘ θ_t) N(dt) ]`

for all non-negative measurable `f : (Ω, F) → (ℝ, B)`, where `T'_n` is the `n`-th point of `N'`.

The formula exchanges the roles of the two processes: it expresses an `N`-Palm expectation as an
`N'`-Palm expectation of a sum over the points of `N` in one `N'`-cycle. Its two hypotheses `hflow`
and `hprob` are what "jointly stationary" means here. -/
theorem neveu_exchange_formula (S S' : PalmSetting Ω)
    (hflow : S'.θ = S.θ) (hprob : S'.P = S.P)
    (f : Ω → ENNReal) (hf : Measurable f) :
    ENNReal.ofReal S.lam * ∫⁻ ω, f ω ∂S.P0
      = ENNReal.ofReal S'.lam *
          ∫⁻ ω, ∫⁻ t in Set.Ioc (0 : ℝ) (S'.N.T 1 ω), f (S.θ t ω) ∂(S.N.count ω) ∂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. 21, §1.3.2, Eq. (1.3.4)
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