Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1, pp. 124–125 — strictly convex f on ℝ: up–down–up brackets x_min; f increases beyond x_min; f continuous

Proved
NelderMeadLD.Conv1D.lemma_4_1

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

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

Let f:R→Rf : \mathbb R \to \mathbb Rf:R→R be strictly convex, and let xmin⁡x_{\min}xmin​ be a minimizer of fff (necessarily unique). For reals a,ba, ba,b write int⁡(a,b)\operatorname{int}(a, b)int(a,b) for the open interval with endpoints aaa and bbb and int⁡[a,b]\operatorname{int}[a, b]int[a,b] for the closed one, whichever endpoint is larger.

  1. If y1,y2,y3y_1, y_2, y_3y1​,y2​,y3​ are three distinct points with y2∈int⁡(y1,y3)y_2 \in \operatorname{int}(y_1, y_3)y2​∈int(y1​,y3​), then
f(y1)≥f(y2)  and  f(y2)≤f(y3)  ⟹  xmin⁡∈int⁡(y1,y3).f(y_1) \ge f(y_2)\ \text{ and }\ f(y_2) \le f(y_3) \implies x_{\min} \in \operatorname{int}(y_1, y_3).f(y1​)≥f(y2​)  and  f(y2​)≤f(y3​)⟹xmin​∈int(y1​,y3​).
  1. If y1≠y2y_1 \ne y_2y1​=y2​ and xmin⁡∈int⁡[y1,y2]x_{\min} \in \operatorname{int}[y_1, y_2]xmin​∈int[y1​,y2​], then for all ξ2>ξ1≥1\xi_2 > \xi_1 \ge 1ξ2​>ξ1​≥1,
f(y2+ξ2(y1−y2))>f(y2+ξ1(y1−y2)).f\big(y_2 + \xi_2(y_1 - y_2)\big) > f\big(y_2 + \xi_1(y_1 - y_2)\big).f(y2​+ξ2​(y1​−y2​))>f(y2​+ξ1​(y1​−y2​)).
  1. fff is continuous.

The first part says that an "up–down–up" pattern of values brackets the minimizer; the second that fff strictly increases along the ray leaving the minimizer's side of y1y_1y1​. Both are used repeatedly in the one-dimensional analysis of the Nelder–Mead method.

Formalization Note Part 2 adds y1≠y2y_1 \ne y_2y1​=y2​: at y1=y2y_1 = y_2y1​=y2​ both points coincide and the strict inequality fails; the page's int⁡[y1,y2]\operatorname{int}[y_1, y_2]int[y1​,y2​] presupposes two endpoints. The page's lemma does not use bounded level sets, and none is assumed; the minimizer is a hypothesis, as in the lemma.

Preamble
import Mathlib
import Definitions.Def_NelderMeadLD_Conv1D_Algorithm

open Filter Topology
Formal statement
namespace NelderMeadLD.Conv1D

theorem lemma_4_1 (f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
    (xmin : ℝ) (hmin : ∀ y, f xmin ≤ f y) :
    (∀ y1 y2 y3 : ℝ, y1 ≠ y2 → y2 ≠ y3 → y1 ≠ y3 →
        min y1 y3 < y2 → y2 < max y1 y3 → f y2 ≤ f y1 → f y2 ≤ f y3 →
        min y1 y3 < xmin ∧ xmin < max y1 y3) ∧
    (∀ y1 y2 : ℝ, y1 ≠ y2 → xmin ∈ Set.uIcc y1 y2 →
        ∀ ξ1 ξ2 : ℝ, 1 ≤ ξ1 → ξ1 < ξ2 →
          f (y2 + ξ1 * (y1 - y2)) < f (y2 + ξ2 * (y1 - y2))) ∧
    Continuous f := by sorry

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