Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.7, p. 132 — with ρ = 1, after a contraction there are never more than j* consecutive expansions

Proved
NelderMeadLD.Rate1D.lemma_4_7

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

direct-searchnelder-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 apply the one-dimensional Nelder–Mead method with ρ=1\rho = 1ρ=1, χ>1\chi > 1χ>1, 0<γ<10 < \gamma < 10<γ<1, 0<σ<10 < \sigma < 10<σ<1 to fff, starting from a nondegenerate ordered initial interval Δ0\Delta_0Δ0​. Let NNM=max⁡(χ,1/γ)N_{NM} = \max(\chi, 1/\gamma)NNM​=max(χ,1/γ) and let j∗j^*j∗ be the largest integer j≥0j \ge 0j≥0 with

χ+χ2+⋯+χj<NNM\chi + \chi^2 + \cdots + \chi^{j} < N_{NM}χ+χ2+⋯+χj<NNM​

(so j∗=0j^* = 0j∗=0 when χ=NNM\chi = N_{NM}χ=NNM​). If iteration kkk is a contraction, then at all later iterations there are no more than j∗j^*j∗ consecutive expansions: whenever m>km > km>k and iterations m,m+1,…,m+L−1m, m+1, \dots, m+L-1m,m+1,…,m+L−1 are all expansions, L≤j∗L \le j^*L≤j∗.

Together with Lemma 4.6 this bounds the length of every move sequence between two contractions, which is what makes the diameter decrease at a uniform rate.

Formalization Note. ρ=1\rho = 1ρ=1 is substituted; (2.1) is carried as a hypothesis. The two cases (a) and (b) of the page are encoded by one definition of j∗j^*j∗ as the largest jjj in {0,…,⌈NNM⌉}\{0, \dots, \lceil N_{NM}\rceil\}{0,…,⌈NNM​⌉} satisfying the strict inequality; in case (a) only j=0j = 0j=0 satisfies it. The block of expansions may start at any m>km > km>k, not only at k+1k + 1k+1.

Preamble
import Mathlib
import Definitions.Def_NelderMeadLD_Conv1D_Algorithm
import Definitions.Def_NelderMeadLD_Rate1D_Algorithm
Formal statement
namespace NelderMeadLD.Rate1D

open NelderMeadLD.Conv1D

theorem lemma_4_7 (χ γ σ : ℝ) (hpar : ParamsOK 1 χ γ σ)
    (f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
    (hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ})
    (p0 : ℝ × ℝ) (h0 : IsStart f p0)
    (k : ℕ) (hk : IsContraction (moveAt f χ γ σ p0 k)) :
    ∀ m : ℕ, k < m → ∀ L : ℕ,
      (∀ i < L, moveAt f χ γ σ p0 (m + i) = Move.expand) → L ≤ jStar χ γ := by sorry

end NelderMeadLD.Rate1D
Source
Lagarias, Reeds, Wright & Wright, Convergence properties of the Nelder–Mead simplex method in low dimensions, SIAM J. Optim. 9 (1998), p. 132, Lemma 4.7
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