Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9.3.7 — stability of the value and of the optimal policies under utility perturbation

Proved
MDPFinance.JumpMarkets.theorem_9_3_7

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-programmingmathematical-financeoperations-researchoptimizationprobability

Theorem 9.3.7 (p. 290).

a) If UUU and U~\tilde UU~ are two utility functions with corresponding value functions VVV and V~\tilde VV~, then ∥V−V~∥b≤∥U−U~∥b eTμˉ/(1−αb)\|V - \tilde V\|_b \le \|U - \tilde U\|_b\,e^{T\barμ}/(1-\alpha_b)∥V−V~∥b​≤∥U−U~∥b​eTμˉ​/(1−αb​). b) Let (U(n))(U^{(n)})(U(n)) be a sequence of utility functions with lim⁡n→∞∥U(n)−U∥b=0\lim_{n\to\infty}\|U^{(n)} - U\|_b = 0limn→∞​∥U(n)−U∥b​=0. Then it holds ∅≠Ls An∗(t,x)⊂A∗(t,x)\emptyset \ne \mathrm{Ls}\,A^*_n(t,x) \subset A^*(t,x)∅=LsAn∗​(t,x)⊂A∗(t,x) for all (t,x)∈E(t,x) \in E(t,x)∈E, i.e. in particular, the limit f∗f^*f∗ of a sequence (fn∗)(f^*_n)(fn∗​) with fn∗(t,x)∈An∗(t,x)f^*_n(t,x) \in A^*_n(t,x)fn∗​(t,x)∈An∗​(t,x) for all (t,x)∈E(t,x) \in E(t,x)∈E defines an optimal stationary policy for the given model (with utility function UUU).

The practical payoff of the contracting structure: a utility function is never known exactly, and this says the answer degrades gracefully. a) is a Lipschitz estimate for the value with the explicit constant eTμˉ/(1−αb)e^{T\barμ}/(1-\alpha_b)eTμˉ​/(1−αb​); b) is the corresponding statement for the optimal policies, which is strictly stronger and does not follow from a) — value functions can be close while argmax sets are far apart.

b) is an upper-limit statement, not a limit. Ls An∗(t,x)\mathrm{Ls}\,A^*_n(t,x)LsAn∗​(t,x) is the book's own definition (p. 201): an accumulation point of some sequence (an)(a_n)(an​) with an∈An∗(t,x)a_n \in A^*_n(t,x)an​∈An∗​(t,x) — a statement about a sequence of points, not a Filter.limsup of sets, and rendered here as chunk 07a renders it. Both halves are the content: ∅≠Ls\emptyset \ne \mathrm{Ls}∅=Ls says approximating policies have accumulation points, and the inclusion says every such point is optimal for the true utility.

a) is stated in its ≤\le≤-form against the bounding function rather than by forming ∥⋅∥b\|\cdot\|_b∥⋅∥b​, which is itself a supremum.

Moderation note. In the draft the approximating markets M_n were arbitrary (not the same market with a different utility — refutable), their V_n arbitrary fixed points, and Ls was in an arbitrary topology. Now M_n share the market data, V, Ṽ, V^{(n)} are the value functions, a) is a two-sided [0,∞] bound with the constant e^{T\barμ}/(1 − α_b), and b) is ∅ ≠ Ls A^*_n(t,x) ⊂ A^*(t,x) over the relaxed controls with the Young topology.

Preamble
import Mathlib
import Definitions.Def_MDPFinance_JumpMarkets_JumpMarket

open MeasureTheory Filter Topology
open scoped ENNReal
Formal statement
namespace MDPFinance.JumpMarkets

/-- Two jump markets with the same market data, differing only in the utility. -/
def JumpMarket.SameMarket {d : ℕ} (M M' : JumpMarket d) : Prop :=
  M'.rho = M.rho ∧ M'.mu = M.mu ∧ M'.lam = M.lam ∧ M'.QY = M.QY ∧ M'.T = M.T

/-- **Theorem 9.3.7** (p. 290), for the contracting model (`b = b_γ`, `α_b < 1`). a) If `U`,
`Ũ` are two utility functions (same market) with value functions `V`, `Ṽ`, then `‖V - Ṽ‖_b ≤
‖U - Ũ‖_b e^{T\barμ}/(1-α_b)` (in `≤`-form against `b`, two-sided in `[0,∞]`). b) If `(U^{(n)})`
are utility functions with `‖U^{(n)} - U‖_b → 0` and `V^{(n)}` their value functions, then
`∅ ≠ Ls A^*_n(t,x) ⊂ A^*(t,x)` on `E`, the maximum-point sets over the relaxed controls `R`
with the Young topology. -/
theorem theorem_9_3_7 {d : ℕ} (M Mtilde : JumpMarket d)
    (gamma alpha : ℝ) (hb : M.IsBoundingFunction (M.bfun gamma) alpha)
    (hbt : Mtilde.IsBoundingFunction (M.bfun gamma) alpha) (halpha : alpha < 1)
    (hsame : M.SameMarket Mtilde)
    (Pr : HistPolicy d → ℝ × ℝ → Measure (ℕ → ℝ × ℝ))
    (hPr : ∀ g, M.IsChainLaw g (Pr g)) :
    (∀ C : ℝ, (∀ p ∈ M.E, |M.U p.2 - Mtilde.U p.2| ≤ C * M.bfun gamma p) →
      ∀ p ∈ M.E,
        M.V Pr p ≤ Mtilde.V Pr p +
            ENNReal.ofReal (C * Real.exp (M.T * M.mubar) / (1 - alpha) * M.bfun gamma p) ∧
          Mtilde.V Pr p ≤ M.V Pr p +
            ENNReal.ofReal (C * Real.exp (M.T * M.mubar) / (1 - alpha) * M.bfun gamma p)) ∧
    (∀ Mn : ℕ → JumpMarket d, (∀ n, M.SameMarket (Mn n)) →
      (∀ n, (Mn n).IsBoundingFunction (M.bfun gamma) alpha) →
      (∀ ε > (0 : ℝ), ∀ᶠ n in atTop, ∀ p ∈ M.E,
        |(Mn n).U p.2 - M.U p.2| ≤ ε * M.bfun gamma p) →
      ∀ p ∈ M.E,
        (LsSeq (fun n => (Mn n).AstarRel ((Mn n).V Pr) p)).Nonempty ∧
        LsSeq (fun n => (Mn n).AstarRel ((Mn n).V Pr) p) ⊆ M.AstarRel (M.V Pr) p) := by sorry

end MDPFinance.JumpMarkets
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Universitext, Springer 2011, DOI 10.1007/978-3-642-18324-9, p. 290 (PDF 300), Theorem 9.3.7
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 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