Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.5, p. 47 — first-order condition: X≻0X\succ0X≻0 is the X-update iff S−X−1+ρ(X−Zk+Uk)=0S-X^{-1}+\rho(X-Z^k+U^k)=0S−X−1+ρ(X−Zk+Uk)=0

Proved
BoydADMM.L1.covsel_first_order_condition

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

admmcovariance-selectionoptimality-conditionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let S,Z,U∈Rn×nS,Z,U\in\mathbb R^{n\times n}S,Z,U∈Rn×n with SSS and Z−UZ-UZ−U symmetric, and let ρ>0\rho>0ρ>0. Consider

F(X)=Tr⁡(SX)−log⁡det⁡X+ρ2∥X−Z+U∥F2F(X)=\operatorname{Tr}(SX)-\log\det X+\frac\rho2\|X-Z+U\|_F^2F(X)=Tr(SX)−logdetX+2ρ​∥X−Z+U∥F2​

on the cone S++n\mathbb S^n_{++}S++n​ of symmetric positive definite matrices. For X∈S++nX\in\mathbb S^n_{++}X∈S++n​,

F(X)≤F(X′)  for all X′∈S++n⟺S−X−1+ρ(X−Z+U)=0.F(X)\le F(X')\ \text{ for all } X'\in\mathbb S^n_{++}\quad\Longleftrightarrow\quad S-X^{-1}+\rho(X-Z+U)=0 .F(X)≤F(X′)  for all X′∈S++n​⟺S−X−1+ρ(X−Z+U)=0.

This is the book's statement that "the first-order optimality condition is that the gradient should vanish, together with the implicit constraint X≻0X\succ0X≻0": the vanishing gradient is necessary and, because FFF is convex, sufficient for XXX to solve the X-minimization.

Formalization Note Z,UZ,UZ,U stand for Zk,UkZ^k,U^kZk,Uk. The symmetry of SSS (an empirical covariance) and of Z−UZ-UZ−U (the ADMM iterates are symmetric when started symmetric) is made an explicit hypothesis; without it the gradient over symmetric matrices is only the symmetric part of S−X−1+ρ(X−Z+U)S-X^{-1}+\rho(X-Z+U)S−X−1+ρ(X−Z+U). S++n\mathbb S^n_{++}S++n​ is Matrix.PosDef, which includes symmetry. ∥⋅∥F2\|\cdot\|_F^2∥⋅∥F2​ is the sum of squared entries.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_L1_CovSel

open Matrix
Formal statement
namespace BoydADMM.L1

/-- §6.5, p. 47: for symmetric `S` and `Z − U` and `ρ > 0`, a positive definite `X` minimizes
`Tr(SX) − log det X + (ρ/2)‖X − Z + U‖_F²` over the positive definite matrices if and only if
the gradient vanishes, `S − X⁻¹ + ρ(X − Z + U) = 0`. -/
theorem covsel_first_order_condition {n : ℕ} (S Z U : Matrix (Fin n) (Fin n) ℝ) (ρ : ℝ)
    (hρ : 0 < ρ) (hS : S.IsSymm) (hZU : (Z - U).IsSymm)
    (X : Matrix (Fin n) (Fin n) ℝ) (hX : X.PosDef) :
    (∀ X' : Matrix (Fin n) (Fin n) ℝ, X'.PosDef →
        covselXObjective S Z U ρ X ≤ covselXObjective S Z U ρ X') ↔
      S - X⁻¹ + ρ • (X - Z + U) = 0 := 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 (first-order optimality condition)
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