Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 479, remark after (5) — a coordinatewise minimum point at which f is regular is stationary

Proved
TsengBCD.Stationary.stationary_of_coordMin_of_regular

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

coordinatewise-minimump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regularitystationary-point

Let f:Rn1+⋯+nN→R∪{∞}f:\mathbb R^{n_1+\cdots+n_N}\to\mathbb R\cup\{\infty\}f:Rn1​+⋯+nN​→R∪{∞} and let zzz be a coordinatewise minimum point of fff, i.e. z∈dom⁡fz\in\operatorname{dom}fz∈domf and f(z+(0,…,dk,…,0))≥f(z)f(z+(0,\dots,d_k,\dots,0))\ge f(z)f(z+(0,…,dk​,…,0))≥f(z) for all dkd_kdk​ and all kkk (4). If fff is regular at zzz in the sense of (5), then zzz is a stationary point of fff:

f′(z;d)≥0for all d.f'(z;d)\ge 0\qquad\text{for all } d.f′(z;d)≥0for all d.

The step is that (4) gives f′(z;(0,…,dk,…,0))≥0f'(z;(0,\dots,d_k,\dots,0))\ge 0f′(z;(0,…,dk​,…,0))≥0 for every block, and regularity turns these blockwise inequalities into stationarity. It is the last step of each part of Theorem 4.1.

Formalization Note. Directional derivatives are lower limits in EReal. The hypothesis that fff never takes the value −∞-\infty−∞ is the paper's standing assumption f:Rn1+⋯+nN→R∪{∞}f:\mathbb R^{n_1+\cdots+n_N}\to\mathbb R\cup\{\infty\}f:Rn1​+⋯+nN​→R∪{∞} (§1); it is needed, since for f≡−∞f\equiv-\inftyf≡−∞ every point is a coordinatewise minimum point at which fff is (vacuously) regular, while every difference quotient is −∞−(−∞)=−∞-\infty-(-\infty)=-\infty−∞−(−∞)=−∞ in EReal.

Preamble
import Mathlib
import Definitions.Def_TsengBCD_Stationary_Setting
Formal statement
namespace TsengBCD.Stationary

open Filter Topology

theorem stationary_of_coordMin_of_regular {N : ℕ} {n : Fin N → ℕ} (f : X n → EReal)
    (hbot : ∀ x, f x ≠ ⊥) (z : X n) :
    IsCoordMin f z → IsRegularAt f z → IsStationary f z := by sorry

end TsengBCD.Stationary
Source
Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl. 109 (2001), p. 479, §3, remark after (5)
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