(1.57), p. 758 — P(S_n ≥ x) ≥ Σ_j P(S_n ≥ x, X_j ≥ x, max_{i≠j}X_i < x) = Σ_j P_j
ProvedNagaevLD.LowerBound.eq_1_57large-deviationslower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be real random variables on a probability space , let , and for a real number and an index put
Then
This is the first step of Nagaev's lower bound for large deviations: the event contains the disjoint events on which exactly one summand reaches the level , so its probability dominates the sum of their probabilities. No independence, moment condition or sign condition on is needed.
Formalization Note The variables are only assumed measurable (the standing independence of the paper is not used here). The condition is written " for every ".
Preamble
import Mathlib import Definitions.Def_NagaevLD_LowerBound_Setting open MeasureTheory ProbabilityTheory
Formal statement
namespace NagaevLD.LowerBound
/-- (1.57), p. 758: `P(S_n ≥ x) ≥ Σ_j P(S_n ≥ x, X_j ≥ x, max_{i≠j} X_i < x) = Σ_j P_j`. -/
theorem eq_1_57 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(n : ℕ) (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i)) (x : ℝ) :
∑ j, Pj P X x j ≤ P.real {ω | x ≤ NagaevLD.FukNagaev.S n X ω} := by sorry
end NagaevLD.LowerBound
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), p. 758, (1.57)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.