Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4 — equalities on supported actions

Proved
HordijkKallenbergLP.Correspondence.proposition_4

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

average-rewardlinear-programmingmarkov-decision-processmultichainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix positive normalized state weights β\betaβ, an optimal dual solution (x,y)(x,y)(x,y) and an optimal primal solution (ϕ,u)(\phi,u)(ϕ,u). Let A‾(i)\overline A(i)A(i) be the actions with πia(x,y)>0\pi_{ia}(x,y)>0πia​(x,y)>0. For every a∈A‾(i)a\in\overline A(i)a∈A(i),

ϕi=∑jpiajϕj;i∈Ex  ⟹  ϕi+ui=ria+∑jpiajuj.\phi_i=\sum_jp_{iaj}\phi_j;\qquad i\in E_x\implies\phi_i+u_i=r_{ia}+\sum_jp_{iaj}u_j.ϕi​=j∑​piaj​ϕj​;i∈Ex​⟹ϕi​+ui​=ria​+j∑​piaj​uj​.

These equalities identify which superharmonic constraints become tight on the actions used by an optimal dual point. Formalization Note The primal first component is any optimal ϕ\phiϕ; its identification with the optimal gain follows from Theorem 6 and positive β\betaβ, rather than being added as an assumption.

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

open MarkovDecisionProcesses

/-- Hordijk and Kallenberg (1979), Proposition 4, pp. 360–361.
The complementary-slackness identities hold for every action given positive
probability by the policy of any optimal dual solution. -/
theorem proposition_4 {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 : DualOptimal M β x y)
    (φ u : S → ℝ) (hφu : PrimalOptimal M β φ u) :
    ∀ i a, 0 < dualPolicyWeight M x y i a →
      (∑ j, M.trans i a j * φ j = φ i) ∧
      (i ∈ Ex M x → φ i + u i = M.reward i a + ∑ j, M.trans i a j * u j) := 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. 360–361, Proposition 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