Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Summed decrease bound after (46)

Proved
NonconvexSplitting.ProxGrad.summed_decrease

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

nonconvex-optimizationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-gradient

Under the hypotheses of (46) (standing assumptions on hhh and PPP; qqq convex and C2C^2C2; ℓ>0\ell > 0ℓ>0 with −ℓI⪯∇2h+∇2q⪯ℓI-\ell I \preceq \nabla^2 h + \nabla^2 q \preceq \ell I−ℓI⪯∇2h+∇2q⪯ℓI; β>0\beta > 0β>0; (xt)(x^t)(xt) generated by (43)), for every NNN with N−1>0N - 1 > 0N−1>0,

(12β−ℓ2)∑t=0N−1∥xt+1−xt∥2+h(xN)+P(xN)≤h(x0)+P(x0).\Bigl(\frac{1}{2\beta} - \frac{\ell}{2}\Bigr)\sum_{t=0}^{N-1}\|x^{t+1} - x^t\|^2 + h(x^N) + P(x^N) \le h(x^0) + P(x^0).(2β1​−2ℓ​)t=0∑N−1​∥xt+1−xt∥2+h(xN)+P(xN)≤h(x0)+P(x0).

Equivalently, where P(xN)P(x^N)P(xN) is finite (which is the case for N≥1N \ge 1N≥1, as xNx^NxN minimizes a proper function), (12β−ℓ2)∑t=0N−1∥xt+1−xt∥2≤h(x0)+P(x0)−h(xN)−P(xN)\bigl(\frac{1}{2\beta} - \frac{\ell}{2}\bigr)\sum_{t=0}^{N-1}\|x^{t+1}-x^t\|^2 \le h(x^0) + P(x^0) - h(x^N) - P(x^N)(2β1​−2ℓ​)∑t=0N−1​∥xt+1−xt∥2≤h(x0)+P(x0)−h(xN)−P(xN), the form printed in the paper.

Formalization Note The additive form avoids the undefined difference +∞−(+∞)+\infty - (+\infty)+∞−(+∞) in EReal. The range N≥2N \ge 2N≥2 is the paper's "any N−1>0N - 1 > 0N−1>0".

Preamble
import Mathlib
import Definitions.Def_NonconvexSplitting_ProxGrad_StandingAssumptions
import Definitions.Def_NonconvexSplitting_ProxGrad_HessianSandwich
import Definitions.Def_NonconvexSplitting_ProxGrad_IsProxGradSeq
Formal statement
namespace NonconvexSplitting.ProxGrad

/-- The display after (46) in Li–Pong (p. 18), in additive form: for `N - 1 > 0`,
`(1/(2β) - ℓ/2) Σ_{t=0}^{N-1} ‖x^{t+1} - x^t‖² + h(x^N) + P(x^N) ≤ h(x^0) + P(x^0)`, in `EReal`. -/
theorem summed_decrease {n : ℕ} (h q : EuclideanSpace ℝ (Fin n) → ℝ) (P : EuclideanSpace ℝ (Fin n) → EReal) (ℓ β : ℝ)
    (x : ℕ → EuclideanSpace ℝ (Fin n))
    (hSA : StandingAssumptions h P) (hq : ContDiff ℝ 2 q) (hq_convex : ConvexOn ℝ Set.univ q)
    (hℓ : 0 < ℓ) (h44 : HessianSandwich h q ℓ) (hβ : 0 < β)
    (hx : IsProxGradSeq h P β x) (N : ℕ) (hN : 1 < N) :
    (((1 / (2 * β) - ℓ / 2) * ∑ t ∈ Finset.range N, ‖x (t + 1) - x t‖ ^ 2 : ℝ) : EReal) +
        ((h (x N) : ℝ) : EReal) + P (x N) ≤
      ((h (x 0) : ℝ) : EReal) + P (x 0) := by sorry

end NonconvexSplitting.ProxGrad
Source
Li & Pong, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, arXiv:1407.0753v6, p. 18, display after Eq. (46)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me