Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — the mini-batch objective f(·; A) is λ-strongly convex

Proved
Pegasos.Analysis.instObj_strongly_convex

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1strong-convexitysvm

For any data (xi,yi)i∈[m](x_i, y_i)_{i\in[m]}(xi​,yi​)i∈[m]​ and any mini-batch AAA of kkk indices, the instantaneous objective f(w;A)=λ2∥w∥2+1k∑i∈Amax⁡{0,1−yi⟨w,xi⟩}f(w;A) = \frac\lambda2\|w\|^2 + \frac1k\sum_{i\in A}\max\{0,1-y_i\langle w,x_i\rangle\}f(w;A)=2λ​∥w∥2+k1​∑i∈A​max{0,1−yi​⟨w,xi​⟩} is λ\lambdaλ-strongly convex in the paper's sense:

w  ↦  f(w;A)−λ2∥w∥2is convex on Rn.w \;\mapsto\; f(w;A) - \frac\lambda2\|w\|^2 \quad\text{is convex on } \mathbb R^n.w↦f(w;A)−2λ​∥w∥2is convex on Rn.

This verifies the first hypothesis of Lemma 1 for the functions ft=f(⋅;At)f_t = f(\cdot;A_t)ft​=f(⋅;At​).

Formalization Note. The paper's definition of λ\lambdaλ-strong convexity (p. 9) is used verbatim, so the statement is the convexity of the averaged hinge loss over the batch; it holds for every real λ\lambdaλ and every kkk (at k=0k = 0k=0, Lean's 1/0=01/0 = 01/0=0 makes the average 000).

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

/-- **Proof of Theorem 1** (p. 11): the instantaneous objective `f(·; A)` of Eq. (7) is
λ-strongly convex in the paper's sense (p. 9): `f(w; A) − λ/2‖w‖²` is a convex function
of `w`. -/
theorem instObj_strongly_convex {n m k : ℕ} (lam : ℝ)
    (x : Fin m → EuclideanSpace ℝ (Fin n)) (y : Fin m → ℝ) (B : Fin k → Fin m) :
    ConvexOn ℝ Set.univ (fun w => instObj lam x y B w - lam / 2 * ‖w‖ ^ 2) := 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