Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3 — representative satisfies the dual LP

Proved
HordijkKallenbergLP.Correspondence.representative_feasible

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 βi>0\beta_i>0βi​>0 and ∑iβi=1\sum_i\beta_i=1∑i​βi​=1. For every stationary randomized policy π\piπ, form the representative (x(π),y(π))(x(\pi),y(\pi))(x(π),y(π)) by equation (6), including the class-wise choice of γ\gammaγ. Then

(x(π),y(π)) satisfies the dual constraints (3)–(5).(x(\pi),y(\pi))\text{ satisfies the dual constraints (3)–(5).}(x(π),y(π)) satisfies the dual constraints (3)–(5).

Thus each stationary policy determines a feasible dual point, even when its Markov chain has several recurrent classes. The dual coordinates are indexed only by admissible state-action pairs.

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

open MarkovDecisionProcesses

/-- Hordijk and Kallenberg (1979), §3.3, pp. 359–360, equation (6) and
properties 1–4: the representative is dual feasible. -/
theorem representative_feasible {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) :
    DualFeasible M β (representativeX M β π) (representativeY M β π) := 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, pp. 359–360, §3.3, equation (6) and properties 1–4
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