Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite prevailing-charge accounting identities

Proved
BanditAlgorithm.gittins_finite_prevailing_charge_accounting

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

banditsgittins-indexoptimal-stoppingprobability

Under discounted absolute-reward integrability, compare finite reward and prevailing charge over a horizon NNN. For every policy π\piπ, finite discounted reward is at most its finite discounted prevailing-charge value. If π∗\pi^*π∗ is a Gittins-index policy, its charge accounting is exact up to the terminal retirement potential:

RNπ≤CNπ,CNπ∗=RNπ∗+αNUNπ∗.R_N^\pi\le C_N^\pi, \qquad C_N^{\pi^*}=R_N^{\pi^*}+\alpha^N U_N^{\pi^*}.RNπ​≤CNπ​,CNπ∗​=RNπ∗​+αNUNπ∗​.

This is Part 1 of the prevailing-charge proof and is reusable independently of the greedy interleaving argument.

Formalization Note Both assertions are bundled so the arbitrary-policy Bellman inequality and the fair-charge identity share the same horizon and initial state.

Preamble
import Definitions.Def_GittinsPrevailingChargeValue

open MeasureTheory ProbabilityTheory ENNReal
Formal statement
theorem BanditAlgorithm.gittins_finite_prevailing_charge_accounting
    {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 : ℕ) :
    (∑ n ∈ Finset.range N,
        α ^ n * markovBanditRoundReward P r π x n) ≤
        markovBanditFinitePrevailingChargeValue P r α π x N ∧
      markovBanditFinitePrevailingChargeValue P r α πstar x N =
        (∑ n ∈ Finset.range N,
          α ^ n * markovBanditRoundReward P r πstar x n) +
        α ^ N * markovBanditExpectedRetirementPotential
          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 1 “Prevailing Charge”, printed pp. 451–452 / PDF pp. 459–460.

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