Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Relation (21) — F̂ ≥ LᵢF̂, with equality if M ≤ Mᵢ and M₍ᵢ₎ ≤ Mᵢ

Proved
WhittleGittins.Retirement.relation21_L_le

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

bandit-algorithmsdynamic-programminggittins-indexp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In Whittle's bandit process with per-project horizons sss, let F^(x,s,M)\hat F(x, s, M)F^(x,s,M) be defined by (13), and let

LiF^(x,s,M)=Ri(xi)+β E[F^(x(t+1),Dis,M)∣x(t)=x, i(t)=i]L_i\hat F(x, s, M) = R_i(x_i) + \beta\, \mathbb E\big[\hat F(x(t+1), D_i s, M) \mid x(t) = x,\ i(t) = i\big]Li​F^(x,s,M)=Ri​(xi​)+βE[F^(x(t+1),Di​s,M)∣x(t)=x, i(t)=i]

be the extended operator (15), where DisD_i sDi​s lowers sis_isi​ by one. Let Mj=Mj(xj,sj)M_j = M_j(x_j, s_j)Mj​=Mj​(xj​,sj​) be the index of project jjj, and M(i)=max⁡j≠iMjM_{(i)} = \max_{j \ne i} M_jM(i)​=maxj=i​Mj​ over the other active projects. Then for every project iii with si>0s_i > 0si​>0,

F^≥LiF^,(21)\hat F \ge L_i \hat F, \qquad (21)F^≥Li​F^,(21)

with equality if M≤MiM \le M_iM≤Mi​ and M(i)≤MiM_{(i)} \le M_iM(i)​≤Mi​, that is, if Mi=max⁡jMj≥MM_i = \max_j M_j \ge MMi​=maxj​Mj​≥M.

Relation (21) shows that engaging a project of maximal index is optimal in the dynamic programming equation (16) satisfied by F^\hat FF^.

Formalization Note The inequality is stated for active projects (si>0s_i > 0si​>0) only, since an exhausted project cannot be engaged. The condition M(i)≤MiM_{(i)} \le M_iM(i)​≤Mi​ is written as Mj≤MiM_j \le M_iMj​≤Mi​ for every other active project jjj. Projects are indexed by Fin N.

Preamble
import Mathlib
import Definitions.Def_WhittleGittins_Retirement_BanditProcess
Formal statement
namespace WhittleGittins.Retirement

open MeasureTheory ProbabilityTheory

/-- Relation (21) (p. 148): for every active project `i`, `F̂ ≥ Lᵢ F̂`, with equality if
`M ≤ Mᵢ` and `M₍ᵢ₎ ≤ Mᵢ` (i.e. `Mᵢ` is maximal among the indices of the active projects). -/
theorem relation21_L_le {N : ℕ} {X : Fin N → Type*} [∀ i, MeasurableSpace (X i)]
    (B : BanditProcess N X) (x : ∀ j, X j) (s : Fin N → ℕ) (M : ℝ) (i : Fin N) (hi : 0 < s i) :
    LFhat B i x s M ≤ Fhat B x s M ∧
      (M ≤ index B i (x i) (s i) →
        (∀ j, j ≠ i → 0 < s j → index B j (x j) (s j) ≤ index B i (x i) (s i)) →
        LFhat B i x s M = Fhat B x s M) := by sorry

end WhittleGittins.Retirement
Source
Whittle, Multi-armed Bandits and the Gittins Index, J. R. Statist. Soc. B 42 (1980), p. 148 (PDF 6), Section 4, relation (21)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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