Loewner order
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, Loewner order is the partial order defined by the convex cone of positive semi-definite matrices. This order is usually employed to generalize the definitions of monotone and concave/convex scalar functions to monotone and concave/convex Hermitian valued functions. These functions arise naturally in matrix and operator theory and have applications in many areas of physics and engineering.
In mathematics, Loewner order is the partial order defined by the convex cone of positive semi-definite matrices. This order is usually employed to generalize the definitions of monotone and concave/convex scalar functions to monotone and concave/convex Hermitian valued functions.
These functions arise naturally in matrix and operator theory and have applications in many areas of physics and engineering. When A and B are real scalars (i.e. n = 1), the Loewner order reduces to the usual ordering of R. Although some familiar properties of the usual order of R are also valid when n ≥ 2, several properties are no longer valid.
For instance, the comparability of two matrices may no longer be valid. In fact, if A = \begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}\ and B = \begin{bmatrix} 0 & 0 \\ 0 & 1 \end{bmatrix}\ then neither A ≥ B or B ≥ A holds true. In other words, the Loewner order is a partial order, but not a total order.
Moreover, since A and B are Hermitian matrices, their eigenvalues are all real numbers. If λ 1 (B) is the maximum eigenvalue of B and λ n (A) the minimum eigenvalue of A, a sufficient criterion to have A ≥ B is that λ n (A) ≥ λ 1 (B). If A or B is a multiple of the identity matrix, then this criterion is also necessary.
The Loewner order does not have the least-upper-bound property, and therefore does not form a lattice. It is bounded: for any finite set S of matrices, one can find an "upper-bound" matrix A that is greater than all of S. However, there will be multiple upper bounds.
In a lattice, there would exist a unique maximum \max(S) such that any upper bound U on S obeys \max(S) ≤ U. But in the Loewner order, one can have two upper bounds A and B that are both minimal (there is no element C < A that is also an upper bound) but that are incomparable (A - B is neither positive semidefinite nor negative semidefinite).
Text derived from https://en.wikipedia.org/w/index.php?oldid=1377400313 under CC BY-SA 4.0; modifications have been made.