Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — stationarity exactly when the full direction vanishes

Proved
TsengCGD.Global.lemma2

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

composite-optimizationcoordinate-descentnonsmooth-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let x∈dom⁡Px\in\operatorname{dom}Px∈domP and let HHH be positive definite. The full-coordinate quadratic direction dH(x)=dH(x;N)d_H(x)=d_H(x;\mathcal N)dH​(x)=dH​(x;N) vanishes precisely at stationary points of FcF_cFc​:

Fc′(x;v)≥0 for every v∈Rn⟺dH(x)=0.F_c'(x;v)\ge0\ \text{for every }v\in\mathbb R^n \quad\Longleftrightarrow\quad d_H(x)=0.Fc′​(x;v)≥0 for every v∈Rn⟺dH​(x)=0.

This characterization turns a variational first-order condition into a residual test for the exact subproblem.

Formalization Note Stationarity includes x∈Dx\in Dx∈D and uses the one-sided derivative of the extended-valued objective. The Lean predicate uses the equivalent nonnegative lower-limit condition; directions leaving DDD have value +∞+\infty+∞. The standing assumptions of (1) are explicit.

Preamble
import Mathlib
import Definitions.Def_TsengCGD_Global_Basic
Formal statement
namespace TsengCGD.Global

open Filter Topology Finset Matrix
open scoped RealInnerProductSpace

theorem lemma2 {n : ℕ} (f : Vec n → ℝ) (D : Set (Vec n)) (P : Vec n → ℝ)
    (c : ℝ) (hs : Standing f D P c)
    (x : Vec n) (hx : x ∈ D) (H : Matrix (Fin n) (Fin n) ℝ) (hH : H.PosDef) :
    IsStationary f D P c x ↔ dH f D P c H x Finset.univ = 0 := by sorry

end TsengCGD.Global
Source
Tseng and Yun, A coordinate gradient descent method for nonsmooth separable minimization, Math. Program. Ser. B 117 (2009), p. 394, Lemma 2, https://doi.org/10.1007/s10107-007-0170-0
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