Eq. (1.2.16) — the Palm probability is invariant under the point shift
ProvedPalmQueueing.Palm.palm_invariantpalm-calculuspoint-processqueueingstationary-process
is -invariant, where is the point shift — the discrete shift that moves the origin to the next point of the process, not the continuous flow (it is that is invariant under that).
The book's proof applies the defining formula (1.2.1) with to get for every , using , and then lets .
Its consequence is the one the rest of the book uses: if is compatible with the flow — equivalently, if it is time-stationary under — then the sequence is a stationary sequence under .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.