Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 positive semidefinite cone is self-dual and its log determinant barrier has parameter n

Statement

Let n≥1, let Sn have trace pairing ⟨X,Y⟩=tr⁡(XY), and let S+n be the cone of real symmetric positive semidefinite matrices. Then (S+n)∗=S+n. On S++n, F(X)=−log⁡det⁡X is an n-log-homogeneous self-concordant barrier, with DF(X)[H]=−tr⁡(X−1H),D2F(X)[H,J]=tr⁡(X−1HX−1J), and λF(X)=n.

Facts & Assumptions

Given: The trace pairing, positive-definite matrices, and the self-concordant barrier convention.

[F2]

The trace pairing on symmetric matrices is ⟨X,Y⟩=tr⁡(XY) and X⪰0 means vTXv≥0 for every v (Conic, LP, and convex QP primal-dual models).

[F3]

The determinant differential on invertible matrices is Ddet⁡(X)[H]=det⁡(X)tr⁡(X−1H) (The determinant differential is Ddet⁡(A)[H]=tr⁡(adj⁡(A)H) at every matrix, and Jacobi's formula holds on the invertible locus).

[F4]

The derivative of inversion is D(X−1)[H]=−X−1HX−1 (On the invertible locus, Dinv⁡(A)[H]=−A−1HA−1).

[F6]

The log determinant is concave on the positive-definite cone (The log determinant is concave on positive-definite matrices); this published result is reused, not reproved as a separate concavity theorem here.

[F7]

The Frobenius norm is ∥M∥F=(∑i,jMij2)1/2 for real matrices.

Proof

1.1F1F2F5F7algebra

The set S+n is a closed convex cone because quadratic-form inequalities are preserved by nonnegative sums and limits. If both X and −X are positive semidefinite, their quadratic forms vanish on every vector; testing ei gives Xii=0, then testing ei+ej gives Xij=0, so the cone is pointed. The identity is interior: diagonalize E=ET=Udiag⁡(λi)UT. From the entry definition, ∥E∥F2=∑i,jEij2=tr⁡(E2); the finite sums give tr⁡(AB)=∑i,jAijBji=∑j,iBjiAij=tr⁡(BA), so tr⁡(E2)=tr⁡(diag⁡(λi2))=∑iλi2. Thus ∥E∥F<1 implies ∣λi∣<1 for every i, hence I+E≻0, proving that I is interior and the cone is proper. If X,Y⪰0, their positive square roots exist by [F1]. The same trace identity gives tr⁡(XY)=tr⁡(X1/2YX1/2)≥0, since X1/2YX1/2⪰0 and its diagonal entries are nonnegative. Thus S+n⊆(S+n)∗. Conversely, if Y is in the dual cone under [F2], testing against vvT⪰0 gives vTYv=tr⁡(YvvT)≥0 for every v, so Y⪰0.

1.2F1F2F3F4F5algebraconstruct

For X≻0 and symmetric H, set Z=X−1/2HX−1/2. Then det⁡(X+sH)=det⁡(X)det⁡(I+sZ). Diagonalizing the symmetric Z and differentiating the scalar sum −log⁡det⁡(X+sH)=−log⁡det⁡X−∑ilog⁡(1+sλi(Z)) gives DF(X)[H]=−tr⁡(X−1H) and D2F(X)[H,H]=tr⁡(Z2). Polarization gives the displayed bilinear Hessian formula. Equivalently the first derivative follows from [F3], and differentiating it uses [F4]–[F5].

2.1F1F7F8step 1.2algebra

Differentiating the inverse formula once more gives D3F(X)[U,V,V]=−2tr⁡(ZUZV2), where ZU=X−1/2UX−1/2 and ZV=X−1/2VX−1/2. By [F8] after vectorizing matrices, ∣tr⁡(ZUZV2)∣≤∥ZU∥F∥ZV2∥F. Diagonalizing the symmetric ZV gives ∥ZV2∥F2=∑iλi4≤(∑iλi2)2=∥ZV∥F4. The latter Frobenius norms are exactly the local norms, proving the mixed self-concordance inequality. Also ∥Z∥2=max⁡i∣λi(Z)∣≤(∑iλi(Z)2)1/2=∥Z∥F, so if ∥H∥X=∥Z∥F<1, then I+Z≻0 and X+H≻0.

3.1F1F5F6step 1.2algebra∎

Scaling gives F(αX)=F(X)−nlog⁡α. The local dual norm satisfies ∥DF(X)∥X,∗2=tr⁡(In)=n. If a sequence tends to a finite boundary matrix, its determinant tends to zero through positive values, so F→+∞. These facts, [F6], and the positive-definite Hessian in step 1.2 establish the stated barrier properties.

Depends on

Used by

Dependency tree · two levels

53 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