Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (41) — the one-step KL estimate

Proved
NonconvexSplitting.ADMMKL.eq41_kl_step

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

admmkurdyka-lojasiewicznonconvex-optimizationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let hhh, PPP, M\mathcal MM, β\betaβ and LβL_\betaLβ​ be as in the paper, regarded on X=Rn×Rm×Rm\mathcal X=\mathbb R^n\times\mathbb R^m\times\mathbb R^mX=Rn×Rm×Rm, and let (xt,yt,zt)t≥0(x^t,y^t,z^t)_{t\ge0}(xt,yt,zt)t≥0​ be any sequences. Assume:

  1. constants C,D>0C,D>0C,D>0 with, for all t≥1t\ge1t≥1, some w∈∂Lβ(xt+1,yt+1,zt+1)w\in\partial L_\beta(x^{t+1},y^{t+1},z^{t+1})w∈∂Lβ​(xt+1,yt+1,zt+1) with ∥w∥≤C∥xt+1−xt∥\|w\|\le C\|x^{t+1}-x^t\|∥w∥≤C∥xt+1−xt∥ (the conclusion of (35)), and Lβ(xt,yt,zt)−Lβ(xt+1,yt+1,zt+1)≥D∥xt+1−xt∥2L_\beta(x^t,y^t,z^t)-L_\beta(x^{t+1},y^{t+1},z^{t+1})\ge D\|x^{t+1}-x^t\|^2Lβ​(xt,yt,zt)−Lβ​(xt+1,yt+1,zt+1)≥D∥xt+1−xt∥2 (the conclusion of (36));
  2. a real l∗l^*l∗ with Lβ(xt,yt,zt)>l∗L_\beta(x^t,y^t,z^t)>l^*Lβ​(xt,yt,zt)>l∗ for all t≥1t\ge1t≥1;
  3. η>0\eta>0η>0, a set V⊆XV\subseteq\mathcal XV⊆X and φ\varphiφ satisfying condition (i) of Definition 1 on [0,η)[0,\eta)[0,η), such that the KL inequality (40) holds: for all (x,y,z)∈V(x,y,z)\in V(x,y,z)∈V with l∗<Lβ(x,y,z)<l∗+ηl^*<L_\beta(x,y,z)<l^*+\etal∗<Lβ​(x,y,z)<l∗+η and all v∈∂Lβ(x,y,z)v\in\partial L_\beta(x,y,z)v∈∂Lβ​(x,y,z), φ′(Lβ(x,y,z)−l∗) ∥v∥≥1\varphi'(L_\beta(x,y,z)-l^*)\,\|v\|\ge1φ′(Lβ​(x,y,z)−l∗)∥v∥≥1.

Then for every t≥2t\ge2t≥2 with (xt,yt,zt)∈V(x^t,y^t,z^t)\in V(xt,yt,zt)∈V and l∗<Lβ(xt,yt,zt)<l∗+ηl^*<L_\beta(x^t,y^t,z^t)<l^*+\etal∗<Lβ​(xt,yt,zt)<l∗+η,

∥xt+1−xt∥+(∥xt+1−xt∥−∥xt−xt−1∥)≤CD[φ(Lβ(xt,yt,zt)−l∗)−φ(Lβ(xt+1,yt+1,zt+1)−l∗)].\|x^{t+1}-x^t\|+\bigl(\|x^{t+1}-x^t\|-\|x^t-x^{t-1}\|\bigr)\le\frac CD\Bigl[\varphi\bigl(L_\beta(x^t,y^t,z^t)-l^*\bigr)-\varphi\bigl(L_\beta(x^{t+1},y^{t+1},z^{t+1})-l^*\bigr)\Bigr].∥xt+1−xt∥+(∥xt+1−xt∥−∥xt−xt−1∥)≤DC​[φ(Lβ​(xt,yt,zt)−l∗)−φ(Lβ​(xt+1,yt+1,zt+1)−l∗)].

Summing this inequality telescopes the right-hand side and yields the finite length (34).

Formalization Note The paper states (41) for the ADMM sequence under "xt∈Bρx^t\in B_\rhoxt∈Bρ​ and t≥N0t\ge N_0t≥N0​", which it uses only to conclude (xt,yt,zt)∈Bρ⊆V(x^t,y^t,z^t)\in\mathbf B_\rho\subseteq V(xt,yt,zt)∈Bρ​⊆V; this statement assumes (xt,yt,zt)∈V(x^t,y^t,z^t)\in V(xt,yt,zt)∈V directly and takes (35), (36) and the case assumption Lβ>l∗L_\beta>l^*Lβ​>l∗ as hypotheses, so it is implied by the paper's version. The range t≥2t\ge2t≥2 comes from applying (35) at index t−1≥1t-1\ge1t−1≥1. Values of LβL_\betaLβ​ are in EReal; under the stated bounds the differences Lβ−l∗L_\beta-l^*Lβ​−l∗ are finite reals and are converted with toReal.

Preamble
import Mathlib
import Definitions.Def_NonconvexSplitting_Shared_IsProxADMMSeq
import Definitions.Def_NonconvexSplitting_Shared_LimitingSubdiff
import Definitions.Def_NonconvexSplitting_ADMMKL_AugLagProd
import Definitions.Def_NonconvexSplitting_ADMMKL_KLProperty
open NonconvexSplitting.Shared

open Filter Topology
open scoped InnerProductSpace
Formal statement
namespace NonconvexSplitting.ADMMKL

/-- Eq. (41) of Li–Pong (p. 15), in self-contained form. Let `(x^t, y^t, z^t)` be sequences and
`C, D > 0` constants satisfying the conclusions of (35) and (36) for `t ≥ 1`, let `l*` be a real
number with `L_β(x^t, y^t, z^t) > l*` for all `t ≥ 1`, and let `η > 0`, `V` and `φ` satisfy
condition (i) of Definition 1 and the KL inequality (40) at level `l*` on `V`. Then for every
`t ≥ 2` with `(x^t, y^t, z^t) ∈ V` and `l* < L_β(x^t, y^t, z^t) < l* + η`,
`‖x^{t+1} - x^t‖ + (‖x^{t+1} - x^t‖ - ‖x^t - x^{t-1}‖)
  ≤ (C/D) [φ(L_β(x^t, y^t, z^t) - l*) - φ(L_β(x^{t+1}, y^{t+1}, z^{t+1}) - l*)]`. -/
theorem eq41_kl_step {n m : ℕ} (h : EuclideanSpace ℝ (Fin n) → ℝ) (P : EuclideanSpace ℝ (Fin m) → EReal)
    (M : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin m)) (β : ℝ)
    (x : ℕ → EuclideanSpace ℝ (Fin n)) (y z : ℕ → EuclideanSpace ℝ (Fin m))
    (C D : ℝ) (hC : 0 < C) (hD : 0 < D)
    (h35 : ∀ t : ℕ, 1 ≤ t →
      ∃ w ∈ LimitingSubdiff (augLagX h P M β) (pack (x (t + 1)) (y (t + 1)) (z (t + 1))),
        ‖w‖ ≤ C * ‖x (t + 1) - x t‖)
    (h36 : ∀ t : ℕ, 1 ≤ t →
      augLag h P M β (x (t + 1)) (y (t + 1)) (z (t + 1)) + ((D * ‖x (t + 1) - x t‖ ^ 2 : ℝ) : EReal) ≤
        augLag h P M β (x t) (y t) (z t))
    (lstar : ℝ) (hgt : ∀ t : ℕ, 1 ≤ t → (lstar : EReal) < augLag h P M β (x t) (y t) (z t))
    (η : ℝ) (hη : 0 < η) (V : Set (XYZ n m)) (φ : ℝ → ℝ) (hφ : IsDesingularizer η φ)
    (h40 : ∀ w ∈ V, (lstar : EReal) < augLagX h P M β w →
      augLagX h P M β w < (lstar : EReal) + (η : EReal) →
      ∀ v ∈ LimitingSubdiff (augLagX h P M β) w,
        1 ≤ deriv φ (augLagX h P M β w - (lstar : EReal)).toReal * ‖v‖)
    (t : ℕ) (ht : 2 ≤ t) (hV : pack (x t) (y t) (z t) ∈ V)
    (hlo : (lstar : EReal) < augLag h P M β (x t) (y t) (z t))
    (hhi : augLag h P M β (x t) (y t) (z t) < (lstar : EReal) + (η : EReal)) :
    ‖x (t + 1) - x t‖ + (‖x (t + 1) - x t‖ - ‖x t - x (t - 1)‖) ≤
      C / D * (φ (augLag h P M β (x t) (y t) (z t) - (lstar : EReal)).toReal -
        φ (augLag h P M β (x (t + 1)) (y (t + 1)) (z (t + 1)) - (lstar : EReal)).toReal) := by sorry

end NonconvexSplitting.ADMMKL
Source
Li & Pong, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, arXiv:1407.0753v6, p. 15, Eq. (41) and the display after it
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me