Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.4.2, p. 45 — the group-lasso z-update is block soft thresholding zik+1=Sλ/ρ(xik+1+uik)z_i^{k+1}=\mathcal S_{\lambda/\rho}(x_i^{k+1}+u_i^k)zik+1​=Sλ/ρ​(xik+1​+uik​)

Proved
BoydADMM.L1.group_lasso_z_update

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

admmgroup-lassop2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1proximal-operator

Let x=(x1,…,xN)x=(x_1,\dots,x_N)x=(x1​,…,xN​) and u=(u1,…,uN)u=(u_1,\dots,u_N)u=(u1​,…,uN​) be partitioned into blocks xi,ui∈Rnix_i,u_i\in\mathbb R^{n_i}xi​,ui​∈Rni​, and let λ≥0\lambda\ge0λ≥0, ρ>0\rho>0ρ>0. The block vector z⋆z^\starz⋆ with blocks

zi⋆=Sλ/ρ(xi+ui),i=1,…,N,z^\star_i=\mathcal S_{\lambda/\rho}(x_i+u_i),\qquad i=1,\dots,N,zi⋆​=Sλ/ρ​(xi​+ui​),i=1,…,N,

where Sκ(a)=(1−κ/∥a∥2)+a\mathcal S_\kappa(a)=(1-\kappa/\|a\|_2)_+aSκ​(a)=(1−κ/∥a∥2​)+​a (with Sκ(0)=0\mathcal S_\kappa(0)=0Sκ​(0)=0) is vector soft thresholding, is the unique minimizer over all block vectors z=(z1,…,zN)z=(z_1,\dots,z_N)z=(z1​,…,zN​) of

λ∑i=1N∥zi∥2+ρ2∑i=1N∥xi−zi+ui∥22.\lambda\sum_{i=1}^N\|z_i\|_2+\frac\rho2\sum_{i=1}^N\|x_i-z_i+u_i\|_2^2 .λi=1∑N​∥zi​∥2​+2ρ​i=1∑N​∥xi​−zi​+ui​∥22​.

With x=xk+1x=x^{k+1}x=xk+1 and u=uku=u^ku=uk this is the z-update of ADMM for the group lasso, whose regularizer ∑i∥xi∥2\sum_i\|x_i\|_2∑i​∥xi​∥2​ is separable across blocks but not within them.

Formalization Note The book prints uku^kuk in the block update; since uuu is partitioned like xxx, the intended term is the block uiku_i^kuik​, which is what is stated. The block sizes nin_ini​ are arbitrary (nb : Fin N → ℕ), and blocks are indexed from 000. λ\lambdaλ is called lam; the book takes λ>0\lambda>0λ>0, the statement allows λ≥0\lambda\ge0λ≥0.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_L1_Basic

open Matrix
Formal statement
namespace BoydADMM.L1

/-- §6.4.2, p. 45: let `x = (x_1, …, x_N)` and `u = (u_1, …, u_N)` be partitioned into blocks
`x_i, u_i ∈ ℝ^{n_i}`. For `λ ≥ 0` (called `lam`) and `ρ > 0`, the block vector with blocks
`S_{λ/ρ}(x_i + u_i)` (vector soft thresholding) is the unique minimizer of
`λ ∑_i ‖z_i‖₂ + (ρ/2) ∑_i ‖x_i − z_i + u_i‖₂²` over all block vectors `z`. -/
theorem group_lasso_z_update {N : ℕ} (nb : Fin N → ℕ) (lam ρ : ℝ) (hlam : 0 ≤ lam) (hρ : 0 < ρ)
    (x u : (i : Fin N) → EuclideanSpace ℝ (Fin (nb i))) :
    IsUniqueMinimizerOn
      (fun z : (i : Fin N) → EuclideanSpace ℝ (Fin (nb i)) =>
        lam * ∑ i, ‖z i‖ + (ρ / 2) * ∑ i, ‖x i - z i + u i‖ ^ 2) Set.univ
      (fun i => blockSoftThreshold (lam / ρ) (x i + u i)) := 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. 45, §6.4.2 (group lasso, block soft thresholding)
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