Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3, pp. 359–360 — the representative (x(π), y(π)) of a stationary policy is a feasible solution of the dual LP

Proved
HordijkKallenbergLP.ExtremePoint.representative_feasible

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

linear-programmingmarkov-chainmarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let βj>0\beta_j>0βj​>0 with ∑jβj=1\sum_j\beta_j=1∑j​βj​=1, and let π\piπ be a stationary rule: πia≥0\pi_{ia}\ge 0πia​≥0 for a∈A(i)a\in A(i)a∈A(i) and ∑a∈A(i)πia=1\sum_{a\in A(i)}\pi_{ia}=1∑a∈A(i)​πia​=1 for every state iii. Then the representative (x(π),y(π))(x(\pi),y(\pi))(x(π),y(π)) defined by (6) is a feasible solution of the dual linear program:

(x(π),y(π)) satisfies (3), (4) and (5).(x(\pi),y(\pi))\ \text{satisfies (3), (4) and (5)}.(x(π),y(π)) satisfies (3), (4) and (5).

Feasibility of the representative is the first half of the correspondence between stationary policies and dual solutions of §3.3, and it is part of the conclusion of Theorem 10.

Formalization Note. The vector γ\gammaγ in (6) uses the denominator ∑k∈Ejpki∗(π)\sum_{k\in E_j}p^*_{ki}(\pi)∑k∈Ej​​pki∗​(π); with the printed ∑kpki∗(π)\sum_k p^*_{ki}(\pi)∑k​pki∗​(π) the representative is in general not nonnegative.

Preamble
import Mathlib
import Definitions.Def_MarkovDecisionProcesses_AverageReward
import Definitions.Def_BlackwellDiscreteDP_NearOne_LimitMatrix
import Definitions.Def_HordijkKallenbergLP_ExtremePoint_Model
open Matrix MarkovDecisionProcesses BlackwellDiscreteDP.NearOne
Formal statement
namespace HordijkKallenbergLP.ExtremePoint

/-- **§3.3, pp. 359–360 (unnumbered): the representative is a feasible solution.** For every
stationary rule `π` (randomized, supported on the admissible actions) and every `β` with
`β_j > 0`, `∑_j β_j = 1`, the representative `(x(π), y(π))` of (6) satisfies the constraints
(3)–(5) of the dual linear program.

Hordijk and Kallenberg, Linear Programming and Markov Decision Chains, Management Sci.
25(4):352–362 (1979), DOI 10.1287/mnsc.25.4.352, pp. 359–360, §3.3
("First, we show that (x(π), y(π)) is a feasible solution.").

**Formalization Note.** `γ` in `repY` uses the denominator `∑_{k ∈ E_j} p*_ki` (see `gamma`):
with the printed `∑_k p*_ki` the claim fails when transient states feed an ergodic set. -/
theorem representative_feasible {S A : Type*} [Fintype S] [Fintype A] [DecidableEq S]
    [DecidableEq A] (M : StationaryMDP S A) (β : S → ℝ) (hβpos : ∀ j, 0 < β j)
    (hβsum : ∑ j, β j = 1) (π : S → A → ℝ) (hπ : IsStationaryRule M π) :
    (repX M β π, repY M β π) ∈ dualFeasible M β := by sorry

end HordijkKallenbergLP.ExtremePoint
Source
Hordijk and Kallenberg, Linear Programming and Markov Decision Chains, Management Sci. 25(4):352–362 (1979), DOI 10.1287/mnsc.25.4.352, pp. 359–360, §3.3, feasibility of (x(π), y(π))
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