Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — G(f) ∪ H(f) empty ⇒ f ∈ F″; improvement steps raise (x, y, z) lexicographically

Proved
VeinottNoDiscount.Improve.theorem_6

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

bias-optimalitymarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1policy-improvement

In Blackwell's finite decision model without discounting, let x(f)x(f)x(f) and y(f)y(f)y(f) be the gain and bias of the stationary policy f∞f^\inftyf∞, let z(f)z(f)z(f) be the unique solution of [I−Q(f)]z=−y(f)[I-Q(f)]z=-y(f)[I−Q(f)]z=−y(f), Q∗(f)z=0Q^*(f)z=0Q∗(f)z=0, and let G(f)G(f)G(f), H(f)H(f)H(f) be Veinott's improvement sets. For vectors, u>vu>vu>v means u≥vu\ge vu≥v coordinatewise and u≠vu\ne vu=v. Suppose f∈Ff\in Ff∈F. Then

  1. if G(f)G(f)G(f) is empty, then f∈F′f\in F'f∈F′;
  2. if G(f)∪H(f)G(f)\cup H(f)G(f)∪H(f) is empty, then f∈F′′f\in F''f∈F′′;
  3. if g∈G(f)g\in G(f)g∈G(f), then either x(g)>x(f)x(g)>x(f)x(g)>x(f), or x(g)=x(f)x(g)=x(f)x(g)=x(f) and y(g)>y(f)y(g)>y(f)y(g)>y(f);
  4. if g∈H(f)g\in H(f)g∈H(f), then x(g)=x(f)x(g)=x(f)x(g)=x(f), and either y(g)>y(f)y(g)>y(f)y(g)>y(f), or y(g)=y(f)y(g)=y(f)y(g)=y(f) and z(g)>z(f)z(g)>z(f)z(g)>z(f).

In short,

G(f)∪H(f)=∅ ⟹ f∈F′′,G(f)\cup H(f)=\varnothing\ \Longrightarrow\ f\in F'',G(f)∪H(f)=∅ ⟹ f∈F′′,

and every step f↦g∈G(f)∪H(f)f\mapsto g\in G(f)\cup H(f)f↦g∈G(f)∪H(f) raises the triple (x,y,z)(x,y,z)(x,y,z) lexicographically, so the extended policy improvement method cannot cycle and stops, after finitely many steps, at a decision rule fff with f∞f^\inftyf∞ 1-optimal (Theorem 4).

Formalization Note Every action is available in every state. G(f)G(f)G(f), H(f)H(f)H(f), F′F'F′, F′′F''F′′ are sets of decision rules defined literally from the paper's inequalities (i)–(iii); z(f)z(f)z(f) is the closed form H(f)(−y(f))H(f)(-y(f))H(f)(−y(f)) with Blackwell's deviation matrix.

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 6.** Suppose `f ε F`.
(a) If `G(f)` is empty, then `f ε F′`.
(b) If `G(f) ∪ H(f)` is empty, then `f ε F″`.
(c) If `g ε G(f)`, then either `x(g) > x(f)`, or `x(g) = x(f)` and `y(g) > y(f)`.
(d) If `g ε H(f)`, then `x(g) = x(f)`; and either `y(g) > y(f)`, or `y(g) = y(f)` and
`z(g) > z(f)`.

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. 1290, Theorem 6.

**Formalization Note.** `F = St → Act` (`A_s = Act` for every state). `G(f)`, `H(f)`, `F′`,
`F″` are `GSet`, `HSet`, `Fprime`, `Fdprime` (sets of decision rules; `HSet` is not Blackwell's
deviation matrix `Hf`). `x`, `y` are Blackwell's gain and bias `Q*(f)r(f)`, `H(f)r(f)`; `z` is
`H(f)(−y(f))`, the unique solution of (12). `>` is `VecGt` (`≧` and `≠`). -/
theorem theorem_6 {St Act : Type*} [Fintype St] [DecidableEq St] [Nonempty St]
    [Fintype Act] [Nonempty Act] (M : Model St Act)
    (f : St → Act) :
    (GSet M f = ∅ → f ∈ Fprime M) ∧
      (GSet M f ∪ HSet M f = ∅ → f ∈ Fdprime M) ∧
      (∀ g ∈ GSet M f, VecGt (M.x g) (M.x f) ∨ (M.x g = M.x f ∧ VecGt (M.y g) (M.y f))) ∧
      (∀ g ∈ HSet M f, M.x g = M.x f ∧
        (VecGt (M.y g) (M.y f) ∨ (M.y g = M.y f ∧ VecGt (z M g) (z M 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. 1290, Theorem 6
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