Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2.1, proof of Theorem 3.3, (4.2) — if ‖x*‖₀ < s then f(x*) ≤ min_t f(x* + teᵢ) for every i ∈ I₁(x*)

Proved
SparseNLO.Greedy.eq_4_2

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

coordinate-descentp2o-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), let 0<s<n0<s<n0<s<n be an integer, and let (xk)(x^k)(xk) be a sequence generated by the greedy sparse-simplex method for (P). Let x∗x^*x∗ be an accumulation point of (xk)(x^k)(xk) with ∥x∗∥0<s\|x^*\|_0<s∥x∗∥0​<s, and let i∈I1(x∗)i\in I_1(x^*)i∈I1​(x∗). Then

f(x∗)≤f(x∗+tei)for all t∈R,f(x^*)\le f(x^*+te_i)\qquad\text{for all } t\in\mathbb R,f(x∗)≤f(x∗+tei​)for all t∈R,

that is, f(x∗)≤min⁡t∈Rf(x∗+tei)f(x^*)\le\min_{t\in\mathbb R}f(x^*+te_i)f(x∗)≤mint∈R​f(x∗+tei​) (4.2).

This is the support half of the case ∥x∗∥0<s\|x^*\|_0<s∥x∗∥0​<s in the proof of Theorem 3.3; the same argument also yields Lemma 3.3 for the partial sparse-simplex method.

Formalization Note "Accumulation point" is MapClusterPt xstar atTop x. Indices are 0,…,n−10,\dots,n-10,…,n−1 and teite_itei​ is EuclideanSpace.single i t. The minimum in (4.2) is attained (at t=0t=0t=0, by the inequality itself), so "≤\le≤ the minimum" is written as "≤\le≤ every value". Assumption 1 is the paper's standing assumption.

Preamble
import Definitions.Def_SparseNLO_Greedy_Method

open Filter Topology
Formal statement
namespace SparseNLO.Greedy

/-- §4.2.1, proof of Theorem 3.3, (4.2) (p. 29): if `x*` is an accumulation point of a run of
the greedy sparse-simplex method with `‖x*‖₀ < s`, then for every `i ∈ I₁(x*)`,
`f(x*) ≤ f(x* + t eᵢ)` for all `t ∈ ℝ`, i.e. `f(x*) ≤ min_t f(x* + t eᵢ)`. -/
theorem eq_4_2
    {n s : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ) (hf : ContDiff ℝ 1 f)
    (hbdd : ∃ γ : ℝ, ∀ x, γ ≤ f x) (hs : 0 < s) (hsn : s < n)
    (x : ℕ → EuclideanSpace ℝ (Fin n)) (hrun : IsGreedyRun f s x)
    (xstar : EuclideanSpace ℝ (Fin n)) (hacc : MapClusterPt xstar atTop x)
    (hstar : SparseNLO.CWOpt.l0 xstar < s) (i : Fin n) (hi : i ∈ SparseNLO.CWOpt.I1 xstar) :
    ∀ t : ℝ, f xstar ≤ f (xstar + EuclideanSpace.single i t) := by sorry

end SparseNLO.Greedy
Source
Beck, Eldar, Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms, SIAM J. Optim. (2013), doi:10.1137/120869778 (source: arXiv:1203.4580v1), p. 29, §4.2.1, proof of Theorem 3.3, (4.2)
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