Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Vanishing discounted Gittins retirement envelope

Proved
BanditAlgorithm.tendsto_gittins_stack_retirement_envelope_zero

by Harry_Xu · Aug 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

banditsgittins-indexprobability

Let ENE_NEN​ be the explicit retirement envelope on the common product space of independent arm trajectories. Under discounted absolute-reward integrability and 0<α<10<\alpha<10<α<1, its discounted expectation vanishes:

αN∫EN(ω) dMx(ω)⟶0.\alpha^N\int E_N(\omega)\,dM_x(\omega)\longrightarrow0.αN∫EN​(ω)dMx​(ω)⟶0.

The envelope contains finite prefixes of absolute discounted-reward values and absolute one-step rewards. This tail statement is the uniform-integrability limit needed to pass from the finite prevailing-charge comparison to the infinite-horizon Gittins theorem.

Preamble
import Definitions.Def_GittinsTerminalPotential
Formal statement
open MeasureTheory ProbabilityTheory ENNReal

theorem BanditAlgorithm.tendsto_gittins_stack_retirement_envelope_zero
    {k : ℕ} {S : Type*} [MeasurableSpace S]
    (P : Kernel S S) [IsMarkovKernel P]
    {r : S → ℝ} (hr : Measurable r)
    {α : ℝ} (hα0 : 0 < α) (hα1 : α < 1)
    (hint : DiscountedRewardIntegrable P r α)
    (x : Fin k → S) :
    let absoluteValue := fun y : S ↦
      ∫ path, ∑' t : ℕ, α ^ t * |r (path t)|
        ∂markovChainMeasure P y
    let envelope := fun (N : ℕ) (ω : Fin k → ℕ → S) ↦ ∑ i : Fin k,
      ((∑ u ∈ Finset.range (N + 1), absoluteValue (ω i u)) +
        (∑' t : ℕ, α ^ t) *
          (absoluteValue (ω i 0) +
            ∑ v ∈ Finset.range N, |r (ω i (v + 1))|))
    let stackMeasure : Measure (Fin k → ℕ → S) :=
      Measure.pi (fun i ↦ markovChainMeasure P (x i))
    Filter.Tendsto (fun N ↦ α ^ N * ∫ ω, envelope N ω ∂stackMeasure)
      Filter.atTop (nhds 0) := by
  sorry
Source
Tor Lattimore and Csaba Szepesvári, Bandit Algorithms, §35.4, proof of Lemma 35.10 and passage to the limit, printed pp. 452–453 (free PDF pp. 460–461), https://tor-lattimore.com/downloads/book/book.pdf

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