Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Zero-year optimal entropic valuation equals terminal cost

Proved
ActuarialValuation.finiteEntropicBellmanValue_zero

by WillR · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

actuarial-scienceentropic-bellmanrisk-sensitive-markov-control

At a zero-horizon valuation date, the optimiser cannot improve or worsen an immediate given terminal reserve or terminal insurance loss. The Bellman value is exactly that terminal amount, even if the state type is empty or the discount factor is zero.

Mathematical statement

V0(s)=h(s)V_0(s)=h(s)V0​(s)=h(s)
Preamble
import Mathlib
import Definitions.Def_actuarial_finiteEntropicBellmanValue
Formal statement
namespace ActuarialValuation

theorem finiteEntropicBellmanValue_zero {S A : Type*}
  [Fintype S] [Fintype A] [Nonempty A]
  (P : S → A → S → ℝ)
  (cost : S → A → S → ℝ) (beta gamma : ℝ)
  (terminal : S → ℝ) (s : S) :
  finiteEntropicBellmanValue P cost beta gamma terminal 0 s =
    terminal s := by sorry

end ActuarialValuation
Source
Bäuerle and Glauner (2022), Markov decision processes with recursive risk measures, European Journal of Operational Research 296(3), Definition 4.6, Theorem 4.7, equation (4.2), DOI https://doi.org/10.1016/j.ejor.2021.04.030; Bäuerle and Jaśkiewicz (2024), entropic certainty equivalent, Example 1(a), equation (2), DOI https://doi.org/10.1007/s00186-024-00857-0; derived finite-state discrete-time insurer cost specialisation
Read-back

What the Lean code literally says, in plain math · gpt-6

Independent mathematical reading. The cost-minimising Bellman recursion makes no decision at zero remaining policy years and consequently returns the given terminal value for every state. A finite nonempty action type is part of the general Bellman definition's signature but is not used to choose any action at zero years. This base case is independent of probability normalisation and risk or discount restrictions.

Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by WillR · Oct 9, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me