Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.4, p. 12 — a nonnegative summable sequence tends to 0, has averages O(1/k) and running minima o(1/k)

Proved
ExtraConsensus.Sublinear.proposition_3_4

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

convergence-ratelittle-op2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1summable-sequence

Let (ak)k≥0(a_k)_{k\ge0}(ak​)k≥0​ be a real sequence with ak≥0a_k\ge0ak​≥0 for all kkk and ∑tat<∞\sum_{t}a_t<\infty∑t​at​<∞. Then

  1. lim⁡k→∞ak=0\lim_{k\to\infty}a_k=0limk→∞​ak​=0;
  2. 1k∑t=1kat=O ⁣(1k)\displaystyle\frac1k\sum_{t=1}^k a_t=O\!\left(\frac1k\right)k1​t=1∑k​at​=O(k1​);
  3. min⁡1≤t≤kat=o ⁣(1k)\displaystyle\min_{1\le t\le k}a_t=o\!\left(\frac1k\right)1≤t≤kmin​at​=o(k1​) as k→∞k\to\inftyk→∞.

This elementary fact converts the summability of the progress and residual sequences into the ergodic O(1/k)O(1/k)O(1/k) and running-best o(1/k)o(1/k)o(1/k) rates of Theorem 3.5.

Formalization Note Summability is over all t≥0t\ge0t≥0, which is equivalent to the page's ∑t=1∞at<∞\sum_{t=1}^\infty a_t<\infty∑t=1∞​at​<∞. The running minimum ranges over 1≤t≤k1\le t\le k1≤t≤k, the same indices as the sums; its value at k=0k=0k=0 is irrelevant.

Preamble
import Mathlib
import Definitions.Def_ExtraConsensus_Sublinear_Model
Formal statement
namespace ExtraConsensus.Sublinear

open Matrix Filter Topology Asymptotics

/-- Proposition 3.4, p. 12. If `aₖ ≥ 0` for all `k` and `Σₜ aₜ < ∞`, then (i) `aₖ → 0`;
(ii) `(1/k) Σ_{t=1}^{k} aₜ = O(1/k)`; (iii) `min_{1≤t≤k} aₜ = o(1/k)`. -/
theorem proposition_3_4 (a : ℕ → ℝ) (ha : ∀ k, 0 ≤ a k) (hsum : Summable a) :
    Tendsto a atTop (𝓝 0) ∧
      (fun k : ℕ => (1 / (k : ℝ)) * ∑ t ∈ Finset.Icc 1 k, a t) =O[atTop]
        (fun k : ℕ => (1 : ℝ) / k) ∧
      (fun k : ℕ => runMin a k) =o[atTop] (fun k : ℕ => (1 : ℝ) / k) := by sorry

end ExtraConsensus.Sublinear
Source
Shi, Ling, Wu & Yin, arXiv:1404.6264v4, Proposition 3.4, p. 12
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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