Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (4.5) — corrected zero-competitor estimate

Proved
GabayMercier.Approximation.eq_4_5

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

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

Under the standing assumptions and (4.1)–(4.3), let w∈Vkw\in V_kw∈Vk​ solve (Pk)({\cal P}_k)(Pk​) and suppose f2(0)<+∞f_2(0)<+\inftyf2​(0)<+∞. Choosing the zero competitor in (4.4) yields

∥Akw∥2−⟨b,w⟩+f2(Akw)≤f2(0).\|A_kw\|^2-\langle b,w\rangle+f_2(A_kw)\le f_2(0).∥Ak​w∥2−⟨b,w⟩+f2​(Ak​w)≤f2​(0).

This is the estimate used to bound discrete solutions.

Formalization Note The paper prints f2(Akw)−f2(0)f_2(A_kw)-f_2(0)f2​(Ak​w)−f2​(0) on the right of (4.5). Substitution in (4.4) gives f2(0)−f2(Akw)f_2(0)-f_2(A_kw)f2​(0)−f2​(Ak​w) instead. The finite-value assumption on f2(0)f_2(0)f2​(0) 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
  • 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