Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite prevailing-charge comparison for a Gittins policy

Proved
BanditAlgorithm.gittins_finite_prevailing_charge_interleaving

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

banditsgittins-indexinterleavingprobability

Let π∗\pi^*π∗ be a Gittins-index policy in a finite-armed rested Markov bandit. For every competing policy π\piπ and finite horizon NNN, the expected discounted prevailing-charge value of π\piπ is at most that of π∗\pi^*π∗:

CNπ≤CNπ∗.C_N^\pi\le C_N^{\pi^*}.CNπ​≤CNπ∗​.

This is the finite probabilistic form of Part 2 of the Gittins proof. It combines the common independent reward-stack coupling with the deterministic fact that greedily interleaving nonincreasing charge stacks maximizes every discounted finite prefix.

Formalization Note The statement exposes only the finite charge-value interface; reward-stack sample spaces and action likelihoods remain internal proof machinery.

Preamble
import Definitions.Def_GittinsPrevailingChargeValue

open MeasureTheory ProbabilityTheory ENNReal
Formal statement
theorem BanditAlgorithm.gittins_finite_prevailing_charge_interleaving
    {k : ℕ} {S : Type*} [MeasurableSpace S]
    [StandardBorelSpace S]
    (P : Kernel S S) [IsMarkovKernel P]
    {r : S → ℝ} (hr : Measurable r)
    {α : ℝ} (hα0 : 0 < α) (hα1 : α < 1)
    (hint : DiscountedRewardIntegrable P r α)
    (π πstar : MarkovBanditPolicy k S)
    (hπstar : IsGittinsIndexPolicy P r α πstar)
    (x : Fin k → S) (N : ℕ) :
    markovBanditFinitePrevailingChargeValue P r α π x N ≤
      markovBanditFinitePrevailingChargeValue P r α πstar x N := by
  sorry
Source
Tor Lattimore and Csaba Szepesvári, Bandit Algorithms (free online edition), https://tor-lattimore.com/downloads/book/book.pdf, §35.4, proof of Theorem 35.9, Part 2, printed pp. 452–453 / PDF pp. 460–461, using Lemma 35.10 on printed p. 451 / PDF p. 459.

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