Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.4.2 — the S-order compares mean cycle lengths

Proved
PalmQueueing.Ordering.s_order_mean

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

palm-calculusprobabilityqueueingstatisticsstochastic-ordering

Lemma 4.4.2. F0≤S-iF~0F^0 \le_{S\text{-}i} \widetilde F^0F0≤S-i​F0 implies EP0[T]≤EP~0[T~]E_{P^0}[T] \le E_{\widetilde P^0}[\widetilde T]EP0​[T]≤EP0​[T].

The SSS-orders are built by dividing Palm integrals by the mean cycle length, so it is not obvious that they say anything about that mean itself. This lemma says they do in the ≤S-i\le_{S\text{-}i}≤S-i​ case: the normalisation does not hide the comparison it normalises by.

It is the step Property 4.4.6 needs — the diagram placing the SSS-orders among the integral orders of §4.2.1,

≤I-i⇒≤S-i⇒≤S-I-i+,≤I-i⇒≤i⇒≤I-i+.(4.4.10)\le_{I\text{-}i} \Rightarrow \le_{S\text{-}i} \Rightarrow \le_{S\text{-}I\text{-}i^+}, \qquad \le_{I\text{-}i} \Rightarrow \le_i \Rightarrow \le_{I\text{-}i^+} . \tag{4.4.10}≤I-i​⇒≤S-i​⇒≤S-I-i+​,≤I-i​⇒≤i​⇒≤I-i+​.(4.4.10)

The proof runs through the equivalent form FT≤iF~TF_T \le_i \widetilde F_TFT​≤i​FT​, then (4.4.6),

1EP0[T]1x∫0x(1−FT0(u))du≥1EP~0[T~]1x∫0x(1−F~T0(u))du,\frac{1}{E_{P^0}[T]}\frac{1}{x}\int_0^x (1 - F^0_T(u))du \ge \frac{1}{E_{\widetilde P^0}[\widetilde T]}\frac{1}{x}\int_0^x (1 - \widetilde F^0_T(u))du ,EP0​[T]1​x1​∫0x​(1−FT0​(u))du≥EP0​[T]1​x1​∫0x​(1−FT0​(u))du,

and lets xxx tend to zero, using FT0(0)=F~T0(0)=0F^0_T(0) = \widetilde F^0_T(0) = 0FT0​(0)=FT0​(0)=0 — which is the support restriction the SSS-order domain carries, and without which the limit is a different number.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Ordering_IntegralOrders
import Definitions.Def_PalmQueueing_Ordering_TimeStationary

/-!
# Lemma 4.4.2: the `S`-order compares mean cycle lengths (§4.4, p.302)
-/
Formal statement
namespace PalmQueueing.Ordering

open MeasureTheory

/-- **Lemma 4.4.2** (p.302). `F⁰ ≤_{S-i} F̃⁰` implies `E_{P⁰}[T] ≤ E_{P̃⁰}[T̃]`.

The `S`-orders are built by dividing Palm integrals by the mean cycle length, so it is not obvious
that they say anything about that mean itself. This lemma says they do, in the `≤_{S-i}` case: the
normalisation does not hide the comparison it normalises by.

It is the step Property 4.4.6 needs, the diagram that places the `S`-orders among the integral
orders of §4.2.1:

`≤_{I-i} ⟹ ≤_{S-i} ⟹ ≤_{S-I-i⁺}`, and `≤_{I-i} ⟹ ≤_i ⟹ ≤_{I-i⁺}`.

The proof runs through the equivalent form `F_T ≤_i F̃_T`, then (4.4.6),

`(1/E_{P⁰}[T])(1/x)∫_0^x (1 − F⁰_T(u))du ≥ (1/E_{P̃⁰}[T̃])(1/x)∫_0^x (1 − F̃⁰_T(u))du`,

and lets `x` tend to zero, using `F⁰_T(0) = F̃⁰_T(0) = 0` — which is the support restriction that
`SOrderDomain` carries, and without which the limit is a different number. -/
theorem s_order_mean {n : ℕ} (F0 F0' : Measure (Fin (n + 1) → ℝ))
    (hdom : SOrderDomain F0) (hdom' : SOrderDomain F0')
    (hle : SILe F0 F0') :
    (∫ z, z 0 ∂F0) ≤ ∫ z, z 0 ∂F0' := by sorry

end PalmQueueing.Ordering
Source
Baccelli & Bremaud, Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences, 2nd ed., Springer 2003, p. 302, Lemma 4.4.2
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