Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 — strong convergence of internal approximations

Proved
GabayMercier.Approximation.theorem_4_1

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

convex-optimizationfinite-elementsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1variational-problems

Let V,YV,YV,Y be real Hilbert spaces, A:V→YA:V\to YA:V→Y continuous linear, b∈V′b\in V'b∈V′, and f2:Y→(−∞,+∞]f_2:Y\to(-\infty,+\infty]f2​:Y→(−∞,+∞] proper, convex and lower semicontinuous. Assume the paper's standing hypotheses (2.4) and (2.5), feasibility of (P)({\cal P})(P), and the internal approximation conditions (4.1) and (4.3) for finite dimensional Vk⊆VV_k\subseteq VVk​⊆V and continuous linear maps Ak:Vk→YA_k:V_k\to YAk​:Vk​→Y. With f(y)=12∥y∥2+f2(y)f(y)=\frac12\|y\|^2+f_2(y)f(y)=21​∥y∥2+f2​(y), the continuous problem has a unique solution v∗v^*v∗; for all sufficiently large kkk, the discrete problem has a unique solution vk∗v_k^*vk∗​; and

vk∗⟶v∗strongly in V.v_k^*\longrightarrow v^*\quad\text{strongly in }V.vk∗​⟶v∗strongly in V.

The claim is for every eventual selection of discrete solutions, since the first finitely many problems need not be feasible.

Formalization Note The paper prints convergence “in VhV_hVh​”; varying VhV_hVh​ is embedded in the common space VVV. Its proof requires a finite-valued feasible point of (P)({\cal P})(P), stated explicitly here. (4.3) only guarantees discrete feasibility eventually. The YhY_hYh​ codomain is suppressed because its inclusion in YYY is all the theorem uses. The limit h→0h\to0h→0 is represented by k→∞k\to\inftyk→∞.

Preamble
import Mathlib
import Definitions.Def_InertialFB_IFB_ConvexAnalysis
import Definitions.Def_GabayMercier_Approximation_Model

open Filter Topology InertialFB.IFB
Formal statement
namespace GabayMercier.Approximation

variable {V Y : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [CompleteSpace V]
  [NormedAddCommGroup Y] [InnerProductSpace ℝ Y] [CompleteSpace Y]

/-- Theorem 4.1: eventual unique discrete solutions converge strongly in `V`. -/
theorem theorem_4_1 (A : V →L[ℝ] Y) (f₂ : Y → EReal) (b : StrongDual ℝ V)
    (α : ℝ) (Vh : ℕ → Submodule ℝ V) [∀ k, FiniteDimensional ℝ (Vh k)]
    (Ah : (k : ℕ) → Vh k →L[ℝ] Y) (α' M : ℝ)
    (h : ApproxHyp A f₂ α Vh Ah α' M) :
    (∃! vs : V, GabayMercier.DualAlgorithm.IsSolution A halfSq f₂ b vs) ∧
    ∀ vs : V, GabayMercier.DualAlgorithm.IsSolution A halfSq f₂ b vs →
      (∀ᶠ k in atTop, ∃! w : Vh k, IsSolutionH (Ah k) f₂ b w) ∧
      ∀ vh : (k : ℕ) → Vh k, (∀ᶠ k in atTop, IsSolutionH (Ah k) f₂ b (vh k)) →
        Tendsto (fun k => (vh k : V)) atTop (𝓝 vs) := by sorry

end GabayMercier.Approximation
Source
Gabay & Mercier, IRIA RR-126 (1975), hal-04716124v1, p. 21, Theorem 4.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