Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3 — stationary gain from the Cesàro limit

Proved
HordijkKallenbergLP.Correspondence.stationary_gain

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

average-rewardlinear-programmingmarkov-decision-processmultichainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let π\piπ be any stationary randomized policy of a finite Markov decision process, with transition matrix P(π)P(\pi)P(π), one-step reward vector r(π)r(\pi)r(π) and Cesàro limit matrix P∗(π)P^*(\pi)P∗(π). Its liminf average reward is

ϕi(π∞)=[P∗(π)r(π)]ifor every state i.\phi_i(\pi^\infty)=\bigl[P^*(\pi)r(\pi)\bigr]_i\quad\text{for every state }i.ϕi​(π∞)=[P∗(π)r(π)]i​for every state i.

This converts the policy's long-run performance into the matrix expression used by its representative. Formalization Note The other identities stated in the same paragraph of the paper belong to Blackwell's existing limit and deviation matrix results.

Preamble
import Mathlib
import Definitions.Def_HordijkKallenbergLP_Correspondence_Representative
Formal statement
namespace HordijkKallenbergLP.Correspondence

open MarkovDecisionProcesses Matrix

/-- Hordijk and Kallenberg (1979), §3.3, p. 359, the final clause after
the limit and deviation matrix identities. -/
theorem stationary_gain {S A : Type*} [Fintype S] [Fintype A]
    [DecidableEq S] [DecidableEq A] [Nonempty S]
    (M : StationaryMDP S A) (π : RandomizedPolicy M) (i : S) :
    gainInf π.toHR i = (Pstar M π).mulVec (policyReward M π) i := by sorry

end HordijkKallenbergLP.Correspondence
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. 359, §3.3
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