Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4 — the fixed point iterations (2.1) with τ ∈ (0, 2/λmax(AᵀA)) converge to an optimal solution of (1.8)

Proved
MaGoldfarbFPC.Convergence.theorem4

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

convergencematrix-completionnuclear-normp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-gradient

Let A:Rm×n→Rp\mathcal A:\mathbb R^{m\times n}\to\mathbb R^pA:Rm×n→Rp be linear with matrix AAA (AX=A vec(X)\mathcal AX=A\,\mathrm{vec}(X)AX=Avec(X)), let b∈Rpb\in\mathbb R^pb∈Rp, μ>0\mu>0μ>0 and τ∈(0,2/λmax⁡(A⊤A))\tau\in(0,2/\lambda_{\max}(A^\top A))τ∈(0,2/λmax​(A⊤A)). Write g(X)=A∗(A(X)−b)g(X)=\mathcal A^*(\mathcal A(X)-b)g(X)=A∗(A(X)−b) and let SνS_\nuSν​ be the matrix shrinkage operator. Let (Xk)k≥0(X^k)_{k\ge0}(Xk)k≥0​ be generated by the fixed point iterations (2.1) from an arbitrary X0∈Rm×nX^0\in\mathbb R^{m\times n}X0∈Rm×n:

Yk=Xk−τg(Xk),Xk+1=Sτμ(Yk).Y^k=X^k-\tau g(X^k),\qquad X^{k+1}=S_{\tau\mu}(Y^k).Yk=Xk−τg(Xk),Xk+1=Sτμ​(Yk).

Then there is an optimal solution X∗∈X∗X^*\in\mathcal X^*X∗∈X∗ of problem (1.8), min⁡Xμ∥X∥∗+12∥A(X)−b∥22\min_X\mu\|X\|_*+\tfrac12\|\mathcal A(X)-b\|_2^2minX​μ∥X∥∗​+21​∥A(X)−b∥22​, such that

lim⁡k→∞∥Xk−X∗∥F=0.\lim_{k\to\infty}\|X^k-X^*\|_F=0 .k→∞lim​∥Xk−X∗∥F​=0.

This is the convergence theorem for the fixed point iterations underlying the FPC and FPCA algorithms for nuclear norm regularized matrix rank minimization: the simple two-line scheme of singular value shrinkage after a gradient step reaches an exact minimizer, for every starting point and every step size below 2/λmax⁡(A⊤A)2/\lambda_{\max}(A^\top A)2/λmax​(A⊤A).

Formalization Note The step range is StepRange τ Aop (0<τ0<\tau0<τ, τ∥A∥22<2\tau\|\mathcal A\|_2^2<2τ∥A∥22​<2; ∥A∥22=λmax⁡(A⊤A)\|\mathcal A\|_2^2=\lambda_{\max}(A^\top A)∥A∥22​=λmax​(A⊤A)), written without division so that A=0\mathcal A=0A=0 is not vacuous. μ>0\mu>0μ>0 is explicit; the paper needs it for ν=τμ>0\nu=\tau\mu>0ν=τμ>0. The run is the predicate IsFixedPointRun, with X0X^0X0 arbitrary and SτμS_{\tau\mu}Sτμ​ the relation IsShrink. Neither the nonemptiness of X∗\mathcal X^*X∗ nor the boundedness of the iterates is assumed: both are part of what is to be proved. Convergence is in the Frobenius norm, to some optimal X∗X^*X∗ chosen after the run.

Preamble
import Mathlib
import Definitions.Def_MaGoldfarbFPC_Convergence_Basic
Formal statement
namespace MaGoldfarbFPC.Convergence

open CaiCandesShen.Convergence Filter Topology

/-- Theorem 4, p. 12: for `μ > 0` and `τ ∈ (0, 2/λ_max(AᵀA))`, every sequence `{X^k}`
generated by the fixed point iterations (2.1) from an arbitrary `X⁰` converges in the
Frobenius norm to some optimal solution `X*` of problem (1.8). -/
theorem theorem4 {m n p : ℕ} (Aop : Fin p → Mat m n) (b : Fin p → ℝ) (μ τ : ℝ)
    (hμ : 0 < μ) (hτ : StepRange τ Aop) (X : ℕ → Mat m n)
    (hX : IsFixedPointRun μ τ Aop b X) :
    ∃ Xs : Mat m n, IsOptimal μ Aop b Xs ∧
      Tendsto (fun k => frobNorm (X k - Xs)) atTop (𝓝 0) := by sorry

end MaGoldfarbFPC.Convergence
Source
Ma, Goldfarb and Chen, Fixed point and Bregman iterative methods for matrix rank minimization, arXiv:0905.1643v2, p. 12, Theorem 4
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