Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1 (i), (iii) — the discounted cost optimality equation and a discount optimal stationary policy (countable states)

Proved
ArapostathisAC.SennottACOI.theorem_2_1

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

discounted-costdynamic-programmingoptimality-equationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the countable-state controlled Markov process of §5: states 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,a)c(i,a)c(i,a) and transition probabilities P(j∣i,a)P(j\mid i,a)P(j∣i,a), both continuous in a∈U(i)a\in U(i)a∈U(i). Let β∈(0,1)\beta\in(0,1)β∈(0,1) and let Jβ∗(i)=inf⁡π∈ΠJβ(i,π)∈[0,∞]J^*_\beta(i)=\inf_{\pi\in\Pi}J_\beta(i,\pi)\in[0,\infty]Jβ∗​(i)=infπ∈Π​Jβ​(i,π)∈[0,∞] be the optimal discounted cost over all admissible policies. Then:

  1. the discounted cost optimality equation (DCOE) holds: for every i∈Si\in Si∈S,
Jβ∗(i)=inf⁡a∈U(i){c(i,a)+β∑j∈SP(j∣i,a) Jβ∗(j)};J^*_\beta(i)=\inf_{a\in U(i)}\Big\{c(i,a)+\beta\sum_{j\in S}P(j\mid i,a)\,J^*_\beta(j)\Big\};Jβ∗​(i)=a∈U(i)inf​{c(i,a)+βj∈S∑​P(j∣i,a)Jβ∗​(j)};
  1. there is a stationary deterministic policy f∈ΠSDf\in\Pi_{SD}f∈ΠSD​ that is β\betaβ-discount optimal, i.e. Jβ(i,f)=Jβ∗(i)J_\beta(i,f)=J^*_\beta(i)Jβ​(i,f)=Jβ∗​(i) for every i∈Si\in Si∈S.

This is the countable-state instance of the paper's Theorem 2.1 (i) and (iii); the paper states it for Borel state spaces under Assumptions 2.1–2.3, which hold in the §5 model (discrete state space, compact U(i)U(i)U(i), continuity of c(i,⋅)c(i,\cdot)c(i,⋅) and P(j∣i,⋅)P(j\mid i,\cdot)P(j∣i,⋅)). It provides the βn\beta_nβn​-discount optimal policies fβnf_{\beta_n}fβn​​ from which the proof of Theorem 5.9 starts.

Formalization Note Both sides of the DCOE are computed in [0,∞][0,\infty][0,∞], so the equation is meaningful even where Jβ∗J^*_\betaJβ∗​ is infinite; the integral ∫SJβ∗(y)P(dy∣x,a)\int_S J^*_\beta(y)P(dy\mid x,a)∫S​Jβ∗​(y)P(dy∣x,a) of the paper is the series ∑jP(j∣i,a)Jβ∗(j)\sum_j P(j\mid i,a)J^*_\beta(j)∑j​P(j∣i,a)Jβ∗​(j) on the countable state space. Part (ii) of the paper's theorem (characterization of discount optimal policies) is not part of this item.

Preamble
import Mathlib
import Definitions.Def_ArapostathisAC_SennottACOI_CMP

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal
Formal statement
namespace ArapostathisAC.SennottACOI

variable {A : Type*} [MetricSpace A] [MeasurableSpace A] [BorelSpace A]

/-- Theorem 2.1 (i), (iii) (p. 289) for the countable-state model of §5: for every discount
factor `β ∈ (0, 1)` the discounted value function satisfies the discounted cost optimality
equation (2.7), `J*_β(i) = inf_{a ∈ U(i)} {c(i, a) + β Σ_j P(j | i, a) J*_β(j)}`, computed in
`[0, ∞]`, and a `β`-discount optimal stationary deterministic policy exists. -/
theorem theorem_2_1 (M : ArapostathisAC.VanishingDiscount.CMP A) (β : ℝ) (hβ : β ∈ Set.Ioo (0 : ℝ) 1) :
    (∀ i, ArapostathisAC.VanishingDiscount.discValue M β i =
      ⨅ a ∈ M.U i, (ENNReal.ofReal (M.c i a) +
        ENNReal.ofReal β * ∑' j, M.P (i, a) {j} * ArapostathisAC.VanishingDiscount.discValue M β j)) ∧
    ∃ f : StationaryPolicy M, ArapostathisAC.VanishingDiscount.IsDiscOptimal M β f := by sorry

end ArapostathisAC.SennottACOI
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 (i), (iii), display (2.7); specialised to the countable model of §5, p. 299
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