Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.11 — accumulation points of DP-minimizing controls form an optimal stationary policy

Proved
BertsekasShreve.Monotone.prop5_11_accumulation_points_optimal

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

compactnessdynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1stationary-policyvalue-iteration

Consider the abstract monotone dynamic programming model (state space SSS, control space CCC, nonempty constraint sets U(x)⊆CU(x)\subseteq CU(x)⊆C, monotone mapping HHH, terminal function J0>−∞J_0>-\inftyJ0​>−∞), with operators Tμ(J)(x)=H(x,μ(x),J)T_\mu(J)(x)=H(x,\mu(x),J)Tμ​(J)(x)=H(x,μ(x),J) and T(J)(x)=inf⁡u∈U(x)H(x,u,J)T(J)(x)=\inf_{u\in U(x)}H(x,u,J)T(J)(x)=infu∈U(x)​H(x,u,J), policy costs Jπ=lim⁡N(Tμ0⋯TμN−1)(J0)J_\pi=\lim_N(T_{\mu_0}\cdots T_{\mu_{N-1}})(J_0)Jπ​=limN​(Tμ0​​⋯TμN−1​​)(J0​), stationary costs JμJ_\muJμ​ and optimal cost J∗=inf⁡πJπJ^*=\inf_\pi J_\piJ∗=infπ​Jπ​. Assume:

  1. Assumptions I, I.1 and I.2 hold;
  2. CCC is a Hausdorff topological space;
  3. there is a nonnegative integer kˉ\bar kkˉ such that for each x∈Sx\in Sx∈S, λ∈R\lambda\in\mathbb Rλ∈R and k≥kˉk\ge\bar kk≥kˉ the set
Uk(x,λ)={u∈U(x)∣H[x,u,Tk(J0)]≤λ}U_k(x,\lambda)=\{u\in U(x)\mid H[x,u,T^k(J_0)]\le\lambda\}Uk​(x,λ)={u∈U(x)∣H[x,u,Tk(J0​)]≤λ}

is compact.

Then:

(a) There exists a policy π∗=(μ0∗,μ1∗,… )\pi^*=(\mu_0^*,\mu_1^*,\dots)π∗=(μ0∗​,μ1∗​,…) attaining the infimum in the DP algorithm for all k≥kˉk\ge\bar kk≥kˉ:

(Tμk∗Tk)(J0)=Tk+1(J0)∀k≥kˉ.(43)(T_{\mu_k^*}T^k)(J_0)=T^{k+1}(J_0)\qquad\forall k\ge\bar k. \tag{43}(Tμk∗​​Tk)(J0​)=Tk+1(J0​)∀k≥kˉ.(43)

(b) For every policy π∗\pi^*π∗ satisfying (43), the sequence {μk∗(x)}k≥0\{\mu_k^*(x)\}_{k\ge0}{μk∗​(x)}k≥0​ has at least one accumulation point in CCC for each x∈Sx\in Sx∈S with J∗(x)<∞J^*(x)<\inftyJ∗(x)<∞.

(c) Let π∗\pi^*π∗ satisfy (43). If μ∗:S→C\mu^* : S\to Cμ∗:S→C is such that μ∗(x)\mu^*(x)μ∗(x) is an accumulation point of {μk∗(x)}\{\mu_k^*(x)\}{μk∗​(x)} for every x∈Sx\in Sx∈S with J∗(x)<∞J^*(x)<\inftyJ∗(x)<∞, and μ∗(x)∈U(x)\mu^*(x)\in U(x)μ∗(x)∈U(x) for every x∈Sx\in Sx∈S with J∗(x)=∞J^*(x)=\inftyJ∗(x)=∞, then μ∗(x)∈U(x)\mu^*(x)\in U(x)μ∗(x)∈U(x) for all xxx and the stationary policy (μ∗,μ∗,… )(\mu^*,\mu^*,\dots)(μ∗,μ∗,…) is optimal:

Jμ∗=J∗.J_{\mu^*}=J^*.Jμ∗​=J∗.

The proposition makes the value-iteration algorithm constructive: the controls that attain the minimum at each stage of the DP recursion, followed to an accumulation point state by state, yield an optimal stationary policy.

Formalization Note The model and assumptions are the published MonotoneDP.Increase definitions; "I.2 holds" is ∃α\exists\alpha∃α, AssumptionI2 α. An accumulation point of {μk∗(x)}\{\mu_k^*(x)\}{μk∗​(x)} is a cluster point of the sequence (MapClusterPt u atTop), not a limit. In (c) the admissibility of μ∗\mu^*μ∗ is part of the conclusion, as the existence of a proof that μ∗(x)∈U(x)\mu^*(x)\in U(x)μ∗(x)∈U(x) for all xxx.

Preamble
import Mathlib
import Definitions.Def_MonotoneDP_Increase_Model
import Definitions.Def_MonotoneDP_Increase_Assumptions
Formal statement
namespace BertsekasShreve.Monotone

open Filter Topology

/-- Bertsekas & Shreve (1996), p. 87, Proposition 5.11, under the assumptions of Proposition 5.10
(p. 86): I, I.1 and I.2 hold, the control space `C` is a Hausdorff space, and for a nonnegative
integer `k̄` the sets `U_k(x, λ) = {u ∈ U(x) | H[x, u, T^k(J₀)] ≤ λ}` (eq. (40)) are compact for all
`x ∈ S`, `λ ∈ ℝ`, `k ≥ k̄`. Then
(a) some policy `π* = (μ₀*, μ₁*, …)` satisfies `(T_{μ_k*} T^k)(J₀) = T^{k+1}(J₀)` for all `k ≥ k̄`
(eq. (43));
(b) for every policy satisfying (43), `{μ_k*(x)}` has an accumulation point whenever
`J*(x) < ∞`;
(c) if `μ* : S → C` takes an accumulation point of `{μ_k*(x)}` at every `x` with `J*(x) < ∞` and a
value in `U(x)` at every `x` with `J*(x) = ∞`, then `μ*` is admissible and the stationary policy
`(μ*, μ*, …)` is optimal. -/
theorem prop5_11_accumulation_points_optimal {S C : Type*} [TopologicalSpace C] [T2Space C]
    (m : MonotoneDP.Increase.Model S C)
    (hI : m.AssumptionI) (hI1 : m.AssumptionI1) (hI2 : ∃ α : ℝ, m.AssumptionI2 α)
    (kbar : ℕ)
    (hcpt : ∀ x : S, ∀ lam : ℝ, ∀ k : ℕ, kbar ≤ k →
      IsCompact {u | u ∈ m.U x ∧ m.H x u ((m.T)^[k] m.Jbar) ≤ (lam : EReal)}) :
    (∃ π : m.Policy, ∀ k : ℕ, kbar ≤ k →
        m.Tmu (π k) ((m.T)^[k] m.Jbar) = (m.T)^[k + 1] m.Jbar) ∧
    (∀ π : m.Policy, (∀ k : ℕ, kbar ≤ k →
        m.Tmu (π k) ((m.T)^[k] m.Jbar) = (m.T)^[k + 1] m.Jbar) →
      ∀ x : S, m.Jstar x < ⊤ → ∃ u : C, MapClusterPt u atTop (fun k => (π k).1 x)) ∧
    (∀ π : m.Policy, (∀ k : ℕ, kbar ≤ k →
        m.Tmu (π k) ((m.T)^[k] m.Jbar) = (m.T)^[k + 1] m.Jbar) →
      ∀ μ : S → C,
        (∀ x : S, m.Jstar x < ⊤ → MapClusterPt (μ x) atTop (fun k => (π k).1 x)) →
        (∀ x : S, m.Jstar x = ⊤ → μ x ∈ m.U x) →
        ∃ hμ : ∀ x, μ x ∈ m.U x, m.Jmu ⟨μ, hμ⟩ = m.Jstar) := by sorry

end BertsekasShreve.Monotone
Source
Bertsekas & Shreve, Stochastic Optimal Control: The Discrete-Time Case, Athena Scientific 1996, p. 87, Proposition 5.11, Eq. (43) of Chapter 5; hypotheses from p. 86, Proposition 5.10, Eq. (40) of Chapter 5
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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