Lemma 4.4, p. 128 — the limiting vertex values coincide: f*₁ = f*₂
ProvedNelderMeadLD.Conv1D.lemma_4_4Let be strictly convex with bounded level sets and minimizer . Let the parameters satisfy (2.1) (in particular and ), and let be the one-dimensional Nelder–Mead run from a nondegenerate, ordered initial interval. Then the vertex values and converge to a common limit:
This excludes the situation in which the best vertex stalls while the worst vertex keeps a strictly larger value, and it is the starting point for showing that the interval shrinks to a point.
Formalization Note The page writes , the existence of the limits being established earlier (Lemma 3.3); here the existence of a common limit of both sequences is part of the conclusion. No condition on is assumed; the lemma's own hypotheses are , , and , , come from the standing conditions (2.1) of the one-dimensional analysis.
import Mathlib import Definitions.Def_NelderMeadLD_Conv1D_Algorithm open Filter Topology
namespace NelderMeadLD.Conv1D
theorem lemma_4_4 (f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
(hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ})
(xmin : ℝ) (hmin : ∀ y, f xmin ≤ f y)
(ρ χ γ σ : ℝ) (hpar : ParamsOK ρ χ γ σ)
(p0 : ℝ × ℝ) (h0 : IsStart f p0) :
∃ L : ℝ, Tendsto (fun k => f (run f ρ χ γ σ p0 k).1) atTop (𝓝 L) ∧
Tendsto (fun k => f (run f ρ χ γ σ p0 k).2) atTop (𝓝 L) := by sorry
end NelderMeadLD.Conv1D
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.