Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1(b) — vanishing direction along a convergent subsequence

Disproved
TsengCGD.Global.theorem1_b

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

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

Under the full preamble of Theorem 1, suppose an infinite subsequence xϕ(i)x^{\phi(i)}xϕ(i) converges to xˉ\bar xxˉ, where ϕ\phiϕ is strictly increasing. Then the Armijo-weighted descent quantities vanish along the whole run, while the directions vanish along the selected subsequence:

αkΔk⟶0,dϕ(i)⟶0.\alpha^k\Delta^k\longrightarrow0,\qquad d^{\phi(i)}\longrightarrow0.αkΔk⟶0,dϕ(i)⟶0.

If diagonal positive-definite matrices DkD^kDk have uniform positive lower and finite upper spectral bounds, their corresponding block directions dDϕ(i)(xϕ(i);Jϕ(i))d_{D^{\phi(i)}}(x^{\phi(i)};\mathcal J^{\phi(i)})dDϕ(i)​(xϕ(i);Jϕ(i)) also tend to zero. The result connects objective decrease with the stationarity residual used by later parts of Theorem 1.

Formalization Note A strictly increasing ϕ:N→N\phi:\mathbb N\to\mathbb Nϕ:N→N represents an infinite subsequence. The bounds on DkD^kDk use quadratic forms and retain the diagonality stipulated with (14)–(16). The standing assumptions, exact run, first-trial Armijo rule, Assumption 1, and lower bound on initial trial steps 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 theorem1_b {n : ℕ} (f : Vec n → ℝ) (D : Set (Vec n)) (P : Vec n → ℝ)
    (c : ℝ) (hs : Standing f D P c)
    (J : ℕ → Finset (Fin n)) (H : ℕ → Matrix (Fin n) (Fin n) ℝ)
    (x d : ℕ → Vec n) (α αinit : ℕ → ℝ) (β σ γ lam lamBar : ℝ)
    (hrun : IsCGDRun f D P c J H x d α)
    (harm : IsArmijo f D P c β σ γ αinit H x d α)
    (hA1 : Assumption1 H lam lamBar)
    (hinit : ∃ a : ℝ, 0 < a ∧ ∀ k, a ≤ αinit k)
    (φ : ℕ → ℕ) (hφ : StrictMono φ) (xbar : Vec n)
    (hconv : Tendsto (x ∘ φ) atTop (𝓝 xbar)) :
    let Δ := fun k => Delta f P c γ (H k) (x k) (d k)
    Tendsto (fun k => α k * Δ k) atTop (𝓝 0) ∧
    Tendsto (d ∘ φ) atTop (𝓝 0) ∧
    ∀ (Dk : ℕ → Matrix (Fin n) (Fin n) ℝ) (del delBar : ℝ),
      0 < del → del ≤ delBar →
      (∀ k, IsPosDiag (Dk k) ∧
        ∀ z : Vec n, del * ‖z‖ ^ 2 ≤ qf (Dk k) z ∧
          qf (Dk k) z ≤ delBar * ‖z‖ ^ 2) →
      Tendsto (fun i => dH f D P c (Dk (φ i)) (x (φ i)) (J (φ i)))
        atTop (𝓝 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. 399, Theorem 1(b), 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