Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Regularity of the finite Gittins terminal potential

Proved
BanditAlgorithm.gittins_terminal_potential_regular

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

banditsgittins-indexprobability

For a measurable reward function and discount factor 0<α<10<\alpha<10<α<1, assume discounted absolute rewards are integrable. Then, at every finite horizon nnn, the sum of the arms' current Gittins retirement values is a measurable function of the bandit history and is integrable under the history law generated by every Markov bandit policy and initial state vector.

h⟼Un(h)=∑i=1kVγi(n)(Xi(n))is measurable and integrable.h\longmapsto U_n(h)=\sum_{i=1}^k V_{\gamma_i(n)}(X_i(n)) \quad\text{is measurable and integrable.}h⟼Un​(h)=i=1∑k​Vγi​(n)​(Xi​(n))is measurable and integrable.

This regularity theorem is the measure-theoretic interface required to take expectations of the terminal potential and to transport those expectations through common-stack couplings.

Preamble
import Definitions.Def_GittinsTerminalPotential
Formal statement
open MeasureTheory ProbabilityTheory ENNReal

theorem BanditAlgorithm.gittins_terminal_potential_regular
    {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 α) :
    ∀ n : ℕ,
      Measurable (currentGittinsRetirementPotential P r α :
        MarkovBanditHistory k S n → ℝ) ∧
      ∀ (π : MarkovBanditPolicy k S) (x : Fin k → S),
        Integrable (currentGittinsRetirementPotential P r α)
          (markovBanditMeasure P π x n) := by
  sorry
Source
Tor Lattimore and Csaba Szepesvári, Bandit Algorithms, Assumption 35.6 and §35.4 proof of Lemma 35.10, printed pp. 447 and 452–453 (free PDF pp. 455 and 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