Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 11 — if min_i (x − v_i) · w ≤ ε for every unit w, an optimal point p of Problem (5) satisfies ‖p − x‖ ≤ ε

Proved
ApproxOLO.FullInfo.lemma_6

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

approximation-algorithmsconvex-geometryminimum-norm-pointp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix x∈Rdx\in\mathbb R^dx∈Rd, vectors v1,…,vN∈Rdv_1,\dots,v_N\in\mathbb R^dv1​,…,vN​∈Rd with N≥1N\ge1N≥1, and ε>0\varepsilon>0ε>0. Suppose that for every Euclidean unit vector www,

min⁡i∈{1,…,N}(x−vi)⋅w≤ε.\min_{i\in\{1,\dots,N\}}(x-v_i)\cdot w\le\varepsilon .i∈{1,…,N}min​(x−vi​)⋅w≤ε.

Let (a1,…,aN)(a_1,\dots,a_N)(a1​,…,aN​) be an optimal solution of Problem (5), i.e. a minimizer of 12∥∑i=1Naivi−x∥2\tfrac12\|\sum_{i=1}^Na_iv_i-x\|^221​∥∑i=1N​ai​vi​−x∥2 over the probability simplex. Then the point p=∑i=1Naivip=\sum_{i=1}^Na_iv_ip=∑i=1N​ai​vi​ satisfies

∥p−x∥≤ε.\|p-x\|\le\varepsilon.∥p−x∥≤ε.

The lemma converts the absence of a separating direction with margin ε\varepsilonε into an explicit convex combination of the viv_ivi​ that is ε\varepsilonε-close to xxx; it is the decomposition half of the separation-or-decomposition procedure (Lemma 5).

Formalization Note ∥⋅∥\|\cdot\|∥⋅∥ is Euclidean, and a unit vector is one of Euclidean norm 1. N≥1N\ge1N≥1 is implicit in the page's min⁡i∈{1,…,N}\min_{i\in\{1,\dots,N\}}mini∈{1,…,N}​ and in the simplex constraint of Problem (5).

Preamble
import Mathlib
import Definitions.Def_ApproxOLO_FullInfo_Model
Formal statement
namespace ApproxOLO.FullInfo

open Matrix

/-- **Lemma 6, Garber, arXiv:1709.03093v1, p. 11.** Fix `x ∈ ℝ^d`, vectors `v_1, …, v_N ∈ ℝ^d`
(`N ≥ 1`) and `ε > 0`. If for every (Euclidean) unit vector `w`,
`min_{i∈{1,…,N}} (x − v_i) · w ≤ ε`, then for every optimal solution `(a_1, …, a_N)` of
Problem (5) the point `p = Σ_i a_i v_i` satisfies `‖p − x‖ ≤ ε`. -/
theorem lemma_6 {d N : ℕ} (hN : 1 ≤ N) (x : Vec d) (v : Fin N → Vec d) (eps : ℝ)
    (heps : 0 < eps) (hmin : ∀ w : Vec d, euclNorm w = 1 → ∃ i, (x - v i) ⬝ᵥ w ≤ eps)
    (a : Fin N → ℝ) (ha : IsSimplexOpt v x a) :
    euclNorm (∑ i, a i • v i - x) ≤ eps := by sorry

end ApproxOLO.FullInfo
Source
Garber, Efficient Online Linear Optimization with Approximation Algorithms, arXiv:1709.03093v1, p. 11, Lemma 6 (Problem (5), p. 10)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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