Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.3 with the explicit bound |h_β(i)| ≤ MK

Proved
ArapostathisAC.RossRecurrence.theorem_5_3_explicit

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

discounted-costp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1relative-value-functionreturn-time

Consider the countable-state controlled Markov process of §5 with bounded cost, c(i,a)≤Mc(i,a)\le Mc(i,a)≤M for every iii and a∈U(i)a\in U(i)a∈U(i). Let τ=min⁡{t≥1:Xt=0}\tau=\min\{t\ge1:X_t=0\}τ=min{t≥1:Xt​=0} and assume Ross's recurrence condition (5.7): there is K>0K>0K>0 with Eif[τ]<KE^f_i[\tau]<KEif​[τ]<K for all f∈ΠSDf\in\Pi_{SD}f∈ΠSD​ and i∈Si\in Si∈S. Then the differential discounted value function hβ(i)=Jβ∗(i)−Jβ∗(0)h_\beta(i)=J^*_\beta(i)-J^*_\beta(0)hβ​(i)=Jβ∗​(i)−Jβ∗​(0) satisfies

∣hβ(i)∣≤MKfor all β∈(0,1), i∈S.|h_\beta(i)|\le MK\qquad\text{for all }\beta\in(0,1),\ i\in S.∣hβ​(i)∣≤MKfor all β∈(0,1), i∈S.

This is the bound the proof of Theorem 5.3 produces ("The desired result follows from (5.9) and (5.10)"). The bound depends only on the cost bound MMM and the recurrence constant KKK.

Formalization Note. The paper's Theorem 5.3 asserts only that hβh_\betahβ​ is bounded uniformly; this item states the explicit constant obtained in its proof, which is a stronger statement. Under bounded cost Jβ∗J^*_\betaJβ∗​ is finite, so hβh_\betahβ​ is a genuine difference of real numbers.

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

/-- Theorem 5.3 with the bound its proof gives (p. 302, "The desired result follows from (5.9) and
(5.10)"): under bounded costs `c ≤ M₀` and (5.7), `|h_β(i)| ≤ M₀ K` for all `β ∈ (0, 1)` and all
states `i`. -/
theorem theorem_5_3_explicit {A : Type*} [MetricSpace A] [MeasurableSpace A] [BorelSpace A]
    (M : CMP A) (M₀ : ℝ) (hc : ∀ i, ∀ a ∈ M.U i, M.c i a ≤ M₀)
    (K : ℝ) (hK : 0 < K)
    (h57 : ∀ f : StationaryPolicy M, ∀ i, meanReturnTime M f i < ENNReal.ofReal K) :
    ∀ β ∈ Set.Ioo (0 : ℝ) 1, ∀ i, |hRel M β i| ≤ M₀ * K := 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. 302, proof of Theorem 5.3, conclusion from (5.9) and (5.10)
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