Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p. 87 — the localizing ellipsoid Φk\Phi_kΦk​ has volume v0Rn(n/n2−1)nk/det⁡Akv_0 R^n (n/\sqrt{n^2-1})^{nk}/\det A_kv0​Rn(n/n2−1​)nk/detAk​

Proved
ShorNonsmooth.Ellipsoid.ellipsoid_volume_formula

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

ellipsoid-methodp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1volume

Let n>1n > 1n>1, R>0R > 0R>0, let g:En→Eng : E_n \to E_ng:En​→En​ be any vector field and x0∈Enx_0 \in E_nx0​∈En​, and run the algorithm (3.57)–(3.60) from x0x_0x0​, B0=InB_0 = I_nB0​=In​, h0=R/(n+1)h_0 = R/(n+1)h0​=R/(n+1). Suppose that the first kkk iterations are performed, i.e. g(xj)≠0g(x_j) \ne 0g(xj​)=0 for j=0,…,k−1j = 0, \dots, k-1j=0,…,k−1, and put Ak=Bk−1A_k = B_k^{-1}Ak​=Bk−1​. Then

(n+1) hk=R(nn2−1)k,(n+1)\,h_k = R\left(\frac{n}{\sqrt{n^2-1}}\right)^{k},(n+1)hk​=R(n2−1​n​)k,

and for every center c∈Enc \in E_nc∈En​ the ellipsoid Φk={x:∥Ak(x−c)∥≤(n+1)hk}\Phi_k = \{x : \|A_k(x - c)\| \le (n+1) h_k\}Φk​={x:∥Ak​(x−c)∥≤(n+1)hk​} has Lebesgue volume

v(Φk)=v0 Rn(nn2−1)nk/det⁡Ak,v(\Phi_k) = v_0\, R^n \left(\frac{n}{\sqrt{n^2-1}}\right)^{nk} \Big/ \det A_k ,v(Φk​)=v0​Rn(n2−1​n​)nk/detAk​,

where v0v_0v0​ is the volume of the closed unit ball of EnE_nEn​.

This is the volume computation that turns the localization inequality (3.61) of Theorem 3.14 into a rate: the solution lies in an ellipsoid whose volume is known explicitly.

Formalization Note The book centers Φk\Phi_kΦk​ at x∗x^*x∗; since Lebesgue measure is translation invariant, the statement is given for an arbitrary center, which covers both x∗x^*x∗ and the iterate xkx_kxk​. The volume is an element of ℝ≥0∞ and the right-hand side is volume (closedBall 0 1) * ENNReal.ofReal (…).

Preamble
import Mathlib
import Definitions.Def_ShorNonsmooth_Ellipsoid_EllipsoidMethod

open MeasureTheory
Formal statement
namespace ShorNonsmooth.Ellipsoid

/-- Shor (1985), p. 87, display after the proof of Theorem 3.14. Let `n > 1`, `R > 0`, and let
the algorithm (3.57)–(3.60) run for `k` iterations without stopping (`g(x_j) ≠ 0` for `j < k`).
Then `(n + 1) h_k = R (n/√(n² - 1))^k`, and for every center `c` the ellipsoid
`Φ_k = {x : ‖A_k (x - c)‖ ≤ (n + 1) h_k}`, `A_k = B_k⁻¹`, has volume
`v₀ Rⁿ (n/√(n² - 1))^{nk} / det A_k`, where `v₀` is the volume of the unit ball.
(The book centers `Φ_k` at `x*`; the volume does not depend on the center.) -/
theorem ellipsoid_volume_formula {n : ℕ} (hn : 1 < n)
    (g : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) (R : ℝ) (hR : 0 < R)
    (x₀ : EuclideanSpace ℝ (Fin n)) (k : ℕ)
    (hrun : ∀ j < k, g (ellipsoidMethod g R x₀ j).x ≠ 0) :
    ((n : ℝ) + 1) * (ellipsoidMethod g R x₀ k).h = R * ratio n ^ k ∧
    ∀ c : EuclideanSpace ℝ (Fin n),
      volume (ellipsoid (ellipsoidMethod g R x₀ k).B⁻¹ c
          (((n : ℝ) + 1) * (ellipsoidMethod g R x₀ k).h)) =
        volume (Metric.closedBall (0 : EuclideanSpace ℝ (Fin n)) 1) *
          ENNReal.ofReal (R ^ n * ratio n ^ (n * k) / ((ellipsoidMethod g R x₀ k).B⁻¹).det) := by sorry

end ShorNonsmooth.Ellipsoid
Source
Shor, Minimization Methods for Non-Differentiable Functions, Springer 1985, p. 87, display following the proof of Theorem 3.14
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

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