Some trace inequalities for exponential and logarithmic functions

Abstract

Consider a function F(X,Y) of pairs of positive matrices with values in the positive matrices such that whenever X and Y commute F(X,Y)= XpYq. Our first main result gives conditions on F such that Tr[ X (F(Z,Y))] ≤ Tr[X(p X + q Y)] for all X,Y,Z such that Tr Z = Tr X. (Note that Z is absent from the right side of the inequality.) We give several examples of functions F to which the theorem applies. Our theorem allows us to give simple proofs of the well known logarithmic inequalities of Hiai and Petz and several new generalizations of them which involve three variables X,Y,Z instead of just X,Y alone. The investigation of these logarithmic inequalities is closely connected with three quantum relative entropy functionals: The standard Umegaki quantum relative entropy D(X||Y) = Tr [X( X- Y]), and two others, the Donald relative entropy DD(X||Y), and the Belavkin-Stasewski relative entropy DBS(X||Y). They are known to satisfy DD(X||Y) ≤ D(X||Y)≤ DBS(X||Y). We prove that the Donald relative entropy provides the sharp upper bound, independent of Z, on Tr[ X (F(Z,Y))] in a number of cases in which (Z,Y) is homogeneous of degree 1 in Z and -1 in Y. We also investigate the Legendre transforms in X of DD(X||Y) and DBS(X||Y), and show how our results for these lead to new refinements of the Golden-Thompson inequality.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…