Trace inequality#Von Neumann's trace inequality

{{Short description|Concept in Hlibert spaces mathematics}}

In mathematics, there are many kinds of inequalities involving matrices and linear operators on Hilbert spaces. This article covers some important operator inequalities connected with traces of matrices.E. Carlen, Trace Inequalities and Quantum Entropy: An Introductory Course, Contemp. Math. 529 (2010) 73–140 {{doi|10.1090/conm/529/10428}}R. Bhatia, Matrix Analysis, Springer, (1997).B. Simon, Trace Ideals and their Applications, Cambridge Univ. Press, (1979); Second edition. Amer. Math. Soc., Providence, RI, (2005).M. Ohya, D. Petz, Quantum Entropy and Its Use, Springer, (1993).

Basic definitions

Let \mathbf{H}_n denote the space of Hermitian n \times n matrices, \mathbf{H}_n^+ denote the set consisting of positive semi-definite n \times n Hermitian matrices and \mathbf{H}_n^{++} denote the set of positive definite Hermitian matrices. For operators on an infinite dimensional Hilbert space we require that they be trace class and self-adjoint, in which case similar definitions apply, but we discuss only matrices, for simplicity.

For any real-valued function f on an interval I \subseteq \Reals, one may define a matrix function f(A) for any operator A \in \mathbf{H}_n with eigenvalues \lambda in I by defining it on the eigenvalues and corresponding projectors P as

f(A) \equiv \sum_j f(\lambda_j)P_j ~,

given the spectral decomposition A = \sum_j \lambda_j P_j.

=Operator monotone=

{{Main|Operator monotone function}}

A function f : I \to \Reals defined on an interval I \subseteq \Reals is said to be operator monotone if for all n, and all A, B \in \mathbf{H}_n with eigenvalues in I, the following holds,

A \geq B \implies f(A) \geq f(B),

where the inequality A \geq B means that the operator A - B \geq 0 is positive semi-definite. One may check that f(A) = A^2 is, in fact, not operator monotone!

=Operator convex=

A function f : I \to \Reals is said to be operator convex if for all n and all A, B \in \mathbf{H}_n with eigenvalues in I, and 0 < \lambda < 1, the following holds

f(\lambda A + (1-\lambda)B) \leq \lambda f(A) + (1 -\lambda)f(B).

Note that the operator \lambda A + (1-\lambda)B has eigenvalues in I, since A and B have eigenvalues in I.

A function f is {{visible anchor|operator concave}} if -f is operator convex;=, that is, the inequality above for f is reversed.

={{anchor|Joint_convexity_function_2016_10}}Joint convexity=

A function g : I \times J \to \Reals, defined on intervals I, J \subseteq \Reals is said to be {{visible anchor|jointly convex}} if for all n and all

A_1, A_2 \in \mathbf{H}_n with eigenvalues in I and all B_1, B_2 \in \mathbf{H}_n with eigenvalues in J, and any 0 \leq \lambda \leq 1 the following holds

g(\lambda A_1 + (1-\lambda) A_2, \lambda B_1 + (1-\lambda) B_2) ~\leq~ \lambda g(A_1, B_1) + (1 -\lambda) g(A_2, B_2).

A function g is {{visible anchor|jointly concave}} if −g is jointly convex, i.e. the inequality above for g is reversed.

=Trace function=

Given a function f : \Reals \to \Reals, the associated trace function on \mathbf{H}_n is given by

A \mapsto \operatorname{Tr} f(A) = \sum_j f(\lambda_j),

where A has eigenvalues \lambda and \operatorname{Tr} stands for a trace of the operator.

Convexity and monotonicity of the trace function

Let f: \mathbb{R} \rarr \mathbb{R} be continuous, and let {{mvar|n}} be any integer. Then, if t\mapsto f(t) is monotone increasing, so

is A \mapsto \operatorname{Tr} f(A) on Hn.

Likewise, if t \mapsto f(t) is convex, so is A \mapsto \operatorname{Tr} f(A) on Hn, and

it is strictly convex if {{mvar|f}} is strictly convex.

See proof and discussion in, for example.

Löwner–Heinz theorem

For -1\leq p \leq 0, the function f(t) = -t^p is operator monotone and operator concave.

For 0 \leq p \leq 1, the function f(t) = t^p is operator monotone and operator concave.

For 1 \leq p \leq 2, the function f(t) = t^p is operator convex. Furthermore,

:f(t) = \log(t) is operator concave and operator monotone, while

:f(t) = t \log(t) is operator convex.

The original proof of this theorem is due to K. Löwner who gave a necessary and sufficient condition for {{mvar|f}} to be operator monotone.{{cite journal | last=Löwner | first=Karl | title=Über monotone Matrixfunktionen | journal=Mathematische Zeitschrift | publisher=Springer Science and Business Media LLC | volume=38 | issue=1 | year=1934 | issn=0025-5874 | doi=10.1007/bf01170633 | pages=177–216 | s2cid=121439134 | language=de}} An elementary proof of the theorem is discussed in and a more general version of it in.W.F. Donoghue, Jr., Monotone Matrix Functions and Analytic Continuation, Springer, (1974).

{{anchor|Klein2016_10}}Klein's inequality

For all Hermitian {{mvar|n}}×{{mvar|n}} matrices {{mvar|A}} and {{mvar|B}} and all differentiable convex functions

f: \mathbb{R} \rarr \mathbb{R}

with derivative {{math|f ' }}, or for all positive-definite Hermitian {{mvar|n}}×{{mvar|n}} matrices {{mvar|A}} and {{mvar|B}}, and all differentiable

convex functions {{mvar|f}}:(0,∞) → \mathbb{R}, the following inequality holds,

{{Equation box 1

|indent =:

|equation = \operatorname{Tr}[f(A)- f(B)- (A - B)f'(B)] \geq 0~.

|cellpadding= 6

|border

|border colour = #0073CF

|bgcolor=#F9FFF7}}

In either case, if {{mvar|f}} is strictly convex, equality holds if and only if {{mvar|A}} = {{mvar|B}}.

A popular choice in applications is {{math|f(t) {{=}} t log t}}, see below.

=Proof=

Let C=A-B so that, for t\in (0,1),

:B + tC = (1 -t)B + tA,

varies from B to A.

Define

:F(t) = \operatorname{Tr}[f(B + tC)].

By convexity and monotonicity of trace functions, F(t) is convex, and so for all t\in (0,1),

: F(0) + t(F(1)-F(0))\geq F(t) ,

which is,

: F(1) - F(0) \geq \frac{F(t)-F(0)}{t} ,

and, in fact, the right hand side is monotone decreasing in t.

Taking the limit t\to 0 yields,

: F(1) - F(0) \geq F'(0) ,

which with rearrangement and substitution is Klein's inequality:

: \mathrm{tr}[f(A)-f(B)-(A-B)f'(B)] \geq 0

Note that if f(t) is strictly convex and C\neq 0 , then F(t) is strictly convex. The final assertion follows from this and the fact that \tfrac{F(t) -F(0)}{t} is monotone decreasing in t.

Golden–Thompson inequality

{{main|Golden–Thompson inequality}}

In 1965, S. Golden {{cite journal | last=Golden | first=Sidney | title=Lower Bounds for the Helmholtz Function | journal=Physical Review | publisher=American Physical Society (APS) | volume=137 | issue=4B | date=1965-02-22 | issn=0031-899X | doi=10.1103/physrev.137.b1127 | pages=B1127–B1128| bibcode=1965PhRv..137.1127G }} and C.J. Thompson {{cite journal | last=Thompson | first=Colin J. | title=Inequality with Applications in Statistical Mechanics | journal=Journal of Mathematical Physics | publisher=AIP Publishing | volume=6 | issue=11 | year=1965 | issn=0022-2488 | doi=10.1063/1.1704727 | pages=1812–1813| bibcode=1965JMP.....6.1812T }} independently discovered that

For any matrices A, B\in\mathbf{H}_n,

:\operatorname{Tr} e^{A+B}\leq \operatorname{Tr} e^A e^B.

This inequality can be generalized for three operators:{{cite journal | last=Lieb | first=Elliott H | title=Convex trace functions and the Wigner-Yanase-Dyson conjecture | journal=Advances in Mathematics | volume=11 | issue=3 | year=1973 | issn=0001-8708 | doi=10.1016/0001-8708(73)90011-x | doi-access=free | pages=267–288| url=http://www.numdam.org/item/RCP25_1973__19__A4_0/ }} for non-negative operators A, B, C\in\mathbf{H}_n^+,

:\operatorname{Tr} e^{\ln A -\ln B+\ln C}\leq \int_0^\infty \operatorname{Tr} A(B+t)^{-1}C(B+t)^{-1}\,\operatorname{d}t.

Peierls–Bogoliubov inequality

Let R, F\in \mathbf{H}_n be such that Tr eR = 1.

Defining {{math|g {{=}} Tr FeR}}, we have

:\operatorname{Tr} e^F e^R \geq \operatorname{Tr} e^{F+R}\geq e^g.

The proof of this inequality follows from the above combined with Klein's inequality. Take {{math|f(x) {{=}} exp(x), A{{=}}R + F, and B {{=}} R + gI}}.D. Ruelle, Statistical Mechanics: Rigorous Results, World Scient. (1969).

Gibbs variational principle

Let H be a self-adjoint operator such that e^{-H} is trace class. Then for any \gamma\geq 0 with \operatorname{Tr}\gamma=1,

:\operatorname{Tr}\gamma H+\operatorname{Tr}\gamma\ln\gamma\geq -\ln \operatorname{Tr} e^{-H},

with equality if and only if \gamma=\exp(-H)/\operatorname{Tr} \exp(-H).

Lieb's concavity theorem

The following theorem was proved by E. H. Lieb in. It proves and generalizes a conjecture of E. P. Wigner, M. M. Yanase, and Freeman Dyson.{{cite journal | last1=Wigner | first1=Eugene P. | last2=Yanase | first2=Mutsuo M. | title=On the Positive Semidefinite Nature of a Certain Matrix Expression | journal=Canadian Journal of Mathematics | publisher=Canadian Mathematical Society | volume=16 | year=1964 | issn=0008-414X | doi=10.4153/cjm-1964-041-x | pages=397–406| s2cid=124032721 }} Six years later other proofs were given by T. Ando {{cite journal | last=Ando | first=T. | title=Concavity of certain maps on positive definite matrices and applications to Hadamard products | journal=Linear Algebra and Its Applications | publisher=Elsevier BV | volume=26 | year=1979 | issn=0024-3795 | doi=10.1016/0024-3795(79)90179-4 | pages=203–241| doi-access=free }} and B. Simon, and several more have been given since then.

For all m\times n matrices K, and all q and r such that 0 \leq q\leq 1 and 0\leq r \leq 1, with q + r \leq 1 the real valued map on \mathbf{H}^+_m \times \mathbf{H}^+_n given by

:

F(A,B,K) = \operatorname{Tr}(K^*A^qKB^r)

  • is jointly concave in (A,B)
  • is convex in K.

Here K^* stands for the adjoint operator of K.

Lieb's theorem

For a fixed Hermitian matrix L\in\mathbf{H}_n, the function

: f(A)=\operatorname{Tr} \exp\{L+\ln A\}

is concave on \mathbf{H}_n^{++}.

The theorem and proof are due to E. H. Lieb, Thm 6, where he obtains this theorem as a corollary of Lieb's concavity Theorem.

The most direct proof is due to H. Epstein;{{cite journal | last=Epstein | first=H. | title=Remarks on two theorems of E. Lieb | journal=Communications in Mathematical Physics | publisher=Springer Science and Business Media LLC | volume=31 | issue=4 | year=1973 | issn=0010-3616 | doi=10.1007/bf01646492 | pages=317–325| bibcode=1973CMaPh..31..317E | s2cid=120096681 | url=http://projecteuclid.org/euclid.cmp/1103859039 }} see M.B. Ruskai papers,{{cite journal | last=Ruskai | first=Mary Beth | title=Inequalities for quantum entropy: A review with conditions for equality | journal=Journal of Mathematical Physics | publisher=AIP Publishing | volume=43 | issue=9 | year=2002 | issn=0022-2488 | doi=10.1063/1.1497701 | pages=4358–4375| arxiv=quant-ph/0205064 | bibcode=2002JMP....43.4358R | s2cid=3051292 }}{{cite journal | last=Ruskai | first=Mary Beth | title=Another short and elementary proof of strong subadditivity of quantum entropy | journal=Reports on Mathematical Physics | publisher=Elsevier BV | volume=60 | issue=1 | year=2007 | issn=0034-4877 | doi=10.1016/s0034-4877(07)00019-5 | pages=1–12| arxiv=quant-ph/0604206 | bibcode=2007RpMP...60....1R | s2cid=1432137 }} for a review of this argument.

Ando's convexity theorem

T. Ando's proof of Lieb's concavity theorem led to the following significant complement to it:

For all m \times n matrices K, and all 1 \leq q \leq 2 and 0 \leq r \leq 1 with q-r \geq 1, the real valued map on \mathbf{H}^{++}_m \times \mathbf{H}^{++}_n given by

: (A,B) \mapsto \operatorname{Tr}(K^*A^qKB^{-r})

is convex.

{{anchor|Joint_convexity_2016_10}}Joint convexity of relative entropy

For two operators A, B\in\mathbf{H}^{++}_n define the following map

: R(A\parallel B):= \operatorname{Tr}(A\log A) - \operatorname{Tr}(A\log B).

For density matrices \rho and \sigma, the map R(\rho\parallel\sigma)=S(\rho\parallel\sigma) is the Umegaki's quantum relative entropy.

Note that the non-negativity of R(A\parallel B) follows from Klein's inequality with f(t)=t\log t.

=Statement=

The map R(A\parallel B): \mathbf{H}^{++}_n \times \mathbf{H}^{++}_n \rightarrow \mathbf{R} is jointly convex.

=Proof=

For all 0 < p < 1, (A,B) \mapsto \operatorname{Tr}(B^{1-p}A^p) is jointly concave, by Lieb's concavity theorem, and thus

:(A,B)\mapsto \frac{1}{p-1}(\operatorname{Tr}(B^{1-p}A^p)-\operatorname{Tr}A)

is convex. But

:\lim_{p\rightarrow 1}\frac{1}{p-1}(\operatorname{Tr}(B^{1-p}A^p)-\operatorname{Tr}A)=R(A\parallel B),

and convexity is preserved in the limit.

The proof is due to G. Lindblad.{{cite journal | last=Lindblad | first=Göran | title=Expectations and entropy inequalities for finite quantum systems | journal=Communications in Mathematical Physics | publisher=Springer Science and Business Media LLC | volume=39 | issue=2 | year=1974 | issn=0010-3616 | doi=10.1007/bf01608390 | pages=111–119| bibcode=1974CMaPh..39..111L | s2cid=120760667 | url=http://projecteuclid.org/euclid.cmp/1103860161 }}

Jensen's operator and trace inequalities

The operator version of Jensen's inequality is due to C. Davis.C. Davis, A Schwarz inequality for convex operator functions, Proc. Amer. Math. Soc. 8, 42–44, (1957).

A continuous, real function f on an interval I satisfies Jensen's Operator Inequality if the following holds

: f\left(\sum_kA_k^*X_kA_k\right)\leq\sum_k A_k^*f(X_k)A_k,

for operators \{A_k\}_k with \sum_k A^*_kA_k=1 and for self-adjoint operators \{X_k\}_k with spectrum on I.

See,{{cite journal | last1=Hansen | first1=Frank | last2=Pedersen | first2=Gert K. | title=Jensen's Operator Inequality | journal=Bulletin of the London Mathematical Society | volume=35 | issue=4 | date=2003-06-09 | issn=0024-6093 | doi=10.1112/s0024609303002200 | pages=553–564|arxiv=math/0204049| s2cid=16581168 }} for the proof of the following two theorems.

=Jensen's trace inequality=

Let {{mvar|f}} be a continuous function defined on an interval {{mvar|I}} and let {{mvar|m}} and {{mvar|n}} be natural numbers. If {{mvar|f}} is convex, we then have the inequality

: \operatorname{Tr}\Bigl(f\Bigl(\sum_{k=1}^nA_k^*X_kA_k\Bigr)\Bigr)\leq \operatorname{Tr}\Bigl(\sum_{k=1}^n A_k^*f(X_k)A_k\Bigr),

for all ({{mvar|X}}1, ... , {{mvar|X}}n) self-adjoint {{mvar|m}} × {{mvar|m}} matrices with spectra contained in {{mvar|I}} and

all ({{mvar|A}}1, ... , {{mvar|A}}n) of {{mvar|m}} × {{mvar|m}} matrices with

:\sum_{k=1}^nA_k^*A_k=1.

Conversely, if the above inequality is satisfied for some {{mvar|n}} and {{mvar|m}}, where {{mvar|n}} > 1, then {{mvar|f}} is convex.

=Jensen's operator inequality=

For a continuous function f defined on an interval I the following conditions are equivalent:

  • f is operator convex.
  • For each natural number n we have the inequality

: f\Bigl(\sum_{k=1}^nA_k^*X_kA_k\Bigr)\leq\sum_{k=1}^n A_k^*f(X_k)A_k,

for all (X_1, \ldots , X_n) bounded, self-adjoint operators on an arbitrary Hilbert space \mathcal{H} with

spectra contained in I and all (A_1, \ldots , A_n) on \mathcal{H} with \sum_{k=1}^n A^*_kA_k=1.

  • f(V^*XV) \leq V^*f(X)V for each isometry V on an infinite-dimensional Hilbert space \mathcal{H} and

every self-adjoint operator X with spectrum in I.

  • Pf(PXP + \lambda(1 -P))P \leq Pf(X)P for each projection P on an infinite-dimensional Hilbert space \mathcal{H}, every self-adjoint operator X with spectrum in I and every \lambda in I.

Araki–Lieb–Thirring inequality

{{distinguish|text=the Lieb–Thirring inequality}}

E. H. Lieb and W. E. Thirring proved the following inequality in E. H. Lieb, W. E. Thirring, Inequalities for the Moments of the Eigenvalues of the Schrödinger Hamiltonian and Their Relation to Sobolev Inequalities, in Studies in Mathematical Physics, edited E. Lieb, B. Simon, and A. Wightman, Princeton University Press, 269–303 (1976). 1976: For any A \geq 0, B \geq 0 and r \geq 1,

\operatorname{Tr} ((BAB)^r) ~\leq~ \operatorname{Tr} (B^r A^r B^r).

In 1990 {{cite journal | last=Araki | first=Huzihiro | title=On an inequality of Lieb and Thirring | journal=Letters in Mathematical Physics | publisher=Springer Science and Business Media LLC | volume=19 | issue=2 | year=1990 | issn=0377-9017 | doi=10.1007/bf01045887 | pages=167–170| bibcode=1990LMaPh..19..167A | s2cid=119649822 }} H. Araki generalized the above inequality to the following one: For any A \geq 0, B \geq 0 and q \geq 0,

\operatorname{Tr}((BAB)^{rq}) ~\leq~ \operatorname{Tr}((B^r A^r B^r)^q),

for r \geq 1, and

\operatorname{Tr}((B^r A^r B^r)^q) ~\leq~ \operatorname{Tr}((BAB)^{rq}),

for 0 \leq r \leq 1.

There are several other inequalities close to the Lieb–Thirring inequality, such as the following:Z. Allen-Zhu, Y. Lee, L. Orecchia, Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver, in ACM-SIAM Symposium on Discrete Algorithms, 1824–1831 (2016). for any A \geq 0, B \geq 0 and \alpha \in [0, 1],

\operatorname{Tr} (B A^\alpha B B A^{1-\alpha} B) ~\leq~ \operatorname{Tr} (B^2 A B^2),

and even more generally:L. Lafleche, C. Saffirio, Strong Semiclassical Limit from Hartree and

Hartree-Fock to Vlasov-Poisson Equation, arXiv:2003.02926 [math-ph]. for any A \geq 0, B \geq 0, r \geq 1/2 and c \geq 0,

\operatorname{Tr}((B A B^{2c} A B)^r) ~\leq~ \operatorname{Tr}((B^{c+1} A^2 B^{c+1})^r).

The above inequality generalizes the previous one, as can be seen by exchanging A by B^2 and B by A^{(1-\alpha)/2} with \alpha = 2 c / (2 c + 2) and using the cyclicity of the trace, leading to

\operatorname{Tr}((B A^\alpha B B A^{1-\alpha} B)^r) ~\leq~ \operatorname{Tr}((B^2 A B^2)^r).

Additionally, building upon the Lieb-Thirring inequality the following inequality was derived: V. Bosboom, M. Schlottbom, F. L. Schwenninger, On the unique solvability of radiative transfer equations with polarization, in Journal of Differential Equations, (2024). For any A,B\in \mathbf{H}_n, T\in \mathbb{C}^{n\times n} and all 1\leq p,q\leq \infty with 1/p+1/q = 1, it holds that

|\operatorname{Tr}(TAT^*B)| ~\leq~ \operatorname{Tr}(T^*T|A|^p)^\frac{1}{p}\operatorname{Tr}(TT^*|B|^q)^\frac{1}{q}.

Effros's theorem and its extension

E. Effros in {{cite journal | last=Effros | first=E. G. | title=A matrix convexity approach to some celebrated quantum inequalities | journal=Proceedings of the National Academy of Sciences USA| publisher=Proceedings of the National Academy of Sciences | volume=106 | issue=4 | date=2009-01-21 | issn=0027-8424 | doi=10.1073/pnas.0807965106 | pages=1006–1008| pmid=19164582 | pmc=2633548 |arxiv=0802.1234| bibcode=2009PNAS..106.1006E |doi-access=free}} proved the following theorem.

If f(x) is an operator convex function, and L and R are commuting bounded linear operators, i.e. the commutator [L,R]=LR-RL=0, the perspective

:g(L, R):=f(LR^{-1})R

is jointly convex, i.e. if L=\lambda L_1+(1-\lambda)L_2 and R=\lambda R_1+(1-\lambda)R_2 with [L_i, R_i]=0 (i=1,2), 0\leq\lambda\leq 1,

:g(L,R)\leq \lambda g(L_1,R_1)+(1-\lambda)g(L_2,R_2).

Ebadian et al. later extended the inequality to the case where L and R do not commute .{{cite journal | last1=Ebadian | first1=A. | last2=Nikoufar | first2=I. | last3=Eshaghi Gordji | first3=M. | title=Perspectives of matrix convex functions | journal=Proceedings of the National Academy of Sciences | publisher=Proceedings of the National Academy of Sciences USA| volume=108 | issue=18 | date=2011-04-18 | issn=0027-8424 | doi=10.1073/pnas.1102518108| pmc=3088602 | pages=7313–7314| bibcode=2011PNAS..108.7313E | doi-access=free }}

See also

  • {{annotated link|Lieb–Thirring inequality}}
  • {{annotated link|Schur–Horn theorem}}
  • {{annotated link|Trace identity}}
  • {{annotated link|von Neumann entropy}}

References

{{reflist}}

  • [http://www.scholarpedia.org/article/Matrix_and_Operator_Trace_Inequalities#Gibbs_variational_principle Scholarpedia] primary source.

Category:Operator theory

Category:Matrix theory

Category:Inequalities (mathematics)