Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.4: for a target process in a favourable state, the Gittins index equals the current probability of success

Proved
AllocationIndices.favourable_index_eq_cps

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

favourable-priorsgittins-indextarget-processes

Proposition 7.4. If SSS is a target process and the probability density π\piπ for the parameter θ\thetaθ is favourable, then ν(S,π)=r(S,π)\nu(S, \pi) = r(S, \pi)ν(S,π)=r(S,π).

Formally: for a conjugate sampling model, a target TTT, a state ppp that is favourable for TTT (along every finite sequence of observations below TTT the current probability of success never exceeds its value at ppp) and a∈(0,1)a \in (0, 1)a∈(0,1), the Gittins index of the target process in the state ppp equals its current probability of success f([T,∞)∣p)f([T, \infty) \mid p)f([T,∞)∣p).

Preamble
import Definitions.Def_AllocationIndices_Sampling

open MeasureTheory ProbabilityTheory BanditAlgorithm
Formal statement
namespace AllocationIndices

/-- **Proposition 7.4** (p. 181). If `S` is a target process and the probability density `π` for
the parameter `θ` is favourable, then `ν(S, π) = r(S, π)`: the Gittins index of the target
process in a favourable state equals its current probability of success. -/
theorem favourable_index_eq_cps {Θ P : Type*} [MeasurableSpace Θ] [StandardBorelSpace Θ]
    [Nonempty Θ] [MeasurableSpace P] (F : SamplingModel Θ P) (hconj : F.IsConjugate) (T : ℝ)
    (p : P) (hfav : F.IsFavourable T p) {a : ℝ} (ha0 : 0 < a) (ha1 : a < 1) :
    gittinsIndex (F.targetChain T) (F.targetReward T) a (Sum.inl p) =
      F.targetReward T (Sum.inl p) := by sorry

end AllocationIndices
Source
Gittins, Glazebrook and Weber, Multi-armed Bandit Allocation Indices, 2nd ed., Wiley 2011, doi:10.1002/9780470980033, §7.3 p. 181, Proposition 7.4 (from Proposition 2.7)
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