Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sign and boundedness of J∗J^*J∗ under (P), (N), (D)

Proved
BertsekasShreve.BorelInfinite.Jstar_sign

by tianyipeng · Nov 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

borel-modeldynamic-programming

Let (SM) =(S,C,U,W,p,f,α,g)=(S,C,U,W,p,f,\alpha,g)=(S,C,U,W,p,f,α,g) be an infinite horizon stochastic optimal control model on nonempty Borel spaces (Definitions 8.1, 9.1), with costs Jπ(x)=∑k=0∞αk∫g dqk(π,px)J_\pi(x)=\sum_{k=0}^\infty\alpha^k\int g\,dq_k(\pi,p_x)Jπ​(x)=∑k=0∞​αk∫gdqk​(π,px​) (Eq. (1)) and optimal cost J∗(x)=inf⁡π∈Π′Jπ(x)J^*(x)=\inf_{\pi\in\Pi'}J_\pi(x)J∗(x)=infπ∈Π′​Jπ​(x) (Eq. (2)). Then

  1. under (P) (g≥0g\ge0g≥0 on Γ\GammaΓ): J∗(x)≥0J^*(x)\ge0J∗(x)≥0 for all xxx;
  2. under (N) (g≤0g\le0g≤0 on Γ\GammaΓ): J∗(x)≤0J^*(x)\le0J∗(x)≤0 for all xxx;
  3. under (D) (0<α<10<\alpha<10<α<1, −b≤g≤b-b\le g\le b−b≤g≤b on Γ\GammaΓ): there is c∈Rc\in\mathbb Rc∈R with −c≤J∗(x)≤c-c\le J^*(x)\le c−c≤J∗(x)≤c for all xxx.

These are the sign conditions that allow Proposition 9.7 to be applied with J=J∗J=J^*J=J∗ in the proof of Proposition 9.8 (p. 226).

Preamble
import Mathlib
import Definitions.Def_BertsekasShreve_BorelInfinite_Analytic
import Definitions.Def_BertsekasShreve_BorelInfinite_ExtArith
import Definitions.Def_BertsekasShreve_BorelInfinite_Model
import Definitions.Def_BertsekasShreve_BorelInfinite_Policy
import Definitions.Def_BertsekasShreve_BorelInfinite_DetModel

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace BertsekasShreve.BorelInfinite

/-- Section 9.1, Definition 9.3 and Eq. (2) (pp. 214–215), as used in the proof of
Proposition 9.8 (p. 226): `J* ≥ 0` under (P), `J* ≤ 0` under (N), and `J*` is bounded under (D). -/
theorem Jstar_sign {S C W : Type*}
    [TopologicalSpace S] [BertsekasShreve.AnalyticSelection.IsBorelSpace S] [MeasurableSpace S] [BorelSpace S] [Nonempty S]
    [TopologicalSpace C] [BertsekasShreve.AnalyticSelection.IsBorelSpace C] [MeasurableSpace C] [BorelSpace C] [Nonempty C]
    [TopologicalSpace W] [BertsekasShreve.AnalyticSelection.IsBorelSpace W] [MeasurableSpace W] [BorelSpace W] [Nonempty W]
    (M : Model S C W) :
    (M.CaseP → ∀ x, 0 ≤ M.Jstar x) ∧ (M.CaseN → ∀ x, M.Jstar x ≤ 0) ∧
      (M.CaseD → ∃ c : ℝ, ∀ x, -(c : EReal) ≤ M.Jstar x ∧ M.Jstar x ≤ (c : EReal)) := by sorry

end BertsekasShreve.BorelInfinite
Source
Bertsekas & Shreve, Stochastic Optimal Control: The Discrete-Time Case, Athena Scientific 1996, pp. 214–215, Definitions 9.2–9.3 and Eqs. (1)–(2) of Chapter 9, as used in the proof of Proposition 9.8 (p. 226)

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