Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1.2.17) — Mecke's formula

Proved
PalmQueueing.Palm.mecke_formula

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

campbell-formulapalm-calculuspoint-processqueueingstationary-process

Mecke's formula, the central identity of Palm calculus. For all non-negative measurable functions vvv from (Ω×R,F⊗B)(\Omega \times \mathbb{R}, \mathcal{F} \otimes \mathcal{B})(Ω×R,F⊗B) into (R,B)(\mathbb{R}, \mathcal{B})(R,B),

λ∬Ω×Rv(ω,t) PN0(dω) dt  =  ∬Ω×Rv(θtω,t) P(dω) N(ω,dt).(1.2.17)\lambda \iint_{\Omega \times \mathbb{R}} v(\omega, t)\, P^0_N(d\omega)\, dt \;=\; \iint_{\Omega \times \mathbb{R}} v(\theta_t \omega, t)\, P(d\omega)\, N(\omega, dt) . \tag{1.2.17}λ∬Ω×R​v(ω,t)PN0​(dω)dt=∬Ω×R​v(θt​ω,t)P(dω)N(ω,dt).(1.2.17)

The book obtains it by reading the defining formula (1.2.1) for the product function v(ω,t)=1A(ω)1C(t)v(\omega, t) = \mathbf{1}_A(\omega)\mathbf{1}_C(t)v(ω,t)=1A​(ω)1C​(t), and then extends it to all non-negative measurable vvv by standard monotone class arguments. It records that (1.2.17) "is known as the generalized Campbell formula. In this book, it will be called Mecke's formula, after its author"; the original Campbell formula is the specialization v(ω,t)=f(t,Z0(ω))v(\omega, t) = f(t, Z_0(\omega))v(ω,t)=f(t,Z0​(ω)) for a sequence of marks {Zn}\{Z_n\}{Zn​}.

The statement carries no integrability hypothesis, both sides being valued in [0,+∞][0, +\infty][0,+∞]. It has content precisely because PN0P^0_NPN0​ was defined by counting in (1.2.1) rather than as a measure for which this formula holds.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Palm_PointProcess

/-!
# Eq. (1.2.17): Mecke's formula (p.17)
-/
Formal statement
namespace PalmQueueing.Palm

open MeasureTheory

variable {Ω : Type*} [MeasurableSpace Ω]

/-- **Mecke's formula**, Eq. (1.2.17) (p.17), the central identity of Palm calculus, which the
book also calls the generalized Campbell formula:

`λ ∫∫_{Ω × ℝ} v(ω, t) P⁰_N(dω) dt = ∫∫_{Ω × ℝ} v(θ_t ω, t) P(dω) N(ω, dt)`

for every non-negative measurable `v : (Ω × ℝ, F ⊗ B) → (ℝ, B)`. The page derives it for
`v(ω, t) = 1_A(ω) 1_C(t)` straight from the defining formula (1.2.1) of `P⁰_N` and then extends it
to all such `v` by a monotone class argument; both sides are stated here in `ℝ≥0∞`, which is where
"non-negative measurable, no integrability hypothesis" lives.

It has content precisely because `P⁰_N` is defined by counting (1.2.1) and not as "a measure
satisfying this formula". -/
theorem mecke_formula (S : PalmSetting Ω) (v : Ω → ℝ → ENNReal)
    (hv : Measurable (Function.uncurry v)) :
    ENNReal.ofReal S.lam * ∫⁻ ω, ∫⁻ t, v ω t ∂(volume : Measure ℝ) ∂S.P0
      = ∫⁻ ω, ∫⁻ t, v (S.θ t ω) t ∂(S.N.count ω) ∂S.P := by sorry

end PalmQueueing.Palm
Source
Baccelli & Bremaud, Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences, 2nd ed., Springer 2003, p. 17, Eq. (1.2.17)
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