Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — least superharmonic gain

Proved
HordijkKallenbergLP.Correspondence.theorem_6

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

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

For a finite Markov decision process, let ϕi\phi_iϕi​ be the supremum, over all history-dependent randomized policies, of the liminf average reward starting at iii. Then some uuu makes (ϕ,u)(\phi,u)(ϕ,u) superharmonic, and every superharmonic pair (ϕ~,u~)(\widetilde\phi,\widetilde u)(ϕ​,u) satisfies

ϕi≤ϕ~ifor every state i.\phi_i\le\widetilde\phi_i\quad\text{for every state }i.ϕi​≤ϕ​i​for every state i.

This identifies the optimal gain vector as the componentwise least possible first component of a feasible primal pair.

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

open MarkovDecisionProcesses

/-- Hordijk and Kallenberg (1979), Theorem 6, p. 356.
The optimal average reward is the componentwise least first component of a
superharmonic pair. -/
theorem theorem_6 {S A : Type*} [Fintype S] [Fintype A] [Nonempty S]
    (M : StationaryMDP S A) :
    (∃ u : S → ℝ, HordijkKallenbergLP.SingleLP.Superharmonic M (optGainInf M) u) ∧
    (∀ φ u : S → ℝ, HordijkKallenbergLP.SingleLP.Superharmonic M φ u → ∀ i, optGainInf M i ≤ φ 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. 356, Theorem 6
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