Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5 (case n = 1), p. 122 — for strictly convex f no shrink step is taken by the 1-D Nelder–Mead method

Proved
NelderMeadLD.Conv1D.lemma_3_5_one_dim

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

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

Let f:R→Rf : \mathbb R \to \mathbb Rf:R→R be strictly convex, let the parameters satisfy (2.1), and run Algorithm NM in dimension 111 from a nondegenerate initial interval Δ0=(x1(0),x2(0))\Delta_0 = (x_1^{(0)}, x_2^{(0)})Δ0​=(x1(0)​,x2(0)​), x1(0)≠x2(0)x_1^{(0)} \ne x_2^{(0)}x1(0)​=x2(0)​, ordered so that f(x1(0))≤f(x2(0))f(x_1^{(0)}) \le f(x_2^{(0)})f(x1(0)​)≤f(x2(0)​). Then for every iteration kkk,

iteration k is not a shrink step.\text{iteration } k \text{ is not a shrink step.}iteration k is not a shrink step.

This is the one-dimensional case of the paper's Lemma 3.5. It is why the shrink coefficient σ\sigmaσ plays no role in the one-dimensional analysis.

Formalization Note The general-nnn Lemma 3.5 belongs to a separate mission of this series; this item is its n=1n = 1n=1 case on the one-dimensional algorithm of this mission. Bounded level sets are not needed and not assumed.

Preamble
import Mathlib
import Definitions.Def_NelderMeadLD_Conv1D_Algorithm

open Filter Topology
Formal statement
namespace NelderMeadLD.Conv1D

theorem lemma_3_5_one_dim (f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
    (ρ χ γ σ : ℝ) (hpar : ParamsOK ρ χ γ σ)
    (p0 : ℝ × ℝ) (h0 : IsStart f p0) :
    ∀ k : ℕ, move f ρ χ γ (run f ρ χ γ σ p0 k) ≠ Move.shrink := 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. 122, Lemma 3.5 (case n = 1)
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