§1, p. 758, after (1.57) — P_j ≥ P(X_j ≥ 2x) P(S_n^j ≥ −x, max_{i≠j}X_i < x)
ProvedNagaevLD.LowerBound.Pj_ge_prodlarge-deviationslower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be independent real random variables on a probability space , let and , and let . With , for every index
This bound separates the large summand from the rest of the sum: if is at least while the other summands stay below and their sum is at least , then and is the only summand at level . It is the step that turns into a product of a single-summand tail and a probability close to one.
Formalization Note The page writes this as a chain ; the formal statement is the outer inequality. The condition is written " for every ".
Preamble
import Mathlib import Definitions.Def_NagaevLD_LowerBound_Setting open MeasureTheory ProbabilityTheory
Formal statement
namespace NagaevLD.LowerBound
/-- §1, p. 758, after (1.57): `P_j ≥ P(X_j ≥ 2x) P(S_n^j ≥ −x, max_{i≠j} X_i < x)`. -/
theorem Pj_ge_prod {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(n : ℕ) (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i))
(hindep : iIndepFun (fun i => X i) P)
(x : ℝ) (hx : 0 < x) (j : Fin n) :
P.real {ω | 2 * x ≤ X j ω} *
P.real {ω | -x ≤ Sj n X j ω ∧ ∀ i, i ≠ j → X i ω < x} ≤ Pj P X x j := by sorry
end NagaevLD.LowerBound
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), p. 758, §1, after (1.57)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.