Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.5: if ψ is strictly increasing the vigour bandit is indexable, and if W**(x) is strictly increasing its Whittle index is W**(x)

Proved
AllocationIndices.vigour_bandit_indexable

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

indexabilityrestless-banditswhittle-index

Theorem 6.5 (p. 159). (i) If ψ\psiψ is increasing, the bandit is indexable. (ii) If additionally W∗∗(x)=(r(x)[1−ψ(x)]−r(x+1)[1−ψ(x+1)])/(ψ(x+1)−ψ(x))W^{**}(x) = \big(r(x)[1 - \psi(x)] - r(x+1)[1 - \psi(x+1)]\big)/\big(\psi(x+1) - \psi(x)\big)W∗∗(x)=(r(x)[1−ψ(x)]−r(x+1)[1−ψ(x+1)])/(ψ(x+1)−ψ(x)) is increasing over 1≤x≤k1 \le x \le k1≤x≤k, then the bandit has Whittle index W(x)=W∗∗(x)W(x) = W^{**}(x)W(x)=W∗∗(x), 1≤x≤k1 \le x \le k1≤x≤k.

Formally, for the vigour bandit (active: down at rate ν(x)\nu(x)ν(x) earning r(x)r(x)r(x); passive: up at rate ρ(x)\rho(x)ρ(x) earning nothing; rates in [0,1][0, 1][0,1], ν(1)=ρ(k)=0\nu(1) = \rho(k) = 0ν(1)=ρ(k)=0; rrr increasing and nonnegative): if ψ(y)=ν(y)/(ν(y)+ρ(y−1))\psi(y) = \nu(y)/(\nu(y) + \rho(y-1))ψ(y)=ν(y)/(ν(y)+ρ(y−1)) is strictly increasing over the thresholds 0≤y≤k0 \le y \le k0≤y≤k (with ψ(0)=0\psi(0) = 0ψ(0)=0, ψ(k)=1\psi(k) = 1ψ(k)=1), the bandit is indexable; and if moreover W∗∗W^{**}W∗∗ is strictly increasing over the states, W(x)=W∗∗(x)W(x) = W^{**}(x)W(x)=W∗∗(x) for every state xxx. "Increasing" is read as strictly increasing, as in Theorem 6.4.

Preamble
import Definitions.Def_AllocationIndices_Restless

open MeasureTheory ProbabilityTheory BanditAlgorithm Finset
Formal statement
namespace AllocationIndices

/-- **Theorem 6.5** (p. 159). For the vigour bandit (active: down at rate `ν(x)` earning `r(x)`;
passive: up at rate `ρ(x)` earning nothing; `ν(1) = ρ(k) = 0`; `r` increasing and nonnegative):
(i) if `ψ(y) = ν(y)/(ν(y) + ρ(y−1))` is (strictly) increasing over the thresholds, the bandit is
indexable; (ii) if additionally `W**(x) = (r(x)(1−ψ(x)) − r(x+1)(1−ψ(x+1)))/(ψ(x+1) − ψ(x))` is
(strictly) increasing over the states, the bandit has Whittle index `W(x) = W**(x)`. -/
theorem vigour_bandit_indexable {k : ℕ} (nu rho r : Fin k → ℝ)
    (hnu : ∀ x, nu x ∈ Set.Icc (0 : ℝ) 1) (hrho : ∀ x, rho x ∈ Set.Icc (0 : ℝ) 1)
    (hnu_bot : ∀ x : Fin k, x.val = 0 → nu x = 0)
    (hrho_top : ∀ x : Fin k, x.val + 1 = k → rho x = 0)
    (hr : Monotone r) (hr0 : ∀ x, 0 ≤ r x)
    (hpsi : StrictMonoOn (vigourShare nu rho) (Set.Iic k)) :
    Indexable (vigourBandit nu rho r hnu hrho) ∧
    (StrictMono (vigourIndex nu rho r) →
      ∀ x, whittleIndex (vigourBandit nu rho r hnu hrho) x = vigourIndex nu rho r x) := by sorry

end AllocationIndices
Source
Gittins, Glazebrook and Weber, Multi-armed Bandit Allocation Indices, 2nd ed., Wiley 2011, doi:10.1002/9780470980033, §6.5 pp. 158-159, Theorem 6.5 (the bandit of Example 6.1; proof 'similar to the above', i.e. to Theorem 6.4)
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