Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark before Theorem 2.4, p. 250 — a point of X leaves E_t only if c_t ∈ X, and then its value exceeds f(c_t)

Proved
ConvexOptAlg.Ellipsoid.cut_keeps_X

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

convex-optimizationcutting-planeellipsoid-methodp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let n≥2n\ge2n≥2, R>0R>0R>0, and let (ct,Ht,wt)(c_t,H_t,w_t)(ct​,Ht​,wt​) be a run of the ellipsoid method on X⊂Rn\mathcal X\subset\mathbb R^nX⊂Rn with objective fff, started from the Euclidean ball of center c0c_0c0​ and radius RRR. Fix ttt such that the oracle answers w0,…,wtw_0,\dots,w_tw0​,…,wt​ are all nonzero, and write Es={x:(x−cs)⊤Hs−1(x−cs)≤1}\mathcal E_s=\{x:(x-c_s)^\top H_s^{-1}(x-c_s)\le1\}Es​={x:(x−cs​)⊤Hs−1​(x−cs​)≤1}. If x∈Xx\in\mathcal Xx∈X lies in Et\mathcal E_tEt​ but not in Et+1\mathcal E_{t+1}Et+1​, then

ct∈Xandf(ct)<f(x).c_t\in\mathcal X\qquad\text{and}\qquad f(c_t)<f(x).ct​∈Xandf(ct​)<f(x).

This is the ellipsoid-method analogue of (2.2) for the center of gravity method: a cut never removes a point of X\mathcal XX unless it is a value cut at a center in X\mathcal XX, and such a cut removes only points that are worse than that center.

Formalization Note The page states only "at step ttt one can remove a point in X\mathcal XX from the current ellipsoid only if ct∈Xc_t\in\mathcal Xct​∈X"; the second conclusion is the inequality of (2.2) that "the exact same argument" of Theorem 2.1 uses. The nonzero answers guarantee that every HsH_sHs​, s≤t+1s\le t+1s≤t+1, is a genuine update.

Preamble
import Mathlib
import Definitions.Def_ConvexOptAlg_Ellipsoid_Defs
Formal statement
namespace ConvexOptAlg.Ellipsoid

/-- The remark before Theorem 2.4 (Bubeck, arXiv:1405.4980v2, §2.2, p. 250): at step `t` of the
ellipsoid method a point of `X` can be removed from the current ellipsoid only if `c_t ∈ X`, and
then (as in (2.2), p. 246) its value exceeds `f(c_t)`. Formally: in a run with `n ≥ 2`, `R > 0`
and nonzero oracle answers `w_0, …, w_t`, every `x ∈ X` lying in `E_t` but not in `E_{t+1}`
satisfies `c_t ∈ X` and `f(c_t) < f(x)`, where
`E_s = {x : (x − c_s)⊤H_s⁻¹(x − c_s) ≤ 1}`. -/
theorem cut_keeps_X {n : ℕ} (hn : 2 ≤ n) (X : Set (Fin n → ℝ)) (f : (Fin n → ℝ) → ℝ)
    (R : ℝ) (hR : 0 < R) (c0 : Fin n → ℝ) (c : ℕ → Fin n → ℝ)
    (H : ℕ → Matrix (Fin n) (Fin n) ℝ) (w : ℕ → Fin n → ℝ)
    (hrun : IsEllipsoidRun X f R c0 c H w) (t : ℕ) (hw : ∀ s ≤ t, w s ≠ 0)
    (x : Fin n → ℝ) (hxX : x ∈ X) (hxt : x ∈ LinearOptimization.ellipsoid (c t) (H t))
    (hxt1 : x ∉ LinearOptimization.ellipsoid (c (t + 1)) (H (t + 1))) :
    c t ∈ X ∧ f (c t) < f x := by sorry

end ConvexOptAlg.Ellipsoid
Source
Bubeck, arXiv:1405.4980v2, §2.2, remark before Theorem 2.4, p. 250; cf. (2.2), p. 246
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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