How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The all-entry graphical-lasso objective has a unique KKT optimizer
Statement
Let be the real symmetric positive-semidefinite matrices and the real symmetric positive-definite ones. For , and , maximize over . The objective is strictly concave and attains a unique maximizer . A feasible is this unique maximizer if and only if there is a symmetric matrix such that , with , when , and when .
Statement references
Facts & Assumptions
Given: , , , and the symmetric positive-definite domain and all-entry objective in the Statement.
The all-entry graphical-lasso functional is on . Gaussian sparse-precision objective with the all-entry penalty.
A finite-dimensional nonnegative self-adjoint operator has a factorization . A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S.
A real symmetric matrix has an orthonormal eigenbasis. Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis.
For a twice continuously differentiable function on an open convex Euclidean domain, positive-semidefinite Hessian everywhere implies convexity. A function is convex exactly when its Hessian is positive semidefinite.
Convexity on a convex set is the chord inequality; strict convexity requires strict inequality for distinct points and interior weights. Convex and strictly convex functions on Euclidean convex sets.
Proof
By the all-entry objective definition [F1] and the nonnegative-operator factorization [F2], write . Thus for . Also , since positive-definite matrices have positive diagonal entries.
The cone is open and convex: positive quadratic forms remain positive under sufficiently small symmetric perturbations, and convex combinations of positive quadratic forms remain positive. For symmetric , determinant expansion gives . Differentiating gives , so the second directional derivative is .
By [F3], the eigenvalues of are positive and , . Hence for . The function is bounded above and tends to as or . For any , the upper level set therefore forces each eigenvalue into a compact interval : if , then each . These matrices form a closed bounded set of symmetric matrices contained in , hence a compact set. Taking gives a nonempty compact upper level set, and continuity of yields a maximizer.
Let , using the positive square root from the orthonormal eigenbasis [F3]. Then is symmetric and , strictly positive when . Thus the second derivative of along every nonconstant segment is strictly negative, giving its strict chord inequality. The Hessian of is positive semidefinite by step 1.2, so [F4] gives convexity in the chord sense of [F5]. The trace term is linear and the entrywise norm is convex by the triangle inequality, so its negative is concave; adding these terms preserves the strict chord inequality. Hence is strictly concave on its open convex domain.
Put . At a maximizer every feasible one-coordinate directional derivative is at most zero, and when the objective is differentiable in both directions its derivative is zero. Since , the diagonal penalty is locally differentiable with slope , so the diagonal equation is and . For , a symmetric perturbation by has smooth derivative and changes the penalty by . If , testing both signs of small gives . If , taking gives and taking gives . Defining at zero and the sign otherwise yields the stated KKT equation for the all-entry penalty [F1].
Conversely, suppose and a symmetric satisfies the stated entrywise conditions and . Put for any ; its eigenvalues are positive. Since for (the function has its minimum at ), . For each scalar and each allowed subgradient of , : if , this follows from , while for it follows from . Summing gives for the all-entry objective [F1]. Combining these bounds with the linear trace term and the KKT equation yields . Thus every such KKT point is a maximizer. The maximizer exists by step 2.1 and is unique by strict concavity from step 2.2, so the KKT condition is both necessary and sufficient for that unique optimum.
Depends on
- Gaussian sparse-precision objective with the all-entry penalty
- A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- A $C^2$ function is convex exactly when its Hessian is positive semidefinite
- Convex and strictly convex functions on Euclidean convex sets
Used by
Dependency tree · two levels
19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- The Elements of Statistical Learning, second edition (standard reference, not scraped)
- Friedman, Hastie and Tibshirani, Sparse inverse covariance estimation with the lasso (standard reference, not scraped)