Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollaire — if (1) has a unique solution x̄, the regularized iterates converge weakly to x̄

Proved
MartinetReg.VI.corollary

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

hilbert-spacep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-pointvariational-inequalityweak-convergence

Let HHH be a real Hilbert space, C⊆HC\subseteq HC⊆H convex, closed and bounded, T:H→H′T:H\to H'T:H→H′ monotone and hemicontinuous on CCC, and let (xn)(x^n)(xn) be a sequence generated by the regularization algorithm (2) from x0∈Cx^0\in Cx0∈C. If the variational inequality (1) has a unique solution xˉ\bar xxˉ, i.e. M={xˉ}M=\{\bar x\}M={xˉ}, then

xn⇀xˉ(n→∞)x^n\rightharpoonup\bar x\qquad(n\to\infty)xn⇀xˉ(n→∞)

weakly in HHH.

Formalization Note. Uniqueness is the hypothesis solSet T C = {xbar} (which includes existence). Weak convergence is convergence in WeakSpace ℝ H. The standing hypotheses are bundled in Standing T C.

Preamble
import Mathlib
import Definitions.Def_MartinetReg_VI_Setting
Formal statement
namespace MartinetReg.VI

open Filter Topology

/-- Corollaire, p. 156: if (1) has a unique solution `x̄`, the sequence `xⁿ`
converges weakly to `x̄`. -/
theorem corollary {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (T : H → StrongDual ℝ H) (C : Set H) (hS : Standing T C)
    (x : ℕ → H) (hx : IsRegSeq T C x) (xbar : H) (huniq : solSet T C = {xbar}) :
    Tendsto (fun n => toWeakSpace ℝ H (x n)) atTop (𝓝 (toWeakSpace ℝ H xbar)) := by sorry

end MartinetReg.VI
Source
Martinet, Régularisation d'inéquations variationnelles par approximations successives, R.I.R.O. 4(R-3) (1970), p. 156, Corollaire
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