Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3: the minimum squared norm of a k-sparse simplex point is 1/k

Proved
JaggiFW.Sparsity.lemma_3

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

lower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simplexsparsity

Let 1≤k≤n1\le k\le n1≤k≤n. Among points xxx of the unit simplex Δn\Delta_nΔn​ with at most kkk nonzero coordinates, the minimum squared Euclidean norm exists and is

min⁡x∈Δn, card⁡(x)≤k∑ixi2=1k.\min_{x\in\Delta_n,\ \operatorname{card}(x)\le k}\sum_i x_i^2=\frac1k.x∈Δn​, card(x)≤kmin​i∑​xi2​=k1​.

This is the sparse primal objective bound used in the paper's lower bound.

Formalization Note The formal statement uses an attained minimum, including an attaining sparse point, so it preserves the paper's “min” rather than merely an infimum.

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

/-- Sparse minimum of the quadratic objective (Lemma 3, PDF p. 5). -/
theorem lemma_3 {n : ℕ} (k : ℕ) (hk1 : 1 ≤ k) (hkn : k ≤ n) :
    IsLeast {r : ℝ | ∃ x ∈ stdSimplex ℝ (Fin n), card x ≤ k ∧ r = sqNorm x}
      (1 / (k : ℝ)) := 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 3
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