Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix A, p. 966 — an ergodic chain has a unique, positive stationary vector and PnP^nPn is Cesàro-summable to Π\PiΠ

Proved
JewellMRP.InfiniteStep.stationary_cesaro_limit

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

cesaro-meanmarkov-chainp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1stationary-distribution

Let PPP be an irreducible row-stochastic matrix on a nonempty finite state set SSS. Then there is a probability vector π\piπ with πP=π\pi P = \piπP=π such that

  1. every entry of π\piπ is strictly positive,
  2. π\piπ is the only stationary probability vector of PPP, and
  3. the Cesàro means of the powers of PPP converge entrywise to the matrix Π\PiΠ whose rows all equal π\piπ:
lim⁡n→∞1n∑k=0n−1Pk=Π.\lim_{n\to\infty} \frac1n \sum_{k=0}^{n-1} P^k = \Pi .n→∞lim​n1​k=0∑n−1​Pk=Π.

This is the Markov-chain fact on which Appendix A rests: it identifies the limiting per-step reward Πρ\Pi\rhoΠρ and makes the matrix Π\PiΠ used in the fundamental matrix well defined.

Formalization Note The paper says "Pn−1P^{n-1}Pn−1 converges or is Cesàro-summable"; ordinary convergence fails for periodic chains, so the statement is the Cesàro limit, which holds for every irreducible chain.

Preamble
import Mathlib
import Definitions.Def_JewellMRP_InfiniteStep_Model

open Matrix Filter Topology
Formal statement
namespace JewellMRP.InfiniteStep

theorem stationary_cesaro_limit {S : Type*} [Fintype S] [DecidableEq S] [Nonempty S]
    (P : Matrix S S ℝ) (hP : IsErgodic P) :
    ∃ π : S → ℝ, IsStationary P π ∧ (∀ i, 0 < π i) ∧
      (∀ π' : S → ℝ, IsStationary P π' → π' = π) ∧
      Tendsto (fun n : ℕ => (n : ℝ)⁻¹ • ∑ k ∈ Finset.range n, P ^ k) atTop
        (𝓝 (limitMatrix π)) := by sorry

end JewellMRP.InfiniteStep
Source
Jewell, Markov-Renewal Programming. II: Infinite Return Models, Example, Oper. Res. 11 (1963), p. 966, Appendix A (after Eq. (A 1)), citing Kemeny and Snell [13]
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me