§1, p. 759 — P(max_{i≠j}X_i ≥ x) ≤ B_n²/x² for centred summands
ProvedNagaevLD.LowerBound.chebyshev_maxLet be independent real random variables on a probability space with and for every , and put . Then for every and every index
Each centred summand reaches with probability at most , and the union over costs at most the sum. Together with the previous bound this shows that, for , the probability is at least .
Formalization Note The page states ; the statement here, with , is stronger, follows from the same Chebyshev step, and is the form that the preceding inequality ("It is clear that") requires once is used as in (1.57). The event is written "there is with ". Square integrability of each stands for the page's . Independence is the paper's standing assumption and is not needed for this bound.
import Mathlib import Definitions.Def_NagaevLD_LowerBound_Setting open MeasureTheory ProbabilityTheory
namespace NagaevLD.LowerBound
/-- §1, p. 759: `P(max_{i≠j} X_i ≥ x) ≤ B_n²/x²` (the page prints `> x`; `≥ x` is stronger and is
what the chain needs). -/
theorem chebyshev_max {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(n : ℕ) (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i))
(hindep : iIndepFun (fun i => X i) P)
(hL2 : ∀ i, MemLp (X i) 2 P) (hmean : ∀ i, ∫ ω, X i ω ∂P = 0)
(x : ℝ) (hx : 0 < x) (j : Fin n) :
P.real {ω | ∃ i, i ≠ j ∧ x ≤ X i ω} ≤ NagaevLD.FukNagaev.Bn2 P X / x ^ 2 := by sorry
end NagaevLD.LowerBound
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.