Lemma 5.1, p. 136 — n = 2, ρ = 1, γ = ½: if the best vertex never moves, the triangles converge to it
ProvedNelderMeadLD.Dim2.lemma_5_1Let be strictly convex with bounded level sets (every set is bounded). Run Algorithm NM on with reflection coefficient , contraction coefficient , and any satisfying (2.1), from a nondegenerate initial triangle . If the best vertex is constant, for all , then every vertex converges to it:
This is the case of Theorem 5.1 not covered by Corollary 3.1; it describes the behaviour seen in McKinnon's examples, where the simplices converge to a nonstationary point.
Formalization Note Vertices are Lean indices 0,1,2. The lemma names only and ; since the best vertex never changes, no expansion is ever accepted, so is kept general under (2.1) rather than fixed at the §5 standard value . Likewise is general (the paper's standard (2.2) has ) because no shrink occurs on a strictly convex (Lemma 3.5). Both choices make the statement at least as strong as the page's.
import Mathlib import Definitions.Def_NelderMeadLD_Dim2_Algorithm open Filter Topology
namespace NelderMeadLD.Dim2
theorem lemma_5_1 (f : E 2 → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
(hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ}) (χ σ : ℝ) (hpar : NelderMeadLD.Conv1D.ParamsOK 1 χ (1 / 2) σ)
(Δ : ℕ → Fin 3 → E 2) (hrun : IsNMRun f 1 χ (1 / 2) σ Δ) (hnd : Nondegenerate (Δ 0))
(hconst : ∀ k, Δ k 0 = Δ 0 0) :
∀ i, Tendsto (fun k => Δ k i) atTop (𝓝 (Δ 0 0)) := by sorry
end NelderMeadLD.Dim2
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.