Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1 (iii) — a β-discount optimal stationary deterministic policy exists

Proved
ArapostathisAC.RossRecurrence.theorem_2_1_iii

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

controlled-markov-processdiscounted-costoptimal-policyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the countable-state controlled Markov process of §5: state space S={0,1,2,… }S=\{0,1,2,\dots\}S={0,1,2,…}, nonempty compact admissible action sets U(i)U(i)U(i), a nonnegative cost c(i,⋅)c(i,\cdot)c(i,⋅) and transition probabilities P(j∣i,⋅)P(j\mid i,\cdot)P(j∣i,⋅) that are continuous on U(i)U(i)U(i). For β∈(0,1)\beta\in(0,1)β∈(0,1), let Jβ(i,π)J_\beta(i,\pi)Jβ​(i,π) be the expected β\betaβ-discounted cost of the policy π\piπ from state iii, and let Jβ∗(i)=inf⁡π∈ΠJβ(i,π)J^*_\beta(i)=\inf_{\pi\in\Pi}J_\beta(i,\pi)Jβ∗​(i)=infπ∈Π​Jβ​(i,π), where Π\PiΠ is the class of all admissible policies.

Theorem 2.1 (iii). For every β∈(0,1)\beta\in(0,1)β∈(0,1) there is a stationary deterministic policy f∈ΠSDf\in\Pi_{SD}f∈ΠSD​ that is β\betaβ-discount optimal:

Jβ(i,f)=Jβ∗(i)for every i∈S.J_\beta(i,f)=J^*_\beta(i)\qquad\text{for every } i\in S.Jβ​(i,f)=Jβ∗​(i)for every i∈S.

The proof of Theorem 5.3 starts from such a policy fβf_\betafβ​.

Formalization Note. The paper states Theorem 2.1 for Borel models under Assumptions 2.1–2.3: nonnegative cost, weakly continuous transitions, an upper semicontinuous UUU and a lower semicontinuous cost. With a countable discrete state space these assumptions follow from the §5 standing assumptions built into the model: compact U(i)U(i)U(i) and continuity of c(i,⋅)c(i,\cdot)c(i,⋅) and P(j∣i,⋅)P(j\mid i,\cdot)P(j∣i,⋅). The survey cites this result and does not prove it (Remark 2.2). No bound on ccc is assumed. Jβ∗J^*_\betaJβ∗​ is computed in [0,∞][0,\infty][0,∞], and the infimum is over all history-dependent randomized admissible policies.

Preamble
import Mathlib
import Definitions.Def_ArapostathisAC_RossRecurrence_CMP
open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace ArapostathisAC.RossRecurrence

/-- Theorem 2.1 (iii) (p. 289) in the countable-state model of §5: for every discount factor
`β ∈ (0, 1)` a `β`-discount optimal stationary deterministic policy exists. -/
theorem theorem_2_1_iii {A : Type*} [MetricSpace A] [MeasurableSpace A] [BorelSpace A]
    (M : CMP A) (β : ℝ) (hβ : β ∈ Set.Ioo (0 : ℝ) 1) :
    ∃ f : StationaryPolicy M, IsDiscOptimal M f β := by sorry

end ArapostathisAC.RossRecurrence
Source
Arapostathis, Borkar, Fernández-Gaucherand, Ghosh, Marcus, Discrete-time controlled Markov processes with average cost criterion: a survey, SIAM J. Control Optim. 31(2) (1993), p. 289, Theorem 2.1 (iii)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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