Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.2(ii) — the penalty components are G\mathbb GG-adapted and nonanticipative in the actions

Proved
InfoRelax.IdealPenalty.proposition_2_2_ii

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

conditional-expectationdynamic-programminginformation-relaxationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G\mathbb GG be a relaxation of F\mathbb FF and let (w0,…,wT)(w_0,\dots,w_T)(w0​,…,wT​) be generating functions as in Proposition 2.2(i): each wtw_twt​ depends only on the first t+1t+1t+1 actions, is almost everywhere strongly measurable, and the family is bounded almost everywhere by one constant. Let zt(a)=E[wt(a)∣Gt]−E[wt(a)∣Ft]z_t(a)=\mathbb E[w_t(a)\mid\mathcal G_t]-\mathbb E[w_t(a)\mid\mathcal F_t]zt​(a)=E[wt​(a)∣Gt​]−E[wt​(a)∣Ft​]. Then

  1. for every action sequence aaa, the sequence (z0(a),…,zT(a))(z_0(a),\dots,z_T(a))(z0​(a),…,zT​(a)) is adapted to G\mathbb GG;
  2. each ztz_tzt​ depends only on the first t+1t+1t+1 actions (a0,…,at)(a_0,\dots,a_t)(a0​,…,at​) of aaa.

Consequently the penalized objective decomposes into period-ttt terms rt−ztr_t-z_trt​−zt​ that depend only on what is known at time ttt under G\mathbb GG and the actions chosen up to ttt, which is what allows the dual problem to be solved by the recursion (10).

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

/-- **Proposition 2.2(ii) (Constructing Good Penalties)**, Brown, Smith & Sun (2010), Oper. Res.,
DOI 10.1287/opre.1090.0796, p. 5.

Let `𝔾` be a relaxation of `𝔽` and `(w_0, …, w_T)` generating functions, each `w_t` depending only
on `a_0, …, a_t`, and `z_t(a) = 𝔼[w_t(a) | 𝒢_t] − 𝔼[w_t(a) | 𝓕_t]`. Then `(z_0(a), …, z_T(a))` is
adapted to `𝔾` and `z_t` depends only on the first `t + 1` actions `(a_0, …, a_t)` of `a`.

**Formalization Note.** Same hypotheses as Proposition 2.2(i) (`GeneratingFns`); the countable
action type is not needed here and is not assumed. "Adapted" is Mathlib's `Adapted 𝔾` (each
`z_t(a)` is `𝒢_t`-measurable). The statement is close to definitional; it is the paper's
numbered result. -/
theorem proposition_2_2_ii {Ω X : Type*} [mΩ : MeasurableSpace Ω] {T : ℕ}
    (μ : Measure Ω) [IsProbabilityMeasure μ] (𝔽 𝔾 : Filtration (Fin (T + 1)) mΩ)
    (h𝔾 : IsRelaxation 𝔽 𝔾) (w : Fin (T + 1) → (Fin (T + 1) → X) → Ω → ℝ)
    (hw : GeneratingFns μ w) :
    (∀ a : Fin (T + 1) → X, Adapted 𝔾 (fun t => penaltyComp μ 𝔽 𝔾 w t a)) ∧
      ∀ (t : Fin (T + 1)) (a a' : Fin (T + 1) → X), (∀ s, s ≤ t → a s = a' s) →
        penaltyComp μ 𝔽 𝔾 w t a = penaltyComp μ 𝔽 𝔾 w 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, Proposition 2.2(ii)
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