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.
Strict concavity of log determinant on positive-definite matrices
Statement
Let and let be symmetric positive-definite matrices. For and ,
If , equality holds. Thus is strictly concave on the positive-definite cone.
Facts & Assumptions
Given: Symmetric positive-definite matrices with .
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a real symmetric matrix has an orthonormal eigenbasis.
For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix: the determinant is the finite signed Leibniz sum; in particular .
On the invertible locus, : on the invertible locus, .
The chain rule for total derivatives: : derivatives of differentiable compositions are the compositions of the derivatives.
The trace as the sum of the diagonal entries: is the finite sum of diagonal entries of .
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a real function is continuous on a closed interval and differentiable on its interior, its secant slope equals its derivative at some interior point.
For same-sized finite square matrices over a commutative ring, , For every square matrix over a commutative ring, , and The determinant of a triangular matrix is the product of its diagonal entries: determinant is multiplicative and transpose-invariant, and on a triangular matrix it is the product of its diagonal entries; in particular, .
Proof
Put and for . For every nonzero , , so each is symmetric positive definite. By [F1], choose an orthogonal eigenbasis with every . The determinant laws [F9], including the triangular formula for the diagonal matrix, give and , so . Since the determinant is a polynomial by [F2] and is differentiable, hence continuous, on by [F4], is real and continuous on .
On , Jacobi's formula [F3], the scalar derivative [F4], and the chain rule [F6] give .
Differentiate the expression in step 2.1 along the same affine path. The inverse derivative [F5] and linearity of the finite trace [F7] give .
By [F1], form the symmetric positive-definite inverse square root , and set . Since is symmetric, is symmetric; if , then and invertibility of gives . Expanding the finite trace sum and interchanging its indices gives ; applying this identity yields . Thus for every . For any , is continuous on and differentiable on because is twice differentiable on . By [F8] applied to , there is with . Hence is strictly decreasing on .
For , step 1.1 shows that is continuous on and differentiable on , so [F8] applies on both and . Their secant slopes are and for some and . Step 4.1 makes strictly decreasing, so the first slope is strictly larger than the second; rearranging yields . If , the path is constant and equality holds.
Depends on
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- For every square matrix over a commutative ring, $\det(A^{\mathsf T})=\det(A)$
- The determinant of a triangular matrix is the product of its diagonal entries
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- 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}$
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
Used by
Dependency tree · two levels
62 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, §3.1.5, printed p. 74 (standard reference, not scraped)