Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Jensen step — J*_β(i) ≥ J*_β(0) E[β^τ] ≥ J*_β(0) β^K

Proved
ArapostathisAC.RossRecurrence.jensen_step

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

discounted-costjensen-inequalityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1return-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), under Ross's recurrence condition (5.7): Eif[τ]<KE^f_i[\tau]<KEif​[τ]<K for all f∈ΠSDf\in\Pi_{SD}f∈ΠSD​ and i∈Si\in Si∈S, with τ=min⁡{t≥1:Xt=0}\tau=\min\{t\ge1:X_t=0\}τ=min{t≥1:Xt​=0} and K>0K>0K>0. Let β∈(0,1)\beta\in(0,1)β∈(0,1) and let fβ∈ΠSDf_\beta\in\Pi_{SD}fβ​∈ΠSD​ be β\betaβ-discount optimal. Then for every state iii,

Jβ∗(i) ≥ Jβ∗(0) Eifβ[βτ] ≥ Jβ∗(0) βK.J^*_\beta(i)\ \ge\ J^*_\beta(0)\,E^{f_\beta}_i[\beta^\tau]\ \ge\ J^*_\beta(0)\,\beta^K.Jβ∗​(i) ≥ Jβ∗​(0)Eifβ​​[βτ] ≥ Jβ∗​(0)βK.

This is the unnumbered display after (5.9) in the proof of Theorem 5.3. It gives the lower half of the uniform bound on hβh_\betahβ​.

Formalization Note. βτ=0\beta^\tau=0βτ=0 on {τ=∞}\{\tau=\infty\}{τ=∞}, and βK\beta^KβK is a real power since KKK is real. The two inequalities are stated as a conjunction in [0,∞][0,\infty][0,∞]. The bounded-cost hypothesis is the standing assumption of §5.1.

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

/-- The Jensen step (proof of Theorem 5.3, p. 302, display after (5.9)): under bounded costs and
(5.7), for a `β`-discount optimal `f ∈ Π_SD`,
`J*_β(i) ≥ J*_β(0) E^f_i[β^τ] ≥ J*_β(0) β^K`. -/
theorem jensen_step {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)
    (β : ℝ) (hβ : β ∈ Set.Ioo (0 : ℝ) 1) (f : StationaryPolicy M) (hf : IsDiscOptimal M f β)
    (i : ℕ) :
    discValue M β 0 * expDiscAtReturn M f β i ≤ discValue M β i ∧
      discValue M β 0 * ENNReal.ofReal (β ^ K) ≤ discValue M β 0 * expDiscAtReturn M f β i := 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, display after (5.9)
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