Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 10, p. 362 — an invariant row vector on an ergodic set that vanishes at one state vanishes on the set

Proved
HordijkKallenbergLP.ExtremePoint.invariant_vanishes_on_ergodic

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

linear-algebramarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let P=(pli)P=(p_{li})P=(pli​) be a stochastic matrix on a finite set and CCC the ergodic set of a recurrent state. If a real vector zzz satisfies

zi=∑l∈Czl pli,i∈C,andzi0=0 for some i0∈C,z_i=\sum_{l\in C}z_l\,p_{li},\quad i\in C,\qquad\text{and}\qquad z_{i_0}=0\ \text{for some } i_0\in C,zi​=l∈C∑​zl​pli​,i∈C,andzi0​​=0 for some i0​∈C,

then zi=0z_i=0zi​=0 for every i∈Ci\in Ci∈C.

This is the fact from the theory of Markov chains (Chung, Markov Chains with Stationary Transition Probabilities, p. 33) that the paper applies to z=yˉ1−yˉ2z=\bar y^1-\bar y^2z=yˉ​1−yˉ​2 to conclude yˉ1=yˉ2\bar y^1=\bar y^2yˉ​1=yˉ​2 in the proof of Theorem 10: on a closed communicating class the invariant row vectors form a one-dimensional space spanned by a strictly positive vector.

Formalization Note. No sign condition is imposed on zzz. The ergodic set is the set of states accessible from the recurrent state.

Preamble
import Mathlib
import Definitions.Def_MarkovDecisionProcesses_AverageReward
import Definitions.Def_BlackwellDiscreteDP_NearOne_LimitMatrix
import Definitions.Def_HordijkKallenbergLP_ExtremePoint_Model
open Matrix MarkovDecisionProcesses BlackwellDiscreteDP.NearOne
Formal statement
namespace HordijkKallenbergLP.ExtremePoint

/-- **Proof of Theorem 10, p. 362 (unnumbered; Chung [2, p. 33]): an invariant row vector on an
ergodic set that vanishes at one state vanishes on the set.** Let `P` be a Markov matrix and
`C = E_k` the ergodic set of a recurrent state `l`. If `z` satisfies
`z_i = ∑_{l' ∈ C} z_{l'} p_{l' i}` for every `i ∈ C`, and `z_{i₀} = 0` for some `i₀ ∈ C`, then
`z_i = 0` for every `i ∈ C`.

Hordijk and Kallenberg, Linear Programming and Markov Decision Chains, Management Sci.
25(4):352–362 (1979), DOI 10.1287/mnsc.25.4.352, p. 362, proof of Theorem 10
("ȳ¹_i − ȳ²_i = Σ_{l∈E_k} (ȳ¹_l − ȳ²_l) p_li, i ∈ E_k, ȳ¹_{i(k)} − ȳ²_{i(k)} = 0. Then it follows
from the theory of Markov chains (e.g. Chung [2, p. 33]) that ȳ¹ = ȳ².").

**Formalization Note.** The paper applies the fact to `z = ȳ¹ − ȳ²`; this is the Markov-chain
fact it cites, stated for an arbitrary real `z` (no sign condition). The ergodic set is
`ergodicSet P l`, the states accessible from the recurrent state `l`. -/
theorem invariant_vanishes_on_ergodic {n : Type*} [Fintype n] [DecidableEq n]
    (P : Matrix n n ℝ) (hP : IsMarkovMatrix P) (l : n) (hl : IsRecurrent P l) (z : n → ℝ)
    (hz : ∀ i ∈ ergodicSet P l, z i = ∑ k ∈ ergodicSet P l, z k * P k i)
    (i₀ : n) (hi₀ : i₀ ∈ ergodicSet P l) (hz₀ : z i₀ = 0) :
    ∀ i ∈ ergodicSet P l, z i = 0 := by sorry

end HordijkKallenbergLP.ExtremePoint
Source
Hordijk and Kallenberg, Linear Programming and Markov Decision Chains, Management Sci. 25(4):352–362 (1979), DOI 10.1287/mnsc.25.4.352, p. 362, proof of Theorem 10 (citing Chung [2, p. 33])
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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