Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, p. 120 — nondegeneracy is preserved; vol(Δₖ₊₁) = |τ| vol(Δₖ) after a step of type τ, = σⁿ vol(Δₖ) after a shrink

Proved
NelderMeadLD.Dim2.lemma_3_1

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

nelder-meadp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simplex-volume

Let the coefficients satisfy (2.1), let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R (n≥1n\ge1n≥1) be arbitrary, and let (Δk)(\Delta_k)(Δk​) be a run of Algorithm NM on fff from a nondegenerate initial simplex Δ0\Delta_0Δ0​. Then

  1. every simplex Δk\Delta_kΔk​ is nondegenerate;
  2. after a nonshrink iteration of type τ\tauτ (the coefficient of the accepted point),
vol⁡(Δk+1)=∣τ∣ vol⁡(Δk);\operatorname{vol}(\Delta_{k+1})=|\tau|\,\operatorname{vol}(\Delta_k);vol(Δk+1​)=∣τ∣vol(Δk​);
  1. after a shrink iteration, vol⁡(Δk+1)=σnvol⁡(Δk)\operatorname{vol}(\Delta_{k+1})=\sigma^n\operatorname{vol}(\Delta_k)vol(Δk+1​)=σnvol(Δk​).

In particular a reflection with ρ=1\rho=1ρ=1 preserves volume, which the proof of Theorem 5.2 uses.

Formalization Note vol⁡(Δ)=∣det⁡M∣/n!\operatorname{vol}(\Delta)=|\det M|/n!vol(Δ)=∣detM∣/n! with MMM the edge matrix (2.10). The type of iteration kkk is tau ρ χ γ (move f ρ χ γ (Δ k)), i.e. ρ\rhoρ, ρχ\rho\chiρχ, ργ\rho\gammaργ or −γ-\gamma−γ; note that an expansion attempt whose expansion point is rejected accepts xrx_rxr​ and has type ρ\rhoρ.

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

theorem lemma_3_1 {n : ℕ} [NeZero n] (f : E n → ℝ) (ρ χ γ σ : ℝ) (hpar : NelderMeadLD.Conv1D.ParamsOK ρ χ γ σ)
    (Δ : ℕ → Fin (n + 1) → E n) (hrun : IsNMRun f ρ χ γ σ Δ) (hnd : Nondegenerate (Δ 0)) :
    (∀ k, Nondegenerate (Δ k)) ∧
    (∀ k, ¬ IsShrinkAt f ρ χ γ Δ k →
      vol (Δ (k + 1)) = |tau ρ χ γ (move f ρ χ γ (Δ k))| * vol (Δ k)) ∧
    (∀ k, IsShrinkAt f ρ χ γ Δ k → vol (Δ (k + 1)) = σ ^ n * vol (Δ 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. 120, Lemma 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