Operator monotone function

In linear algebra, the operator monotone function is an important type of real-valued function, fully classified by Charles Löwner in 1934.Template:R It is closely allied to the operator concave and operator concave functions, and is encountered in operator theory and in matrix theory, and led to the Löwner–Heinz inequality.Template:RTemplate:R

Definition

A function $f:I\to ℝ$ defined on an interval $I\subseteq ℝ$ is said to be operator monotone if whenever $A$ and $B$ are Hermitian matrices (of any size/dimensions) whose eigenvalues all belong to the domain of $f$ and whose difference $A-B$ is a positive semi-definite matrix, then necessarily $f(A)-f(B)\ge 0$ where $f(A)$ and $f(B)$ are the values of the matrix function induced by $f$ (which are matrices of the same size as $A$ and $B$).

Notation

This definition is frequently expressed with the notation that is now defined. Write $A\ge 0$ to indicate that a matrix $A$ is positive semi-definite and write $A\ge B$ to indicate that the difference $A-B$ of two matrices $A$ and $B$ satisfies $A-B\ge 0$ (that is, $A-B$ is positive semi-definite).

With $f:I\to ℝ$ and $A$ as in the theorem's statement, the value of the matrix function $f(A)$ is the matrix (of the same size as $A$) defined in terms of its $A$'s spectral decomposition $A=\sum _j{\lambda }_j{P}_j$ by $$f(A)=\sum _{j}f({\lambda }_j)P_j,$$ where the ${\lambda }_j$ are the eigenvalues of $A$ with corresponding projectors $P_j.$

The definition of an operator monotone function may now be restated as:

A function $f:I\to ℝ$ defined on an interval $I\subseteq ℝ$ said to be operator monotone if (and only if) for all positive integers $n,$ and all $n\times n$ Hermitian matrices $A$ and $B$ with eigenvalues in $I,$ if $A\ge B$ then $f(A)\ge f(B).$

See also

• Template:Annotated link
• Template:Annotated link

Further reading

• Template:Cite book
• Template:Cite journal
• Template:Cite journal