Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7 — a pure policy read off an extreme optimal solution of the dual LP is average optimal

Proved
HordijkKallenbergLP.SingleLP.theorem_7

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 βj>0\beta_j>0βj​>0, j∈Ej\in Ej∈E, with ∑jβj=1\sum_j\beta_j=1∑j​βj​=1, and let (x,y)(x,y)(x,y) be an optimal solution of the dual program

max⁡∑i∑ariaxia  s.t.  ∑i∑a(δij−piaj)xia=0,  ∑axja+∑i∑a(δij−piaj)yia=βj,  x,y≥0,\max\sum_i\sum_a r_{ia}x_{ia}\ \text{ s.t. }\ \sum_i\sum_a(\delta_{ij}-p_{iaj})x_{ia}=0,\ \ \sum_ax_{ja}+\sum_i\sum_a(\delta_{ij}-p_{iaj})y_{ia}=\beta_j,\ \ x,y\ge0,maxi∑​a∑​ria​xia​  s.t.  i∑​a∑​(δij​−piaj​)xia​=0,  a∑​xja​+i∑​a∑​(δij​−piaj​)yia​=βj​,  x,y≥0,

obtained by the simplex method, i.e. an optimal solution that is an extreme point of the feasible set. Let fff be any decision rule with f(i)=ai∈A(i)f(i)=a_i\in A(i)f(i)=ai​∈A(i) such that

xiai>0  (i∈Ex={i∣∑axia>0}),yiai>0  (i∉Ex).x_{ia_i}>0\ \ (i\in E_x=\{i\mid \textstyle\sum_a x_{ia}>0\}),\qquad y_{ia_i}>0\ \ (i\notin E_x).xiai​​>0  (i∈Ex​={i∣∑a​xia​>0}),yiai​​>0  (i∈/Ex​).

Then f∞f^\inftyf∞ is average optimal: φi(f∞)=sup⁡Rφi(R)\varphi_i(f^\infty)=\sup_R\varphi_i(R)φi​(f∞)=supR​φi​(R) for every i∈Ei\in Ei∈E.

One linear program thus yields an average optimal pure stationary policy in every finite Markov decision chain, with no unichain assumption.

Formalization Note "The simplex method is used" is encoded as extremality of (x,y)(x,y)(x,y) in the feasible set, the property of a basic feasible solution that the proof uses. The conclusion is asserted for every fff obeying the rule. Policies RRR range over all history-dependent randomized policies.

Preamble
import Mathlib
import Definitions.Def_MarkovDecisionProcesses_AverageReward
import Definitions.Def_BlackwellDiscreteDP_NearOne_LimitMatrix
import Definitions.Def_HordijkKallenbergLP_SingleLP_Model
open MarkovDecisionProcesses BlackwellDiscreteDP.NearOne Matrix Filter Topology
Formal statement
namespace HordijkKallenbergLP.SingleLP

variable {S A : Type*} [Fintype S] [Fintype A] [DecidableEq S] [DecidableEq A]

/-- **Theorem 7.** If the simplex method is used to solve the dual problem (3)–(5) and an optimal
solution `(x, y)` is obtained, then the policy `f^∞`, where `f(i) = a_i` such that `x_{i a_i} > 0`
for `i ∈ E_x = {i | Σ_a x_{ia} > 0}` and `y_{i a_i} > 0` for `i ∉ E_x`, is average optimal.

Hordijk and Kallenberg, Linear Programming and Markov Decision Chains, Management Sci.
25(4):352–362 (1979), DOI 10.1287/mnsc.25.4.352, p. 357, Theorem 7.

**Formalization Note.** "The simplex method is used and an optimal solution is obtained" is
encoded as: `(x, y)` is an optimal solution of the dual program that is an extreme point of its
feasible set (a basic feasible solution, which is what the simplex method returns; the paper's
proof of Proposition 3 uses exactly this). Without extremality the statement is a different,
unproved claim. The conclusion holds for *every* `f` obeying the rule (Remark after Theorem 7:
"an arbitrary action"). Average optimality is Hordijk and Kallenberg's: `φ_i(f^∞) = φ_i` for all
`i`, against all history-dependent randomized policies. -/
theorem theorem_7 (M : StationaryMDP S A) [Nonempty S]
    (β : S → ℝ) (hβpos : ∀ j, 0 < β j) (hβsum : ∑ j, β j = 1)
    (z : (Pair M → ℝ) × (Pair M → ℝ)) (hext : z ∈ Set.extremePoints ℝ (dualFeasible M β))
    (hopt : IsDualOptimal M β z)
    (f : S → A) (hf : ∀ i, f i ∈ M.admissible i) (hsel : IsSelection M z.1 z.2 f hf) :
    IsAvgOptimal M (stationaryPolicy M f hf) := by sorry

end HordijkKallenbergLP.SingleLP
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. 357, Theorem 7
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