Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3, p. 121 — f bounded below: f₁ converges; nonshrink steps decrease values; limits f*ᵢ exist and are ordered after the last shrink; vertices converge if only shrinks

Proved
NelderMeadLD.Dim2.lemma_3_3

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

convergencenelder-meadp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R (n≥1n\ge1n≥1) be bounded below, let the coefficients satisfy (2.1), and let Δ0,Δ1,…\Delta_0,\Delta_1,\dotsΔ0​,Δ1​,… be a run of Algorithm NM on fff from a nondegenerate initial simplex Δ0\Delta_0Δ0​. Write fi(k)=f(xi(k))f_i^{(k)}=f(x_i^{(k)})fi(k)​=f(xi(k)​). Then:

  1. the sequence (f1(k))k(f_1^{(k)})_k(f1(k)​)k​ converges;
  2. at every nonshrink iteration kkk,
fi(k+1)≤fi(k)(1≤i≤n+1),f_i^{(k+1)}\le f_i^{(k)}\quad(1\le i\le n+1),fi(k+1)​≤fi(k)​(1≤i≤n+1),

with strict inequality for at least one iii; 3. if no shrink occurs from iteration K0K_0K0​ on, then there are numbers f1∗,…,fn+1∗f_1^*,\dots,f_{n+1}^*f1∗​,…,fn+1∗​ such that (i) fi(k)→fi∗f_i^{(k)}\to f_i^*fi(k)​→fi∗​ for every iii, (ii) fi∗≤fi(k)f_i^*\le f_i^{(k)}fi∗​≤fi(k)​ for every iii and every k≥K0k\ge K_0k≥K0​, and (iii) f1∗≤f2∗≤⋯≤fn+1∗f_1^*\le f_2^*\le\dots\le f_{n+1}^*f1∗​≤f2∗​≤⋯≤fn+1∗​; 4. if every iteration from K0K_0K0​ on is a shrink, then all vertices converge to one common point.

These are the basic monotonicity and convergence facts on which the analysis of limiting vertex values rests.

Formalization Note "Finitely many shrink (resp. nonshrink) iterations" is written as the existence of K0K_0K0​ after which none occurs. Part 3(ii) is printed "for all kkk"; it is false when a shrink precedes K0K_0K0​, because a shrink can raise vertex values. A counterexample with n=1n=1n=1, ρ=1\rho=1ρ=1, γ=σ=12\gamma=\sigma=\tfrac12γ=σ=21​: f(0)=0f(0)=0f(0)=0, f(1)=1f(1)=1f(1)=1, f(12)=5f(\tfrac12)=5f(21​)=5, f(x)=2+∣x∣f(x)=2+|x|f(x)=2+∣x∣ otherwise, start (0,1)(0,1)(0,1); iteration 0 shrinks to (0,12)(0,\tfrac12)(0,21​) and afterwards f2(k)→2>f2(0)=1f_2^{(k)}\to2>f_2^{(0)}=1f2(k)​→2>f2(0)​=1. The statement therefore asserts (ii) for k≥K0k\ge K_0k≥K0​, which is what the later proofs use. Vertex xix_ixi​ is 0-based index i−1i-1i−1.

Preamble
import Mathlib
import Definitions.Def_NelderMeadLD_Dim2_Algorithm
open Filter Topology
Formal statement
namespace NelderMeadLD.Dim2

theorem lemma_3_3 {n : ℕ} [NeZero n] (f : E n → ℝ) (ρ χ γ σ : ℝ) (hpar : NelderMeadLD.Conv1D.ParamsOK ρ χ γ σ)
    (Δ : ℕ → Fin (n + 1) → E n) (hrun : IsNMRun f ρ χ γ σ Δ) (hnd : Nondegenerate (Δ 0))
    (hbdd : BddBelow (Set.range f)) :
    (∃ L : ℝ, Tendsto (fun k => f (Δ k 0)) atTop (𝓝 L)) ∧
    (∀ k, ¬ IsShrinkAt f ρ χ γ Δ k →
      (∀ i, f (Δ (k + 1) i) ≤ f (Δ k i)) ∧ ∃ i, f (Δ (k + 1) i) < f (Δ k i)) ∧
    (∀ K₀ : ℕ, (∀ k ≥ K₀, ¬ IsShrinkAt f ρ χ γ Δ k) →
      ∃ fstar : Fin (n + 1) → ℝ,
        (∀ i, Tendsto (fun k => f (Δ k i)) atTop (𝓝 (fstar i))) ∧
        (∀ i, ∀ k ≥ K₀, fstar i ≤ f (Δ k i)) ∧
        Monotone fstar) ∧
    (∀ K₀ : ℕ, (∀ k ≥ K₀, IsShrinkAt f ρ χ γ Δ k) →
      ∃ p : E n, ∀ i, Tendsto (fun k => Δ k i) atTop (𝓝 p)) := by sorry

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