Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1 — for finite state spaces some priority rule is optimal

Proved
TsitsiklisGittins.IndexTheorem.theorem2_1_priority_rule_optimal

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

bandit-algorithmsdynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the semi-Markov multi-armed bandit problem with n≥1n\ge1n≥1 bandits, discount rate β>0\beta>0β>0 and state spaces X1,…,Xn\mathcal X_1,\dots,\mathcal X_nX1​,…,Xn​. If each Xi\mathcal X_iXi​, i=1,…,ni=1,\dots,ni=1,…,n, is finite (and nonempty), then there exists a priority rule which is optimal:

∃ π priority rule with Jπ′(z)≤Jπ(z) for every policy π′ and every initial state z.\exists\,\pi\ \text{priority rule with}\ J_{\pi'}(z)\le J_\pi(z)\ \text{for every policy}\ \pi'\ \text{and every initial state}\ z .∃π priority rule with Jπ′​(z)≤Jπ​(z) for every policy π′ and every initial state z.

This is the paper's basic result; Theorem 2.2 refines it by identifying an optimal priority order through indices computed bandit by bandit.

Formalization Note Finiteness is the Fintype instance on each state type. A priority rule is a policy that, for some injective ranking of X\mathcal XX, always plays the bandit whose current state has the highest rank. Optimality is over stationary deterministic policies and for every initial joint state. Bandits are indexed by Fin n.

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

/-- Theorem 2.1 of Tsitsiklis (1994), p. 196: if each `𝒳ᵢ` is finite, there exists a priority
rule which is optimal. -/
theorem theorem2_1_priority_rule_optimal {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) :
    ∃ π : Policy n X, IsPriorityRule π ∧ B.IsOptimal π := by sorry

end TsitsiklisGittins.IndexTheorem
Source
Tsitsiklis, A Short Proof of the Gittins Index Theorem, Ann. Appl. Probab. 4 (1994), p. 196 (PDF p. 3), Theorem 2.1
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