Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — Av ≤ v gives v ≥ f, Av ≥ v gives v ≤ f; Av_δ ≥ v_δ; H_δ v ≥ v gives v_δ ≥ H_δ v

Proved
DenardoDP.NStage.lemma2

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

contraction-mappingdynamic-programmingmonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Work in Denardo's model under the monotonicity and N-stage contraction assumptions, with vδv_\deltavδ​ the fixed point of HδNH_\delta^NHδN​ for each policy δ\deltaδ and f(x)=sup⁡δvδ(x)f(x)=\sup_\delta v_\delta(x)f(x)=supδ​vδ​(x) the optimal return. Then:

  1. (a) if Av≤vAv\le vAv≤v, then v≥fv\ge fv≥f; if Av≥vAv\ge vAv≥v, then v≤fv\le fv≤f;
  2. (b) Avδ≥vδAv_\delta\ge v_\deltaAvδ​≥vδ​ for each δ∈Δ\delta\in\Deltaδ∈Δ;
  3. (c) if Hδv≥vH_\delta v\ge vHδ​v≥v, then vδ≥Hδvv_\delta\ge H_\delta vvδ​≥Hδ​v.

Inequalities between functions are pointwise. Part (a) says that fff is the smallest element of VVV with Av≤vAv\le vAv≤v and the largest with Av≥vAv\ge vAv≥v; it is the step that identifies fff as the fixed point of AAA in Theorem 4 and makes fff optimal for the two mathematical programs of §6.

Formalization Note fff is any element of VVV that is the pointwise least upper bound of {vδ(x)}δ\{v_\delta(x)\}_\delta{vδ​(x)}δ​ (such an fff exists by Theorem 4 (a)–(c)). The family vvv satisfies HδNvδ=vδH_\delta^Nv_\delta=v_\deltaHδN​vδ​=vδ​, the paper's definition of vδv_\deltavδ​ in §5.

Preamble
import Mathlib
import Definitions.Def_DenardoDP_NStage_Model
Formal statement
namespace DenardoDP.NStage

theorem lemma2 {Ω : Type*} {D : Ω → Type*}
    (h : (x : Ω) → D x → DenardoDP.Contraction.BFun Ω → ℝ) (H : ((x : Ω) → D x) → DenardoDP.Contraction.BFun Ω → DenardoDP.Contraction.BFun Ω)
    (A : DenardoDP.Contraction.BFun Ω → DenardoDP.Contraction.BFun Ω) (v : ((x : Ω) → D x) → DenardoDP.Contraction.BFun Ω) (N : ℕ) (c : ℝ)
    (hH : DenardoDP.Contraction.IsPolicyOperator h H) (hA : DenardoDP.Contraction.IsMaxOperator h A)
    (hmono : DenardoDP.Contraction.MonotonicityAssumption H) (hN : NStageContractionAssumption H N c)
    (hv : ∀ δ, (H δ)^[N] (v δ) = v δ)
    (f : DenardoDP.Contraction.BFun Ω) (hf : DenardoDP.Contraction.IsOptimalReturn v f) :
    ((∀ w, DenardoDP.Contraction.PLe (A w) w → DenardoDP.Contraction.PLe f w) ∧ (∀ w, DenardoDP.Contraction.PLe w (A w) → DenardoDP.Contraction.PLe w f)) ∧
    (∀ δ, DenardoDP.Contraction.PLe (v δ) (A (v δ))) ∧
    (∀ δ w, DenardoDP.Contraction.PLe w (H δ w) → DenardoDP.Contraction.PLe (H δ w) (v δ)) := by sorry

end DenardoDP.NStage
Source
Denardo, Contraction Mappings in the Theory Underlying Dynamic Programming, SIAM Review 9(2) (1967), p. 169, Lemma 2 (proof pp. 169–170)
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