Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.6, p. 131 — with ρ = 1: at most r* = ⌈χ − 1⌉ consecutive reflections, and no expansion right after a reflection

Proved
NelderMeadLD.Rate1D.lemma_4_6

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 reflection coefficient ρ=1\rho = 1ρ=1, expansion coefficient χ>1\chi > 1χ>1, contraction coefficient 0<γ<10 < \gamma < 10<γ<1 and shrink coefficient 0<σ<10 < \sigma < 10<σ<1, starting from a nondegenerate ordered initial interval Δ0\Delta_0Δ0​. Let

r∗=⌈χ−1⌉.r^* = \lceil \chi - 1 \rceil.r∗=⌈χ−1⌉.

Then:

  1. the number of consecutive reflections is at most r∗r^*r∗: there is no kkk such that iterations k,k+1,…,k+r∗k, k+1, \dots, k + r^*k,k+1,…,k+r∗ are all reflections;
  2. the iteration immediately following a reflection is never an expansion.

These two facts restrict which move sequences the method can produce in dimension 1 with ρ=1\rho = 1ρ=1, and are the first ingredients of the paper's M-step linear convergence result (Theorem 4.2).

Formalization Note. ρ=1\rho = 1ρ=1 is substituted into the algorithm. The standing conditions (2.1) are carried as a hypothesis; with ρ=1\rho = 1ρ=1 they reduce to χ>1\chi > 1χ>1, 0<γ<10 < \gamma < 10<γ<1, 0<σ<10 < \sigma < 10<σ<1. r∗r^*r∗ is the natural-number ceiling ⌈χ − 1⌉₊, equal to the paper's value for χ>1\chi > 1χ>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_6 (χ γ σ : ℝ) (hpar : ParamsOK 1 χ γ σ)
    (f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
    (hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ})
    (p0 : ℝ × ℝ) (h0 : IsStart f p0) :
    (∀ k : ℕ, ¬ ∀ i < rStar χ + 1, moveAt f χ γ σ p0 (k + i) = Move.reflect) ∧
    (∀ k : ℕ, moveAt f χ γ σ p0 k = Move.reflect →
      moveAt f χ γ σ p0 (k + 1) ≠ Move.expand) := 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. 131, Lemma 4.6
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