Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remarque 1 of §IV — for uniformly convex f the proximal iterates converge strongly to the unique solution of (12)

Proved
MartinetReg.ConvexMin.remark1

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

convex-optimizationhilbert-spacep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-pointuniform-convexity

Assume the hypotheses of §4.1 (HHH a real Hilbert space, C⊆HC\subseteq HC⊆H nonempty, closed and convex, f:H→Rf:H\to\mathbb Rf:H→R convex and lower semicontinuous with bounded sublevel sets {x∈C∣f(x)≤a}\{x\in C\mid f(x)\le a\}{x∈C∣f(x)≤a}), and assume moreover that fff is uniformly convex: there is φ:R→R\varphi:\mathbb R\to\mathbb Rφ:R→R with φ(t)>0\varphi(t)>0φ(t)>0 for all t>0t>0t>0 such that

f(ax+by)≤af(x)+bf(y)−ab φ(∥x−y∥)f(ax+by)\le a f(x)+b f(y)-ab\,\varphi(\|x-y\|)f(ax+by)≤af(x)+bf(y)−abφ(∥x−y∥)

for all x,y∈Hx,y\in Hx,y∈H and a,b≥0a,b\ge0a,b≥0 with a+b=1a+b=1a+b=1. Let (xn)(x^n)(xn) be generated by (13) from some x0∈Cx^0\in Cx0∈C. Then (12) has a unique solution xˉ\bar xxˉ, and

∥xn−xˉ∥→0(n→∞),\|x^n-\bar x\|\to 0\qquad (n\to\infty),∥xn−xˉ∥→0(n→∞),

that is, xnx^nxn converges strongly to xˉ\bar xxˉ.

The remark upgrades Théorème 3 from weak cluster points to strong convergence of the whole sequence when fff has a modulus of uniform convexity.

Formalization Note Uniform convexity is Mathlib's UniformConvexOn Set.univ φ f; with only φ≥0\varphi\ge0φ≥0 this would be plain convexity, so the hypothesis φ(t)>0\varphi(t)>0φ(t)>0 for t>0t>0t>0 is what makes it uniform convexity. No monotonicity of φ\varphiφ is assumed. All hypotheses of §4.1 are kept, since the remark is made under them. "Converge fortement" is convergence in the norm topology.

Preamble
import Mathlib
import Definitions.Def_MartinetReg_ConvexMin_Setting
Formal statement
namespace MartinetReg.ConvexMin

open Filter Topology

/-- Remarque 1 of §IV, p. 158: if moreover f is uniformly convex, problem (12) has a unique
solution and the sequence {xⁿ} generated by (13) converges strongly (in norm) to it. -/
theorem remark1 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    [CompleteSpace H] (f : H → ℝ) (C : Set H) (hS : Standing f C)
    (φ : ℝ → ℝ) (hφ : ∀ t : ℝ, 0 < t → 0 < φ t) (hunif : UniformConvexOn Set.univ φ f)
    (x : ℕ → H) (hx : IsProxSeq f C x) :
    ∃ xs : H, solSet f C = {xs} ∧ Tendsto x atTop (𝓝 xs) := by sorry

end MartinetReg.ConvexMin
Source
Martinet, Régularisation d'inéquations variationnelles par approximations successives, R.I.R.O. 4(R-3) (1970), p. 158, §IV, Remarque 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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