Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Théorème 3 — weak cluster points of the proximal iterates (13) solve (12), and the iterates form a minimizing sequence

Proved
MartinetReg.ConvexMin.theorem3

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

convex-optimizationhilbert-spacep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-pointweak-convergence

Let HHH be a real Hilbert space, C⊆HC\subseteq HC⊆H a nonempty closed convex set, and f:H→Rf:H\to\mathbb Rf:H→R convex and lower semicontinuous such that every sublevel set {x∈C∣f(x)≤a}\{x\in C\mid f(x)\le a\}{x∈C∣f(x)≤a}, a∈Ra\in\mathbb Ra∈R, is bounded. Let (xn)n≥0(x^n)_{n\ge0}(xn)n≥0​ be a sequence with x0∈Cx^0\in Cx0∈C and, for every nnn,

xn+1∈C  minimizes  f(x)+∥x−xn∥2  over x∈C.x^{n+1}\in C \ \text{ minimizes } \ f(x)+\|x-x^n\|^2 \ \text{ over } x\in C .xn+1∈C  minimizes  f(x)+∥x−xn∥2  over x∈C.

Then:

  1. every weak cluster point x~\tilde xx~ of (xn)(x^n)(xn) is a solution of (12), i.e. x~∈C\tilde x\in Cx~∈C and f(x~)≤f(x)f(\tilde x)\le f(x)f(x~)≤f(x) for all x∈Cx\in Cx∈C;
  2. (xn)(x^n)(xn) is a minimizing sequence: the infimum m=inf⁡x∈Cf(x)m=\inf_{x\in C} f(x)m=infx∈C​f(x) is a real number and
lim⁡n→∞f(xn)=m.\lim_{n\to\infty} f(x^n)=m .n→∞lim​f(xn)=m.

This is the main result of §IV: the proximal regularization of a convex minimization problem converges in value, and its weak cluster points are minimizers. Martinet remarks that it is more precise than the corresponding result for variational inequalities (§II), where only the weak cluster points are controlled.

Formalization Note "Minimisante" is stated as: there is a real mmm that is the greatest lower bound of f(C)f(C)f(C) and f(xn)→mf(x^n)\to mf(xn)→m; this avoids the default value Lean's sInf takes on sets unbounded below, and asserts in particular that fff is bounded below on CCC. Weak cluster points are cluster points in the weak topology (MapClusterPt in WeakSpace ℝ H), not norm cluster points. No existence of a minimizer, and no lower bound on fff, is assumed: both are consequences of the hypotheses. C≠∅C\neq\emptysetC=∅ (implicit in the paper) is part of the standing hypotheses; x0∈Cx^0\in Cx0∈C is part of the sequence predicate, as in "{xn}⊂C\{x^n\}\subset C{xn}⊂C".

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

open Filter Topology

/-- Théorème 3, §4.3, p. 158: every weak cluster point of a sequence {xⁿ} generated by (13) is a
solution of (12), and {xⁿ} is a minimizing sequence: f(xⁿ) converges to the infimum of f over C. -/
theorem theorem3 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    [CompleteSpace H] (f : H → ℝ) (C : Set H) (hS : Standing f C)
    (x : ℕ → H) (hx : IsProxSeq f C x) :
    (∀ xt : H, MartinetReg.VI.IsWeakClusterPt xt x → xt ∈ solSet f C) ∧
    ∃ m : ℝ, IsGLB (f '' C) m ∧ Tendsto (fun n => f (x n)) atTop (𝓝 m) := 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, §4.3, Théorème 3 (announced in the Résumé, p. 154, (3)–(4))
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