Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4 — the system is transient iff Σⱼ pᵢⱼ yⱼ = yᵢ (i ≠ 0) has a bounded nonconstant solution

Proved
FosterQueues.GIM1.theorem4_transient_iff

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

harmonic-functionmarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1transience

Let [pij][p_{ij}][pij​] (i,j=0,1,2,…i, j = 0, 1, 2, \dotsi,j=0,1,2,…) be the transition matrix of an irreducible, aperiodic Markov chain. The system is transient if and only if there is a real sequence (yj)j≥0(y_j)_{j \ge 0}(yj​)j≥0​ which is bounded (∣yj∣≤C|y_j| \le C∣yj​∣≤C for some constant CCC and all jjj), nonconstant (yi≠yjy_i \ne y_jyi​=yj​ for some i,ji, ji,j), and solves

∑j=0∞pij yj=yi,i≠0.(7)\sum_{j=0}^{\infty} p_{ij}\, y_j = y_i, \qquad i \ne 0. \tag{7}j=0∑∞​pij​yj​=yi​,i=0.(7)

The equations are imposed for every state except 000; nothing is required at i=0i = 0i=0.

Transience is here the complement of recurrence, without distinguishing recurrent-null from recurrent-nonnull systems. Foster uses both directions for the GI/M/1 chain: when ρ<1\rho < 1ρ<1 no bounded nonconstant solution of (7) exists, so the chain is recurrent; when ρ>1\rho > 1ρ>1 one exists, so the chain is transient.

Formalization Note "Transient" means every state jjj has return probability fjj<1f_{jj} < 1fjj​<1. Irreducibility and aperiodicity are the paper's standing assumptions (§1, p. 355). The equations (7) are stated with HasSum; for bounded yyy the series always converge.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_Foundations_MarkovChain
import Definitions.Def_FosterQueues_GIM1_Model

open scoped ENNReal
open QueueingFundamentals.Foundations
Formal statement
namespace FosterQueues.GIM1

theorem theorem4_transient_iff (P : TransitionMatrix) (hirr : P.Irreducible)
    (hap : P.Aperiodic) :
    FosterQueues.MG1.IsTransient P ↔
      ∃ y : ℕ → ℝ, (∃ C : ℝ, ∀ i, |y i| ≤ C) ∧ (∃ i j, y i ≠ y j) ∧
        ∀ i, i ≠ 0 → HasSum (fun j => P.p i j * y j) (y i) := by sorry

end FosterQueues.GIM1
Source
Foster (Ann. Math. Statist. 24, 1953), Theorem 4, pp. 356–357; standing assumptions §1, p. 355
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