pp. 751–752 — under (1.6), P(S̃_n ≥ x) < P₄
ProvedNagaevLD.FukNagaev.p4_casefuk-nagaev-inequalitylarge-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
In the setting of (1.19), suppose instead that condition (1.6) holds:
Then
This is the polynomial-type bound for the truncated sum; with (1.8) it gives (1.7). The page proves it in the two sub-cases (taking in (1.18)) and (taking in (1.17)).
Formalization Note Condition (1.6) is cond_1_6, which requires , as the page's (1.6) does implicitly (for its left side is ). Finiteness of is assumed summand by summand.
Preamble
import Mathlib import Definitions.Def_NagaevLD_FukNagaev_Setting
Formal statement
namespace NagaevLD.FukNagaev
open MeasureTheory ProbabilityTheory
theorem p4_case {Ω : 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)
(y : ℝ) (hy0 : 0 < y) (hyy : ∀ i, yv i ≤ y)
(t : ℝ) (ht : 2 ≤ t)
(α β : ℝ) (hα0 : 0 < α) (hα1 : α < 1) (hβ : β = 1 - α)
(hL2 : ∀ i, IntegrableOn (fun ω => X i ω ^ 2) {ω | X i ω ≤ yv i} P)
(h16 : cond_1_6 t α β x y (B2Y P X yv) (AY P X yv t)) :
P.real {ω | x ≤ St X yv ω} < P4 t α β x y (muY P X yv) (AY P X yv t) := by sorry
end NagaevLD.FukNagaev
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), pp. 751–752, proof of Theorem 1.3, case h₁ > max[t/y, h₂]
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.