Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (2.5): the Gittins index is the greatest prevailing charge under which continuing for one or more periods is not a loss

Proved
AllocationIndices.fair_charge_characterization

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

fair-chargegittins-indexoptimal-stopping

Eq. (2.5). ν(B,x)=sup⁡{λ:sup⁡τ>0E[∑t=0τ−1at[r(x(t))−λ] ∣ x(0)=x]≥0}\nu(B, x) = \sup\big\{\lambda : \sup_{\tau > 0} \mathbb{E}\big[\sum_{t=0}^{\tau-1} a^t [r(x(t)) - \lambda] \,\big|\, x(0) = x\big] \ge 0\big\}ν(B,x)=sup{λ:supτ>0​E[∑t=0τ−1​at[r(x(t))−λ]​x(0)=x]≥0}: the index is the greatest rent one would be willing to pay per period for ownership of the rewards arising from the bandit while it is continued for one or more periods.

Formally: for a bandit process on a countable state space with bounded reward and a∈(0,1)a \in (0,1)a∈(0,1), for every state xxx,

ν(B,x)=sup⁡{λ∈R:0≤sup⁡τ>0(Rτ(B,x)−λWτ(B,x))},\nu(B, x) = \sup\{\lambda \in \mathbb{R} : 0 \le \sup_{\tau > 0}(R_\tau(B, x) - \lambda W_\tau(B, x))\},ν(B,x)=sup{λ∈R:0≤τ>0sup​(Rτ​(B,x)−λWτ​(B,x))},

where the inner supremum is over all stopping times τ≥1\tau \ge 1τ≥1 and ν(B,x)\nu(B, x)ν(B,x) is the index (2.6) of the Bandit Algorithms model. The set on the right is nonempty (λ=−sup⁡∣r∣\lambda = -\sup|r|λ=−sup∣r∣ works with τ=1\tau = 1τ=1) and bounded above by sup⁡∣r∣\sup|r|sup∣r∣, so the real supremum is genuine.

Preamble
import Definitions.Def_AllocationIndices_Index

open MeasureTheory ProbabilityTheory BanditAlgorithm
Formal statement
namespace AllocationIndices

theorem fair_charge_characterization {S : Type*} [MeasurableSpace S] [Countable S]
    [MeasurableSingletonClass S] (P : Kernel S S) [IsMarkovKernel P] {r : S → ℝ}
    (hr : BoundedReward r) {a : ℝ} (ha0 : 0 < a) (ha1 : a < 1) (x : S) :
    gittinsIndex P r a x = sSup {lam : ℝ | 0 ≤ fairChargeProfit P r a x lam} := by sorry

end AllocationIndices
Source
Gittins, Glazebrook and Weber, Multi-armed Bandit Allocation Indices, 2nd ed., Wiley 2011, doi:10.1002/9780470980033, §2.5 p. 25, Eq. (2.5), and the fair-charge interpretation in the proof of Theorem 2.1 (p. 27)
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).

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