Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2 — normalization of a feasible dual solution

Proved
HordijkKallenbergLP.Correspondence.dual_policy_well_defined

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 with ∑iβi=1\sum_i\beta_i=1∑i​βi​=1, and let (x,y)(x,y)(x,y) satisfy the dual constraints (3)–(5). For every state jjj,

∑a∈A(j)xja+∑a∈A(j)yja≥βj>0.\sum_{a\in A(j)}x_{ja}+\sum_{a\in A(j)}y_{ja}\ge\beta_j>0.a∈A(j)∑​xja​+a∈A(j)∑​yja​≥βj​>0.

Consequently the normalized rule πja(x,y)\pi_{ja}(x,y)πja​(x,y), using xxx when its row sum is positive and yyy otherwise, is a stationary randomized policy supported on available actions. This supplies the denominator and policy facts used in both parts of Theorem 8. Formalization Note The Lean inequality states the comparison with βj\beta_jβj​; strict positivity follows from the separately stated assumption βj>0\beta_j>0βj​>0.

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

open MarkovDecisionProcesses

/-- Hordijk and Kallenberg (1979), §3.2, proof of Theorem 7, p. 357:
equations (4) and (5) make the normalization of §3.3 a policy.
Formalization Note: the existence clause certifies both cases of the printed
definition, including the positive y-denominator outside E_x. -/
theorem dual_policy_well_defined {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)
    (x y : HordijkKallenbergLP.SingleLP.Pair M → ℝ) (hxy : DualFeasible M β x y) :
    (∀ i, β i ≤ stateMass M x i + stateMass M y i) ∧
    ∃ π : RandomizedPolicy M, ∀ i a, π.weight i a = dualPolicyWeight M x y i a := 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. 357, §3.2, proof of 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