Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4: every k-sparse simplex point has duality gap at least 2/k

Proved
JaggiFW.Sparsity.lemma_4

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

duality-gapfrank-wolfelower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simplexsparsity

For f(x)=∑ixi2f(x)=\sum_i x_i^2f(x)=∑i​xi2​ on the unit simplex Δn\Delta_nΔn​, let kkk be a natural number with k<nk<nk<n. Every feasible point with at most kkk nonzero coordinates satisfies

gf,Δn(x)≥2k(x∈Δn, card⁡(x)≤k).g_{f,\Delta_n}(x)\ge\frac{2}{k} \qquad(x\in\Delta_n,\ \operatorname{card}(x)\le k).gf,Δn​​(x)≥k2​(x∈Δn​, card(x)≤k).

Thus the duality-gap guarantee cannot improve its order in the number of active coordinates for this example.

Formalization Note The gap is the supremum of Df(x)[x−s]Df(x)[x-s]Df(x)[x−s] over s∈Δns\in\Delta_ns∈Δn​, equal to the paper's maximum because k<nk<nk<n makes the compact simplex nonempty. When k=0k=0k=0, no simplex point meets the sparsity condition, so the natural-number division convention has no effect on a feasible case.

Preamble
import Mathlib
import Definitions.Def_JaggiFW_Sparsity_Setting
Formal statement
namespace JaggiFW.Sparsity

/-- Sparse duality-gap lower bound (Lemma 4, PDF p. 5). -/
theorem lemma_4 {n : ℕ} (k : ℕ) (hk : k < n) :
    ∀ x ∈ stdSimplex ℝ (Fin n), card x ≤ k →
      2 / (k : ℝ) ≤ dualityGap sqNorm (stdSimplex ℝ (Fin n)) x := by sorry

end JaggiFW.Sparsity
Source
Jaggi, Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization, ICML 2013 (JMLR W&CP 28), PDF p. 5, Lemma 4
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