Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.3 — with wt=Vt+1w_t = V_{t+1}wt​=Vt+1​ the dual value functions equal the primal ones, VtG=VtV^{\mathbb G}_t = V_tVtG​=Vt​

Proved
InfoRelax.IdealPenalty.dual_value_fn_eq_value_fn

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

bellman-equationdualitydynamic-programminginformation-relaxationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a recursive DP as in eq. (2) (natural filtration with F0={∅,Ω}\mathcal F_0=\{\emptyset,\Omega\}F0​={∅,Ω}, countable action set, nonempty feasible sets, bounded Ft\mathcal F_tFt​-measurable period rewards). Let G\mathbb GG be any relaxation of F\mathbb FF and take the generating functions wt(a)=Vt+1(a0,…,at)w_t(a)=V_{t+1}(a_0,\dots,a_t)wt​(a)=Vt+1​(a0​,…,at​) built from the primal value functions of (2). Then for every t=0,…,T+1t=0,\dots,T+1t=0,…,T+1 and every action sequence,

VtG=Vtalmost surely,V^{\mathbb G}_t=V_t\quad\text{almost surely},VtG​=Vt​almost surely,

where VtGV^{\mathbb G}_tVtG​ are the dual value functions of (10).

This identity is the core of Theorem 2.3: with the ideal generating functions the dual recursion reproduces the primal recursion, so the dual bound equals the primal value.

Formalization Note The equality is almost sure because conditional expectations are determined only almost everywhere. For t>T+1t>T+1t>T+1 both sides are 000.

Preamble
import Mathlib
import Definitions.Def_InfoRelax_IdealPenalty_Framework
import Definitions.Def_InfoRelax_IdealPenalty_RecursiveModel
import Definitions.Def_InfoRelax_IdealPenalty_Penalty

open MeasureTheory
Formal statement
namespace InfoRelax.IdealPenalty

/-- **§2.3, the induction before Theorem 2.3**, Brown, Smith & Sun (2010), Oper. Res., DOI
10.1287/opre.1090.0796, p. 5.

In the recursive setting, let `𝔾` be a relaxation of `𝔽` and take the generating functions
`w_t(a) = V_{t+1}(a_0, …, a_t)` from the primal value functions (2). Then the dual value functions
of (10) equal the primal value functions: `V^𝔾_t = V_t` for every `t = 0, …, T + 1` (and
trivially beyond), almost surely, for every action sequence.

**Formalization Note.** Equality is almost sure (`=ᵐ[μ]`) because conditional expectations are
determined only a.e. Pinned: countable action type with the discrete σ-algebra. -/
theorem dual_value_fn_eq_value_fn {Ω X : Type*} [mΩ : MeasurableSpace Ω] [MeasurableSpace X]
    [DiscreteMeasurableSpace X] [Countable X] [DecidableEq X] {T : ℕ}
    (μ : Measure Ω) [IsProbabilityMeasure μ] (M : RecursiveDP Ω X T) (hM : M.Valid)
    (𝔾 : Filtration (Fin (T + 1)) mΩ) (h𝔾 : IsRelaxation M.𝔽 𝔾) :
    ∀ (t : ℕ) (a : Fin (T + 1) → X),
      dualValueFn M μ 𝔾 (idealGen M μ) t a =ᵐ[μ] valueFn M μ t a := by sorry

end InfoRelax.IdealPenalty
Source
Brown, Smith & Sun, Information Relaxations and Duality in Stochastic Dynamic Programs, Oper. Res. (Articles in Advance, 2010), DOI 10.1287/opre.1090.0796, p. 5, §2.3, the paragraph before Theorem 2.3
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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