Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — the SVM optimum satisfies ‖w⋆‖ ≤ 1/√λ

Proved
Pegasos.Analysis.wstar_norm_bound

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

dualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1svm

Let λ>0\lambda>0λ>0 and let (xi,yi)i∈[m](x_i,y_i)_{i\in[m]}(xi​,yi​)i∈[m]​ be examples with xi∈Rnx_i\in\mathbb R^nxi​∈Rn and yi∈{+1,−1}y_i\in\{+1,-1\}yi​∈{+1,−1}. If w⋆w^\starw⋆ minimises the SVM objective

f(w)=λ2∥w∥2+1m∑i=1mmax⁡{0,1−yi⟨w,xi⟩}f(w) = \frac\lambda2\|w\|^2 + \frac1m\sum_{i=1}^m\max\{0, 1 - y_i\langle w, x_i\rangle\}f(w)=2λ​∥w∥2+m1​i=1∑m​max{0,1−yi​⟨w,xi​⟩}

of Eq. (1) (that is, w⋆w^\starw⋆ is as in Eq. (9)), then

∥w⋆∥≤1λ.\|w^\star\| \le \frac{1}{\sqrt\lambda}.∥w⋆∥≤λ​1​.

So the optimum lies in the ball onto which projected Pegasos projects, which is the last hypothesis of Lemma 1 (u=w⋆∈Bu = w^\star\in Bu=w⋆∈B) in the projected case.

Formalization Note. The minimiser is any w⋆w^\starw⋆ with f(w⋆)≤f(w)f(w^\star)\le f(w)f(w⋆)≤f(w) for all www; no dual problem is formalized (the paper's proof goes through the dual (14)–(15), but the statement concerns only the primal minimiser).

Preamble
import Mathlib
import Definitions.Def_Pegasos_Analysis_Model
Formal statement
namespace Pegasos.Analysis

/-- **Proof of Theorem 1** (pp. 11–12): every minimiser `w⋆` of the SVM objective (1)
(Eq. (9)) satisfies `‖w⋆‖ ≤ 1/√λ`. -/
theorem wstar_norm_bound {n m : ℕ} (lam : ℝ) (hlam : 0 < lam)
    (x : Fin m → EuclideanSpace ℝ (Fin n)) (y : Fin m → ℝ) (hy : ∀ i, y i = 1 ∨ y i = -1)
    (wstar : EuclideanSpace ℝ (Fin n)) (hwstar : ∀ w, svmObj lam x y wstar ≤ svmObj lam x y w) :
    ‖wstar‖ ≤ 1 / Real.sqrt lam := by sorry

end Pegasos.Analysis
Source
Shalev-Shwartz, Singer, Srebro & Cotter, Pegasos: primal estimated sub-gradient solver for SVM, Math. Program. 127 (2011), pp. 11-12, proof of Theorem 1 (with Eq. (1) and (9))
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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