Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.5.9 — Kronecker's lemma

Proved
DurrettProbability.kronecker_lemma

by naimengye · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisprobability

Let (an)(a_n)(an​) be a positive increasing sequence with an→∞a_n\to\inftyan​→∞, and let (xn)(x_n)(xn​) be real numbers. If the series ∑nxn/an\sum_n x_n/a_n∑n​xn​/an​ converges, then

1an∑m≤nxm⟶0.\frac{1}{a_n}\sum_{m\le n}x_m\longrightarrow0 .an​1​m≤n∑​xm​⟶0.

There is no probability in this statement — it is a lemma about real sequences — but it is what converts every theorem about convergence of random series into a theorem about averages, and therefore the bridge from section 2.5 to the strong law of large numbers. Applying the three-series theorem to Xn/nX_n/nXn​/n and then Kronecker's lemma with an=na_n=nan​=n turns "∑nXn/n\sum_n X_n/n∑n​Xn​/n converges" into "Sn/n→0S_n/n\to0Sn​/n→0", which is the law of large numbers.

The proof is summation by parts: writing bm=∑k≤mxk/akb_m=\sum_{k\le m}x_k/a_kbm​=∑k≤m​xk​/ak​ and xm=am(bm−bm−1)x_m=a_m(b_m-b_{m-1})xm​=am​(bm​−bm−1​), the average an−1∑m≤nxma_n^{-1}\sum_{m\le n}x_man−1​∑m≤n​xm​ becomes bnb_nbn​ minus a weighted average of b0,…,bn−1b_0,\dots,b_{n-1}b0​,…,bn−1​ with weights summing to one, and both converge to the same limit.

Formalization Note "Increases to infinity" is split into positivity, monotonicity and divergence, since positivity is what makes the divisions meaningful and is used separately from the other two. Convergence of ∑nxn/an\sum_n x_n/a_n∑n​xn​/an​ is convergence of the partial sums to a real limit, as in the rest of this mission, and not absolute convergence — the hypothesis would otherwise be much stronger than the book's and the lemma correspondingly weaker.

Preamble
import Mathlib
import Definitions.Def_DurrettProbability_Series

open MeasureTheory ProbabilityTheory Filter
Formal statement
namespace DurrettProbability

theorem kronecker_lemma (a x : ℕ → ℝ) (hapos : ∀ n, 0 < a n) (hamono : Monotone a)
    (hatop : Tendsto a atTop atTop)
    (hconv : ∃ L : ℝ, Tendsto (fun N => ∑ n ∈ Finset.range N, x n / a n) atTop (nhds L)) :
    Tendsto (fun n => (∑ m ∈ Finset.range n, x m) / a n) atTop (nhds 0) := by sorry

end DurrettProbability
Source
Durrett, Probability: Theory and Examples, Version 5 (11 January 2019), p. 85 (PDF p. 93), Theorem 2.5.9: 'Kronecker's lemma. If a_n increases to infinity and sum_{n=1}^{infinity} x_n/a_n converges then a_n^{-1} sum_{m=1}^{n} x_m -> 0.' Durrett introduces it as 'The link between convergence of series and the strong law of large numbers is provided by'. sha256 aeac36cbf5e44c53d69fa60a2d29a393e2d0e8c955ee103bd845d925fd910886
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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