Equation (4.5) — corrected zero-competitor estimate
ProvedGabayMercier.Approximation.eq_4_5convex-optimizationfinite-elementsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1variational-problems
Under the standing assumptions and (4.1)–(4.3), let solve and suppose . Choosing the zero competitor in (4.4) yields
This is the estimate used to bound discrete solutions.
Formalization Note The paper prints on the right of (4.5). Substitution in (4.4) gives instead. The finite-value assumption on is explicit here and is not added to Theorem 4.1.
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]
/-- (4.5), with the sign corrected by setting the competitor in (4.4) to zero. -/
theorem eq_4_5 (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) (hzero : f₂ 0 ≠ ⊤)
(k : ℕ) (w : Vh k) (hw : IsSolutionH (Ah k) f₂ b w) :
(((‖Ah k w‖ ^ 2 - b w : ℝ) : EReal) + f₂ (Ah k w)) ≤ f₂ 0 := by sorry
end GabayMercier.Approximation
Source
Gabay & Mercier, IRIA RR-126 (1975), hal-04716124v1, p. 21, (4.5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.