Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 9.1, p. 887 — under essential finiteness every policy's return is at most lim U^n0

Proved
NegativeDP.EssFinite.return_le_lim

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

dynamic-programmingnegative-dynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

In Strauch's negative dynamic programming problem (non-empty Borel SSS, AAA, law of motion qqq, Borel return r≤0r\le0r≤0 with qr>−∞qr>-\inftyqr>−∞), suppose that AAA is essentially finite by the Markov policy π∗=(f1,f2,… )\pi^*=(f_1,f_2,\dots)π∗=(f1​,f2​,…), and let UUU be the operator associated with π∗\pi^*π∗. Put vn=Un0v_n=U^n0vn​=Un0. Then:

  1. vn(s)≥vn+1(s)v_n(s)\ge v_{n+1}(s)vn​(s)≥vn+1​(s) for every nnn and every state sss, so v∞=lim⁡nvn=inf⁡nvnv^\infty=\lim_n v_n=\inf_n v_nv∞=limn​vn​=infn​vn​ exists;
  2. every policy π\piπ satisfies, at every state sss,
I(π)(s)≤v∞(s)=inf⁡n Un0(s).I(\pi)(s)\le v^\infty(s)=\inf_{n}\,U^n0(s).I(π)(s)≤v∞(s)=ninf​Un0(s).

In the paper this limit is called v∗v^*v∗ inside the proof of Theorem 9.1; it is a different object from v∗=sup⁡πI(π)v^*=\sup_\pi I(\pi)v∗=supπ​I(π) until the theorem identifies the two. This inequality is one half of Theorem 9.1 (a).

Formalization Note Monotonicity is stated as Antitone in nnn for each state, and the limit of the non-increasing sequence is written as its infimum in EReal. The policy π\piπ ranges over every randomized history-dependent plan.

Preamble
import Mathlib
import Definitions.Def_DiscountedDP_Stationary_Operators
import Definitions.Def_NegativeDP_EssFinite_Model

open MeasureTheory ProbabilityTheory Filter Topology
open DiscountedDP.Stationary (Hist Plan MarkovPlan MarkovPlan.toPlan stationary IsGenerated IsGeneratedPlan)
Formal statement
namespace NegativeDP.EssFinite

variable {S A : Type*} [MeasurableSpace S] [StandardBorelSpace S] [Nonempty S]
  [MeasurableSpace A] [StandardBorelSpace A] [Nonempty A]

/-- Proof of Theorem 9.1 (N), Strauch (1966), p. 887, first paragraph. If `A` is essentially
finite by `π*` and `U` is its operator, then `v_n = NegativeDP.OptEq.U^n 0` is non-increasing in `n`, and
every policy satisfies `I(π) ≦ lim_n v_n = inf_n v_n`. -/
theorem return_le_lim (P : NegativeDP.Stationary.Problem S A) (πstar : MarkovPlan S A)
    (h : EssentiallyFinite P πstar) :
    (∀ s, Antitone (fun n => (NegativeDP.OptEq.U P πstar)^[n] 0 s)) ∧
      ∀ (σ : Plan (S := S) (A := A)) (s : S), NegativeDP.Stationary.I P σ s ≤ ⨅ n, (NegativeDP.OptEq.U P πstar)^[n] 0 s := by sorry

end NegativeDP.EssFinite
Source
Strauch, Negative Dynamic Programming, Ann. Math. Statist. 37 (1966), p. 887, proof of Theorem 9.1 (first paragraph)
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