(1.8), p. 749 — P(S_n ≥ x) ≤ P(S̃_n ≥ x) + Σ P(X_i > y_i)
ProvedNagaevLD.FukNagaev.eq_1_8large-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1truncation
Let be independent random variables, , and . Let if and otherwise, and . Then
This is the truncation step of the proof of the Fuk–Nagaev inequality: it reduces the tail of to the tail of a sum of summands bounded above by , at the cost of the probabilities that some summand exceeds its level.
Formalization Note Indices run over Fin n. The standing assumptions of the paper (independence, measurability, , ) are kept as hypotheses although the inequality does not need them.
Preamble
import Mathlib import Definitions.Def_NagaevLD_FukNagaev_Setting
Formal statement
namespace NagaevLD.FukNagaev
open MeasureTheory ProbabilityTheory
theorem eq_1_8 {Ω : 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) :
P.real {ω | x ≤ S n X ω} ≤
P.real {ω | x ≤ St X yv ω} + ∑ i, P.real {ω | yv i < X i ω} := 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.8)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.