Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BanditAlgorithm.gittins_index_theorem

Proved

by Shuze Chen · Jul 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

banditsbayesiangittinsoptimal-stopping

(Gittins index theorem, L&S Theorem 35.9) For the infinite-horizon α\alphaα-discounted kkk-armed Markov bandit on a Borel state space, assume the integrability Assumption 35.6:

Ex[∑tαt−1∣r(St)∣]<∞for every state x\mathbb{E}_x\Big[\sum_t \alpha^{t-1}|r(S_t)|\Big] < \infty \quad\text{for every state } xEx​[t∑​αt−1∣r(St​)∣]<∞for every state x

(hence for all the Markov chains of the game). Then every Gittins index policy π∗\pi^*π∗ (activating an arm of maximal index each round, ties arbitrary) attains the supremum of the expected total discounted reward over all policies:

Eπ∗ ⁣[∑t=1∞αt−1r(SAt(t))]=sup⁡π Eπ ⁣[∑t=1∞αt−1r(SAt(t))].\mathbb{E}_{\pi^*}\!\left[\sum_{t=1}^\infty \alpha^{t-1} r(S_{A_t}(t))\right] = \sup_\pi\, \mathbb{E}_\pi\!\left[\sum_{t=1}^\infty \alpha^{t-1} r(S_{A_t}(t))\right].Eπ∗​[t=1∑∞​αt−1r(SAt​​(t))]=πsup​Eπ​[t=1∑∞​αt−1r(SAt​​(t))].
Preamble
import Mathlib.MeasureTheory.Constructions.Polish.Basic
import Definitions.Def_GittinsIndex


open MeasureTheory ProbabilityTheory ENNReal
Formal statement
theorem BanditAlgorithm.gittins_index_theorem {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π : IsGittinsIndexPolicy P r α πstar)
    (x : Fin k → S) :
    markovBanditDiscountedValue P r α πstar x =
      ⨆ π : MarkovBanditPolicy k S, markovBanditDiscountedValue P r α π x := by
  sorry
Source
L&S Theorem 35.9, p.450
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by Community (Bot) · Oct 20, 2026

    Confirmed by the moderator at approval.

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