Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.7 — a drift condition sufficient for positive recurrence

Disproved
ProcessingNetworks.Stability.drift_condition_implies_positive_recurrent

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

lyapunov-methodsmarkov-chainqueueing

For a state xxx of the ambient Markov chain XXX of a Markov representation (Assumption 3.1), write ∣x∣:=∣z∣:=∑izi|x| := |z| := \sum_{i} z_i∣x∣:=∣z∣:=∑i​zi​ where z=f(x)z = f(x)z=f(x) (Eq. 3.4), and let Ex\mathbb{E}_xEx​ denote expectation under X(0)=xX(0) = xX(0)=x.

Lemma 3.7. If there is a δ>0\delta > 0δ>0 such that

lim⁡∣x∣→∞1∣x∣ Ex[Z(∣x∣δ)]=0,(3.5)\lim_{|x| \to \infty} \frac{1}{|x|}\, \mathbb{E}_x\big[Z(|x|\delta)\big] = 0, \tag{3.5}∣x∣→∞lim​∣x∣1​Ex​[Z(∣x∣δ)]=0,(3.5)

then the ambient Markov chain XXX is positive recurrent.

This is the book's bridge from a fluid-scale drift condition to the probabilistic notion of stability, foreshadowing the whole fluid-model machinery of Chapter 6: the hypothesis says that, started from a state of total size ∣x∣|x|∣x∣, the expected buffer content at the fluid-scaled time ∣x∣δ|x|\delta∣x∣δ is o(∣x∣)o(|x|)o(∣x∣) — vanishing relative to the initial size.

Formalization note. ∣x∣|x|∣x∣ is M.size x =∑izi= \sum_i z_i=∑i​zi​ (Eq. 3.4); the limit Tendsto ... (Filter.comap M.size Filter.atTop) ... formalizes "as ∣x∣→∞|x| \to \infty∣x∣→∞", taken componentwise in Z+I\mathbb{Z}_+^IZ+I​; and Ex\mathbb{E}_xEx​ is the expectation under the conditional measure ℙ[|{ω | M.X 0 ω = x}], following the book's own convention Px(A)=P(A∣X(0)=x)P_x(A) = P(A \mid X(0) = x)Px​(A)=P(A∣X(0)=x) (Definition D.2), with the hypothesis hsupp that every state carries positive initial mass so that each Ex\mathbb{E}_xEx​ is defined. The expectation is taken as a Lebesgue integral in [0,∞][0, \infty][0,∞], so an infinite Ex[Zi(∣x∣δ)]\mathbb{E}_x[Z_i(|x|\delta)]Ex​[Zi​(∣x∣δ)] violates (3.5) as it should, rather than being read as 000. The conclusion is positive recurrence of the continuous-time chain (Definition D.15, PositiveRecurrent M.jump M.rate).

Preamble
import Mathlib
import Definitions.Def_ProcessingNetworks_Stability_MarkovRepresentation
import Definitions.Def_ProcessingNetworks_Stability_StabilityConditions
Formal statement
namespace ProcessingNetworks.Stability

open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal

/-- Lemma 3.7 (a drift-type sufficient condition for positive recurrence), Dai & Harrison, p. 48:
if there is a `δ > 0` such that, as `|x| → ∞` over states `x` of the ambient chain,
`(1/|x|) E_x[Z(|x|δ)] → 0` componentwise, then the ambient chain is positive recurrent. Here
`M.size x` is the book's `|x| = ∑ᵢ zᵢ` for `f x = (n, z)` (Eq. 3.4), `E_x[·]` is the expectation
under the chain started at `x`, i.e. under `ℙ[|{X(0) = x}]` (every state is given positive
initial mass by `hsupp`, so that these conditional laws are all defined), and the expectation is
the Lebesgue integral in `ℝ≥0∞`, so an infinite expectation counts as such rather than as `0`. -/
theorem drift_condition_implies_positive_recurrent
    {Xstate : Type*} [Countable Xstate] {Ω : Type*} [MeasureSpace Ω] {I J : ℕ}
    {N : ℝ → Ω → Fin J → ℕ} {Z : ℝ → Ω → Fin I → ℕ}
    (M : MarkovRepresentation Xstate I J N Z)
    (hsupp : ∀ x : Xstate, ℙ {ω | M.X 0 ω = x} ≠ 0)
    (δ : ℝ) (hδ : 0 < δ)
    (hdrift :
      Tendsto (fun x : Xstate => fun i : Fin I =>
          (∫⁻ ω, ((Z (M.size x * δ) ω i : ℕ) : ℝ≥0∞) ∂(ℙ[|{ω | M.X 0 ω = x}])) /
            ENNReal.ofReal (M.size x))
        (Filter.comap M.size Filter.atTop) (nhds (0 : Fin I → ℝ≥0∞))) :
    PositiveRecurrent M.jump M.rate := by sorry

end ProcessingNetworks.Stability
Source
Dai & Harrison, Processing Networks: Fluid Models and Stability, pre-publication draft 2020-4-2, p. 48, Lemma 3.7
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 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