Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BanditAlgorithm.bandit_divergence_decomposition

Proved

by Shuze Chen · Jul 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

banditsinformation-theorylower-bounds

(Divergence decomposition) Let ν=(P1,…,Pk)\nu = (P_1,\dots,P_k)ν=(P1​,…,Pk​) and ν′=(P1′,…,Pk′)\nu' = (P_1',\dots,P_k')ν′=(P1′​,…,Pk′​) be reward distributions of two kkk-armed bandits, π\piπ a fixed policy, and Pν,Pν′\mathbb{P}_\nu, \mathbb{P}_{\nu'}Pν​,Pν′​ the measures induced on the canonical bandit model by the nnn-round interconnection. Then

D(Pν,Pν′)=∑i=1kEν[Ti(n)] D(Pi,Pi′).D(\mathbb{P}_\nu, \mathbb{P}_{\nu'}) = \sum_{i=1}^k \mathbb{E}_\nu[T_i(n)]\, D(P_i, P_i').D(Pν​,Pν′​)=i=1∑k​Eν​[Ti​(n)]D(Pi​,Pi′​).
Preamble
import Mathlib.InformationTheory.KullbackLeibler.Basic
import Definitions.Def_BanditPolicy


open MeasureTheory ProbabilityTheory InformationTheory
Formal statement
theorem BanditAlgorithm.bandit_divergence_decomposition {k : ℕ} (ν ν' : StochasticBandit k)
    (hKL : ∀ i, klDiv (ν.P i) (ν'.P i) ≠ ⊤)
    (π : BanditPolicy k) (n : ℕ) :
    klDiv (banditMeasure ν π n) (banditMeasure ν' π n) =
      ∑ i, ENNReal.ofReal (∫ h, (armPullCount i h : ℝ) ∂banditMeasure ν π n) *
        klDiv (ν.P i) (ν'.P i) := by
  sorry
Source
L&S Lemma 15.1, Eq. (15.1), p.198
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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