Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exercise 1.9(ii): exact upward passage probability P(sup⁡tXt>x)=e−θ∗x\mathbb P(\sup_t X_t>x)=e^{-\theta^* x}P(supt​Xt​>x)=e−θ∗x for the overloaded M/G/1 surplus

Proved
Kyprianou.Ch01.queueUpperPassageProbability

by coqelz · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

exercise-1-9first-passagekyprianou-ch01queueing

Consider the M/G/1 / Cramér–Lundberg process with unit drift,

Xt=t−St,St=∑i<NtYi,X_t = t - S_t,\qquad S_t=\sum_{i<N_t}Y_i,Xt​=t−St​,St​=i<Nt​∑​Yi​,

built from a compound Poisson driver with arrival rate λ>0\lambda>0λ>0 and i.i.d. service times (claims) Yi∼FY_i\sim FYi​∼F. Assume:

  1. FFF is concentrated on (0,∞)(0,\infty)(0,∞), i.e. F((−∞,0])=0F((-\infty,0])=0F((−∞,0])=0;
  2. FFF has finite mean μ=∫z F(dz)\mu=\int z\,F(dz)μ=∫zF(dz) and the queue is overloaded, λμ>1\lambda\mu>1λμ>1;
  3. θ∗>0\theta^*>0θ∗>0 is a root of the Laplace exponent
ψ(θ)=θ−λ∫(0,∞)(1−e−θz) F(dz),ψ(θ∗)=0.\psi(\theta)=\theta-\lambda\int_{(0,\infty)}\big(1-e^{-\theta z}\big)\,F(dz),\qquad \psi(\theta^*)=0.ψ(θ)=θ−λ∫(0,∞)​(1−e−θz)F(dz),ψ(θ∗)=0.

Then for every x>0x>0x>0,

P(∃ t>0: Xt>x)=e−θ∗x.\mathbb P\big(\exists\, t>0:\ X_t> x\big)=e^{-\theta^* x}.P(∃t>0: Xt​>x)=e−θ∗x.

Equivalently, the overall supremum sup⁡t>0Xt\sup_{t>0}X_tsupt>0​Xt​ is exponentially distributed with parameter θ∗\theta^*θ∗. This is the second assertion of Kyprianou's Exercise 1.9(ii); together with the exponential martingale eθ∗Xte^{\theta^* X_t}eθ∗Xt​ (the first assertion) it describes the upward fluctuations of the overloaded M/G/1 surplus, which has no positive jumps and drifts to −∞-\infty−∞.

Formalization Note. XXX is riskSurplus arrival claims 1 0 and ψ\psiψ is queueLaplaceExponent rate F. The probability is the real value of the (outer) measure of the strict upward passage event.

Preamble
import Mathlib
import Definitions.Def_Kyprianou_Ch01_RiskQueueCore
import Definitions.Def_Kyprianou_Ch01_McKeanBrownianStopping
import Definitions.Def_LeanLevy_Processes_CompoundPoisson
open MeasureTheory ProbabilityTheory Kyprianou.Ch01 Set Filter
open scoped NNReal ENNReal BigOperators
set_option autoImplicit false

Formal statement
theorem Kyprianou.Ch01.queueUpperPassageProbability
    {Ω : Type*} [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (arrival claims : ℕ → Ω → ℝ)
    (rate : ℝ≥0) (hrate : 0 < rate)
    (F : Measure ℝ) [IsProbabilityMeasure F]
    (hDriver : IsCompoundPoissonDriver arrival claims rate F P)
    (hPos : F (Set.Iic (0 : ℝ)) = 0)
    (hIntegrable : Integrable (fun z : ℝ => z) F)
    (mu : ℝ) (hMean : (∫ z, z ∂F) = mu)
    (hOverload : 1 < (rate : ℝ) * mu)
    (theta : ℝ) (hTheta : 0 < theta)
    (hRoot : queueLaplaceExponent rate F theta = 0) :
    ∀ x : ℝ, 0 < x →
      (P {ω | ∃ t : ℝ≥0, 0 < t ∧ x < riskSurplus arrival claims 1 0 t ω}).toReal =
        Real.exp (-theta * x) := by
  sorry
Source
Kyprianou (2006), Introductory Lectures on Fluctuations of Lévy Processes with Applications, Chapter 1, Exercise 1.9(ii), printed p. 31 (second assertion: the passage probability).

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