Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5, p. 122 — on a strictly convex function Algorithm NM never shrinks

Proved
NelderMeadLD.Dim2.lemma_3_5

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

nelder-meadp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strict-convexity

Let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R (n≥1n\ge1n≥1) be strictly convex, i.e. f(λy+(1−λ)z)<λf(y)+(1−λ)f(z)f(\lambda y+(1-\lambda)z)<\lambda f(y)+(1-\lambda)f(z)f(λy+(1−λ)z)<λf(y)+(1−λ)f(z) for y≠zy\ne zy=z and 0<λ<10<\lambda<10<λ<1 (Definition 3.1). Let the coefficients satisfy (2.1) and let (Δk)(\Delta_k)(Δk​) be a run of Algorithm NM on fff from a nondegenerate initial simplex Δ0\Delta_0Δ0​. Then

no iteration k of the run is a shrink step.\text{no iteration } k \text{ of the run is a shrink step.}no iteration k of the run is a shrink step.

This is why the shrink coefficient σ\sigmaσ plays no role in the analysis of strictly convex functions.

Formalization Note Strict convexity is StrictConvexOn ℝ Set.univ f. A shrink at iteration kkk means that the case analysis of steps 2–4 applied to Δk\Delta_kΔk​ ends in step 5.

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

theorem lemma_3_5 {n : ℕ} [NeZero n] (f : E n → ℝ) (ρ χ γ σ : ℝ) (hpar : NelderMeadLD.Conv1D.ParamsOK ρ χ γ σ)
    (Δ : ℕ → Fin (n + 1) → E n) (hrun : IsNMRun f ρ χ γ σ Δ) (hnd : Nondegenerate (Δ 0))
    (hf : StrictConvexOn ℝ Set.univ f) :
    ∀ k, ¬ IsShrinkAt f ρ χ γ Δ k := 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. 122, Lemma 3.5 (Definition 3.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