Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix A, p. 966 — Z=[I−(P−Π)]−1Z = [I-(P-\Pi)]^{-1}Z=[I−(P−Π)]−1 exists and satisfies PZ=ZPPZ = ZPPZ=ZP, πZ=π\pi Z = \piπZ=π, I−Z=Π−PZI - Z = \Pi - PZI−Z=Π−PZ

Proved
JewellMRP.InfiniteStep.fundamental_matrix_relations

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

fundamental-matrixmarkov-chainp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be an irreducible row-stochastic matrix on a nonempty finite state set, π\piπ its stationary probability vector, and Π\PiΠ the matrix all of whose rows equal π\piπ. Then the matrix I−(P−Π)I - (P - \Pi)I−(P−Π) is invertible, and its inverse, the fundamental matrix Z=(I−P+Π)−1Z = (I - P + \Pi)^{-1}Z=(I−P+Π)−1, satisfies

PZ=ZP,πZ=π,I−Z=Π−PZ.PZ = ZP, \qquad \pi Z = \pi, \qquad I - Z = \Pi - PZ .PZ=ZP,πZ=π,I−Z=Π−PZ.

These are the algebraic relations of the Kemeny–Snell fundamental matrix that Appendix A uses to identify the limiting bias vector.

Preamble
import Mathlib
import Definitions.Def_JewellMRP_InfiniteStep_Model

open Matrix Filter Topology
Formal statement
namespace JewellMRP.InfiniteStep

theorem fundamental_matrix_relations {S : Type*} [Fintype S] [DecidableEq S] [Nonempty S]
    (P : Matrix S S ℝ) (hP : IsErgodic P) (π : S → ℝ) (hπ : IsStationary P π) :
    IsUnit (1 - (P - limitMatrix π)) ∧
      P * fundamentalMatrix P π = fundamentalMatrix P π * P ∧
      π ᵥ* fundamentalMatrix P π = π ∧
      1 - fundamentalMatrix P π = limitMatrix π - P * fundamentalMatrix P π := by sorry

end JewellMRP.InfiniteStep
Source
Jewell, Markov-Renewal Programming. II: Infinite Return Models, Example, Oper. Res. 11 (1963), p. 966, Appendix A (before Eq. (A 4)); p. 952, Eq. (A 7)
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