Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (2.2), p. 7 — bound on the elimination round

Proved
BanditCovariates.SE.bound_2_2

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

multi-armed-banditp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitysuccessive-elimination

For a gap 0<Δ≤10<\Delta\le10<Δ≤1, γ≥1\gamma\ge1γ≥1, and integer T≥1T\ge1T≥1, let τ\tauτ be the first positive integer round at which (3/2)γU(τ,T)≤Δ(3/2)\gamma U(\tau,T)\le\Delta(3/2)γU(τ,T)≤Δ. Then

τ≤19γ2Δ2log⁡‾ ⁣(TΔ218γ2).\tau\le\frac{19\gamma^2}{\Delta^2}\overline{\log}\!\left(\frac{T\Delta^2}{18\gamma^2}\right).τ≤Δ219γ2​log​(18γ2TΔ2​).

This deterministic estimate limits how long a suboptimal arm can remain active on the good event.

Formalization Note The paper defines τ\tauτ as the ceiling of the positive real solution of the corresponding equality. The least-integer formulation gives that ceiling. The upper bound Δ≤1\Delta\le1Δ≤1 follows from rewards in [0,1][0,1][0,1].

Preamble
import Mathlib
import Definitions.Def_BanditCovariates_SE_Setting
Formal statement
namespace BanditCovariates.SE

/-- Equation (2.2), p. 7: the deterministic stopping-round upper bound. -/
theorem bound_2_2 (T : ℕ) (hT : 1 ≤ T) (γ Δ : ℝ)
    (hγ : 1 ≤ γ) (hΔ : 0 < Δ) (hΔ1 : Δ ≤ 1) :
    (stoppingRound T γ Δ : ℝ) ≤
      (19 * γ ^ 2 / Δ ^ 2) * logbar ((T : ℝ) * Δ ^ 2 / (18 * γ ^ 2)) := by sorry

end BanditCovariates.SE
Source
Perchet, Rigollet, The multi-armed bandit problem with covariates, arXiv:1110.6084v3, p. 7, (2.2) and its preceding definition of τ_i
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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