Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 15.8: the homogenous Hard-SVM solution w₀ is a linear combination of the support vectors {xᵢ : |⟨w₀,xᵢ⟩| = 1}

Proved
UnderstandingML.support_vectors

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

optimality-conditionssupport-vector-machinessupport-vectors

Theorem 15.8. Let w0w_0w0​ be as defined in Equation (15.3) and let I={i:∣⟨w0,xi⟩∣=1}I = \{i : |\langle w_0, x_i\rangle| = 1\}I={i:∣⟨w0​,xi​⟩∣=1}. Then there exist coefficients α1,…,αm\alpha_1, \dots, \alpha_mα1​,…,αm​ such that w0=∑i∈Iαixiw_0 = \sum_{i \in I}\alpha_i x_iw0​=∑i∈I​αi​xi​. The examples {xi:i∈I}\{x_i : i \in I\}{xi​:i∈I} are called support vectors.

Formally: labels in {±1}\{\pm1\}{±1}; the coefficients vanish outside III.

Preamble
import Definitions.Def_UnderstandingML_SVM

open MeasureTheory
open scoped InnerProductSpace
Formal statement
namespace UnderstandingML

/-- **Theorem 15.8** (p. 210). Let `w₀` be the solution of the homogenous Hard-SVM problem (15.3)
and let `I = {i : |⟨w₀, xᵢ⟩| = 1}`. Then there exist coefficients `α₁, …, α_m` such that
`w₀ = ∑_{i ∈ I} αᵢ xᵢ`; the examples `{xᵢ : i ∈ I}` are the support vectors. Labels in `{±1}`. -/
theorem support_vectors {d m : ℕ} (x : Fin m → Vec d) (y : Fin m → ℝ)
    (hy : ∀ i, y i = 1 ∨ y i = -1) (w₀ : Vec d) (h : IsHomHardSVM x y w₀) :
    ∃ α : Fin m → ℝ, (∀ i, |⟪w₀, x i⟫_ℝ| ≠ 1 → α i = 0) ∧ w₀ = ∑ i, α i • x i := by sorry

end UnderstandingML
Source
Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms, Cambridge University Press 2014, doi:10.1017/CBO9781107298019, §15.3 p. 210, Theorem 15.8 (from Lemma 15.9)
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me