Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, eq. (10) — Ut(I∩J)+Ut(I∪J)≤Ut(I)+Ut(J)U_t(I\cap J)+U_t(I\cup J)\le U_t(I)+U_t(J)Ut​(I∩J)+Ut​(I∪J)≤Ut​(I)+Ut​(J)

Proved
WeberGittins.Submodular.eq10_partial_sums_submodular

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

banditsgittins-indexinterleavingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1submodular

Let Hj=(Hj0,Hj1,… )H_j=(H_{j0},H_{j1},\dots)Hj​=(Hj0​,Hj1​,…), j∈{1,…,n}j\in\{1,\dots,n\}j∈{1,…,n}, be sequences of real numbers that are nonincreasing (Hj0≥Hj1≥⋯H_{j0}\ge H_{j1}\ge\cdotsHj0​≥Hj1​≥⋯) and nonnegative. For a set of bandits III and t≥0t\ge0t≥0, let Ut(I)U_t(I)Ut​(I) be the sum of the first ttt terms of the interleaving of the sequences HjH_jHj​, j∈Ij\in Ij∈I, into nonincreasing order (Ut(∅)=0U_t(\emptyset)=0Ut​(∅)=0). Then for all sets I,J⊆{1,…,n}I,J\subseteq\{1,\dots,n\}I,J⊆{1,…,n} and all t≥0t\ge0t≥0,

Ut(I∩J)+Ut(I∪J)≤Ut(I)+Ut(J).U_t(I\cap J)+U_t(I\cup J)\le U_t(I)+U_t(J).Ut​(I∩J)+Ut​(I∪J)≤Ut​(I)+Ut​(J).

This is inequality (10) in the proof of Weber's Theorem 4, stated for one fixed realisation of the bandits' state sequences, where Hjk=γjkH_{jk}=\gamma_{jk}Hjk​=γjk​ are the prevailing charges. It is a purely deterministic statement about sums of largest terms; summed against βt\beta^tβt and averaged over realisations it yields the submodularity of the optimal value.

Formalization Note Ut(I)U_t(I)Ut​(I) is partialInterleavedSum H I t, the largest sum of initial segments of total length ttt (equal to the interleaving sum for nonincreasing sequences). Nonnegativity of the sequences is Weber's standing assumption of nonnegative rewards (p. 1024), which makes the fair charges nonnegative; it is needed when I∩J=∅I\cap J=\emptysetI∩J=∅ (for t=1t=1t=1, I={a}I=\{a\}I={a}, J={b}J=\{b\}J={b} and Ha0=Hb0=−5H_{a0}=H_{b0}=-5Ha0​=Hb0​=−5, the left side is −5-5−5 and the right side −10-10−10).

Preamble
import Definitions.Def_WeberGittins_Submodular_PartialInterleavedSum
Formal statement
namespace WeberGittins.Submodular

/-- Weber (1992), proof of Theorem 4, eq. (10), p. 1030: for nonincreasing, nonnegative
prevailing-charge sequences `H j`, the partial interleaved sums are submodular in the set of
bandits: `U_t(I ∩ J) + U_t(I ∪ J) ≤ U_t(I) + U_t(J)` for all `t ≥ 0`. -/
theorem eq10_partial_sums_submodular {n : ℕ} (H : Fin n → ℕ → ℝ)
    (hanti : ∀ j, Antitone (H j)) (hnonneg : ∀ j k, 0 ≤ H j k)
    (I J : Finset (Fin n)) (t : ℕ) :
    partialInterleavedSum H (I ∩ J) t + partialInterleavedSum H (I ∪ J) t ≤
      partialInterleavedSum H I t + partialInterleavedSum H J t := by sorry

end WeberGittins.Submodular
Source
Weber, On the Gittins index for multiarmed bandits, Ann. Appl. Probab. 2 (1992), p. 1030, proof of Theorem 4, eq. (10)
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