Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.1, p. 131 — with ρ = 1, a contraction occurs no later than iteration K + r*, K the first bracketing index

Proved
NelderMeadLD.Rate1D.corollary_4_1

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 KKK be the iteration index of Lemma 4.2, at which for the first time

f1(K)≤fe(K),f_1^{(K)} \le f_e^{(K)},f1(K)​≤fe(K)​,

where f1(K)f_1^{(K)}f1(K)​ is the value at the best vertex of ΔK\Delta_KΔK​ and fe(K)f_e^{(K)}fe(K)​ the value at the expansion point xe(K)=x1(K)+χ(x1(K)−x2(K))x_e^{(K)} = x_1^{(K)} + \chi(x_1^{(K)} - x_2^{(K)})xe(K)​=x1(K)​+χ(x1(K)​−x2(K)​). Then some iteration kkk with K≤k≤K+r∗K \le k \le K + r^*K≤k≤K+r∗, where r∗=⌈χ−1⌉r^* = \lceil \chi - 1\rceilr∗=⌈χ−1⌉, is a contraction (outside or inside).

The result locates the first contraction after the minimizer is bracketed; from that contraction on, the paper's move-sequence analysis applies.

Formalization Note. The printed corollary names only ρ=1\rho = 1ρ=1; the conditions χ>1\chi > 1χ>1, 0<γ<10 < \gamma < 10<γ<1 (and 0<σ<10 < \sigma < 10<σ<1) are the section's standing assumptions (2.1) and are carried as hypotheses. KKK is a binder together with the hypothesis that it is the first index with f1(K)≤fe(K)f_1^{(K)} \le f_e^{(K)}f1(K)​≤fe(K)​, as on the page.

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

open NelderMeadLD.Conv1D

theorem corollary_4_1 (χ γ σ : ℝ) (hpar : ParamsOK 1 χ γ σ)
    (f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
    (hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ})
    (p0 : ℝ × ℝ) (h0 : IsStart f p0)
    (K : ℕ) (hK : FirstBracket f χ γ σ p0 K) :
    ∃ k : ℕ, K ≤ k ∧ k ≤ K + rStar χ ∧ IsContraction (moveAt f χ γ σ p0 k) := 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, Corollary 4.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