Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1.3.8) — the exchange formula as a generalization of Wald's identity

Proved
PalmQueueing.Palm.wald_generalization

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

palm-calculuspoint-processqueueingstationary-processwald-identity

Remark 1.3.3. Formula (1.3.6) can also be viewed as a generalization of Wald's identity, since it reads

EN′0[∑k=1N((0,T1′])f∘θTk]  =  EN′0[N((0,T1′])]  EN0[f].(1.3.8)E^0_{N'}\Big[ \sum_{k=1}^{N((0, T'_1])} f \circ \theta_{T_k} \Big] \;=\; E^0_{N'}\big[ N((0, T'_1]) \big]\; E^0_N[f] . \tag{1.3.8}EN′0​[k=1∑N((0,T1′​])​f∘θTk​​]=EN′0​[N((0,T1′​])]EN0​[f].(1.3.8)

The expectation of a sum with a random number of summands factors into the expectation of the number of summands times the (Palm) expectation of one summand — without any independence hypothesis between the two, which is the sense in which it generalizes Wald.

The sum ∑k=1N((0,T1′])\sum_{k=1}^{N((0,T'_1])}∑k=1N((0,T1′​])​ is the sum over those k∈Zk \in \mathbb{Z}k∈Z with Tk∈(0,T1′]T_k \in (0, T'_1]Tk​∈(0,T1′​]: under the convention T0≤0<T1T_0 \le 0 < T_1T0​≤0<T1​, Tk>0T_k > 0Tk​>0 holds exactly for k≥1k \ge 1k≥1.

The ergodic-limit argument (1.3.7) that the book gives on the same page for the underlying formula is explicitly labelled heuristic — "Such a proof is only heuristic in particular because one has to justify the second equality" — and is deliberately not stated as a result.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Palm_PointProcess

/-!
# Eq. (1.3.8): the exchange formula as a generalization of Wald's identity (Remark 1.3.3, p.23)
-/
Formal statement
namespace PalmQueueing.Palm

open MeasureTheory

variable {Ω : Type*} [MeasurableSpace Ω]

/-- **Eq. (1.3.8)** (Remark 1.3.3, p.23): the exchange formula, read as a **generalization of
Wald's identity**,

`E⁰_{N'} [ Σ_{k=1}^{N((0,T'₁])} f ∘ θ_{T_k} ] = E⁰_{N'} [ N((0,T'₁]) ] · E⁰_N[f]`.

The random number of summands and the summands are not assumed independent — that is the sense in
which it generalizes Wald. The sum `Σ_{k=1}^{N((0,T'₁])}` is written here as the sum over all
`k ∈ ℤ` of the terms with `T_k ∈ (0, T'₁]`, which is the same sum because `T_k > 0` exactly for
`k ≥ 1` under the convention `T₀ ≤ 0 < T₁`.

The ergodic-limit argument `(1.3.7)` that the book gives on the same page for the underlying
formula is explicitly labelled heuristic ("Such a proof is only heuristic") and is not stated
here. -/
theorem wald_generalization (S S' : PalmSetting Ω)
    (hflow : S'.θ = S.θ) (hprob : S'.P = S.P)
    (f : Ω → ENNReal) (hf : Measurable f) :
    ∫⁻ ω, ∑' k : ℤ,
        Set.indicator (Set.Ioc (0 : ℝ) (S'.N.T 1 ω))
          (fun _ => f (S.θ (S.N.T k ω) ω)) (S.N.T k ω) ∂S'.P0
      = (∫⁻ ω, S.N.count ω (Set.Ioc (0 : ℝ) (S'.N.T 1 ω)) ∂S'.P0) * ∫⁻ ω, f ω ∂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. 23, Remark 1.3.3, Eq. (1.3.8)
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