TOPICS
Search

Matrix Monotone Function


A matrix monotone function of order n on a interval J is a real function f such that

 A<=B => f(A)<=f(B)

for all n×n Hermitian matrices A,B with eigenvalues in J (Bhatia 1997). Here A<=B means that B-A is positive semidefinite, and f(A) is defined by applying f to the eigenvalues in a unitary eigen decomposition. A function monotone of every positive integer order is called operator monotone. Matrix monotone decreasing means that -f is matrix monotone.

Matrix monotonicity of order n implies Frobenius radial convexity of order n. The converse fails for every n>=3, even if either the increasing or decreasing direction is allowed. Kian (2026) gave rational functions whose exact matrix monotonicity and Frobenius radial convexity orders differ by an arbitrarily large amount.


See also

Frobenius Radial Convexity, Hermitian Matrix, Monotonic Function, Positive Semidefinite Matrix

Explore with Wolfram|Alpha

References

Bhatia, R. Matrix Analysis. New York: Springer, 1997. https://doi.org/10.1007/978-1-4612-0653-8.Czerwińska, M. M.; Franco, J. A.; and Merino, A. "Towards a Characterization of Matrix Monotonicity via Radial Convexity." 12 Oct 2026. https://arxiv.org/abs/2610.17393v1.Kian, M. "Unbounded Gaps Between Matrix Monotonicity and Frobenius Radial Convexity." 19 Nov 2026. https://arxiv.org/abs/2611.25596v1.

Cite this as:

Weisstein, Eric W. "Matrix Monotone Function." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MatrixMonotoneFunction.html

Subject classifications