No Arabic 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)= X^pY^q.$ Our first main result gives conditions on $F$ such that ${rm Tr}[ X log (F(Z,Y))] leq {rm Tr}[X(plog X + q log Y)]$ for all $X,Y,Z$ such that ${rm Tr} Z = {rm 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) = {rm Tr} [X(log X-log Y])$, and two others, the Donald relative entropy $D_D(X||Y)$, and the Belavkin-Stasewski relative entropy $D_{BS}(X||Y)$. They are known to satisfy $D_D(X||Y) leq D(X||Y)leq D_{BS}(X||Y)$. We prove that the Donald relative entropy provides the sharp upper bound, independent of $Z$, on ${rm Tr}[ X log (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 $D_D(X||Y)$ and $D_{BS}(X||Y)$, and show how our results for these lead to new refinements of the Golden-Thompson inequality.
We define and study multivariate exponential functions, symmetric with respect to the alternating group A_n, which is a subgroup of the permutation (symmetric) group S_n. These functions are connected with multivariate exponential functions, determined as the determinants of matrices whose entries are exponential functions of one variable. Our functions are eigenfunctions of the Laplace operator. By means of alternating multivariate exponential functions three types of Fourier transforms are constructed: expansions into corresponding Fourier series, integral Fourier transforms, and multivariate finite Fourier transforms. Alternating multivariate exponential functions are used as a kernel in all these Fourier transforms. Eigenfunctions of the integral Fourier transforms are obtained.
We prove a version of the data-processing inequality for the relative entropy for general von Neumann algebras with an explicit lower bound involving the measured relative entropy. The inequality, which generalizes previous work by Sutter et al. on finite dimensional density matrices, yields a bound how well a quantum state can be recovered after it has been passed through a channel. The natural applications of our results are in quantum field theory where the von Neumann algebras are known to be of type III. Along the way we generalize various multi-trace inequalities to general von Neumann algebras.
In this paper, we prove the convexity of trace functionals $$(A,B,C)mapsto text{Tr}|B^{p}AC^{q}|^{s},$$ for parameters $(p,q,s)$ that are best possible. We also obtain the monotonicity under unital completely positive trace preserving maps of trace functionals of this type. As applications, we extend some results in cite{HP12quasi,CFL16some} and resolve a conjecture in cite{RZ14}. Other conjectures in cite{RZ14} will also be discussed. We also show that some related trace functionals are not concave in general. Such concavity results were expected to hold in cite{Chehade20} to derive equality conditions of data processing inequalities for $alpha-z$ Renyi relative entropies.
in the recent paper [Journal of Physics A, 43474-0288 (2011)], B. Helffer and R. Purice compute the second term of a semi-classical trace formula for a Schrodinger operator with magnetic field. We show how to recover their formula by using the methods developped by the geometers in the seventies for the heat expansions.
Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for $k$-colored partition functions $p_{-k}(n)$ for all $kgeq2$. This enables us to extend the $k$-colored partition function multiplicatively to a function on $k$-colored partitions, and characterize when it has a unique maximum. We conclude with one conjectural inequality that strengthens our results.