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 , let have trace pairing , and let be the cone of real symmetric positive semidefinite matrices. Then . On , is an -log-homogeneous self-concordant barrier, with and .
Facts & Assumptions
Given: The trace pairing, positive-definite matrices, and the self-concordant barrier convention.
Every 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).
The trace pairing on symmetric matrices is and means for every (Conic, LP, and convex QP primal-dual models).
The determinant differential on invertible matrices is (The determinant differential is at every matrix, and Jacobi's formula holds on the invertible locus).
The derivative of inversion is (On the invertible locus, ).
The trace is linear in matrix entries (Trace and Frobenius-linear matrix functionals differentiate by inspection, The trace as the sum of the diagonal entries).
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.
The Frobenius norm is for real matrices.
Euclidean vectors satisfy Cauchy–Schwarz (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
Proof
The set is a closed convex cone because quadratic-form inequalities are preserved by nonnegative sums and limits. If both and are positive semidefinite, their quadratic forms vanish on every vector; testing gives , then testing gives , so the cone is pointed. The identity is interior: diagonalize . From the entry definition, ; the finite sums give , so . Thus implies for every , hence , proving that is interior and the cone is proper. If , their positive square roots exist by [F1]. The same trace identity gives , since and its diagonal entries are nonnegative. Thus . Conversely, if is in the dual cone under [F2], testing against gives for every , so .
For and symmetric , set . Then . Diagonalizing the symmetric and differentiating the scalar sum gives and . Polarization gives the displayed bilinear Hessian formula. Equivalently the first derivative follows from [F3], and differentiating it uses [F4]–[F5].
Differentiating the inverse formula once more gives , where and . By [F8] after vectorizing matrices, . Diagonalizing the symmetric gives . The latter Frobenius norms are exactly the local norms, proving the mixed self-concordance inequality. Also , so if , then and .
Scaling gives . The local dual norm satisfies . If a sequence tends to a finite boundary matrix, its determinant tends to zero through positive values, so . These facts, [F6], and the positive-definite Hessian in step 1.2 establish the stated barrier properties.
Depends on
- Self-concordant log-homogeneous barriers and their local geometry
- Conic, LP, and convex QP primal-dual models
- The log determinant is concave on positive-definite matrices
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- The determinant differential is $D\det(A)[H]=\operatorname{tr}(\operatorname{adj}(A)H)$ at every matrix, and Jacobi's formula holds on the invertible locus
- On the invertible locus, $D\operatorname{inv}(A)[H]=-A^{-1}HA^{-1}$
- Trace and Frobenius-linear matrix functionals differentiate by inspection
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
- Finite-budget primal-dual Newton methods for LP, convex QP, and symmetric cones Algorithm
- Log-barrier central paths and primal-dual Newton residuals Definition
- A two-variable semidefinite relaxation with a matching dual certificate Example
- Strict feasibility, boundary feasibility, and a weakly infeasible SDP Example
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
- Stephen Boyd and Lieven Vandenberghe, Convex Optimization (standard reference, not scraped)
- Hamza Fawzi, Topics in Convex Optimisation, Lecture 16 (standard reference, not scraped)