Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 — linearization and primal-error certificate

Proved
JaggiFW.PrimalDual.gap_ge_primal_error

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

convexityduality-gapfrank-wolfep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let DDD be a compact convex domain, let fff be a convex, continuously differentiable objective, and let x∗∈Dx^*\in Dx∗∈D minimize fff on DDD. At every feasible x,s∈Dx,s\in Dx,s∈D, the linearization at xxx lies below f(s)f(s)f(s). Consequently, the duality gap g(x)g(x)g(x) bounds the primal error:

f(x)+f′(x)(s−x)≤f(s),f(x)−f(x∗)≤g(x).f(x)+f'(x)(s-x)\le f(s),\qquad f(x)-f(x^*)\le g(x).f(x)+f′(x)(s−x)≤f(s),f(x)−f(x∗)≤g(x).

The gap is therefore a certificate for the quality of a feasible iterate, even when the optimal value is unknown.

Formalization Note The derivative pairing is written as f′(x)f'(x)f′(x) on a real normed space. Convexity is required on DDD; continuous differentiability is kept from the paper's standing assumptions.

Preamble
import Mathlib
import Definitions.Def_JaggiFW_PrimalDual_Setting
Formal statement
namespace JaggiFW.PrimalDual

/-- The linearization inequality and the certificate following equation (2), page 2. -/
theorem gap_ge_primal_error {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    (D : Set E) (hDc : IsCompact D) (hDconv : Convex ℝ D)
    (f : E → ℝ) (hfC1 : ContDiff ℝ 1 f) (hfconv : ConvexOn ℝ D f)
    (xstar : E) (hxstar : xstar ∈ D) (hmin : ∀ y ∈ D, f xstar ≤ f y) :
    (∀ x ∈ D, ∀ s ∈ D, f x + fderiv ℝ f x (s - x) ≤ f s) ∧
      (∀ x ∈ D, f x - f xstar ≤ dualityGap f D x) := by sorry

end JaggiFW.PrimalDual
Source
Jaggi, Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization, ICML 2013 (JMLR W&CP 28), https://proceedings.mlr.press/v28/jaggi13.html, PDF p. 2, §2 “The Duality Gap and Certificates”, paragraph following (2)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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