Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.2(a) (N) — the operator UUU is monotone

Proved
NegativeDP.OptEq.theorem52a

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 π=(f1,f2,… )\pi = (f_1,f_2,\dots)π=(f1​,f2​,…) be a Markov policy of a negative dynamic programming problem, TnT_nTn​ the operator of fnf_nfn​, and Uu=sup⁡nTnuUu = \sup_n T_n uUu=supn​Tn​u its associated operator on M(S)M(S)M(S), the non-positive extended real-valued Borel functions on SSS. For u,v∈M(S)u,v\in M(S)u,v∈M(S),

u≤v⟹Uu≤Uv.u \le v \quad\Longrightarrow\quad Uu \le Uv .u≤v⟹Uu≤Uv.

Monotonicity of UUU is used to propagate the conservation property Uv≥vUv\ge vUv≥v along the iterates UnvU^n vUnv (Lemma 6.2).

The paper states Theorem 5.2 for the discounted, positive and negative cases; this item is the negative case. Formalization Note Inequalities are pointwise; u∈M(S)u\in M(S)u∈M(S) and v∈M(S)v\in M(S)v∈M(S) are explicit hypotheses (IsNegM).

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(a), p. 879, negative case: `U` is monotone on `M(S)`. -/
theorem theorem52a (P : NegativeDP.Stationary.Problem S A) (π : MarkovPlan S A) (u v : S → EReal)
    (hu : NegativeDP.Stationary.IsNegM u) (hv : NegativeDP.Stationary.IsNegM v) (huv : ∀ s, u s ≤ v s) :
    ∀ s, U P π u s ≤ U P π v s := by sorry

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