Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4 (Blackwell) — F″ is the nonempty set of f for which f^∞ is 1-optimal

Proved
VeinottNoDiscount.Improve.theorem_4

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

bias-optimalityblackwell-optimalitymarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the finite decision model, let F′′F''F′′ be the set of decision rules fff of maximal gain x(f)x(f)x(f) that, among those, have maximal bias y(f)y(f)y(f). A policy π∗\pi^*π∗ is 1-optimal if

lim⁡β↗1[Vβ(π∗)−U(β)]=0,\lim_{\beta\nearrow1}\big[V_\beta(\pi^*)-U(\beta)\big]=0,β↗1lim​[Vβ​(π∗)−U(β)]=0,

where U(β)U(\beta)U(β) is the value of a β\betaβ-optimal policy. Then F′′F''F′′ is nonempty, and for every f∈Ff\in Ff∈F,

f∈F′′  ⟺  f∞ is 1-optimal.f\in F''\iff f^\infty\text{ is 1-optimal}.f∈F′′⟺f∞ is 1-optimal.

The theorem reduces the search for a 1-optimal stationary policy to lexicographic maximization of gain and then bias.

Formalization Note 1-optimality is the published Blackwell notion "nearly optimal", encoded without UUU: for every ε>0\varepsilon>0ε>0 and all β<1\beta<1β<1 close enough to 111, Vβ(π)≤Vβ(π∗)+εV_\beta(\pi)\le V_\beta(\pi^*)+\varepsilonVβ​(π)≤Vβ​(π∗)+ε coordinatewise for every policy π\piπ (not only stationary ones).

Preamble
import Mathlib
import Definitions.Def_BlackwellDiscreteDP_NearOne_LimitMatrix
import Definitions.Def_BlackwellDiscreteDP_NearOne_Model
import Definitions.Def_BlackwellDiscreteDP_NearOne_GainBias
import Definitions.Def_VeinottNoDiscount_Improve_Sets
open Filter Topology Matrix BlackwellDiscreteDP.NearOne
Formal statement
namespace VeinottNoDiscount.Improve

/-- **Theorem 4 (Blackwell).** `F″` is the (nonempty) set of all `f ε F` for which `f^∞` is
1-optimal.

Veinott, On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting,
Ann. Math. Statist. 37(5):1284–1294 (1966), DOI 10.1214/aoms/1177699272, p. 1286, Theorem 4.

**Formalization Note.** 1-optimal (p. 1285: `lim_{β↗1}[V_β(π*) − U(β)] = 0` with `U(β)` the
value of a β-optimal policy) is the published `IsNearlyOptimal` (Veinott's footnote 2: Blackwell's
"nearly optimal"), encoded without `U` and comparing against every policy, not only stationary
ones. `F″` is `Fdprime M`. -/
theorem theorem_4 {St Act : Type*} [Fintype St] [DecidableEq St] [Nonempty St]
    [Fintype Act] [Nonempty Act] (M : Model St Act) :
    (Fdprime M).Nonempty ∧
      ∀ f : St → Act, f ∈ Fdprime M ↔ M.IsNearlyOptimal (Policy.stationary f) := by sorry

end VeinottNoDiscount.Improve
Source
Veinott, On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting, Ann. Math. Statist. 37(5):1284–1294 (1966), DOI 10.1214/aoms/1177699272, p. 1286, Theorem 4
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