LeanMachineLearning

Bandits.StreamMeasure.prob_sum_range_sub_le_le_of_HasSubgaussianMGF'🔗

Lemma

No docstring.

🔗theorem
Bandits.StreamMeasure.prob_sum_range_sub_le_le_of_HasSubgaussianMGF'.{u_1} {𝓐 : Type u_1} {m𝓐 : MeasurableSpace 𝓐} {ν : ProbabilityTheory.Kernel 𝓐 } [ProbabilityTheory.IsMarkovKernel ν] {n : } {a : 𝓐} {σ2 : NNReal} (hσ2 : 0 < σ2) (h : ProbabilityTheory.HasSubgaussianMGF (fun x => x - (x : ), id x ν a) σ2 (ν a)) {δ : } ( : 0 < δ) (hn : 0 < n) : (streamMeasure ν) {ω | k Finset.range n, (ω k a - (x : ), id x ν a) -(2 * n * σ2 * Real.log (1 / δ))} ENNReal.ofReal δ
Bandits.StreamMeasure.prob_sum_range_sub_le_le_of_HasSubgaussianMGF'.{u_1} {𝓐 : Type u_1} {m𝓐 : MeasurableSpace 𝓐} {ν : ProbabilityTheory.Kernel 𝓐 } [ProbabilityTheory.IsMarkovKernel ν] {n : } {a : 𝓐} {σ2 : NNReal} (hσ2 : 0 < σ2) (h : ProbabilityTheory.HasSubgaussianMGF (fun x => x - (x : ), id x ν a) σ2 (ν a)) {δ : } ( : 0 < δ) (hn : 0 < n) : (streamMeasure ν) {ω | k Finset.range n, (ω k a - (x : ), id x ν a) -(2 * n * σ2 * Real.log (1 / δ))} ENNReal.ofReal δ

Code

lemma prob_sum_range_sub_le_le_of_HasSubgaussianMGF' {σ2 : ℝ≥0} (hσ2 : 0 < σ2)
    (h : HasSubgaussianMGF (fun x ↦ x - (ν a)[id]) σ2 (ν a)) {δ : ℝ} (hδ : 0 < δ) (hn : 0 < n) :
    streamMeasure ν {ω | ∑ k ∈ range n, (ω k a - (ν a)[id]) ≤
      -√(2 * n * σ2 * Real.log (1 / δ))} ≤ ENNReal.ofReal δ
Proof
calc
  _ ≤ ENNReal.ofReal (Real.exp (-√(2 * n * σ2 * Real.log (1 / δ)) ^ 2 / (2 * n * σ2))) :=
    prob_sum_range_sub_le_le_of_HasSubgaussianMGF h (by positivity) n
  _ ≤ ENNReal.ofReal δ := by
    gcongr
    exact exp_neg_sqrt_sq_div_le hσ2 hδ hn

Actions: Source · Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23), the 3th recorded change.

Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file · open it in the Lean web editor.

Dependency graph

Audit surface: 1 project declarations, 64 external constants

✓ Proved: no sorry anywhere in its closure

This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.