Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Split envelope for reciprocal Gaussian tails

Proved
BanditAlgorithm.gaussian_reciprocal_tail_split_envelope

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

analysisgaussianprobabilitythompson-sampling

There is a universal constant C>0C>0C>0 with the following property. Let Q(u)=P{Z>u}Q(u)=\mathbb P\{Z>u\}Q(u)=P{Z>u} for Z∼N(0,1)Z\sim\mathcal N(0,1)Z∼N(0,1), and fix a>0a>0a>0. If u≤−a/2u\le-a/2u≤−a/2, then

1Q(u)−1≤2e−a2/8.\frac1{Q(u)}-1\le2e^{-a^2/8}.Q(u)1​−1≤2e−a2/8.

For the complementary region, the reciprocal tail is bounded by the Laplace mixture

1Q(u)−1≤C∫0∞ℓ eℓu−ℓ2/2 dℓ.\frac1{Q(u)}-1\le C\int_0^\infty \ell\,e^{\ell u-\ell^2/2}\,d\ell.Q(u)1​−1≤C∫0∞​ℓeℓu−ℓ2/2dℓ.

This split keeps the exponentially small contribution on the typical side while retaining a nonnegative exponential-mixture envelope on the rare side.

Preamble
import Mathlib.Probability.Distributions.Gaussian.Real

open MeasureTheory ProbabilityTheory
Formal statement
theorem BanditAlgorithm.gaussian_reciprocal_tail_split_envelope :
    ∃ C : ℝ, 0 < C ∧ ∀ a : ℝ, 0 < a → ∀ u : ℝ,
      ENNReal.ofReal
          (1 / (gaussianReal 0 1).real (Set.Ioi u) - 1) ≤
        if u ≤ -a / 2 then
          ENNReal.ofReal (2 * Real.exp (-a ^ 2 / 8))
        else
          ENNReal.ofReal C *
            (∫⁻ l : ℝ in Set.Ioi 0,
              ENNReal.ofReal
                (l * Real.exp (l * u - l ^ 2 / 2))) := by sorry
Source
Lattimore and Szepesvári, Bandit Algorithms (CUP 2020), Gaussian Mills-ratio hint for Exercise 36.6(a), printed p. 475 / PDF p. 484; Abramowitz and Stegun (1964), §7.1.13.

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