Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7 — for identically distributed ZiZ_iZi​ with E∣Z1∣k<∞E|Z_1|^k<\inftyE∣Z1​∣k<∞, max⁡i≤n∣Zi∣/n1/k→0\max_{i\le n}|Z_i|/n^{1/k}\to0maxi≤n​∣Zi​∣/n1/k→0 almost surely

Proved
GenEmpLik.Expansion.lemma_7

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

borel-cantellip2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let Z1,Z2,…Z_1,Z_2,\dotsZ1​,Z2​,… be identically distributed real random variables, not necessarily independent, with E[∣Z1∣k]<∞E[|Z_1|^k]<\inftyE[∣Z1​∣k]<∞ for some k>0k>0k>0. Then

  1. for every ϵ>0\epsilon>0ϵ>0,
P(∣Zn∣≥ϵn1/k infinitely often)=0;\mathbb P\big(|Z_n|\ge\epsilon n^{1/k}\ \text{infinitely often}\big)=0;P(∣Zn​∣≥ϵn1/k infinitely often)=0;
  1. almost surely,
max⁡i≤n∣Zi∣n1/k→0.\frac{\max_{i\le n}|Z_i|}{n^{1/k}}\to0 .n1/kmaxi≤n​∣Zi​∣​→0.

With k=2k=2k=2 this shows that a finite-variance stationary sequence has no single observation of order n\sqrt nn​, which makes the event of Lemma 6 hold eventually.

Formalization Note Lean indexes the sequence from 000: Z m is the paper's Zm+1Z_{m+1}Zm+1​, so the event of clause 1 is ∣Zm∣≥ϵ(m+1)1/k|Z_m|\ge\epsilon(m+1)^{1/k}∣Zm​∣≥ϵ(m+1)1/k, and the maximum in clause 2 is over the first nnn variables Z 0, …, Z (n-1). "Infinitely often" is Filter.limsup of the events along atTop. Identical distribution is Mathlib's IdentDistrib; no independence is assumed. Powers with real exponent are Real.rpow.

Preamble
import Mathlib

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace GenEmpLik.Expansion

/-- Lemma 7 (Duchi, Glynn & Namkoong, arXiv:1610.03425v3, p. 31). Let `Z 0, Z 1, …` (the paper's
`Z₁, Z₂, …`) be identically distributed, possibly dependent, with `E[|Z₁|^k] < ∞` for some `k > 0`.
Then for every `ε > 0`, `P(|Z_n| ≥ ε n^{1/k} i.o.) = 0` (Lean's `Z m` is the paper's `Z_{m+1}`,
so the threshold is `ε (m+1)^{1/k}`), and `max_{i ≤ n} |Z_i| / n^{1/k} → 0` almost surely. -/
theorem lemma_7 {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
    (Z : ℕ → Ω → ℝ) (hident : ∀ i, IdentDistrib (Z i) (Z 0) P P) {k : ℝ} (hk : 0 < k)
    (hmom : Integrable (fun ω => |Z 0 ω| ^ k) P) :
    (∀ ε : ℝ, 0 < ε →
      P (limsup (fun m : ℕ => {ω | ε * ((m : ℝ) + 1) ^ (1 / k) ≤ |Z m ω|}) atTop) = 0) ∧
    (∀ᵐ ω ∂P, Tendsto (fun n : ℕ => (⨆ i : Fin n, |Z i ω|) / (n : ℝ) ^ (1 / k))
      atTop (𝓝 0)) := by sorry

end GenEmpLik.Expansion
Source
Duchi, Glynn & Namkoong, Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach, arXiv:1610.03425v3, p. 31, Lemma 7
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