Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A state x can be picked before y by the index algorithm if and only if γ(x) ≥ γ(y)

Proved
TsitsiklisGittins.IndexTheorem.picked_before_iff_index_ge

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

bandit-algorithmsgittins-indexp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the semi-Markov multi-armed bandit problem with finite nonempty state spaces, and let γ\gammaγ be the indices produced by a run of the index algorithm. For distinct states x,y∈Xx,y\in\mathcal Xx,y∈X,

γ(x)≥γ(y)  ⟺  x is picked before y in some run of the index algorithm that yields the same indices γ.\gamma(x)\ge\gamma(y)\iff x\ \text{is picked before}\ y\ \text{in some run of the index algorithm that yields the same indices}\ \gamma .γ(x)≥γ(y)⟺x is picked before y in some run of the index algorithm that yields the same indices γ.

"Can be picked" refers to the freedom in step (a) of the algorithm when several states attain the maximal rate. Combined with the optimality of the picking orders, it shows that every priority order compatible with the indices is optimal (Theorem 2.2).

Formalization Note The runs on the right-hand side are required to produce the same index function γ\gammaγ on all of X\mathcal XX, which is the reading under which the claim yields Theorem 2.2; ties in γ\gammaγ are allowed.

Preamble
import Mathlib
import Definitions.Def_TsitsiklisGittins_IndexTheorem_IndexRun
Formal statement
namespace TsitsiklisGittins.IndexTheorem

/-- Proof of Theorem 2.2 of Tsitsiklis (1994), p. 198: given the indices `γ` of a run of the index
algorithm, a state `x` can be picked before a state `y` by the index algorithm (in some run that
yields the same indices `γ`) if and only if `γ(x) ≥ γ(y)`. -/
theorem picked_before_iff_index_ge {n : ℕ} [NeZero n] {X : Fin n → Type} [∀ i, Fintype (X i)] [∀ i, DecidableEq (X i)]
    [∀ i, Nonempty (X i)] [∀ i, MeasurableSpace (X i)] [∀ i, MeasurableSingletonClass (X i)]
    (B : SemiMarkovBandit n X)
    (seq : List (Σ i, X i)) (γ : (Σ i, X i) → ℝ) (hrun : B.IsIndexRun seq γ)
    (x y : Σ i, X i) (hxy : x ≠ y) :
    γ y ≤ γ x ↔ ∃ seq' : List (Σ i, X i), B.IsIndexRun seq' γ ∧ seq'.idxOf x < seq'.idxOf y := by sorry

end TsitsiklisGittins.IndexTheorem
Source
Tsitsiklis, A Short Proof of the Gittins Index Theorem, Ann. Appl. Probab. 4 (1994), p. 198 (PDF p. 5), Section 2, proof of Theorem 2.2, second sentence
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