Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(113), p. 29 — G_f(x, η) − ∇h(x) ∈ ∂g(S_f(x, η))

Proved
NAGFlow.APGM.eq_113

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

gradient-mappingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-gradientsubdifferential

Let VVV be a real Hilbert space, 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<∞, g:V→R∪{+∞}g:V\to\mathbb R\cup\{+\infty\}g:V→R∪{+∞} proper, closed and convex, and η>0\eta>0η>0. For x∈Vx\in Vx∈V let Sf(x,η)=prox⁡ηg(x−η∇h(x))S_f(x,\eta)=\operatorname{prox}_{\eta g}(x-\eta\nabla h(x))Sf​(x,η)=proxηg​(x−η∇h(x)) and Gf(x,η)=(x−Sf(x,η))/η\mathcal G_f(x,\eta)=(x-S_f(x,\eta))/\etaGf​(x,η)=(x−Sf​(x,η))/η be the composite gradient mapping (111). Then

Gf(x,η)−∇h(x)∈∂g(Sf(x,η)).\mathcal G_f(x,\eta)-\nabla h(x)\in\partial g\big(S_f(x,\eta)\big).Gf​(x,η)−∇h(x)∈∂g(Sf​(x,η)).

The inclusion says that −Gf(x,η)-\mathcal G_f(x,\eta)−Gf​(x,η) is a subgradient-type direction of f=h+gf=h+gf=h+g evaluated in a split way, which is why Gf\mathcal G_fGf​ plays the role of ∇f\nabla f∇f in the nonsmooth scheme.

Formalization Note. Sf(x,η)S_f(x,\eta)Sf​(x,η) is a named point satisfying the prox predicate. ggg is encoded by (g,D)(g,D)(g,D) as in the definitions file. The class of hhh is the standing assumption of (110); the inclusion itself only uses the value ∇h(x)\nabla h(x)∇h(x).

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

/-- Inclusion (113) (Luo & Chen, arXiv:1909.03145v4, §7.2.1, p. 29). Let `h ∈ S^{1,1}_{μ,L}` with
`0 ≤ μ ≤ L < ∞`, `g : V → ℝ ∪ {+∞}` proper, closed and convex (encoded by `(g, D)`), `η > 0` and
`x ∈ V`. If `s = S_f(x, η) = prox_{ηg}(x − η∇h(x))`, then
`G_f(x, η) − ∇h(x) ∈ ∂g(S_f(x, η))`, where `G_f(x, η) = (x − S_f(x, η))/η`. -/
theorem eq_113 {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) (η : ℝ) (hη : 0 < η)
    (x s : V) (hs : IsSf gradh g D η x s) :
    gradMap η x s - gradh x ∈ subdiff g D s := by sorry

end NAGFlow.APGM
Source
Luo & Chen, arXiv:1909.03145v4, §7.2.1, (111) and (113), 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