Lemme 1 — successive regularized iterates get closer: ‖xⁿ⁺¹ − xⁿ‖ → 0
ProvedMartinetReg.VI.lemma1hilbert-spacep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-pointvariational-inequality
Let be a real Hilbert space, convex, closed and bounded, monotone and hemicontinuous on , and let be a sequence generated by the regularization algorithm (2) from . Then
This is the first of the two lemmas into which Martinet splits the proof of Théorème 1.
Formalization Note. No hypothesis "" is added: the paper obtains a solution from §2.1 (here because ). The standing hypotheses are bundled in Standing T C; the limit is Tendsto … atTop (𝓝 0).
Preamble
import Mathlib import Definitions.Def_MartinetReg_VI_Setting
Formal statement
namespace MartinetReg.VI
open Filter Topology
/-- Lemme 1, p. 155: `lim_{n→∞} ‖xⁿ⁺¹ − xⁿ‖ = 0`. -/
theorem lemma1 {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) :
Tendsto (fun n => ‖x (n + 1) - x n‖) atTop (𝓝 0) := 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. 155, Lemme 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.