Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.6.1 — (MV) and (MV=) have the same optimal strategies

Proved
MDPFinance.MeanVariance.mv_eq_mveq

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

dynamic-programmingmarkov-decision-processmathematical-financemean-variance

A strategy π∗\pi^*π∗ is optimal for (MV) if and only if it is optimal for (MV=): the inequality constraint Ex0π[XN]≥μ\mathbb{E}_{x_0}^\pi[X_N]\ge\muEx0​π​[XN​]≥μ binds at the optimum, so relaxing it to ≥\ge≥ from === changes nothing.

This licenses working with the equality-constrained problem throughout the rest of the section (in particular the Lagrangian Lx0(π,λ)=Varx0π[XN]+2λ(μ−Ex0π[XN])L_{x_0}(\pi,\lambda) = \mathrm{Var}_{x_0}^\pi[X_N] + 2\lambda(\mu - \mathbb{E}_{x_0}^\pi[X_N])Lx0​​(π,λ)=Varx0​π​[XN​]+2λ(μ−Ex0​π​[XN​]) of Lemma 4.6.2 is built for the equality version), without losing any optimal strategy of the original inequality-constrained (MV).

Formalization Note. Stated as the Iff the book proves (only the "if (MV) then E=μ\mathbb E =\muE=μ" direction needs an argument; the converse is immediate since (MV=)'s feasible set is a subset of (MV)'s with the same objective, and its restriction argument is Proof content, not part of the statement).

Preamble
import Mathlib
import Definitions.Def_MDPFinance_MeanVariance_MVMarket

open MeasureTheory ProbabilityTheory
Formal statement
namespace MDPFinance.MeanVariance

/-- Lemma 4.6.1 (Bäuerle–Rieder, p. 118, PDF 132). A strategy `π*` is optimal for `(MV)` if and
only if `π*` is optimal for `(MV=)`. -/
theorem mv_eq_mveq {Ω : Type*} [MeasurableSpace Ω] {d : ℕ} (M : MVMarket Ω d)
    (πstar : ℕ → ℝ → (Fin d → ℝ)) :
    M.IsOptimalMV πstar ↔ M.IsOptimalMVeq πstar := by sorry

end MDPFinance.MeanVariance
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Universitext, Springer 2011, DOI 10.1007/978-3-642-18324-9, p. 118, PDF 132, Lemma 4.6.1
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