Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1.4 — the limit reordering

Proved
PalmQueueing.Ordering.limit_reordering

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

probabilityqueueingstatisticsstochastic-ordering

Lemma 4.1.4. In the setting of Lemma 4.1.3, let γn(m)\gamma_n(m)γn​(m) be the customer served mmm-th under ϕ\phiϕ when the queue is fed by A[0,n]A_{[0,n]}A[0,n]​ (m≤nm \le nm≤n; the identity beyond nnn), and assume the traffic intensity ρ=E[σ0]/E[T1−T0]\rho = E[\sigma_0]/E[T_1 - T_0]ρ=E[σ0​]/E[T1​−T0​] satisfies ρ<1\rho < 1ρ<1. Then almost surely, for every kkk, γn(k)\gamma_n(k)γn​(k) does not depend on nnn after a finite rank; let γ=lim⁡nγn\gamma = \lim_n\gamma_nγ=limn​γn​ and define A′A'A′ by

A′(C×K)=lim⁡n→∞An(C×K),(4.1.19)A'(C \times K) = \lim_{n\to\infty} A^n(C \times K), \tag{4.1.19}A′(C×K)=n→∞lim​An(C×K),(4.1.19)

that is, A′=∑k≥0δTk,σγ(k)A' = \sum_{k\ge0}\delta_{T_k,\sigma_{\gamma(k)}}A′=∑k≥0​δTk​,σγ(k)​​. The point process A′A'A′ is equivalent in law to AAA, and almost surely, for all n≥0n \ge 0n≥0,

Bγ(n)(A,ϕ)=Bn(A′,ψ),Dγ(n)(A,ϕ)=Dn(A′,ψ),(4.1.20)B_{\gamma(n)}(A,\phi) = B_n(A',\psi), \qquad D_{\gamma(n)}(A,\phi) = D_n(A',\psi) , \tag{4.1.20}Bγ(n)​(A,ϕ)=Bn​(A′,ψ),Dγ(n)​(A,ϕ)=Dn​(A′,ψ),(4.1.20)

where BnB_nBn​ and DnD_nDn​ are the times at which customer nnn begins and leaves his service.

The stability of γn\gamma_nγn​ is the book's own justification for (4.1.19) ("γn\gamma_nγn​ only permutes indices within a busy period") and is stated as the first conclusion. (4.1.20) is what the FIFO optimality proof consumes: the beginning and departure times of the two systems coincide up to the relabelling γ\gammaγ, so the waiting time vectors are reorderings of each other, and Lemma 4.1.2 gives V(A′,ψ)≺V(A,ϕ)V(A',\psi) \prec V(A,\phi)V(A′,ψ)≺V(A,ϕ).

Formalization Note. ρ<1\rho < 1ρ<1 is stated as E[σ0]<E[T1−T0]E[\sigma_0] < E[T_1 - T_0]E[σ0​]<E[T1​−T0​] with both integrable. The page calls γ(k)\gamma(k)γ(k) a rank; (4.1.20) needs γ\gammaγ to map a rank to the customer of that rank, and that is the reading used.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Ordering_Disciplines
Formal statement
/-!
# Lemma 4.1.4: the limit reordering (§4.1.3, p.270)
-/

namespace PalmQueueing.Ordering

open MeasureTheory

/-- **Lemma 4.1.4** (p.270). The point process `A'` is equivalent in law to `A`, and such that for
all `n ≥ 0`,

`(4.1.20)  B_{γ(n)}(A, φ) = B_n(A', ψ),   D_{γ(n)}(A, φ) = D_n(A', ψ)`.

`A'` is defined by `A'(C × K) = lim_n A^n(C × K)` (4.1.19), with `γ_n` the permutations of the
proof of Lemma 4.1.3 (`rankPerm`: `γ_n(m)` is the customer served `m`-th under `φ` when the queue
is fed by `A_{[0,n]}`). "If `ρ < 1`, this a.s. limit is well defined since the permutations `γ_n`
are then such that `γ_n(k)` does not depend on `n` after a finite rank"; that claim is the first
conclusion, and `γ = lim_n γ_n` is `limitPerm`, so that `A' = Σ_k δ_{T_k, σ_{γ(k)}}`.

`ρ = E[σ_0] / E[τ_0] < 1`, with `τ_0 = T_1 − T_0`, is stated as `E[σ_0] < E[τ_0]` with both
integrable. -/
theorem limit_reordering {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (A : GIGIInput Ω P) (φ : Discipline)
    (hσint : Integrable (A.sigma 0) P) (hτint : Integrable (fun ω => A.T 1 ω - A.T 0 ω) P)
    (hρ : ∫ ω, A.sigma 0 ω ∂P < ∫ ω, (A.T 1 ω - A.T 0 ω) ∂P) :
    (∀ᵐ ω ∂P, ∀ k : ℕ, ∃ N : ℕ, ∀ n ≥ N,
      rankPerm φ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω) n k =
        rankPerm φ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω) N k) ∧
    SameInputLaw P A.T A.sigma
      (fun ω => limitPerm φ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω)) ∧
    (∀ᵐ ω ∂P, ∀ n : ℕ,
      beginTime φ Set.univ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω)
          (limitPerm φ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω) n) =
        beginTime fifo Set.univ (fun k => A.T k ω)
          (fun k => A.sigma
            (limitPerm φ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω) k) ω)
          (fun k => A.U k ω) n ∧
      departTime φ Set.univ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω)
          (limitPerm φ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω) n) =
        departTime fifo Set.univ (fun k => A.T k ω)
          (fun k => A.sigma
            (limitPerm φ (fun k => A.T k ω) (fun k => A.sigma k ω) (fun k => A.U k ω) k) ω)
          (fun k => A.U k ω) n) := by sorry

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