Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-horizon information-ratio cumulative bound

Proved
BanditAlgorithm.information_ratio_cumulative_bound

by Harry_Xu · Jul 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

banditsinequalitiesinformation-theoryprobability

Let nnn be a finite horizon. For every round ttt, let δt≥0\delta_t\ge 0δt​≥0 be an instantaneous regret and let It≥0I_t\ge 0It​≥0 be the corresponding information gain. Suppose Γ,H≥0\Gamma,H\ge 0Γ,H≥0, the pointwise information-ratio inequalities

δt2≤ΓIt\delta_t^2\le \Gamma I_tδt2​≤ΓIt​

hold for all ttt, and the total information satisfies ∑t=1nIt≤H\sum_{t=1}^n I_t\le H∑t=1n​It​≤H. Then

∑t=1nδt≤nΓH.\sum_{t=1}^n \delta_t\le \sqrt{n\Gamma H}.t=1∑n​δt​≤nΓH​.

This is the reusable finite-sum Cauchy--Schwarz step in the information-ratio method for Bayesian regret.

Preamble
import Mathlib.Analysis.InnerProductSpace.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real

open scoped BigOperators
Formal statement
theorem BanditAlgorithm.information_ratio_cumulative_bound {n : ℕ}
    (δ info : Fin n → ℝ) (Γ H : ℝ)
    (hδ : ∀ t, 0 ≤ δ t) (hinfo : ∀ t, 0 ≤ info t)
    (hΓ : 0 ≤ Γ) (hH : 0 ≤ H)
    (hpoint : ∀ t, δ t ^ 2 ≤ Γ * info t)
    (hsum : ∑ t, info t ≤ H) :
    ∑ t, δ t ≤ Real.sqrt (n * Γ * H) := by
  sorry
Source
Lattimore and Szepesvari, Bandit Algorithms (CUP 2020), Theorem 36.6, printed pp. 470-471, especially the Cauchy-Schwarz calculation in Eq. (36.10).

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