Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 33.10: Sequential Halving with L phases

Proved
BanditAlgorithm.best_arm_identification_sequential_halving_clog

by Harry_Xu · Aug 2, 2026 · Mathlib c5ea003 (Lean v4.30.0)

banditsbest-arm-identificationpure-explorationsequential-halving

Let L=⌈log⁡2k⌉L=\lceil\log_2 k\rceilL=⌈log2​k⌉. For a sorted kkk-armed 1-subgaussian bandit, suppose n≥kLn\ge kLn≥kL and H2H_2H2​ bounds (i+1)/Δi2(i+1)/\Delta_i^2(i+1)/Δi2​ for every suboptimal arm. Any policy and recommendation rule implementing Sequential Halving satisfies

P(ΔAn+1>0)≤3Lexp⁡ ⁣(−n16H2L).\mathbb P(\Delta_{A_{n+1}}>0)\le 3L\exp\!\left(-\frac{n}{16H_2L}\right).P(ΔAn+1​​>0)≤3Lexp(−16H2​Ln​).

This uses the exact natural-number phase count in Algorithm 22 rather than the real-valued logb expression.

Preamble
import Definitions.Def_SequentialHalving

open MeasureTheory
Formal statement
theorem BanditAlgorithm.best_arm_identification_sequential_halving_clog {k n : ℕ}
    (ν : StochasticBandit k) (hν : IsSubgaussianBandit 1 ν)
    (hsorted : ∀ i j : Fin k, i ≤ j → banditArmMean ν j ≤ banditArmMean ν i)
    (hn : k * Nat.clog 2 k ≤ n) (H₂ : ℝ)
    (hH₂ : ∀ i : Fin k, 0 < banditGap ν i →
      ((i : ℕ) + 1 : ℝ) / banditGap ν i ^ 2 ≤ H₂)
    (π : BanditPolicy k) (rec : BanditHistory k n → Fin k)
    (hπ : IsSequentialHalvingPolicy k n π rec) :
    (banditMeasure ν π n).real {h | 0 < banditGap ν (rec h)} ≤
      3 * (Nat.clog 2 k : ℝ) *
        Real.exp (-(n / (16 * H₂ * (Nat.clog 2 k : ℝ)))) := by
  sorry
Source
Lattimore and Szepesvari, Bandit Algorithms (2020), Theorem 33.10 p. 412 and Exercise 33.8 pp. 419-420; L is formalized as Nat.clog 2 k.

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