Lemma 3.3 — contracting along a long chord of keeps the width above
OpenShorNonsmooth.RAlgorithm.width_dilation_lower_boundconvex-geometryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1space-dilationwidth
Let be a convex, closed and bounded body in () with width , let , let , and suppose that
Let be the operator of space dilation in the direction with coefficient . Then
Contracting a convex body along the direction of one of its chords that is at least as long as the width cannot make the body much thinner: the loss is controlled by the ratio . This is the step that limits the shrinkage of the transformed almost-gradient sets in the -algorithm.
Formalization Note The book states ; is added because the bound divides by and the lemma is used with , . "Body" is taken to mean nonempty interior, so and is defined.
Preamble
import Mathlib import Definitions.Def_ShorNonsmooth_RAlgorithm_Widths open scoped InnerProductSpace
Formal statement
namespace ShorNonsmooth.RAlgorithm
/-- Shor (1985), pp. 80–81, **Lemma 3.3**. Let `W` be a convex, closed and bounded body in `E_n`,
`z₁, z₂ ∈ W`, `0 < β ≤ 1` (the book writes `β ≤ 1`; `β > 0` is implicit: the bound divides by
`β²` and the lemma is applied with `β = 1/α`, `α > 1`), and `γ = ‖z₁ - z₂‖ / d(W) ≥ 1`. Then
`d(R_β((z₁ - z₂)/‖z₁ - z₂‖) W) ≥ d(W) / √(1 + (1 - β²)/(β² γ²))`. -/
theorem width_dilation_lower_bound {n : ℕ} (hn : 0 < n) (W : Set (EuclideanSpace ℝ (Fin n)))
(hW_convex : Convex ℝ W) (hW_closed : IsClosed W) (hW_bdd : Bornology.IsBounded W)
(hW_body : (interior W).Nonempty)
(z₁ z₂ : EuclideanSpace ℝ (Fin n)) (hz₁ : z₁ ∈ W) (hz₂ : z₂ ∈ W)
(β : ℝ) (hβ_pos : 0 < β) (hβ_le : β ≤ 1)
(γ : ℝ) (hγ : γ = ‖z₁ - z₂‖ / width W) (hγ_ge : 1 ≤ γ) :
width W / Real.sqrt (1 + (1 - β ^ 2) / (β ^ 2 * γ ^ 2)) ≤
width (dilation β (‖z₁ - z₂‖⁻¹ • (z₁ - z₂)) '' W) := by sorry
end ShorNonsmooth.RAlgorithm
Source
Shor, Minimization Methods for Non-Differentiable Functions, Springer 1985, pp. 80–81, Lemma 3.3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.