Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3 — g_n(i) is the optimal expected cost over periods 0, …, n among all rules

Proved
DermanDenumerable.AvgCost.finite_horizon_optimal

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

dynamic-programmingfinite-horizonp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under conditions (A) and (B), let gn(i)g_n(i)gn​(i) be the value iteration of (5) and, for a rule R∈CR \in CR∈C, let hn(i)=∑t=0nERWth_n(i) = \sum_{t=0}^{n} E_R W_thn​(i)=∑t=0n​ER​Wt​ be the total expected cost incurred over the periods 0,1,…,n0, 1, \dots, n0,1,…,n under RRR when Y0=iY_0 = iY0​=i. Then for every nnn:

  1. every rule does at least as badly: gn(i)≤hn(i)g_n(i) \le h_n(i)gn​(i)≤hn​(i) for every rule R∈CR \in CR∈C and every i∈Ii \in Ii∈I;
  2. the bound is attained: some rule R∈CR \in CR∈C has hn(i)=gn(i)h_n(i) = g_n(i)hn​(i)=gn​(i) for every i∈Ii \in Ii∈I.
gn(i)=min⁡R∈Chn(i).g_n(i) = \min_{R \in C} h_n(i).gn​(i)=R∈Cmin​hn​(i).

This is the paper's statement that "gn(i)g_n(i)gn​(i) is the result of an optimal rule for those periods" (proof of Theorem 1). Part 1 is the inequality used there to conclude lim inf⁡nhn(i)/n≥g\liminf_n h_n(i)/n \ge gliminfn​hn​(i)/n≥g.

Formalization Note. The paper's phrase reads "over the periods 0,1,⋯ ,0, 1, \cdots,0,1,⋯, under RRR", with the final nnn missing in print; the meaning, from the gloss of (5), is the periods 0,…,n0, \dots, n0,…,n. No optimality equation is assumed. The minimum is over all history-dependent randomized rules.

Preamble
import Mathlib
import Definitions.Def_DermanDenumerable_AvgCost_Model
open scoped Topology
open Filter SennottDP.AvgFinite
Formal statement
namespace DermanDenumerable.AvgCost

/-- Derman (1966), §3, proof of Theorem 1, p. 1549: `g_n(i)` of (5) is the result of an optimal rule
for the periods `0, 1, ⋯, n`. For every `n`: (a) no rule `R ∈ C` has total expected cost
`h_n(i)` over the periods `0, ⋯, n` below `g_n(i)`, at any initial state `i`; and (b) some rule
`R ∈ C` attains `g_n(i)` at every initial state. -/
theorem finite_horizon_optimal {S Act : Type} [Countable S] (M : MDC S Act)
    (w : S → Act → ℝ) (hB : CostBounded M w) (n : ℕ) :
    (∀ (R : Policy M) (i : S), valueIter M w n i ≤ horizonCostR R w i n) ∧
      ∃ R : Policy M, ∀ i : S, horizonCostR R w i n = valueIter M w n i := by sorry

end DermanDenumerable.AvgCost
Source
Derman, Denumerable State Markovian Decision Processes—Average Cost Criterion, Ann. Math. Statist. 37(6) (1966), p. 1549, §3, gloss of (5) and proof of Theorem 1
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