Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.5, p. 47 — the covariance-selection Z-update is elementwise soft thresholding Sλ/ρ(Xijk+1+Uijk)S_{\lambda/\rho}(X^{k+1}_{ij}+U^k_{ij})Sλ/ρ​(Xijk+1​+Uijk​)

Proved
BoydADMM.L1.covsel_Z_update

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

admmcovariance-selectionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1soft-thresholding

Let λ≥0\lambda\ge0λ≥0, ρ>0\rho>0ρ>0 and X,U∈Rn×nX,U\in\mathbb R^{n\times n}X,U∈Rn×n. The matrix Z⋆Z^\starZ⋆ with entries

Zij⋆=Sλ/ρ(Xij+Uij)Z^\star_{ij}=S_{\lambda/\rho}\bigl(X_{ij}+U_{ij}\bigr)Zij⋆​=Sλ/ρ​(Xij​+Uij​)

is the unique minimizer over all Z∈Rn×nZ\in\mathbb R^{n\times n}Z∈Rn×n of

λ∥Z∥1+ρ2∥X−Z+U∥F2,\lambda\|Z\|_1+\frac\rho2\|X-Z+U\|_F^2,λ∥Z∥1​+2ρ​∥X−Z+U∥F2​,

where ∥Z∥1=∑i,j∣Zij∣\|Z\|_1=\sum_{i,j}|Z_{ij}|∥Z∥1​=∑i,j​∣Zij​∣ and SκS_\kappaSκ​ is scalar soft thresholding.

With X=Xk+1X=X^{k+1}X=Xk+1 and U=UkU=U^kU=Uk this is the Z-update of ADMM for sparse inverse covariance selection.

Formalization Note The regularization weight λ\lambdaλ is called lam. The book takes λ>0\lambda>0λ>0; the statement is made for λ≥0\lambda\ge0λ≥0, which contains it. The minimization is over all real n×nn\times nn×n matrices; when XXX and UUU are symmetric the minimizer is symmetric, so minimizing over symmetric matrices gives the same update.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_L1_Basic
import Definitions.Def_BoydADMM_L1_CovSel

open Matrix
Formal statement
namespace BoydADMM.L1

/-- §6.5, p. 47: for `λ ≥ 0` (called `lam`) and `ρ > 0`, the matrix with entries
`S_{λ/ρ}(X_ij + U_ij)` is the unique minimizer of `λ‖Z‖₁ + (ρ/2)‖X − Z + U‖_F²` over all real
`n × n` matrices `Z`. -/
theorem covsel_Z_update {n : ℕ} (lam ρ : ℝ) (hlam : 0 ≤ lam) (hρ : 0 < ρ)
    (X U : Matrix (Fin n) (Fin n) ℝ) :
    IsUniqueMinimizerOn (covselZObjective lam ρ X U) Set.univ
      (Matrix.of fun i j => BoydADMM.Prox.softThreshold (lam / ρ) (X i j + U i j)) := by sorry

end BoydADMM.L1
Source
Boyd, Parikh, Chu, Peleato, Eckstein, Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Found. Trends Mach. Learn. 3(1) (2011), p. 47, §6.5 (Z-minimization step); objective on p. 46
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