Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.3, proof of Theorem 5.3, p. 24 — NPG improves every state: V⁽ᵗ⁺¹⁾(s) ≥ V⁽ᵗ⁾(s) for all s

Proved
PolicyGradTheory.NPG.npg_value_monotone

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

natural-policy-gradientp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1policy-improvementsoftmax-policy

This is the monotonicity claim used in the proof of Theorem 5.3 ("V(t+1)(s)≥V(t)(s)V^{(t+1)}(s)\ge V^{(t)}(s)V(t+1)(s)≥V(t)(s) for all states sss by Lemma 5.2").

Let (P,r,γ)(P,r,\gamma)(P,r,γ) be a finite MDP with a nonempty action set, ρ∈Δ(S)\rho\in\Delta(\mathcal S)ρ∈Δ(S) a start distribution from which every state is reachable, and η>0\eta>0η>0. Let (θ(t))t≥0(\theta^{(t)})_{t\ge0}(θ(t))t≥0​ be any run of the natural policy gradient updates (15) with softmax policies and V(t)V^{(t)}V(t) the value of π(t)=πθ(t)\pi^{(t)}=\pi_{\theta^{(t)}}π(t)=πθ(t)​. Then for every ttt and every state sss,

V(t+1)(s)  ≥  V(t)(s).V^{(t+1)}(s)\;\ge\;V^{(t)}(s).V(t+1)(s)≥V(t)(s).

State-wise monotonicity lets the proof of Theorem 5.3 replace the average of the values V(0)(ρ),…,V(T−1)(ρ)V^{(0)}(\rho),\dots,V^{(T-1)}(\rho)V(0)(ρ),…,V(T−1)(ρ) by the last one.

Formalization Note Reachability of every state from ρ\rhoρ is the standing restriction of §5.3 (footnote 6). The run may start from any θ(0)\theta^{(0)}θ(0).

Preamble
import Mathlib
import Definitions.Def_PolicyGradTheory_ProjGA_MDP
import Definitions.Def_PolicyGradTheory_NPG_Algorithm
import Definitions.Def_FoundationsML_ReinforcementLearning_IsOptimalPolicy

open FoundationsML.ReinforcementLearning
Formal statement
namespace PolicyGradTheory.NPG

/-- §5.3, proof of Theorem 5.3 (arXiv:1908.00261v5, p. 24): the NPG iterates improve at every
state, `V^{(t+1)}(s) ≥ V^{(t)}(s)` for all states `s`. -/
theorem npg_value_monotone {S A : Type*} [Fintype S] [DecidableEq S] [Fintype A] [DecidableEq A]
    (P : S → A → S → ℝ) (r : S → A → ℝ) (γ : ℝ) (hM : PolicyGradTheory.ProjGA.IsFiniteMDP P r γ)
    [Nonempty A] (ρ : S → ℝ) (hρ : PolicyGradTheory.ProjGA.IsDist ρ) (hreach : AllReachable P γ ρ)
    (η : ℝ) (hη : 0 < η) (θ : ℕ → EuclideanSpace ℝ (S × A)) (hrun : IsNPGRun P r γ ρ η θ) :
    ∀ (t : ℕ) (s : S),
      PolicyValue (softmaxPolicy (θ t)) P r γ s ≤
        PolicyValue (softmaxPolicy (θ (t + 1))) P r γ s := by sorry

end PolicyGradTheory.NPG
Source
arXiv:1908.00261v5, §5.3, proof of Theorem 5.3, p. 24
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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