Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.8, p. 133 — with ρ = 1, the diameter shrinks by a factor φ < 1, depending only on χ and γ, between consecutive contractions

Proved
NelderMeadLD.Rate1D.lemma_4_8

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

direct-searchnelder-meadp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strict-convexity

Fix χ>1\chi > 1χ>1 and 0<γ<10 < \gamma < 10<γ<1. There is a number φ<1\varphi < 1φ<1, depending only on χ\chiχ and γ\gammaγ, with the following property. Let 0<σ<10 < \sigma < 10<σ<1, 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 and coefficients χ,γ,σ\chi, \gamma, \sigmaχ,γ,σ to fff, starting from a nondegenerate ordered initial interval Δ0\Delta_0Δ0​. If iterations k<k′k < k'k<k′ are contractions and no iteration strictly between them is a contraction, then the simplex Δ=Δk+1\Delta = \Delta_{k+1}Δ=Δk+1​ immediately following contraction kkk and the simplex Δ′=Δk′+1\Delta' = \Delta_{k'+1}Δ′=Δk′+1​ immediately following the next contraction k′k'k′ satisfy

diam⁡(Δ′)≤φ diam⁡(Δ).\operatorname{diam}(\Delta') \le \varphi\, \operatorname{diam}(\Delta).diam(Δ′)≤φdiam(Δ).

This is the per-cycle contraction factor of the move-sequence analysis; Theorem 4.2 follows by chaining these cycles.

Formalization Note. "Depending only on χ\chiχ and γ\gammaγ" is encoded by the quantifier order: φ\varphiφ is chosen after χ,γ\chi, \gammaχ,γ and before σ\sigmaσ, fff and Δ0\Delta_0Δ0​. Δk\Delta_kΔk​ is the simplex at the start of iteration kkk, so the simplex immediately following iteration kkk is Δk+1\Delta_{k+1}Δk+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_8 :
    ∀ χ γ : ℝ, 1 < χ → 0 < γ → γ < 1 →
      ∃ φ : ℝ, φ < 1 ∧
        ∀ σ : ℝ, 0 < σ → σ < 1 →
        ∀ f : ℝ → ℝ, StrictConvexOn ℝ Set.univ f →
        (∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ}) →
        ∀ p0 : ℝ × ℝ, IsStart f p0 →
        ∀ k k' : ℕ, k < k' →
          IsContraction (moveAt f χ γ σ p0 k) →
          IsContraction (moveAt f χ γ σ p0 k') →
          (∀ i : ℕ, k < i → i < k' → ¬ IsContraction (moveAt f χ γ σ p0 i)) →
          diam (run f 1 χ γ σ p0 (k' + 1)) ≤ φ * diam (run f 1 χ γ σ p0 (k + 1)) := 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. 133, Lemma 4.8
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