For a real positive-definite matrix in finite dimension, write by the spectral theorem for real symmetric matrices. In the coordinates in an orthonormal basis , the positive level set becomesThis is an ellipsoid, with semi-major and semi-minor axes in two dimensions forming an ellipse; each semi-axis has length and direction given by the corresponding eigenvector. In the opening example, the shorter semi-axis is along , while the longer is along . A stiffer direction, meaning a larger eigenvalue, reaches the same energy at a smaller displacement. The ratio of longest to shortest semi-axis is , the square root of the spectral condition number of a positive-definite matrix.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §2.2.2, p. 30, equation (2.3): ellipsoids and semi-axis lengths; the book uses the inverse quadratic coefficient matrix
Strict positivity matters because givesHence a fixed positive level set cannot extend arbitrarily far. The Cholesky decomposition gives another view: , so the ellipsoid is the inverse image of a sphere under an invertible linear map. A singular positive semidefinite matrix has a nonzero kernel; adding a kernel vector preserves its quadratic form, so any nonempty positive level set is unbounded. These statements concern finite dimension; the positive definite symmetric operator entry explains why strict positivity alone need not give a uniform lower bound on an infinite-dimensional Hilbert space.
Articles by others on the same topic
There are currently no matching articles.