Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 6 — the extended approximation oracle: v · c ≤ min over αK, s dominates v on F, ‖v‖ ≤ (α + 2)R

Proved
ApproxOLO.FullInfo.lemma_1

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

approximation-algorithmslinear-optimization-oracleonline-learningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let K,F⊂R+d\mathcal K,\mathcal F\subset\mathbb R^d_+K,F⊂R+d​, R,F,CR,F,CR,F,C be an instance of online linear optimization (compact sets, K\mathcal KK nonempty, ∥x∥≤R\|x\|\le R∥x∥≤R on K\mathcal KK, ∥f∥≤F\|f\|\le F∥f∥≤F on F\mathcal FF, 0≤x⋅f≤C0\le x\cdot f\le C0≤x⋅f≤C), and let OK\mathcal O_{\mathcal K}OK​ be an α\alphaα-approximation oracle for some α>0\alpha>0α>0. For every c∈Rdc\in\mathbb R^dc∈Rd, the extended oracle output (v,s)=O^K(c)(v,s)=\hat{\mathcal O}_{\mathcal K}(c)(v,s)=O^K​(c) of Eq. (2) satisfies s∈Ks\in\mathcal Ks∈K, v∈K+B(0,(1+α)R)v\in\mathcal K+\mathcal B(0,(1+\alpha)R)v∈K+B(0,(1+α)R), and

v⋅c≤min⁡x∈αKx⋅c;v\cdot c\le\min_{x\in\alpha\mathcal K}x\cdot c;v⋅c≤x∈αKmin​x⋅c;
  1. for every f∈Ff\in\mathcal Ff∈F: s⋅f≤v⋅fs\cdot f\le v\cdot fs⋅f≤v⋅f if α≥1\alpha\ge1α≥1, and s⋅f≥v⋅fs\cdot f\ge v\cdot fs⋅f≥v⋅f if α<1\alpha<1α<1;
  2. ∥v∥≤(α+2)R\|v\|\le(\alpha+2)R∥v∥≤(α+2)R.

The extended oracle accepts every direction in Rd\mathbb R^dRd, not only those in R+d\mathbb R^d_+R+d​; it optimizes as well as any point of CH(αK)\mathrm{CH}(\alpha\mathcal K)CH(αK) while returning, alongside the possibly infeasible point vvv, a feasible point sss that dominates it on every loss/payoff vector.

Formalization Note ∥⋅∥\|\cdot\|∥⋅∥ is the Euclidean norm. Membership in K+B(0,(1+α)R)\mathcal K+\mathcal B(0,(1+\alpha)R)K+B(0,(1+α)R) is stated as ∥v−k∥≤(1+α)R\|v-k\|\le(1+\alpha)R∥v−k∥≤(1+α)R for some k∈Kk\in\mathcal Kk∈K (closed ball), and item 1 as v⋅c≤(αz)⋅cv\cdot c\le(\alpha z)\cdot cv⋅c≤(αz)⋅c for every z∈Kz\in\mathcal Kz∈K.

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

open Matrix

/-- **Lemma 1 (Extended approximation oracle), Garber, arXiv:1709.03093v1, p. 6.** For every
`c ∈ ℝ^d`, `(v, s) = Ô_K(c)` satisfies `s ∈ K`, `v ∈ K + B(0, (1 + α)R)`, and
1. `v · c ≤ min_{x∈αK} x · c`;
2. `∀ f ∈ F`: `s · f ≤ v · f` if `α ≥ 1` and `s · f ≥ v · f` if `α < 1`;
3. `‖v‖ ≤ (α + 2)R`. -/
theorem lemma_1 {d : ℕ} (K Fs : Set (Vec d)) (R Fb C alpha : ℝ) (O : Vec d → Vec d)
    (hinst : IsInstance K Fs R Fb C) (halpha : 0 < alpha) (hO : IsApproxOracle K alpha O)
    (c : Vec d) :
    (extOracle O alpha R c).2 ∈ K ∧
    (∃ k ∈ K, euclNorm ((extOracle O alpha R c).1 - k) ≤ (1 + alpha) * R) ∧
    (∀ z ∈ K, (extOracle O alpha R c).1 ⬝ᵥ c ≤ (alpha • z) ⬝ᵥ c) ∧
    (∀ f ∈ Fs, (1 ≤ alpha → (extOracle O alpha R c).2 ⬝ᵥ f ≤ (extOracle O alpha R c).1 ⬝ᵥ f) ∧
      (alpha < 1 → (extOracle O alpha R c).1 ⬝ᵥ f ≤ (extOracle O alpha R c).2 ⬝ᵥ f)) ∧
    euclNorm (extOracle O alpha R c).1 ≤ (alpha + 2) * R := by sorry

end ApproxOLO.FullInfo
Source
Garber, Efficient Online Linear Optimization with Approximation Algorithms, arXiv:1709.03093v1, p. 6, Lemma 1 (Eq. (2))
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