Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-horizon Gittins retirement values are monotone in the horizon

Proved
BanditAlgorithm.gittinsFiniteRetirementValue_mono_of_integrable

by Harry_Xu · Jul 31, 2026 · Mathlib c5ea003 (Lean v4.30.0)

banditsdynamic-programminggittins-indexoptimal-stopping

Consider the finite-horizon value functions for a discounted one-armed retirement game. At horizon zero the value is zero, while at horizon n+1n+1n+1 the player chooses between retiring for zero and playing once for reward r(x)−γr(x)-\gammar(x)−γ followed by the discounted continuation value at horizon nnn.

Assume α≥0\alpha\ge 0α≥0 and that every finite-horizon continuation value is integrable against every transition measure P(x,⋅)P(x,\cdot)P(x,⋅). Then extending the available horizon cannot decrease the value:

Vnγ(x)≤Vn+1γ(x)for every n≥0 and state x.V_n^{\gamma}(x)\le V_{n+1}^{\gamma}(x) \qquad\text{for every }n\ge0\text{ and state }x.Vnγ​(x)≤Vn+1γ​(x)for every n≥0 and state x.

This is the monotonicity input used to pass from finite-horizon dynamic programming to the infinite-horizon Wald--Bellman equation for the discounted retirement problem.

Preamble
import Definitions.Def_GittinsFiniteRetirementValue

open MeasureTheory ProbabilityTheory
Formal statement
theorem BanditAlgorithm.gittinsFiniteRetirementValue_mono_of_integrable
    {S : Type*} [MeasurableSpace S]
    (P : Kernel S S) (r : S → ℝ) (α γ : ℝ) (hα0 : 0 ≤ α)
    (hint : ∀ n x, Integrable (gittinsFiniteRetirementValue P r α γ n) (P x)) :
    ∀ n x,
      gittinsFiniteRetirementValue P r α γ n x ≤
        gittinsFiniteRetirementValue P r α γ (n + 1) x := by
  sorry
Source
Lattimore and Szepesvari, Bandit Algorithms (Cambridge University Press, 2020), printed p. 442, Theorem 35.3 (finite-horizon approximation underlying the infinite-horizon Wald--Bellman equation), and printed p. 449, Lemma 35.7(a).

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