Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.1, p. 29 — f(y) ≥ f(S_f(x)) + ⟨G_f(x), y − x⟩ + (μ/2)‖y − x‖² + ‖G_f(x)‖²/(2L)

Proved
NAGFlow.APGM.lemma_7_1

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

convex-optimizationgradient-mappingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-gradient

Let VVV be a real Hilbert space and f=h+gf=h+gf=h+g, where h∈Sμ,L1,1h\in\mathcal S^{1,1}_{\mu,L}h∈Sμ,L1,1​ with 0≤μ≤L<∞0\le\mu\le L<\infty0≤μ≤L<∞ and g:V→R∪{+∞}g:V\to\mathbb R\cup\{+\infty\}g:V→R∪{+∞} is proper, closed and convex. Write Sf(x)=prox⁡g/L(x−1L∇h(x))S_f(x)=\operatorname{prox}_{g/L}(x-\frac1L\nabla h(x))Sf​(x)=proxg/L​(x−L1​∇h(x)) and Gf(x)=L(x−Sf(x))\mathcal G_f(x)=L(x-S_f(x))Gf​(x)=L(x−Sf​(x)). Then for every x∈Vx\in Vx∈V and every y∈dom⁡gy\in\operatorname{dom}gy∈domg,

f(y) ≥ f(Sf(x))+⟨Gf(x),y−x⟩+μ2∥y−x∥2+12L∥Gf(x)∥2.(114)f(y)\ \ge\ f(S_f(x))+\langle\mathcal G_f(x),y-x\rangle+\frac\mu2\|y-x\|^2+\frac1{2L}\|\mathcal G_f(x)\|^2.\qquad(114)f(y) ≥ f(Sf​(x))+⟨Gf​(x),y−x⟩+2μ​∥y−x∥2+2L1​∥Gf​(x)∥2.(114)

The right-hand side is a quadratic lower model of fff at xxx built from the gradient mapping; it is the composite analogue of μ\muμ-convexity plus the descent lemma, and it is the only property of ggg used in the convergence proof of Algorithm 2.

Formalization Note. The page says "for any x,y∈Vx,y\in Vx,y∈V"; for y∉dom⁡gy\notin\operatorname{dom}gy∈/domg its left side is +∞+\infty+∞ and (114) is void, so the statement is made for y∈dom⁡gy\in\operatorname{dom}gy∈domg. Sf(x)S_f(x)Sf​(x) is a named point satisfying the prox predicate with η=1/L\eta=1/Lη=1/L. ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle⟨⋅,⋅⟩ is the inner product of VVV (Riesz).

Preamble
import Mathlib
import Definitions.Def_NAGFlow_APGM_Setting
Formal statement
namespace NAGFlow.APGM

/-- Lemma 7.1 (Luo & Chen, arXiv:1909.03145v4, p. 29). Assume `f = h + g`, where `h ∈ S^{1,1}_{μ,L}`
with `0 ≤ μ ≤ L < ∞` and `g : V → ℝ ∪ {+∞}` is proper, closed and convex (encoded by `(g, D)`,
`D = dom g`). Then for any `x ∈ V` and any `y ∈ dom g` (for `y ∉ dom g` the page's `f(y) = +∞` and the
inequality is void), with `S_f(x) = prox_{g/L}(x − ∇h(x)/L)` and `G_f(x) = L(x − S_f(x))`,
`f(y) ≥ f(S_f(x)) + ⟪G_f(x), y − x⟫ + (μ/2)‖y − x‖² + (1/(2L))‖G_f(x)‖²`  (114). -/
theorem lemma_7_1 {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [CompleteSpace V]
    (h : V → ℝ) (gradh : V → V) (μ L : ℝ) (hh : NAGFlow.PredCorr.IsS11 h gradh μ L)
    (g : V → ℝ) (D : Set V) (hg : IsProperClosedConvex g D)
    (x y s : V) (hy : y ∈ D) (hs : IsSf gradh g D (1 / L) x s) :
    (h + g) y ≥ (h + g) s + inner ℝ (gradMap (1 / L) x s) (y - x) + μ / 2 * ‖y - x‖ ^ 2
      + 1 / (2 * L) * ‖gradMap (1 / L) x s‖ ^ 2 := by sorry

end NAGFlow.APGM
Source
Luo & Chen, arXiv:1909.03145v4, Lemma 7.1 and (114), p. 29
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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