Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 — the linear subproblem computes the gap

Proved
JaggiFW.PrimalDual.gap_eq_of_linear_minimizer

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

duality-gapfrank-wolfelinear-minimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let DDD be a compact domain, let x,s∈Dx,s\in Dx,s∈D, and suppose that sss minimizes the linearized objective t↦f′(x)(t)t\mapsto f'(x)(t)t↦f′(x)(t) over DDD. Then the duality gap is attained at sss:

g(x)=f′(x)(x−s).g(x)=f'(x)(x-s).g(x)=f′(x)(x−s).

Thus an exact Frank–Wolfe linear subproblem returns a numerical optimality certificate along with its atom.

Formalization Note The paper's standing convexity and continuous-differentiability assumptions are omitted because this identity uses only the linear derivative at xxx. The chosen point xxx makes the real supremum nonempty, and compactness bounds it.

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

/-- The exact linear subproblem computes the gap, page 2 after equation (2). -/
theorem gap_eq_of_linear_minimizer {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    (D : Set E) (hDc : IsCompact D) (f : E → ℝ)
    (x s : E) (hx : x ∈ D) (hs : s ∈ D)
    (hsmin : ∀ ŝ ∈ D, fderiv ℝ f x s ≤ fderiv ℝ f x ŝ) :
    dualityGap f D x = fderiv ℝ f x (x - s) := 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 beginning “While the value”
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