Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2, p. 125 — with ρχ ≥ 1 the minimizer is eventually bracketed by x₂ and x_e (without the printed bound on K)

Disproved
NelderMeadLD.Conv1D.lemma_4_2

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 {x:f(x)≤μ}\{x : f(x) \le \mu\}{x:f(x)≤μ}, and let xmin⁡x_{\min}xmin​ be its minimizer. Let the parameters satisfy (2.1) and in addition ρχ≥1\rho\chi \ge 1ρχ≥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​. Write xe(k)=x1(k)+ρχ(x1(k)−x2(k))x_e^{(k)} = x_1^{(k)} + \rho\chi(x_1^{(k)} - x_2^{(k)})xe(k)​=x1(k)​+ρχ(x1(k)​−x2(k)​) for the expansion point and fi(k)=f(xi(k))f_i^{(k)} = f(x_i^{(k)})fi(k)​=f(xi(k)​), fe(k)=f(xe(k))f_e^{(k)} = f(x_e^{(k)})fe(k)​=f(xe(k)​).

Then there is a smallest integer K≥0K \ge 0K≥0 such that

f2(K)≥f1(K)andf1(K)≤fe(K),f_2^{(K)} \ge f_1^{(K)} \quad\text{and}\quad f_1^{(K)} \le f_e^{(K)},f2(K)​≥f1(K)​andf1(K)​≤fe(K)​,

and for this KKK the minimizer is bracketed by x2(K)x_2^{(K)}x2(K)​ and xe(K)x_e^{(K)}xe(K)​: xmin⁡∈int⁡(x2(K),xe(K))x_{\min} \in \operatorname{int}(x_2^{(K)}, x_e^{(K)})xmin​∈int(x2(K)​,xe(K)​), the open interval with these endpoints.

The lemma is the first step of the convergence proof: within finitely many iterations the method finds an interval of uncertainty containing the minimizer.

Formalization Note The printed lemma also asserts K≤∣xmin⁡−x1(0)∣/diam⁡(Δ0)K \le |x_{\min} - x_1^{(0)}| / \operatorname{diam}(\Delta_0)K≤∣xmin​−x1(0)​∣/diam(Δ0​). That bound is false: for f(x)=(x−5)2f(x) = (x-5)^2f(x)=(x−5)2, Δ0=(3,0)\Delta_0 = (3, 0)Δ0​=(3,0), ρ=1\rho = 1ρ=1, χ=1.1\chi = 1.1χ=1.1, the bound is 2/32/32/3, but f1(0)=4>fe(0)=f(6.3)=1.69f_1^{(0)} = 4 > f_e^{(0)} = f(6.3) = 1.69f1(0)​=4>fe(0)​=f(6.3)=1.69, so K≥1K \ge 1K≥1. The bound is not stated here and no substitute bound is invented; Theorem 4.1 uses only the existence of KKK. "Smallest" is stated as: the condition fails at every j<Kj < Kj<K. The coefficients γ,σ\gamma, \sigmaγ,σ are constrained by 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_2 (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)
    (hρχ : 1 ≤ ρ * χ) :
    ∃ K : ℕ, Bracketed ρ χ f (run f ρ χ γ σ p0 K) ∧
      (∀ j < K, ¬ Bracketed ρ χ f (run f ρ χ γ σ p0 j)) ∧
      min (run f ρ χ γ σ p0 K).2 (xe ρ χ (run f ρ χ γ σ p0 K)) < xmin ∧
      xmin < max (run f ρ χ γ σ p0 K).2 (xe ρ χ (run f ρ χ γ σ p0 K)) := 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. 125, Lemma 4.2, (4.2) (printed bound on K omitted: false)
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