Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BanditAlgorithm.linear_bandit_mixture_supermartingale

Proved

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

linear-banditsmartingaleprobability

(Supermartingale property, L&S Lemmas 20.2 and 20.3) On a standard Borel probability space with filtration F\mathcal{F}F, let the actions At+1:Ω→RdA_{t+1} : \Omega \to \mathbb{R}^dAt+1​:Ω→Rd be Ft\mathcal{F}_tFt​-measurable and the noise ηt+1\eta_{t+1}ηt+1​ be Ft+1\mathcal{F}_{t+1}Ft+1​-measurable and conditionally 1-subgaussian given Ft\mathcal{F}_tFt​ (Eq. 20.4:

E[exp⁡(α ηt+1)∣Ft]≤exp⁡(α2/2) a.s. for all α;\mathbb{E}[\exp(\alpha\,\eta_{t+1}) \mid \mathcal{F}_t] \le \exp(\alpha^2/2) \ \text{a.s. for all } \alpha;E[exp(αηt+1​)∣Ft​]≤exp(α2/2) a.s. for all α;

Mathlib's HasCondSubgaussianMGF with c=1c = 1c=1). Fix λ≥0\lambda \ge 0λ≥0 and let

Mt(x)=exp⁡(⟨x,St⟩−12∥x∥Vt(λ)2).M_t(x) = \exp\Big(\langle x, S_t\rangle - \tfrac{1}{2}\|x\|^2_{V_t(\lambda)}\Big).Mt​(x)=exp(⟨x,St​⟩−21​∥x∥Vt​(λ)2​).

Then:

  • (i) for every x∈Rdx \in \mathbb{R}^dx∈Rd, (Mt(x))t(M_t(x))_t(Mt​(x))t​ is a nonnegative F\mathcal{F}F-supermartingale with M0(x)=exp⁡(−λ∥x∥2/2)≤1M_0(x) = \exp(-\lambda\|x\|^2/2) \le 1M0​(x)=exp(−λ∥x∥2/2)≤1;
  • (ii) for every probability measure hhh on Rd\mathbb{R}^dRd under which the mixture integrals x↦Mt(x)(ω)x \mapsto M_t(x)(\omega)x↦Mt​(x)(ω) are hhh-integrable, the mixture Mˉt=∫Mt(x) dh(x)\bar M_t = \int M_t(x)\,dh(x)Mˉt​=∫Mt​(x)dh(x) is a nonnegative F\mathcal{F}F-supermartingale with Mˉ0≤1\bar M_0 \le 1Mˉ0​≤1, and Mˉ0=1\bar M_0 = 1Mˉ0​=1 in the unregularized case λ=0\lambda = 0λ=0 treated by the book.
Preamble
import Mathlib.Probability.Moments.SubGaussian
import Mathlib.Probability.Martingale.Basic
import Definitions.Def_SelfNormalizedProcess


open MeasureTheory ProbabilityTheory Matrix
Formal statement
theorem BanditAlgorithm.linear_bandit_mixture_supermartingale
    {Ω : 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 : Measure (Fin d → ℝ)) [IsProbabilityMeasure h]
    (hInt : ∀ (t : ℕ) (ω : Ω),
      Integrable (fun x => selfNormalizedProcess d lam η A x t ω) h) :
    (∀ x : Fin d → ℝ,
      Supermartingale (selfNormalizedProcess d lam η A x) ℱ P ∧
        ∀ ω : Ω, selfNormalizedProcess d lam η A x 0 ω ≤ 1) ∧
    Supermartingale
      (fun (t : ℕ) (ω : Ω) => ∫ x, selfNormalizedProcess d lam η A x t ω ∂h) ℱ P ∧
    (∀ ω : Ω, (∫ x, selfNormalizedProcess d lam η A x 0 ω ∂h) ≤ 1) ∧
    (lam = 0 → ∀ ω : Ω, (∫ x, selfNormalizedProcess d lam η A x 0 ω ∂h) = 1) := by
  sorry
Source
L&S Lemmas 20.2 (p.257) and 20.3 (p.259)

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