Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8(a) proof — objective of the representative

Proved
HordijkKallenbergLP.Correspondence.representative_objective

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 any positive normalized state weights β\betaβ and stationary randomized policy π\piπ, the dual objective at its representative equals the β\betaβ-weighted average reward of the policy:

∑i∑a∈A(i)riaxia(π)=∑iβiϕi(π∞).\sum_i\sum_{a\in A(i)}r_{ia}x_{ia}(\pi)=\sum_i\beta_i\phi_i(\pi^\infty).i∑​a∈A(i)∑​ria​xia​(π)=i∑​βi​ϕi​(π∞).

This is the objective identity used to compare an optimal policy with the primal optimum in Theorem 8(a). It makes no optimality assumption on π\piπ.

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

open MarkovDecisionProcesses

/-- Hordijk and Kallenberg (1979), proof of Theorem 8(a), p. 360:
the representative's dual objective is the β-weighted gain of its policy. -/
theorem representative_objective {S A : Type*} [Fintype S] [Fintype A]
    [DecidableEq S] [DecidableEq A] [Nonempty S]
    (M : StationaryMDP S A) (β : S → ℝ)
    (hβpos : ∀ i, 0 < β i) (hβsum : ∑ i, β i = 1)
    (π : RandomizedPolicy M) :
    dualObjective M (representativeX M β π) =
      ∑ i, β i * gainInf π.toHR 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. 360, proof of Theorem 8(a)
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