Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A2 (p. 632) — lim sup_{α↑1} (1 − α)V_α(i) ≤ g_θ(i) for every policy θ

Proved
Sennott1989.AvgCost.lemma_A2

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

average-costdiscounted-costmarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a Markov decision chain on the states 0,1,2,…0,1,2,\dots0,1,2,… with nonnegative costs. For every policy θ\thetaθ (history-dependent and randomized allowed) and every state iii,

lim sup⁡α↑1 (1−α)Vα(i) ≤ gθ(i),(A5)\limsup_{\alpha\uparrow1}\,(1-\alpha)V_\alpha(i)\ \le\ g_\theta(i),\tag{A5}α↑1limsup​(1−α)Vα​(i) ≤ gθ​(i),(A5)

where Vα(i)V_\alpha(i)Vα​(i) is the optimal α\alphaα-discounted cost and gθ(i)g_\theta(i)gθ​(i) the lim sup average cost of θ\thetaθ from iii.

This Tauberian-type comparison gives the lower bound g≤gθ(i)g\le g_\theta(i)g≤gθ​(i) in the proof of the Theorem.

Formalization Note No assumption is made; both sides are in [0,∞][0,\infty][0,∞] and may be infinite. The lim sup is taken as α→1\alpha\to1α→1 with α<1\alpha<1α<1.

Preamble
import Mathlib
import Definitions.Def_Sennott1989_AvgCost_Assumptions

open scoped ENNReal NNReal
open Filter Topology
Formal statement
namespace Sennott1989.AvgCost

open SennottDP.Discounted

/-- Sennott (1989), Appendix, Lemma A2, p. 632. If `θ` is any policy, then
`lim sup_{α↑1} (1 − α) V_α(i) ≤ g_θ(i)` for every state `i ≥ 0` (A5).

**Formalization Note** No assumption is made: `V_α(i)` and `g_θ(i)` lie in `[0, ∞]` and may be
infinite. `θ` ranges over all (history-dependent, randomized) policies. The lim sup is taken as
`α → 1` with `α < 1` (the filter `𝓝[<] 1` on `ℝ≥0`), in the complete lattice `[0, ∞]`. -/
theorem lemma_A2 {Act : Type} (M : MDC ℕ Act) (θ : Policy M) (i : ℕ) :
    limsup (fun α : ℝ≥0 => ((1 - α : ℝ≥0) : ℝ≥0∞) * valueFn M α i) (𝓝[<] 1) ≤
      SennottDP.SEN.avgCost M θ i := by sorry

end Sennott1989.AvgCost
Source
Sennott, Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs, Oper. Res. 37(4):626–633 (1989), DOI 10.1287/opre.37.4.626, Appendix, Lemma A2, (A5), p. 632
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