Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6(d), p. 1290 — g ∈ H(f) ⇒ w(g) > w(f) = 0, or w(g) = w(f) = 0 and z(g) > z(f)

Proved
VeinottNoDiscount.Improve.proof_theorem_6d

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

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

Let f∈Ff\in Ff∈F and g∈H(f)g\in H(f)g∈H(f). Then w(f)=0w(f)=0w(f)=0 and either

w(g)>w(f)orw(g)=w(f) and z(g)>z(f),w(g)>w(f)\qquad\text{or}\qquad w(g)=w(f)\ \text{and}\ z(g)>z(f),w(g)>w(f)orw(g)=w(f) and z(g)>z(f),

where www is defined by (10) relative to fff, zzz by (12), and u>vu>vu>v means u≥vu\ge vu≥v coordinatewise with u≠vu\ne vu=v.

This is Corollary 1 for the reduced problem with action sets E(s,f)E(s,f)E(s,f) and reward −y(f)-y(f)−y(f); with Lemma 4 it yields part (d) of Theorem 6.

Formalization Note Stated in the original model; in Lean w(g)w(g)w(g) is written w(f,g)w(f,g)w(f,g).

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

/-- **Proof of Theorem 6(d).** "Now `g ε H(f) ⊂ E(f)` so we have from Lemma 1 that `x(g) = x(f)`.
It follows from Theorem 5, Lemma 4, and part (c) above that either `w(g) > w(f) = 0` or
`w(g) = w(f) = 0` 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, §3, proof of Theorem 6(d).

This is Theorem 5 and Corollary 1 applied to the reduced problem of the paragraph after Lemma 4
(p. 1289): action sets `E(s, f)`, rewards `−y(f)`, whose improving set is `H(f)`.

**Formalization Note.** Stated in the original model; `>` is `VecGt`. `w M f g` is the paper's
`w(g)` for the fixed `f`; both alternatives of the sentence are kept, and `w(f) = 0` is the first
conjunct. -/
theorem proof_theorem_6d {St Act : Type*} [Fintype St] [DecidableEq St] [Nonempty St]
    [Fintype Act] [Nonempty Act] (M : Model St Act)
    (f : St → Act) :
    ∀ g ∈ HSet M f, w M f f = 0 ∧
      (VecGt (w M f g) (w M f f) ∨ (w M f g = w M f 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, §3, proof of Theorem 6(d)
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