Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1.2.16) — the Palm probability is invariant under the point shift

Proved
PalmQueueing.Palm.palm_invariant

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

palm-calculuspoint-processqueueingstationary-process

PN0P^0_NPN0​ is θ\thetaθ-invariant, where θ\thetaθ is the point shift ω↦θT1(ω)ω\omega \mapsto \theta_{T_1(\omega)}\omegaω↦θT1​(ω)​ω — the discrete shift that moves the origin to the next point of the process, not the continuous flow {θt}\{\theta_t\}{θt​} (it is PPP that is invariant under that).

PN0(A)  =  PN0(θ−1(A))for all A∈F.(1.2.16)P^0_N(A) \;=\; P^0_N(\theta^{-1}(A)) \qquad \text{for all } A \in \mathcal{F} . \tag{1.2.16}PN0​(A)=PN0​(θ−1(A))for all A∈F.(1.2.16)

The book's proof applies the defining formula (1.2.1) with C=(0,t]C = (0,t]C=(0,t] to get ∣PN0(A)−PN0(θ−1(A))∣≤1/(λt)|P^0_N(A) - P^0_N(\theta^{-1}(A))| \le 1/(\lambda t)∣PN0​(A)−PN0​(θ−1(A))∣≤1/(λt) for every ttt, using 1θ−1(A)∘θTn=1A∘θTn+1\mathbf{1}_{\theta^{-1}(A)} \circ \theta_{T_n} = \mathbf{1}_A \circ \theta_{T_{n+1}}1θ−1(A)​∘θTn​​=1A​∘θTn+1​​, and then lets t→∞t \to \inftyt→∞.

Its consequence is the one the rest of the book uses: if {Z(t)}\{Z(t)\}{Z(t)} is compatible with the flow {θt}\{\theta_t\}{θt​} — equivalently, if it is time-stationary under PPP — then the sequence {Z(Tn)}\{Z(T_n)\}{Z(Tn​)} is a stationary sequence under PN0P^0_NPN0​.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Palm_PointProcess

/-!
# Eq. (1.2.16): the Palm probability is invariant under the point shift (p.17)
-/
Formal statement
namespace PalmQueueing.Palm

open MeasureTheory

variable {Ω : Type*} [MeasurableSpace Ω]

/-- **Eq. (1.2.16)** (p.17). `P⁰_N` is `θ`-invariant, where `θ` is the **point shift**
`ω ↦ θ_{T₁(ω)} ω` — the discrete shift that moves the origin to the next point, not the
continuous flow `{θ_t}` (`P` is what is invariant under that).

This is what makes `{Z(T_n)}` a stationary sequence under `P⁰_N` whenever `{Z(t)}` is compatible
with the flow, which is the form in which the rest of the book uses it. -/
theorem palm_invariant (S : PalmSetting Ω)
    (hshift : Measurable fun ω => S.θ (S.N.T 1 ω) ω) :
    Measure.map (fun ω => S.θ (S.N.T 1 ω) ω) S.P0 = 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. 17, Eq. (1.2.16)
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