Theorem 4.1 — strong convergence of internal approximations
ProvedGabayMercier.Approximation.theorem_4_1Let be real Hilbert spaces, continuous linear, , and proper, convex and lower semicontinuous. Assume the paper's standing hypotheses (2.4) and (2.5), feasibility of , and the internal approximation conditions (4.1) and (4.3) for finite dimensional and continuous linear maps . With , the continuous problem has a unique solution ; for all sufficiently large , the discrete problem has a unique solution ; and
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 ”; varying is embedded in the common space . Its proof requires a finite-valued feasible point of , stated explicitly here. (4.3) only guarantees discrete feasibility eventually. The codomain is suppressed because its inclusion in is all the theorem uses. The limit is represented by .
import Mathlib import Definitions.Def_InertialFB_IFB_ConvexAnalysis import Definitions.Def_GabayMercier_Approximation_Model open Filter Topology InertialFB.IFB
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.