Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.5 — every CW-minimum of (P) is a basic feasible vector

Proved
SparseNLO.CWOpt.lemma_2_5

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

optimality-conditionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-optimization

Let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R be continuously differentiable and bounded below (Assumption 1), and let 0<s<n0<s<n0<s<n be an integer. Consider the sparsity constrained problem min⁡{f(x):∥x∥0≤s}\min\{f(x):\|x\|_0\le s\}min{f(x):∥x∥0​≤s}.

If x∗∈Csx^*\in C_sx∗∈Cs​ is a coordinate-wise minimum of (P) (Definition 2.4), then x∗x^*x∗ is a basic feasible vector (Definition 2.1):

∥x∗∥0<s ⇒ ∇f(x∗)=0,∥x∗∥0=s ⇒ ∇if(x∗)=0  for all i∈I1(x∗).\|x^*\|_0<s\ \Rightarrow\ \nabla f(x^*)=0,\qquad \|x^*\|_0=s\ \Rightarrow\ \nabla_i f(x^*)=0\ \text{ for all } i\in I_1(x^*).∥x∗∥0​<s ⇒ ∇f(x∗)=0,∥x∗∥0​=s ⇒ ∇i​f(x∗)=0  for all i∈I1​(x∗).

The lemma says that the coordinate-wise optimality condition is at least as strong as basic feasibility. In the proof of Theorem 2.4 it supplies the vanishing of the gradient on the support, (2.14).

Formalization Note Assumption 1 (a lower bound γ≤f\gamma\le fγ≤f) is the paper's standing assumption and is kept as a hypothesis, although the statement does not need it. The hypothesis x∗∈Csx^*\in C_sx∗∈Cs​ repeats the feasibility built into the definition of a CW-minimum, as the page does.

Preamble
import Mathlib
import Definitions.Def_SparseNLO_CWOpt_Setting
Formal statement
namespace SparseNLO.CWOpt

/-- Lemma 2.5 (p. 10): every CW-minimum of (P) is a BF vector. -/
theorem lemma_2_5 {n s : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ) (hf : ContDiff ℝ 1 f)
    (hbdd : ∃ γ : ℝ, ∀ x, γ ≤ f x) (hs : 0 < s) (hsn : s < n)
    (xstar : EuclideanSpace ℝ (Fin n)) (hx : xstar ∈ Cs n s) (hcw : IsCWMin f s xstar) :
    IsBF f s xstar := by sorry

end SparseNLO.CWOpt
Source
Beck, Eldar, Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms, SIAM J. Optim. (2013), doi:10.1137/120869778 (source: arXiv:1203.4580v1), p. 10, Lemma 2.5
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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