Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.3.7 — logarithmic-utility closed form

Proved
MDPFinance.ConsumptionInvestment.log_utility_ci_solution

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

convex-analysismathematical-finance

Let Uc=Up=log⁡U_c=U_p=\logUc​=Up​=log. Then Vn(x)=(N−n+1)log⁡x+dnV_n(x) = (N-n+1)\log x + d_nVn​(x)=(N−n+1)logx+dn​; optimal consumption cn∗(x)=x/(N−n+1)c_n^*(x) = x/(N-n+1)cn∗​(x)=x/(N−n+1), optimal stock investment an∗(x)=x(N−n)/(N−n+1)⋅αn∗a_n^*(x) = x(N-n)/(N-n+1)\cdot\alpha_n^*an∗​(x)=x(N−n)/(N−n+1)⋅αn∗​.

Formalization Note (moderation). The constants dnd_ndn​ are existentially quantified ("with dn∈Rd_n\in\mathbb{R}dn​∈R"), not free parameters of the statement, which would have asserted the formula for every choice of constants; (FM)(ii) is carried as hFM2.

Preamble
import Mathlib
import Definitions.Def_MDPFinance_ConsumptionInvestment_Market
import Definitions.Def_MDPFinance_ConsumptionInvestment_LogAuxiliary

open MeasureTheory ProbabilityTheory
Formal statement
namespace MDPFinance.ConsumptionInvestment

/-- Theorem 4.3.7 (Bäuerle–Rieder, p. 99, PDF 113). Under Assumption (FM) (`hFM2`), let
`Uc(x)=Up(x)=log x`, `x > 0`. Then: a) the value functions are `V_n(x) = (N-n+1)\log x + d_n`,
`x > 0`, for some constants `d_n ∈ ℝ`; b) the optimal consumption is `c_n^*(x) = x/(N-n+1)` and
the optimal amounts invested in the stocks are `a_n^*(x) = x(N-n)/(N-n+1) · α_n^*`, `x > 0`,
`α_n^*` the optimal solution of (4.11); the strategy `(f_0^*, …, f_{N-1}^*)` is optimal. -/
theorem log_utility_ci_solution {Ω : Type*} [MeasurableSpace Ω] {d : ℕ}
    (M : ConsumptionInvestmentMarket Ω d) (hFM2 : M.FM2) (hdomU : M.domU = Set.Ioi (0 : ℝ))
    (hUc : ∀ x > (0 : ℝ), M.Uc x = Real.log x) (hUp : ∀ x > (0 : ℝ), M.Up x = Real.log x) :
    (∃ dseq : ℕ → ℝ, ∀ n ≤ M.N, ∀ x > (0 : ℝ),
        M.V n x = ((((M.N : ℝ) - n + 1) * Real.log x + dseq n : ℝ) : EReal)) ∧
      (∃ αstar : ℕ → (Fin d → ℝ), (∀ n < M.N, αstar n ∈ M.AfracLog n ∧
          ∫ ω, Real.log (1 + ∑ k, αstar n k * M.R (n + 1) ω k) ∂M.measIP = M.vLog n) ∧
        ∃ fstar : ℕ → ℝ → ℝ × (Fin d → ℝ), M.IsAdmissible 0 fstar ∧
          (∀ n < M.N, ∀ x > (0 : ℝ), (fstar n x).1 = x / ((M.N : ℝ) - n + 1)) ∧
          (∀ n < M.N, ∀ x > (0 : ℝ), (fstar n x).2 =
            fun k => x * (((M.N : ℝ) - n) / ((M.N : ℝ) - n + 1)) * αstar n k) ∧
          ∀ x > (0 : ℝ), M.Vpi fstar 0 x = M.V 0 x) := by sorry

end MDPFinance.ConsumptionInvestment
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Universitext, Springer 2011, DOI 10.1007/978-3-642-18324-9, p. 99, PDF 113, Theorem 4.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).

  • Endorsed by iris · Nov 4, 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