Loewner's Theorem on Monotone Matrix Functions
Loewner's Theorem on Monotone Matrix Functions
复制标题
DOI:
10.1007/978-3-030-22422-6
复制
发表时间:
2019-08
期刊:
影响因子:
--
通讯作者:
B. Simon
中科院分区:
文献类型:
--
作者:
B. Simon
This book is a love poem to Loewner’s theorem. There are other mathematical love poems, although not many. One sign, not always present and not foolproof, is that like this book, the author has included pictures of some of the main figures in the development of the subject under discussion. The telltale sign is that the reader’s initial reaction is “how can there a whole book on that subject”(although not all narrow books are love poems).Loewner’s theorem concerns the theory of monotone matrix functions, ie functions, f so that A≤ B⇒ f (A)≤ f (B) for pairs of selfadjoint matrices. That this is a subtle notion is seen by the fact (see Corollary 14.3) that if f: R→ R is monotone on all pairs of 2× 2 matrices, then f is affine! So Loewner realized one needed to fix a proper interval (a, b)⊂ R, demand that f:(a, b)→ R, and only demand the monotonicity result for pairs A and B all of whose eigenvalues are in (a, b). In 1934, Charles Loewner proved the remarkable result that f on (a, b) is matrix monotone on all such n× n pairs (for all n) if and only if f is real analytic on (a, b) and has an analytic continuation to the upper half plane with a positive imaginary part there. That functions with this property are matrix monotone follows in a few lines from the Herglotz representation theorem, so I call that half the easy half. The other direction is the hard half. Many applications of Loewner’s notion of matrix monotone functions involve explicit examples and so only the easy half. Matrix monotonicity is an algebraic statement, but Loewner’s theorem says it is equivalent to an analytic fact. One fascination of the subject is the mix of the algebraic and the analytic in its study.