Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1, p. 759, "It is clear that" — P(S_n^j ≥ −x, max_{i≠j}X_i < x) ≥ P(S_n^j ≥ −x) − P(max_{i≠j}X_i ≥ x)

Proved
NagaevLD.LowerBound.clear_step

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

large-deviationslower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be real random variables on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P), let Snj=∑i≠jXiS_n^j=\sum_{i\ne j}X_iSnj​=∑i=j​Xi​, let xxx be real and jjj an index. Then

P(Snj≥−x, max⁡i≠jXi<x) ≥ P(Snj≥−x)−P(max⁡i≠jXi≥x).P\Big(S_n^j\ge -x,\ \max_{i\ne j}X_i<x\Big)\ \ge\ P\big(S_n^j\ge -x\big)-P\Big(\max_{i\ne j}X_i\ge x\Big).P(Snj​≥−x, i=jmax​Xi​<x) ≥ P(Snj​≥−x)−P(i=jmax​Xi​≥x).

This is the elementary inequality P(A∩Bc)≥P(A)−P(B)P(A\cap B^{c})\ge P(A)-P(B)P(A∩Bc)≥P(A)−P(B) applied to A={Snj≥−x}A=\{S_n^j\ge-x\}A={Snj​≥−x} and B={max⁡i≠jXi≥x}B=\{\max_{i\ne j}X_i\ge x\}B={maxi=j​Xi​≥x}. It reduces the probability on the right-hand side of the bound on PjP_jPj​ to two one-sided tail probabilities, each of which is controlled by Chebyshev's inequality.

Formalization Note The page prints "max⁡i≠jXi≤x\max_{i\ne j}X_i\le xmaxi=j​Xi​≤x" on the left and "max⁡i≠jXi>x\max_{i\ne j}X_i>xmaxi=j​Xi​>x" on the right, while (1.57) and the bound on PjP_jPj​ use max⁡i≠jXi<x\max_{i\ne j}X_i<xmaxi=j​Xi​<x. The statement here uses <x<x<x on the left and therefore ≥x\ge x≥x on the right, which is the form the argument needs. The event {max⁡i≠jXi≥x}\{\max_{i\ne j}X_i\ge x\}{maxi=j​Xi​≥x} is written "there is i≠ji\ne ji=j with Xi≥xX_i\ge xXi​≥x".

Preamble
import Mathlib
import Definitions.Def_NagaevLD_LowerBound_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace NagaevLD.LowerBound

/-- §1, p. 759, "It is clear that": `P(S_n^j ≥ −x, max_{i≠j} X_i < x) ≥ P(S_n^j ≥ −x) − P(max_{i≠j} X_i ≥ x)`
(the page prints `≤ x` and `> x`; this is the form the chain uses with (1.57)'s `< x`). -/
theorem clear_step {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i)) (x : ℝ) (j : Fin n) :
    P.real {ω | -x ≤ Sj n X j ω} - P.real {ω | ∃ i, i ≠ j ∧ x ≤ X i ω} ≤
      P.real {ω | -x ≤ Sj n X j ω ∧ ∀ i, i ≠ j → X i ω < x} := by sorry

end NagaevLD.LowerBound
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), p. 759, §1, "It is clear that" (before (1.58))
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me