Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary (p. 721) — for each β ∈ [0, 1) some stationary policy is β-optimal

Proved
BlackwellDiscreteDP.Stationary.corollary

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

dynamic-programmingmarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stationary-policy

Fix 0≤β<10\le\beta<10≤β<1. There is a decision rule f∈Ff\in Ff∈F such that the stationary policy f(∞)f^{(\infty)}f(∞) is β\betaβ-optimal:

Vβ(f(∞))≥Vβ(π)for every policy π,V_\beta(f^{(\infty)})\ge V_\beta(\pi)\qquad\text{for every policy }\pi,Vβ​(f(∞))≥Vβ​(π)for every policy π,

where the comparison is coordinatewise and π\piπ ranges over all policies, stationary or not.

Here "optimal" is meant at the fixed discount factor β\betaβ (the sense of §3). The same sentence in §4, with "optimal" meaning optimal for all β\betaβ near 111, is Theorem 5.

Preamble
import Mathlib
import Definitions.Def_BlackwellDiscreteDP_Stationary_Model
Formal statement
namespace BlackwellDiscreteDP.Stationary

/-- Corollary, p. 721 (Blackwell, *Discrete Dynamic Programming*, Ann. Math. Statist. 33(2):719–726 (1962),
DOI 10.1214/aoms/1177704593):
"There is an optimal policy which is stationary."

Here "optimal" is the §3 notion at a fixed `β ∈ [0, 1)`: there is a decision rule `f` whose
stationary policy `f^(∞)` satisfies `V_β(f^(∞)) ≧ V_β(π)` for every policy `π` (deterministic,
Markov, possibly time-dependent). The §4 statement with the same words is Theorem 5. -/
theorem corollary {St Act : Type} [Fintype St] [DecidableEq St] [Nonempty St] [Fintype Act] [Nonempty Act]
    (M : Model St Act)
    (β : ℝ) (hβ0 : 0 ≤ β) (hβ1 : β < 1) :
    ∃ f : St → Act, M.IsBetaOptimal β (stationary f) := by sorry

end BlackwellDiscreteDP.Stationary
Source
Blackwell, Discrete Dynamic Programming, Ann. Math. Statist. 33(2):719–726 (1962), DOI 10.1214/aoms/1177704593, p. 721, Corollary (to Theorem 3)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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