Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.5, p. 129 — the diameter of the 1-D Nelder–Mead interval tends to 0

Proved
NelderMeadLD.Conv1D.lemma_4_5

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

convergencenelder-meadp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strict-convexity

Let f:R→Rf : \mathbb R \to \mathbb Rf:R→R be strictly convex with bounded level sets and minimizer xmin⁡x_{\min}xmin​. Let the parameters satisfy (2.1) (in particular ρ>0\rho > 0ρ>0 and 0<γ<10 < \gamma < 10<γ<1), and let Δk=(x1(k),x2(k))\Delta_k = (x_1^{(k)}, x_2^{(k)})Δk​=(x1(k)​,x2(k)​) be the one-dimensional Nelder–Mead run from a nondegenerate, ordered initial interval Δ0\Delta_0Δ0​. Then

lim⁡k→∞diam⁡(Δk)=0,diam⁡(Δk)=∣x1(k)−x2(k)∣.\lim_{k\to\infty} \operatorname{diam}(\Delta_k) = 0, \qquad \operatorname{diam}(\Delta_k) = |x_1^{(k)} - x_2^{(k)}|.k→∞lim​diam(Δk​)=0,diam(Δk​)=∣x1(k)​−x2(k)​∣.

The interval always collapses to a point, whatever the value of ρχ\rho\chiρχ; whether that point is the minimizer is the subject of Theorem 4.1.

Formalization Note No condition on ρχ\rho\chiρχ is assumed. As in Lemma 4.4, χ>1\chi > 1χ>1, χ>ρ\chi > \rhoχ>ρ and 0<σ<10 < \sigma < 10<σ<1 come from the standing conditions (2.1).

Preamble
import Mathlib
import Definitions.Def_NelderMeadLD_Conv1D_Algorithm

open Filter Topology
Formal statement
namespace NelderMeadLD.Conv1D

theorem lemma_4_5 (f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
    (hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ})
    (xmin : ℝ) (hmin : ∀ y, f xmin ≤ f y)
    (ρ χ γ σ : ℝ) (hpar : ParamsOK ρ χ γ σ)
    (p0 : ℝ × ℝ) (h0 : IsStart f p0) :
    Tendsto (fun k => diam (run f ρ χ γ σ p0 k)) atTop (𝓝 0) := by sorry

end NelderMeadLD.Conv1D
Source
Lagarias, Reeds, Wright & Wright, Convergence properties of the Nelder–Mead simplex method in low dimensions, SIAM J. Optim. 9 (1998), p. 129, Lemma 4.5
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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