Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BanditAlgorithm.self_normalized_martingale_bound

Proved

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

concentrationlinear-banditsprobabilityself-normalized

(Self-normalized bound, method of mixtures, GOAL; L&S Theorem 20.4) With the setup above (Ft\mathcal{F}_tFt​-measurable actions At+1A_{t+1}At+1​, Ft+1\mathcal{F}_{t+1}Ft+1​-measurable conditionally 1-subgaussian noise ηt+1\eta_{t+1}ηt+1​), let

St=∑s=1tηsAsandVt(λ)=λI+∑s=1tAsAs⊤.S_t = \sum_{s=1}^t \eta_s A_s \quad\text{and}\quad V_t(\lambda) = \lambda I + \sum_{s=1}^t A_s A_s^\top.St​=s=1∑t​ηs​As​andVt​(λ)=λI+s=1∑t​As​As⊤​.

Then for all λ>0\lambda > 0λ>0 and δ∈(0,1)\delta \in (0,1)δ∈(0,1),

P(∃t∈N:∥St∥Vt(λ)−12≥2log⁡1δ+log⁡det⁡Vt(λ)λd)≤δ,\mathbb{P}\left(\exists t \in \mathbb{N} : \|S_t\|^2_{V_t(\lambda)^{-1}} \ge 2\log\frac{1}{\delta} + \log\frac{\det V_t(\lambda)}{\lambda^d}\right) \le \delta,P(∃t∈N:∥St​∥Vt​(λ)−12​≥2logδ1​+logλddetVt​(λ)​)≤δ,

uniformly over all times (the ∃t\exists t∃t is inside a single event).

Preamble
import Mathlib.Probability.Moments.SubGaussian
import Mathlib.Probability.Martingale.Basic
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Definitions.Def_SelfNormalizedProcess


open MeasureTheory ProbabilityTheory Matrix
Formal statement
theorem BanditAlgorithm.self_normalized_martingale_bound
    {Ω : Type} {mΩ : MeasurableSpace Ω} [StandardBorelSpace Ω]
    {P : Measure Ω} [IsProbabilityMeasure P]
    {d : ℕ} (ℱ : Filtration ℕ mΩ)
    (A : ℕ → Ω → Fin d → ℝ) (η : ℕ → Ω → ℝ)
    (hA : ∀ t : ℕ, Measurable[ℱ t] (A (t + 1)))
    (hη : ∀ t : ℕ, Measurable[ℱ (t + 1)] (η (t + 1)))
    (hsg : ∀ t : ℕ, HasCondSubgaussianMGF (ℱ t) (ℱ.le t) (η (t + 1)) 1 P)
    {lam : ℝ} (hlam : 0 < lam) {δ : ℝ} (hδ : δ ∈ Set.Ioo (0 : ℝ) 1) :
    P.real {ω | ∃ t : ℕ,
        2 * Real.log (1 / δ)
            + Real.log ((regularizedDesignMatrix d lam A t ω).det / lam ^ d)
          ≤ selfNormalizedSum d η A t ω ⬝ᵥ
              (regularizedDesignMatrix d lam A t ω)⁻¹ *ᵥ
                selfNormalizedSum d η A t ω} ≤ δ := by
  sorry
Source
L&S Theorem 20.4, p.260
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by iris · Nov 1, 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