Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ellipsoid method correctness in ⌈2(n+1)log⁡(V/v)⌉\lceil 2(n+1)\log(V/v)\rceil⌈2(n+1)log(V/v)⌉ iterations

Proved
LinearOptimization.ellipsoid_method_correct

by Shuze Chen · Aug 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithm-correctnesscomplexityellipsoid-methodlinear-programming

(Theorem 8.2, p. 372, GOAL — correctness of the ellipsoid method) Let PPP be a bounded polyhedron that is either empty or full-dimensional and for which the prior information x0\mathbf{x}_0x0​, rrr, vvv, VVV is available: P⊂E0=E(x0,r2I)P \subset E_0 = E(\mathbf{x}_0, r^2 I)P⊂E0​=E(x0​,r2I), Vol(E0)≤V\mathrm{Vol}(E_0) \le VVol(E0​)≤V, and either P=∅P = \emptysetP=∅ or Vol(P)>v\mathrm{Vol}(P) > vVol(P)>v.

Then the ellipsoid method decides correctly whether PPP is nonempty or not, i.e., if xt∗−1∉P\mathbf{x}_{t^*-1} \notin Pxt∗−1​∈/P [no center x0,…,xt∗−1\mathbf{x}_0, \dots, \mathbf{x}_{t^*-1}x0​,…,xt∗−1​ of an admissible run lies in PPP], then PPP is empty, where

t∗=⌈2(n+1)log⁡(V/v)⌉.t^* = \lceil 2(n+1)\log(V/v) \rceil.t∗=⌈2(n+1)log(V/v)⌉.

Equivalently: if PPP is nonempty, every admissible run of the ellipsoid method reaches a feasible center xt∈P\mathbf{x}_t \in Pxt​∈P for some t<t∗t < t^*t<t∗.

Preamble
import Definitions.Def_LinearOptimization_EllipsoidMethod


open Matrix MeasureTheory

/-- **Bertsimas & Tsitsiklis, Theorem 8.2 (p. 372).** Correctness of the ellipsoid method: if
`P = {x | Ax ≥ b}` is bounded and either empty or full-dimensional,
`P ⊆ E(x₀, r²I)`, `Vol(E(x₀, r²I)) ≤ V`, `Vol(P) > v` unless `P = ∅`,
and an admissible run started at `(x₀, r²I)` has no feasible center
before `t* = ⌈2(n+1) log(V/v)⌉`, then `P` is empty. -/
Formal statement
theorem LinearOptimization.ellipsoid_method_correct {m n : ℕ} (hn : 2 ≤ n)
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (x0 : Fin n → ℝ) (r v V : ℝ) (hr : 0 < r) (hv : 0 < v)
    (hbdd : IsBoundedSet (polyhedron A b))
    (hdim : polyhedron A b = ∅ ∨ IsFullDimensional (polyhedron A b))
    (hcover : polyhedron A b ⊆ ellipsoidBall x0 r)
    (hV : volume (ellipsoidBall x0 r) ≤ ENNReal.ofReal V)
    (hvol : polyhedron A b ≠ ∅ →
      ENNReal.ofReal v < volume (polyhedron A b))
    (tstar : ℕ)
    (htstar : tstar = ⌈2 * ((n : ℝ) + 1) * Real.log (V / v)⌉₊)
    (x : ℕ → Fin n → ℝ) (D : ℕ → Matrix (Fin n) (Fin n) ℝ)
    (hx0 : x 0 = x0)
    (hD0 : D 0 = r ^ 2 • (1 : Matrix (Fin n) (Fin n) ℝ))
    (hrun : IsEllipsoidRun A b x D tstar)
    (hmiss : ∀ t < tstar, x t ∉ polyhedron A b) :
    polyhedron A b = ∅ := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 8.2, p. 372

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