Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 10, p. 362 — a solution of (7) has y_i = (β^T D)_i on the transient states

Proved
HordijkKallenbergLP.ExtremePoint.system7_transient

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

linear-algebramarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a stochastic matrix on a finite set, DDD its deviation matrix, and TTT its set of transient states. If row vectors x,yx,yx,y solve system (7), xT(I−P)=0x^T(I-P)=0xT(I−P)=0 and xT+yT(I−P)=βTx^T+y^T(I-P)=\beta^TxT+yT(I−P)=βT, then

yi=(βTD)i,i∈T.y_i=(\beta^TD)_i,\qquad i\in T.yi​=(βTD)i​,i∈T.

In the proof of Theorem 10 this shows that two feasible points with the zero pattern of a pure representative agree on the transient states.

Formalization Note. A state is transient when it is not recurrent in the sense of the published IsRecurrent: some state accessible from it does not lead back to it.

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

/-- **Proof of Theorem 10, p. 362 (unnumbered): solutions of (7) on the transient states.** Let
`P` be a Markov matrix and `T` its set of transient states. If `x, y` solve system (7),
`x^T(I − P) = 0`, `x^T + y^T(I − P) = β^T`, then `y_i = (β^T D)_i` for every `i ∈ T`.

Hordijk and Kallenberg, Linear Programming and Markov Decision Chains, Management Sci.
25(4):352–362 (1979), DOI 10.1287/mnsc.25.4.352, p. 362, proof of Theorem 10
("Then y_i = (β^T D)_i, i ∈ T.").

**Formalization Note.** A state `i` is transient when it is not recurrent in the sense of the
published `IsRecurrent` (some state accessible from `i` does not lead back to `i`). Row vectors
act by `vecMul`; `D` is the published `deviationMatrix`. -/
theorem system7_transient {n : Type*} [Fintype n] [DecidableEq n] (P : Matrix n n ℝ)
    (hP : IsMarkovMatrix P) (β x y : n → ℝ) (h3 : x ᵥ* (1 - P) = 0)
    (h4 : x + y ᵥ* (1 - P) = β) (i : n) (hi : ¬ IsRecurrent P i) :
    y i = (β ᵥ* deviationMatrix P) i := 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, p. 362, proof of Theorem 10
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