Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p. 87 — the localizing ellipsoids shrink in volume by the ratio qn<1q_n < 1qn​<1 per iteration

Open
ShorNonsmooth.Ellipsoid.ellipsoid_volume_ratio

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, g:En→Eng : E_n \to E_ng:En​→En​ any vector field and x0∈Enx_0 \in E_nx0​∈En​, and run the algorithm (3.57)–(3.60). Suppose the (k+1)(k+1)(k+1)-st iteration is performed, i.e. g(xk)≠0g(x_k) \neq 0g(xk​)=0. With Aj=Bj−1A_j = B_j^{-1}Aj​=Bj−1​ and Φj={x:∥Aj(x−cj)∥≤(n+1)hj}\Phi_j = \{x : \|A_j(x - c_j)\| \le (n+1) h_j\}Φj​={x:∥Aj​(x−cj​)∥≤(n+1)hj​} for arbitrary centers ck,ck+1c_k, c_{k+1}ck​,ck+1​, the volume v(Φk)v(\Phi_k)v(Φk​) is positive and finite, and

v(Φk+1)=qn v(Φk),qn=n−1n+1(nn2−1)n<1.v(\Phi_{k+1}) = q_n\, v(\Phi_k), \qquad q_n = \sqrt{\frac{n-1}{n+1}}\left(\frac{n}{\sqrt{n^2-1}}\right)^{n} < 1 .v(Φk+1​)=qn​v(Φk​),qn​=n+1n−1​​(n2−1​n​)n<1.

Thus the volume of the ellipsoid that localizes the solution according to (3.61) decreases geometrically with ratio qnq_nqn​, which depends only on the dimension (qn≈1−1/(2n)q_n \approx 1 - 1/(2n)qn​≈1−1/(2n) for large nnn).

Formalization Note The chain of equalities printed on p. 87 carries the exponents 222 and 111 on n/n2−1n/\sqrt{n^2-1}n/n2−1​ where nnn is meant, and writes (n−1)/(n+1)(n-1)/(n+1)(n−1)/(n+1) where (n−1)/(n+1)=β\sqrt{(n-1)/(n+1)} = \beta(n−1)/(n+1)​=β is meant; the statement uses the value of qnq_nqn​ printed on p. 88, which is what the book's own derivation gives (det⁡Ak+1=det⁡R1/β(ξk)det⁡Ak=β−1det⁡Ak\det A_{k+1} = \det R_{1/\beta}(\xi_k)\det A_k = \beta^{-1}\det A_kdetAk+1​=detR1/β​(ξk​)detAk​=β−1detAk​). The volumes are compared in ℝ≥0∞; positivity and finiteness of v(Φk)v(\Phi_k)v(Φk​) are stated so that the identity is the book's ratio.

Preamble
import Mathlib
import Definitions.Def_ShorNonsmooth_Ellipsoid_EllipsoidMethod

open MeasureTheory
Formal statement
namespace ShorNonsmooth.Ellipsoid

/-- Shor (1985), pp. 87–88, the volume ratio after the proof of Theorem 3.14, corrected. Let
`n > 1`, `R > 0`, and let the `(k+1)`-st iteration of (3.57)–(3.60) be performed (`g(x_k) ≠ 0`).
With `Φ_k = {x : ‖A_k (x - c)‖ ≤ (n + 1) h_k}`, `A_k = B_k⁻¹`, the volume of `Φ_k` is positive and
finite and, for any centers `c, c'`,
`v(Φ_{k+1}) = q_n v(Φ_k)` with `q_n = √((n - 1)/(n + 1)) (n/√(n² - 1))ⁿ < 1` (p. 88).
The printed chain on p. 87 carries the exponents `2` and `1` on `n/√(n² - 1)` and drops the
square root on `(n - 1)/(n + 1)`; the statement follows the value of `q_n` on p. 88. -/
theorem ellipsoid_volume_ratio {n : ℕ} (hn : 1 < n)
    (g : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) (R : ℝ) (hR : 0 < R)
    (x₀ : EuclideanSpace ℝ (Fin n)) (k : ℕ)
    (hstep : g (ellipsoidMethod g R x₀ k).x ≠ 0) :
    qRatio n < 1 ∧
    ∀ c c' : EuclideanSpace ℝ (Fin n),
      0 < volume (ellipsoid (ellipsoidMethod g R x₀ k).B⁻¹ c
          (((n : ℝ) + 1) * (ellipsoidMethod g R x₀ k).h)) ∧
      volume (ellipsoid (ellipsoidMethod g R x₀ k).B⁻¹ c
          (((n : ℝ) + 1) * (ellipsoidMethod g R x₀ k).h)) < ⊤ ∧
      volume (ellipsoid (ellipsoidMethod g R x₀ (k + 1)).B⁻¹ c'
          (((n : ℝ) + 1) * (ellipsoidMethod g R x₀ (k + 1)).h)) =
        ENNReal.ofReal (qRatio n) *
          volume (ellipsoid (ellipsoidMethod g R x₀ k).B⁻¹ c
            (((n : ℝ) + 1) * (ellipsoidMethod g R x₀ k).h)) := 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 (corrected), and p. 88, the definition of qnq_nqn​
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