(6.5), p. 47 — is positive definite and satisfies
ProvedBoydADMM.L1.covsel_eq_6_5Let , , let satisfy , and let be such that
Put with , and . Then is positive definite and
Equation (6.5) is the first-order optimality condition of the X-update in ADMM for sparse inverse covariance selection, so this says that the book's eigenvalue construction produces a positive definite solution of it.
Formalization Note stand for ; the eigenvalues are called . The statement quantifies over every orthogonal and diagonal with , not over one decomposition chosen by Mathlib; such a decomposition exists whenever is symmetric, and the identity forces it to be symmetric, so no symmetry hypothesis on or is needed here. is Mathlib's matrix inverse, the true inverse since is positive definite.
import Mathlib import Definitions.Def_BoydADMM_L1_CovSel open Matrix
namespace BoydADMM.L1
/-- §6.5, (6.5), p. 47: if `ρ > 0`, `Q` is orthogonal (`QᵀQ = QQᵀ = I`) and
`ρ(Z − U) − S = Q diag(μ) Qᵀ`, then `X = Q X̃ Qᵀ` with `X̃_ii = (μ_i + √(μ_i² + 4ρ))/(2ρ)` is
positive definite and satisfies `ρX − X⁻¹ = ρ(Z − U) − S`. -/
theorem covsel_eq_6_5 {n : ℕ} (S Z U Q : Matrix (Fin n) (Fin n) ℝ) (ρ : ℝ) (μ : Fin n → ℝ)
(hρ : 0 < ρ) (hQ₁ : Qᵀ * Q = 1) (hQ₂ : Q * Qᵀ = 1)
(hdecomp : ρ • (Z - U) - S = Q * Matrix.diagonal μ * Qᵀ) :
(covselX ρ Q μ).PosDef ∧ ρ • covselX ρ Q μ - (covselX ρ Q μ)⁻¹ = ρ • (Z - U) - S := by sorry
end BoydADMM.L1
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.