Structure of the spaces of matrix monotone functions and of matrix convex functions and Jensen's type inequality for operators
Abstract
Let n ∈ and Mn be the algebra of n × n matrices. We call a function f matrix monotone of order n or n-monotone in short whenever the inequality f(a) ≤ f(b) holds for every pair of selfadjoint matrices a, b ∈ Mn such that a ≤ b and all eigenvalues of a and b are contained in I. Matrix convex (concave) functions on I are similarily defined. The spaces for n-monotone functions and n-convex functions are written as Pn(I) and Kn(I). In this note we discuss several assertions at each leven n for which we regard themas the problems of double piling structure of those sequences \Pn(I)\n∈ and \Kn(I)\n∈. In order to see clear insight of the aspect of the problems, however, we choose the following three main assertions among them and discuss their mutual dependence: enumerate [(i)] f(0)≤ 0 and f is n-convex in [0,α), [(ii)] For each matrix a with its spectrum in [0,α) and a contraction c in the matrix algebra Mn, \[ f(ca c)≤ cf(a)c, \] [(iii)] The functon g(t)/t is n-monotone in (0,α). enumerate In particular, we show that for any n ∈ two conditions (ii) and (iii) are equivalent.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.