Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — without projection, ‖w_{t+1}‖ ≤ R/λ and ‖∇_t‖ ≤ 2R

Proved
Pegasos.Analysis.subgrad_bound_no_projection

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-subgradientsvm

Let λ>0\lambda > 0λ>0, k≥1k \ge 1k≥1, labels yi∈{+1,−1}y_i\in\{+1,-1\}yi​∈{+1,−1} and ∥xi∥≤R\|x_i\|\le R∥xi​∥≤R for every example. Run mini-batch Pegasos (Fig. 2) without the projection step, on any sequence of mini-batches. Then for every t≥1t\ge1t≥1

∥wt+1∥≤Rλand∥∇t∥≤2R,\|w_{t+1}\| \le \frac{R}{\lambda}\qquad\text{and}\qquad\|\nabla_t\|\le 2R,∥wt+1​∥≤λR​and∥∇t​∥≤2R,

where ∇t\nabla_t∇t​ is the sub-gradient (8) at wtw_twt​ on the batch AtA_tAt​.

This is the gradient bound G=2RG = 2RG=2R that Lemma 1 needs in the unprojected case (with B=RnB = \mathbb R^nB=Rn).

Formalization Note. Iterations are 1-based with w1=0w_1 = 0w1​=0; mini-batches are kkk-tuples of indices and the statement holds for every sequence of them.

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

/-- **Proof of Theorem 1** (p. 11): without the projection step, for every `t ≥ 1`,
`‖w_{t+1}‖ ≤ R/λ` and the sub-gradient (8) at `w_t` on `A_t` satisfies `‖∇_t‖ ≤ 2R`. -/
theorem subgrad_bound_no_projection {n m k : ℕ} (lam R : ℝ) (hlam : 0 < lam) (hk : 0 < k)
    (x : Fin m → EuclideanSpace ℝ (Fin n)) (y : Fin m → ℝ) (hy : ∀ i, y i = 1 ∨ y i = -1)
    (hR : ∀ i, ‖x i‖ ≤ R) (A : ℕ → Fin k → Fin m) (t : ℕ) (ht : 1 ≤ t) :
    ‖run lam x y A false (t + 1)‖ ≤ R / lam ∧
      ‖subgrad lam x y (A t) (run lam x y A false t)‖ ≤ 2 * R := by sorry

end Pegasos.Analysis
Source
Shalev-Shwartz, Singer, Srebro & Cotter, Pegasos: primal estimated sub-gradient solver for SVM, Math. Program. 127 (2011), p. 11, proof of Theorem 1
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