Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.5.1 — conditioning at a point: Palm probability as a local limit

Proved
PalmQueueing.Palm.palm_local_limit

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

palm-calculuspoint-processqueueingstationary-process

Theorem 1.5.1. The local interpretation of Palm probability:

lim⁡t→0  sup⁡A∈F  ∣PN0(A)−P(θT1∈A∣T1≤t)∣  =  0.(1.5.3)\lim_{t \to 0}\; \sup_{A \in \mathcal{F}}\; \big| P^0_N(A) - P(\theta_{T_1} \in A \mid T_1 \le t) \big| \;=\; 0 . \tag{1.5.3}t→0lim​A∈Fsup​​PN0​(A)−P(θT1​​∈A∣T1​≤t)​=0.(1.5.3)

The Palm probability is the limit of conditioning on there being a point of the process in a shrinking window to the right of the origin — this is the statement that makes "what an arriving customer sees" precise, and it is why PN0P^0_NPN0​ deserves to be read as the law seen from a typical point.

The supremum over A∈FA \in \mathcal{F}A∈F sits inside the limit: the convergence is uniform over all measurable events. That uniformity is what the proof's Dobrushin estimate (lim⁡t→0λt/P(T1≤t)=1\lim_{t\to 0} \lambda t / P(T_1 \le t) = 1limt→0​λt/P(T1​≤t)=1, §1.5.1) buys, and a pointwise limit would be a strictly weaker statement. The ε\varepsilonε-δ\deltaδ form of the statement says exactly this: one δ\deltaδ serves every AAA at once.

The proof rewrites P(θT1∈A∣T1≤t)P(\theta_{T_1} \in A \mid T_1 \le t)P(θT1​​∈A∣T1​≤t) using (1.2.28), obtains P(T1≤t,θT1∈A)=λ∫0tPN0(u<−T−1,A) duP(T_1 \le t, \theta_{T_1} \in A) = \lambda \int_0^t P^0_N(u < -T_{-1}, A)\,duP(T1​≤t,θT1​​∈A)=λ∫0t​PN0​(u<−T−1​,A)du, and concludes from PN0(u≥−T−1)→0P^0_N(u \ge -T_{-1}) \to 0PN0​(u≥−T−1​)→0 as u→0u \to 0u→0.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Palm_PointProcess

/-!
# Theorem 1.5.1: conditioning at a point (§1.5.2, p.45)
-/
Formal statement
namespace PalmQueueing.Palm

open MeasureTheory

variable {Ω : Type*} [MeasurableSpace Ω]

/-- **Theorem 1.5.1** (§1.5.2, p.45), the local aspect of Palm probability:

`(1.5.3)  lim_{t → 0} sup_{A ∈ F} | P⁰_N(A) - P(θ_{T₁} ∈ A | T₁ ≤ t) | = 0`.

The Palm probability is the limit of conditioning on there being a point in a shrinking window to
the right of the origin — the statement that makes "what an arriving customer sees" precise. The
supremum over `A ∈ F` is inside the limit and is not decorative: the convergence is **uniform over
all measurable events**, which is what the proof's Dobrushin estimate (§1.5.1) buys and what a
pointwise limit would not give. The `ε`-`δ` form below says exactly that: one `δ` serves every `A`
at once. -/
theorem palm_local_limit (S : PalmSetting Ω)
    (hshift : Measurable fun ω => S.θ (S.N.T 1 ω) ω) :
    ∀ ε : ℝ, 0 < ε → ∃ δ : ℝ, 0 < δ ∧ ∀ t : ℝ, 0 < t → t < δ →
      ∀ A : Set Ω, MeasurableSet A →
        |(S.P0 A).toReal
            - (S.P ({ω | S.θ (S.N.T 1 ω) ω ∈ A} ∩ {ω | S.N.T 1 ω ≤ t})).toReal
                / (S.P {ω | S.N.T 1 ω ≤ t}).toReal| ≤ ε := by sorry

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