Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 427 — Σ(m+t)^{θμ−3} ≤ max{(m+k)^{θμ−2}/(θμ−2), (m−1)^{θμ−2}/(2−θμ)} and Σ(m+t)^{θμ−2} ≤ (m+k)^{θμ−1}/(θμ−1)

Proved
StochGradTrack.Dimin.sum_bounds

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

diminishing-stepsizeinequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Let m>1m>1m>1 and θμ>1\theta\mu>1θμ>1. For every k≥0k\ge0k≥0,

∑t=0k−1(m+t)θμ−2≤1θμ−1(m+k)θμ−1,\sum_{t=0}^{k-1}(m+t)^{\theta\mu-2}\le\frac1{\theta\mu-1}(m+k)^{\theta\mu-1},t=0∑k−1​(m+t)θμ−2≤θμ−11​(m+k)θμ−1,

and, if θμ≠2\theta\mu\ne2θμ=2,

∑t=0k−1(m+t)θμ−3≤max⁡{1θμ−2(m+k)θμ−2,  12−θμ(m−1)θμ−2}.\sum_{t=0}^{k-1}(m+t)^{\theta\mu-3}\le\max\Big\{\frac1{\theta\mu-2}(m+k)^{\theta\mu-2},\;\frac1{2-\theta\mu}(m-1)^{\theta\mu-2}\Big\}.t=0∑k−1​(m+t)θμ−3≤max{θμ−21​(m+k)θμ−2,2−θμ1​(m−1)θμ−2}.

These comparisons of sums with integrals ∫−1k(m+t)s dt\int_{-1}^k(m+t)^{s}\,dt∫−1k​(m+t)sdt give the final rate of UkU_kUk​ in Theorem 2.

Formalization Note The page states the first bound without excluding θμ=2\theta\mu=2θμ=2, where both branches of the maximum involve 1/01/01/0 (the true bound is logarithmic); the hypothesis θμ≠2\theta\mu\ne2θμ=2 is added for that bound. The intermediate integrals of the page are not stated. Powers are real powers.

Preamble
import Mathlib
Formal statement
namespace StochGradTrack.Dimin

/-- The sum–integral bounds (p. 427), for `m > 1` and `θμ > 1`; the first one (disclosed) for `θμ ≠ 2`. -/
theorem sum_bounds (θ μ m : ℝ) (hm : 1 < m) (hθμ : 1 < θ * μ) (k : ℕ) :
    (θ * μ ≠ 2 →
      ∑ t ∈ Finset.range k, (m + t) ^ (θ * μ - 3)
        ≤ max (1 / (θ * μ - 2) * (m + k) ^ (θ * μ - 2)) (1 / (2 - θ * μ) * (m - 1) ^ (θ * μ - 2))) ∧
    ∑ t ∈ Finset.range k, (m + t) ^ (θ * μ - 2) ≤ 1 / (θ * μ - 1) * (m + k) ^ (θ * μ - 1) := by sorry

end StochGradTrack.Dimin
Source
Pu & Nedić, Math. Program. 187 (2021), §3.3, p. 427 ("Note that" display)
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