Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(12) — z(f) is the unique solution of [I − Q(f)]z = −y(f), Q*(f)z = 0

Proved
VeinottNoDiscount.Improve.display_12

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

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

For each decision rule f∈Ff\in Ff∈F, the system

[I−Q(f)] z=−y(f),Q∗(f) z=0(12)[I-Q(f)]\,z=-y(f),\qquad Q^*(f)\,z=0\tag{12}[I−Q(f)]z=−y(f),Q∗(f)z=0(12)

has exactly one solution, z(f)z(f)z(f).

The vector z(f)z(f)z(f) is the third coordinate of the triple (x(f),y(f),z(f))(x(f),y(f),z(f))(x(f),y(f),z(f)) that Veinott's extended improvement method increases lexicographically; it plays for the bias the role that the bias plays for the gain.

Formalization Note z(f)z(f)z(f) is defined as H(f)(−y(f))H(f)(-y(f))H(f)(−y(f)) with H(f)=(I−Q(f)+Q∗(f))−1−Q∗(f)H(f)=(I-Q(f)+Q^*(f))^{-1}-Q^*(f)H(f)=(I−Q(f)+Q∗(f))−1−Q∗(f); the statement asserts that this vector is the one and only solution of (12).

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

/-- **(12).** For each `f ε F` let `z(f)` be the unique solution (by Theorem 3) to
(12) `[I − Q(f)]z(f) = −y(f), Q*(f)z(f) = 0`.

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, (12).

**Formalization Note.** `z M f` is the closed form `H(f)(−y(f))` with Blackwell's deviation
matrix `H(f)`; the statement says it is the one and only solution of (12). -/
theorem display_12 {St Act : Type*} [Fintype St] [DecidableEq St] [Nonempty St]
    [Fintype Act] [Nonempty Act] (M : Model St Act)
    (f : St → Act) :
    ∀ v : St → ℝ, ((1 - M.Q f) *ᵥ v = -(M.y f) ∧ M.Qstar f *ᵥ v = 0) ↔ v = 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, (12)
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