Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark after Theorem 4.1, p. 483 — a quasiconvex hemivariate function has at most one minimum point

Proved
TsengBCD.Hemivariate.atMostOneMin_of_quasiconvex_hemivariate

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

hemivariatep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quasiconvexunique-minimizer

Let h:V→[−∞,∞]h:V\to[-\infty,\infty]h:V→[−∞,∞] be a function on a real vector space that is quasiconvex,

h(x+λd)≤max⁡{h(x),h(x+d)}for all x,d and λ∈[0,1],h(x+\lambda d)\le\max\{h(x),h(x+d)\}\quad\text{for all }x,d\text{ and }\lambda\in[0,1],h(x+λd)≤max{h(x),h(x+d)}for all x,d and λ∈[0,1],

and hemivariate (not constant on any nondegenerate line segment contained in dom⁡h\operatorname{dom}hdomh). Then hhh has at most one minimum point: if aaa and bbb both minimize hhh over VVV and h(a)<∞h(a)<\inftyh(a)<∞, then a=ba=ba=b.

Applied to the section xk↦f(x1,…,xN)x_k\mapsto f(x_1,\dots,x_N)xk​↦f(x1​,…,xN​), this is the page's remark that if fff is quasiconvex and hemivariate in xkx_kxk​, then fff has at most one minimum in xkx_kxk​; it links Assumption B2 to the uniqueness hypothesis of Theorem 4.1(c).

Formalization Note. A minimum point is a point of dom⁡h\operatorname{dom}hdomh attaining the infimum, so the case h≡∞h\equiv\inftyh≡∞ (where every point attains the infimum) is excluded by h(a)<∞h(a)<\inftyh(a)<∞.

Preamble
import Mathlib
import Definitions.Def_TsengBCD_Hemivariate_Setting
Formal statement
namespace TsengBCD.Hemivariate

open Filter Topology

theorem atMostOneMin_of_quasiconvex_hemivariate {V : Type*} [AddCommGroup V] [Module ℝ V]
    (h : V → EReal) (hqc : IsQuasiconvex h) (hhv : IsHemivariate h) :
    ∀ a b : V, h a ≠ ⊤ → (∀ c, h a ≤ h c) → (∀ c, h b ≤ h c) → a = b := by sorry

end TsengBCD.Hemivariate
Source
Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl. 109 (2001), p. 483, remark after Theorem 4.1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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