Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 S+p be the real symmetric positive-semidefinite p×p matrices and S++p the real symmetric positive-definite ones. For p≥1, S∈S+p and λ>0, maximize FS,λ(Θ)=log⁡det⁡Θ−tr⁡(SΘ)−λ∑i=1p∑j=1p∣Θij∣ over Θ∈S++p. 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 Θ−1−S−λΓ=0, with Γii=1, Γij=sign⁡(Θij) when Θij≠0, and Γij∈[−1,1] when Θij=0.

Facts & Assumptions

Given: p≥1, S∈S+p, λ>0, and the symmetric positive-definite domain and all-entry objective in the Statement.

[F1]

The all-entry graphical-lasso functional is FS,λ(Θ)=log⁡det⁡Θ−tr⁡(SΘ)−λ∑i,j∣Θij∣ on S++p. Gaussian sparse-precision objective with the all-entry penalty.

[F4]

For a twice continuously differentiable function on an open convex Euclidean domain, positive-semidefinite Hessian everywhere implies convexity. A C2 function is convex exactly when its Hessian is positive semidefinite.

[F5]

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

1.1givenF1F2algebra

By the all-entry objective definition [F1] and the nonnegative-operator factorization [F2], write S=RTR. Thus tr⁡(SΘ)=tr⁡(RΘRT)≥0 for Θ≻0. Also ∥Θ∥1=∑i,j∣Θij∣≥∑iΘii=tr⁡Θ, since positive-definite matrices have positive diagonal entries.

1.2givenF3algebra

The cone S++p 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 H, determinant expansion gives ddtlog⁡det⁡(Θ+tH)∣t=0=tr⁡(Θ−1H). Differentiating (Θ+tH)(Θ+tH)−1=I gives ddt(Θ+tH)−1∣t=0=−Θ−1HΘ−1, so the second directional derivative is −tr⁡(Θ−1HΘ−1H).

2.1step 1.1F3algebra

By [F3], the eigenvalues t1,…,tp of Θ≻0 are positive and log⁡det⁡Θ=∑klog⁡tk, tr⁡Θ=∑ktk. Hence FS,λ(Θ)≤∑k=1ph(tk) for h(t)=log⁡t−λt. The function h is bounded above and tends to −∞ as t↓0 or t→∞. For any c, the upper level set FS,λ(Θ)≥c therefore forces each eigenvalue into a compact interval [ac,bc]⊂(0,∞): if M=sup⁡t>0h(t), then each h(tk)≥c−(p−1)M. These matrices form a closed bounded set of symmetric matrices contained in S++p, hence a compact set. Taking c=FS,λ(I) gives a nonempty compact upper level set, and continuity of F yields a maximizer.

2.2F3F4F5step 1.2algebra

Let B=Θ−1/2HΘ−1/2, using the positive square root from the orthonormal eigenbasis [F3]. Then B is symmetric and tr⁡(Θ−1HΘ−1H)=tr⁡(B2)=∥B∥F2, strictly positive when H≠0. Thus the second derivative of log⁡det⁡ along every nonconstant segment is strictly negative, giving its strict chord inequality. The Hessian of −log⁡det⁡ 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 ℓ1 norm is convex by the triangle inequality, so its negative is concave; adding these terms preserves the strict chord inequality. Hence FS,λ is strictly concave on its open convex domain.

2.3givenF1step 1.2algebra

Put G=Θ−1−S. 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 Θii>0, the diagonal penalty is locally differentiable with slope 1, so the diagonal equation is Gii−λ=0 and Γii=1. For i<j, a symmetric perturbation by t(Eij+Eji) has smooth derivative 2Gijt and changes the penalty by 2λ(∣Θij+t∣−∣Θij∣). If Θij≠0, testing both signs of small t gives Gij=λsign⁡(Θij). If Θij=0, taking t>0 gives Gij≤λ and taking t<0 gives Gij≥−λ. Defining Γij=Γji=Gij/λ at zero and the sign otherwise yields the stated KKT equation for the all-entry penalty [F1].

3.1givenF1step 2.1step 2.2step 2.3algebra∎

Conversely, suppose Θ≻0 and a symmetric Γ satisfies the stated entrywise conditions and Θ−1−S−λΓ=0. Put T=Θ−1/2Θ′Θ−1/2 for any Θ′≻0; its eigenvalues tr are positive. Since log⁡t≤t−1 for t>0 (the function t−1−log⁡t has its minimum 0 at t=1), log⁡det⁡Θ′−log⁡det⁡Θ=∑rlog⁡tr≤tr⁡(T)−p=tr⁡(Θ−1(Θ′−Θ)). For each scalar x and each allowed subgradient γ of ∣x∣, ∣y∣≥∣x∣+γ(y−x): if x≠0, this follows from ∣y∣≥sign⁡(x)y, while for x=0 it follows from ∣γ∣≤1. Summing gives ∥Θ′∥1≥∥Θ∥1+∑i,jΓij(Θij′−Θij) for the all-entry objective [F1]. Combining these bounds with the linear trace term and the KKT equation yields FS,λ(Θ′)−FS,λ(Θ)≤tr⁡((Θ−1−S−λΓ)(Θ′−Θ))=0. 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

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