Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.2(c) (N) — U(sup⁡juj)≥sup⁡jUujU(\sup_j u_j) \ge \sup_j Uu_jU(supj​uj​)≥supj​Uuj​

Proved
NegativeDP.OptEq.theorem52c

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

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

Let π\piπ be a Markov policy of a negative dynamic programming problem and UUU its operator. For every sequence u1,u2,…u_1,u_2,\dotsu1​,u2​,… in M(S)M(S)M(S),

U(sup⁡juj) ≥ sup⁡jUujpointwise on S.U\Big(\sup_j u_j\Big) \ \ge\ \sup_j U u_j \qquad\text{pointwise on } S.U(jsup​uj​) ≥ jsup​Uuj​pointwise on S.

With (a) it shows that the class of functions conserved by UUU is closed under countable suprema, which is used in Theorem 6.2.

The paper states Theorem 5.2 for the discounted, positive and negative cases; this item is the negative case. Formalization Note The family is indexed by j∈Nj\in\mathbb Nj∈N (a countable family, so that sup⁡juj∈M(S)\sup_j u_j\in M(S)supj​uj​∈M(S)); each uj∈M(S)u_j\in M(S)uj​∈M(S) is a hypothesis.

Preamble
import Mathlib
import Definitions.Def_DiscountedDP_Stationary_Model
import Definitions.Def_DiscountedDP_Stationary_Return
import Definitions.Def_DiscountedDP_Stationary_Operators
import Definitions.Def_NegativeDP_OptEq_Model
open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal
open DiscountedDP.Stationary (Hist Plan MarkovPlan stationary IsGenerated IsGeneratedPlan)
Formal statement
namespace NegativeDP.OptEq

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

/-- Strauch (1966), Theorem 5.2(c), p. 879, negative case: `U(supⱼ uⱼ) ≥ supⱼ Uuⱼ` for a
sequence `u₁, u₂, …` in `M(S)`. -/
theorem theorem52c (P : NegativeDP.Stationary.Problem S A) (π : MarkovPlan S A) (u : ℕ → S → EReal)
    (hu : ∀ j, NegativeDP.Stationary.IsNegM (u j)) :
    ∀ s, ⨆ j, U P π (u j) s ≤ U P π (fun t => ⨆ j, u j t) s := by sorry

end NegativeDP.OptEq
Source
Strauch, Negative Dynamic Programming, Ann. Math. Statist. 37 (1966), p. 879, Theorem 5.2(c)
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