Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1.8 (1.24), p. 753 — EX_i = 0, A_t⁺ < ∞, t ≥ 2: P(S_n ≥ x) ≤ (1 + 2/t)^tA_t⁺x^{−t} + exp{−2(t + 2)^{−2}e^{−t}x²/B_n²}

Proved
NagaevLD.FukNagaev.corollary_1_8

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

fuk-nagaev-inequalitylarge-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be independent random variables with EXi=0\mathbb EX_i=0EXi​=0 and finite variances σi2\sigma_i^2σi2​, Bn2=∑iσi2B_n^2=\sum_i\sigma_i^2Bn2​=∑i​σi2​, and suppose At+=∑i∫u≥0ut dFi(u)<∞A_t^+=\sum_i\int_{u\ge0}u^t\,dF_i(u)<\inftyAt+​=∑i​∫u≥0​utdFi​(u)<∞ for some t≥2t\ge2t≥2. Then for every x>0x>0x>0,

P(Sn≥x)≤ct(1)At+x−t+exp⁡{−ct(2)x2Bn2},ct(1)=(1+2t)t,ct(2)=2(t+2)−2e−t.P(S_n\ge x)\le c_t^{(1)}A_t^+x^{-t}+\exp\Big\{-\frac{c_t^{(2)}x^2}{B_n^2}\Big\},\qquad c_t^{(1)}=\Big(1+\frac2t\Big)^t,\quad c_t^{(2)}=2(t+2)^{-2}e^{-t}.P(Sn​≥x)≤ct(1)​At+​x−t+exp{−Bn2​ct(2)​x2​},ct(1)​=(1+t2​)t,ct(2)​=2(t+2)−2e−t.

This is the form in which the Fuk–Nagaev inequality is usually quoted: the tail of a sum of centred independent variables is at most a polynomial term, governed by the ttt-th moments of the positive parts, plus a Gaussian term governed by the variance. The page obtains it from (1.23) with yi=βxy_i=\beta xyi​=βx and Chebyshev's inequality.

Formalization Note Bn2B_n^2Bn2​ is the sum of Mathlib's variance (X i) P, which is 000 for a variable outside L2L^2L2; the finiteness of every variance is therefore assumed (Xi∈L2X_i\in L^2Xi​∈L2). On the page an infinite Bn2B_n^2Bn2​ makes the exponential term 111 and the bound trivial. If Bn2=0B_n^2=0Bn2​=0, the exponential term is written as the page's limiting value 000 (exp⁡{−∞}\exp\{-\infty\}exp{−∞}); Lean's x/0=0x/0=0x/0=0 would otherwise turn it into 111. At+<∞A_t^+<\inftyAt+​<∞ is integrability of ∣Xi∣t|X_i|^t∣Xi​∣t on {Xi≥0}\{X_i\ge0\}{Xi​≥0}. Powers with exponent ttt are real powers.

Preamble
import Mathlib
import Definitions.Def_NagaevLD_FukNagaev_Setting
Formal statement
namespace NagaevLD.FukNagaev

open MeasureTheory ProbabilityTheory

theorem corollary_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) (t : ℝ) (ht : 2 ≤ t)
    (hL2 : ∀ i, MemLp (X i) 2 P) (hmean : ∀ i, ∫ ω, X i ω ∂P = 0)
    (hAt : ∀ i, IntegrableOn (fun ω => |X i ω| ^ t) {ω | 0 ≤ X i ω} P) :
    P.real {ω | x ≤ S n X ω} ≤
      (1 + 2 / t) ^ t * Atplus P X t * x ^ (-t) +
        (if Bn2 P X = 0 then 0
          else Real.exp (-(2 * (t + 2) ^ (-2 : ℝ) * Real.exp (-t) * x ^ 2 / Bn2 P X))) := by sorry

end NagaevLD.FukNagaev
Source
Nagaev, Large deviations of sums of independent random variables, Ann. Probab. 7 (1979), pp. 752–753, Corollary 1.8, (1.24)
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