Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 (Dynamic vs Static adversary) — a stationary policy has the same value in the dynamic and the static model

Proved
RobustDP.Discounted.lemma3_dynamic_static

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

dynamic-programminggame-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let (S,A,P,r,λ)(\mathcal S,\mathcal A,\mathcal P,r,\lambda)(S,A,P,r,λ) be a discounted ambiguous MDP, let qqq be a randomized Markov decision rule (qs∈M(A(s))q_s\in\mathcal M(\mathcal A(s))qs​∈M(A(s)) for every sss), and let π=(q,q,… )\pi=(q,q,\dots)π=(q,q,…) be the stationary policy. Let VλπV^\pi_\lambdaVλπ​ be its value against the dynamic adversary and V^λπ\hat V^\pi_\lambdaV^λπ​ its value against the static adversary, who fixes one pˉsa∈P(s,a)\bar p_{sa}\in\mathcal P(s,a)pˉ​sa​∈P(s,a) per state–action pair. Then for every state sss,

V^λπ(s)=Vλπ(s).\hat V^\pi_\lambda(s)=V^\pi_\lambda(s).V^λπ​(s)=Vλπ​(s).

For stationary policies the adversary's best response is static, so the optimal stationary policy of the static model is obtained from (30).

Formalization Note The page states the lemma for "any decision rule" and proves it for deterministic rules, adding that "the same technique extends to randomized policies". It is stated here for randomized Markov rules, which include the deterministic ones as point masses.

Preamble
import Mathlib
import Definitions.Def_RobustDP_Discounted_Model
import Definitions.Def_RobustDP_Discounted_Value
import Definitions.Def_RobustDP_Discounted_Bellman
Formal statement
namespace RobustDP.Discounted

theorem lemma3_dynamic_static {S A : Type*} [Countable S] [Countable A] (M : Model S A)
    (q : RandRule M) (s : S) :
    Vstatic M (stationaryRand M q) s = V M (stationaryRand M q) s := by sorry

end RobustDP.Discounted
Source
Iyengar, Robust dynamic programming, CORC Tech Report TR-2002-07 (rev. May 4, 2004), p. 14, Lemma 3; static model, p. 9
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me