Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.14 — the multiplicative-cost model satisfies I, I.1, I.2 (scalar b) or D, D.1, D.2 (scalar 1)

Proved
BertsekasShreve.Monotone.prop5_14_multiplicative_assumptions

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

dynamic-programmingmultiplicative-costp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let WWW be a countable set, p(⋅∣x,u)p(\cdot\mid x,u)p(⋅∣x,u) a probability distribution on WWW for each (x,u)∈S×C(x,u)\in S\times C(x,u)∈S×C, g:S×C×W→[−∞,∞]g : S\times C\times W\to[-\infty,\infty]g:S×C×W→[−∞,∞] and f:S×C×W→Sf : S\times C\times W\to Sf:S×C×W→S. Consider an abstract monotone dynamic programming model on SSS, CCC with constraint sets U(x)U(x)U(x) whose mapping is the multiplicative-cost mapping

H(x,u,J)=E{ g(x,u,w) J[f(x,u,w)]∣x,u }H(x,u,J)=E\{\,g(x,u,w)\,J[f(x,u,w)]\mid x,u\,\}H(x,u,J)=E{g(x,u,w)J[f(x,u,w)]∣x,u}

(the expectation of Section 2.3.2 on the countable set WWW: positive and negative parts summed separately, with ∞−∞=∞\infty-\infty=\infty∞−∞=∞) and whose terminal function is J0(x)=1J_0(x)=1J0​(x)=1 for all x∈Sx\in Sx∈S.

  1. If there is b∈Rb\in\mathbb Rb∈R with
1≤g(x,u,w)≤b∀x∈S, u∈U(x), w∈W,1\le g(x,u,w)\le b\qquad\forall x\in S,\ u\in U(x),\ w\in W,1≤g(x,u,w)≤b∀x∈S, u∈U(x), w∈W,

then Assumptions I, I.1 and I.2 are satisfied, with the scalar in I.2 equal to bbb. 2. If

0≤g(x,u,w)≤1∀x∈S, u∈U(x), w∈W,0\le g(x,u,w)\le 1\qquad\forall x\in S,\ u\in U(x),\ w\in W,0≤g(x,u,w)≤1∀x∈S, u∈U(x), w∈W,

then Assumptions D, D.1 and D.2 are satisfied, with the scalar in D.2 equal to 111.

Consequently every result of the chapter proved under I, I.1, I.2 (respectively D, D.1, D.2) applies to stochastic control problems with a multiplicative cost functional, such as the risk-sensitive exponential cost.

Formalization Note Part 1 is stated for every MonotoneDP.Increase.Model and part 2 for every MonotoneDP.Decrease.Model whose fields are H = BertsekasShreve.FiniteHorizon.multiplicativeH p g f (the shared definition of Section 2.3.4's mapping, with the book's expectation expect) and Jbar ≡ 1; monotonicity of HHH, part of the model, holds under either hypothesis because g≥0g\ge0g≥0 (Section 2.3.4, eq. (27)), so such models exist. WWW is [Countable W] and each p(⋅∣x,u)p(\cdot\mid x,u)p(⋅∣x,u) is a PMF W.

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

/-- Bertsekas & Shreve (1996), p. 90, Proposition 5.14: for the multiplicative mapping
`H(x, u, J) = E{g(x, u, w) J[f(x, u, w)] | x, u}` of Section 2.3.4 (countable `W`) with
`J₀ ≡ 1`:
(a) if `1 ≤ g(x, u, w) ≤ b` for all `x ∈ S`, `u ∈ U(x)`, `w ∈ W`, with `b ∈ ℝ`, then I, I.1 and I.2
hold, the scalar in I.2 being `b`;
(b) if `0 ≤ g(x, u, w) ≤ 1` for all `x ∈ S`, `u ∈ U(x)`, `w ∈ W`, then D, D.1 and D.2 hold, the
scalar in D.2 being `1`.
A model of Part I with this `H` and `J₀` is any `Model` whose fields `H` and `Jbar` are these. -/
theorem prop5_14_multiplicative_assumptions {S C W : Type*} [Countable W]
    (p : S → C → PMF W) (g : S → C → W → EReal) (f : S → C → W → S) :
    (∀ m : MonotoneDP.Increase.Model S C, m.H = BertsekasShreve.FiniteHorizon.multiplicativeH p g f → m.Jbar = (fun _ => 1) →
      ∀ b : ℝ, (∀ x : S, ∀ u ∈ m.U x, ∀ w : W, 1 ≤ g x u w ∧ g x u w ≤ (b : EReal)) →
        m.AssumptionI ∧ m.AssumptionI1 ∧ m.AssumptionI2 b) ∧
    (∀ m : MonotoneDP.Decrease.Model S C, m.H = BertsekasShreve.FiniteHorizon.multiplicativeH p g f → m.Jbar = (fun _ => 1) →
      (∀ x : S, ∀ u ∈ m.U x, ∀ w : W, 0 ≤ g x u w ∧ g x u w ≤ 1) →
        m.AssumptionD ∧ m.AssumptionD1 ∧ m.AssumptionD2 1) := by sorry

end BertsekasShreve.Monotone
Source
Bertsekas & Shreve, Stochastic Optimal Control: The Discrete-Time Case, Athena Scientific 1996, p. 90, Proposition 5.14; mapping from p. 37, Section 2.3.4, Eq. (26) of Chapter 2
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