Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 1 — history dependent deterministic policies are adequate for the robust value function

Proved
RobustDP.FiniteHorizon.corollary1_deterministic

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

dynamic-programmingmarkov-decision-processesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let ΠD\Pi_DΠD​ be the set of history dependent deterministic policies of a finite horizon AMDP with horizon NNN. For n=0,…,N−1n=0,\dots,N-1n=0,…,N−1 and every history hnh_nhn​,

Vn∗(hn)=sup⁡π∈ΠDVnπ(hn),V^*_n(h_n)=\sup_{\pi\in\Pi_D}V^\pi_n(h_n),Vn∗​(hn​)=π∈ΠD​sup​Vnπ​(hn​),

where Vn∗(hn)V^*_n(h_n)Vn∗​(hn​) is the supremum of Vnπ(hn)V^\pi_n(h_n)Vnπ​(hn​) over all history dependent randomized policies.

Randomization therefore does not improve the robust value.

Preamble
import Mathlib
import Definitions.Def_RobustDP_FiniteHorizon_Value
Formal statement
namespace RobustDP.FiniteHorizon

/-- Corollary 1 (Iyengar, TR-2002-07, p. 7): the history dependent deterministic policies `Π_D`
are adequate: for `n = 0, …, N - 1`, `V*_n(h_n) = sup_{π ∈ Π_D} V^π_n(h_n)`, where `V*_n` is the
supremum over all history dependent randomized policies. -/
theorem corollary1_deterministic {S A : Type*} [Countable S] [Countable A] (M : AMDP S A) :
    ∀ n < M.N, ∀ h : History S A n,
      Vstar M n h = ⨆ π : {π : Policy M // IsDeterministic π}, V M π.1 n h := by sorry

end RobustDP.FiniteHorizon
Source
Iyengar, Robust dynamic programming, CORC Tech Report TR-2002-07 (rev. May 4, 2004), p. 7, Corollary 1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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