(1.9), p. 749 — P(S̃_n ≥ x) ≤ e^{−hx}Ee^{hS̃_n} = e^{−hx}Π Ee^{hX̃_i} for h > 0
ProvedNagaevLD.FukNagaev.eq_1_9chernoff-boundlarge-deviationsmoment-generating-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be independent random variables, , , and let (equal to if , to otherwise) and be the truncated summands and their sum. Then for every ,
The first inequality is the exponential Chebyshev (Chernoff) bound; the equality uses the independence of the truncated summands. All exponential moments are finite because .
Formalization Note The two parts are stated as a conjunction. No integrability hypothesis is needed: .
Preamble
import Mathlib import Definitions.Def_NagaevLD_FukNagaev_Setting
Formal statement
namespace NagaevLD.FukNagaev
open MeasureTheory ProbabilityTheory
theorem eq_1_9 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
{n : ℕ} (X : Fin n → Ω → ℝ) (hmeas : ∀ i, Measurable (X i)) (hindep : iIndepFun X P)
(x : ℝ) (hx : 0 < x) (yv : Fin n → ℝ) (hyv : ∀ i, 0 < yv i)
(h : ℝ) (hh : 0 < h) :
P.real {ω | x ≤ St X yv ω} ≤ Real.exp (-h * x) * ∫ ω, Real.exp (h * St X yv ω) ∂P ∧
Real.exp (-h * x) * ∫ ω, Real.exp (h * St X yv ω) ∂P =
Real.exp (-h * x) * ∏ i, ∫ ω, Real.exp (h * Xt X yv i ω) ∂P := by sorry
end NagaevLD.FukNagaev
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), p. 749, proof of Theorem 1.3, (1.9)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.