Theorem 1.3.1 — the Swiss army formula of Palm calculus
DisprovedPalmQueueing.Palm.swiss_army_formulaTheorem 1.3.1 (the Swiss army formula). In the setting of §1.3.7 — arrivals with counting measure and intensity , departures with counting measure and no ordering assumed, sojourn times (1.3.26) forming a sequence of marks of , the number in system with (1.3.27), a non-decreasing corlol integrator and a non-negative process — suppose that and are -compatible, where is a measurable flow on and is -invariant. Then for all ,
The book's name for it says what it is. Depending on which blade is selected, this one identity gives the main formulas of Palm calculus: with and it reads , which is Little's law; other choices give the inversion formula, the Miyazawa conservation principle and the rate conservation law.
Two details of the statement are load-bearing. The integrator on both sides is — not , not ; is introduced two paragraphs above the theorem and shares its symbol with nothing else. And is the left limit, not : the proof runs through the Stieltjes-Lebesgue integration-by-parts formula
which needs the predictable version of the integrand.
The compatibility of with the flow is assumed here although p.29 does not list it among the compatibility hypotheses; the proof uses it at the step "" (p.30), and without it the identity is false, its left-hand side being independent of while its right-hand side would not be. The book states the conclusion "for all "; it is stated here for , the factor requiring .
import Mathlib import Definitions.Def_PalmQueueing_Palm_PointProcess import Definitions.Def_PalmQueueing_Palm_SwissArmySetting /-! # Theorem 1.3.1: the Swiss army formula of Palm calculus (§1.3.7, p.29) -/
namespace PalmQueueing.Palm
open MeasureTheory
variable {Ω : Type*} [MeasurableSpace Ω]
/-- **The Swiss army formula**, Theorem 1.3.1, Eq. (1.3.28) (§1.3.7, p.29). In the setting of
pp.28-29 — arrivals `{T_n}` with counting measure `A` and intensity `λ_A`, departures `{τ_n}` with
counting measure `D` and no ordering assumed, sojourn times `W_n = τ_n - T_n ≥ 0` forming a
sequence of marks of `A`, the number in system `{X(t)}` with `X(b) - X(a) = A((a,b]) - D((a,b])`, a
non-decreasing corlol integrator `{B(t)}` and a non-negative process `{Z(t)}` — for all `t`,
`λ_A E⁰_A [ ∫_{(0, W₀]} Z(s) dB(s) ] = (1/t) E [ ∫_{(0, t]} X(s-) Z(s) dB(s) ]`.
The book's name for it says what it is: depending on which blade is selected, this one identity
gives Little's law (`Z ≡ 1`, `B(t) = t`, whereupon it reads `λ_A E⁰_A[W₀] = E[X(0)]`), the
inversion formula, the Miyazawa conservation principle and the rate conservation law.
Two details of the statement are load-bearing. The integrator on **both** sides is `dB`, not `dA`
and not `dD`; and `X(s-)` is the left limit, not `X(s)` — the proof runs through the
Stieltjes-Lebesgue integration by parts formula (1.3.29), which needs the predictable version. -/
theorem swiss_army_formula (S : SwissArmySetting Ω) (t : ℝ) (ht : 0 < t) :
ENNReal.ofReal S.toPalmSetting.lam *
∫⁻ ω, ∫⁻ s in Set.Ioc (0 : ℝ) (S.W 0 ω), ENNReal.ofReal (S.Z s ω)
∂((S.B.B ω).measure) ∂S.toPalmSetting.P0
= (∫⁻ ω, ∫⁻ s in Set.Ioc (0 : ℝ) t, ENNReal.ofReal (S.Xl s ω * S.Z s ω)
∂((S.B.B ω).measure) ∂S.toPalmSetting.P) / ENNReal.ofReal t := by sorry
end PalmQueueing.Palm
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.