DOCSLIB.ORG

Singular Values, Diagonal Elements, and Extreme Matrices Hector F

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Singular Values, Diagonal Elements, and Extreme Matrices Hector F View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Linear Algebra and its Applications 305 (2000) 151–159 www.elsevier.com/locate/laa Singular values, diagonal elements, and extreme matrices Hector F. Miranda Departamento de Matemática, Universidad del Bío-Bío, Casilla 1102, Concepción, Chile Received 26 February 1999; accepted 23 September 1999 Submitted by R.A. Brualdi Abstract For complex matrices A and B there are inequalities related to the diagonal elements of AB and the singular values of A and B. We study the conditions on the matrices for which those inequalities become equalities. In all cases, the conditions are both necessary and sufficient. © 2000 Elsevier Science Inc. All rights reserved. AMS classification: 15A45; 15A18 Keywords: Singular values; Diagonal elements; Extreme cases Given an n × n complex matrix A, three sets of numbers are of particular interest: eigenvalues λ1,...,λn(|λ1|>···>|λn|), singular values a1 > ···>an, and diag- onal elements d1,...,dn(|d1|>···>|dn|). The relation between the eigenvalues and the singular values was obtained by Weyl [15] and Horn [5] and the relation between the diagonal elements and the singular values was obtained by Thompson [12] and Sing [9] independently. However, the relation between the eigenvalues and the diagonal elements is far from trivial, even for normal A [13]. Some inequalities for the singular valuesQ of the productQ C = AB and the singular k 6 k = − values of A and B are well-known, e.g. i=1 ci i=1 aibi,k 1,...,n 1and equality holds when k = n [4]. This immediately yields its additive version and Lemma 4. E-mail address: [email protected] (H.F. Miranda). 0024-3795/00/$ - see front matter ( 2000 Elsevier Science Inc. All rights reserved. PII:S0024-3795(99)00221-9 152 H.F. Miranda / Linear Algebra and its Applications 305 (2000) 151–159 So, if di,i =1,...,n,denote the diagonal elements of AB their absolute values in nonincreasing order, then one has (part of Theorem 1) |d1|+···+|dk|6a1b1+···+akbk,k=1,...,n and the inequality with a subtracted term |d1|+···+|dn−1|−|dn|6a1b1+···+an−1bn−1 −anbn. These inequalities completely describe the relation between the diagonal entries of a product AB and the singular values of A and B, respectively [8]. In recent years inequalities of subtracted term have appeared repeatedly and turn out to be closely related to the root system of some real simple Lie algebras. Here, we consider when these inequalities become equalities. The main results are Theorem 2 (for the weak majorization) and Theorem 3 (for the subtracted term inequality). The proofs rely on Lemma 3 and some work of Li [6] on the characterization of extremal matrices. Let A and B be n × n complex matrices with singular values a1 > ···>an and b1 > ···>bn, respectively. Denote the set of n × n complex matrices by Mn. The 1937 trace inequality of von Neumann [14] asserts that Re(tr(AB)) 6 a1b1 +···+anbn, where Re denotes the real part, and tr the trace. This inequality has commanded attention in more than 60 years since it was found and several applications of it in pure and applied mathematics are known. These include applications of group induced orderings to statistics [2], nonlinear elasticity [1], and applications to perturbation theory [10]. For more references, see [7]. A more detailed study of the theorem seems justified. Thus, in [8] we asked about the conditions satisfied by the individual diagonal elements of the product that sum to give the trace, and the answer was given in the following theorem. Theorem 1. Let A and B be in Mn with singular values a1 > ···>an and b1 > ···>bn,respectively. Then if d1,...,dn denote the elements of the principal diag- onal of AB numbered in order of decreasing absolute values, we have that |d1|+···+|dk|6a1b1+···+akbk,k=1,...,n, |d1|+···+|dn−1|−|dn|6a1b1+···+an−1bn−1 −anbn. Conversely, if we have numbers satisfying the above inequalities, there exist matrices A and B with singular values a1 > ···>an and b1 > ···>bn, respect- ively, and d1,...,dn the diagonal entries of AB. Here, we want to study the structure of the matrices in the case when the in- equalities from Theorem 1 become equalities. In order to obtain an answer we need some results. Thompson [12] found the conditions satisfied by the diagonal elements and singular values of a complex matrix. Li [6] studied the extreme cases of these inequalities and found that: H.F. Miranda / Linear Algebra and its Applications 305 (2000) 151–159 153 Lemma 1. Let A ∈ Mn with singular values a1 > ···>an, diagonal elements d1,...,dn such that |d1| > ···>|dn|.Let16k6n. Then |d1|+···+|dk|=a1+···+ak if and only if A = A1 ⊕ A2 (A1 ∈ Mk) and there exists a diagonal matrix D ∈ U(k) such that DA1 is a positive semidefinite matrix with eigenvalues a1,...,ak. Lemma 2. Let A ∈ Mn with singular values a1 > ···>an diagonal elements d1,...,dn such that |d1| > ···>|dn|.Then |d1|+···+|dn−1|−|dn|=a1+···+an−1 −an if and only if there exists a diagonal matrix D ∈ U(n) such that DA is a hermitian matrix with diagonal elements |d1|,...,|dn−1|,−|dn|; and eigenvalues a1,...,an−1, −an. Horn [4] proved that the vector of singular values of a product of two matrices is weakly majorized by the vector of the corresponding products of singular values of the factors, when they are ordered in decreasing order. The equality case is given in the next lemma. Lemma 3. Let A, B ∈ Mn with singular values a1 > ···>an,and b1 > ···>bn, respectively. Let c1 > ···>cn denote the singular values of AB. Let 1 6 k 6 n. Then c1 +···+ck =a1b1 +···+akbk if and only if there are U,V,W ∈ U(n),the n × n unitary group, such that U ∗AV = ∗ diag(a1,...,ak)⊕A2 and V BW = diag(b1,...,bk)⊕B2 for some A2,B2 ∈ Mn−k. Proof. First assume that k 6 min {rank A, rank B},soakbk >0. The singular value decomposition ensures that there are n × n unitary matrices X =[X1 X2]and Y = [Y Y ] such that X ,Y ∈M and 1 2 1 1 n,k ∗ ∗ ∗ = = X1ABY1 X (AB) Y diag(c1, ..., cn) ∗∗. ∗ In particular, X1 A (BY1) is positive semidefinite. Since " # X∗A X∗A = 1 , X∗A 2 ∗ 6 ∗ = = singular value interlacing ensures that σi X1 A σi (X A) ai for all i 1, ..., k. If these inequalities are all equalities, then the k largest eigenvalues of " # ∗ ∗ ∗ X AA X1 ∗ G = X∗A X∗A = 1 ∗ ∗ ∗ X2AA X1 154 H.F. Miranda / Linear Algebra and its Applications 305 (2000) 151–159 ∗ ∗ are exactly the k eigenvalues of its principal submatrix H ≡ X AA X1, which means 1 ∗ ∗ that the interlacing inequalities for H in G are all equalities; this forces X AA X1 = ∗ ∗ 2 0(therowsofX1Aare orthogonal to the rows of X2A). A similar conclusion holds for B. Now compute Xk = ∗ = ∗ ci tr X1A (BY1) tr (BY1) X1A i=1 Xk 6 ∗ σi BY1X1A (1) i=1 Xk 6 ∗ σi (BY1)σi X1A i=1 Xk 6 σi (A)σi (B) (2) i=1 Xk Xk = aibi = ci. i=1 i=1 Thus, all these inequalities are equalities. ∗ = = Equality at (2) means that all σi X1 A σi (A) and σi (BY1) σi (B) since all the terms are positive (here’s where we use the rank assumption). ∗ Equality at (1)means that (BY1) X A is positive semidefinite. Since we already ∗ 1 know that X1A (BY1) is positive semidefinite, the simultaneous singular value ∈ ∈ ∗ = R ∗ decomposition [3] says there are Z U(k) and W U(n) such that X1A Z W ∗ T and BY = WKZ ,whereR=[DA 0]∈Mk,n and K =[PDB 0]∈Mk,n, DA = diag(a1,...,ak), DB =diag(b1,...,b k),and Pis someP permutation matrix. The ∗ = k usual interchange argument using tr X1A (BY1) i=1 aibi ensures that the bi are in the correct position when the ai are distinct, or that they can be put into correct position via a harmless permutation (which is then absorbed into W) when some ai are repeated. The conclusion is that there are Z ∈ U(k) and W =[W1 W2]∈U(n) ∈ ∗ = R ∗ = ∗ = K ∗ = ∗ such that W1 Mn,k, X1 A Z W ZDAW1 ,andBY W Z W1DBZ . Compute " # " # ∗ ∗ ∗ X X AW1 X AW2 X∗AW = 1 A W W = 1 1 ∗ 1 2 ∗ ∗ X2 X2AW1 ∗ ∗ " # ZDAW1 W1 ZDAW1 W2 ZD 0 = = A ∗ ∗ −1 ∗ ∗ X2A A X1ZDA 0 ∗ = ∗ ∗ = since W1 W2 0andX2AA X1 0. Finally, H.F. Miranda / Linear Algebra and its Applications 305 (2000) 151–159 155 " # ∗ ∗ DA 0 Z ⊕ In−k X AW = 0 ∗ is a representation of the required form. A similar argument gives a representation of the desired form for B. Now suppose that k1 = rank A 6 rank B and k>k1.ThenrankAB 6 k1,so ci=0ifi>k1,and Xk1 Xk Xk Xk1 ci = ci = aibi = aibi. i=1 i=1 i=1 i=1 The preceding argument ensures that there are unitary U and V such that " # " # ∗ DA 0 ∗ DB 0 U AV = and U BV = , 00 0 B2 ∗ where DA,DB ∈Mk .LetB2 =V3DW be a singular value decomposition. Then 1 "3 # ∗ ∗ DA 0 U1 I ⊕ V U AV (I ⊕ W3) = 3 00 and " # ∗ ∗ DB 0 I ⊕ V U BV (I ⊕ W3) = 3 0 D is a representation of the desired form for all k > k1. The converse is clear. Let us prove now an inequality with subtracted term satisfied by the singular values of a product of matrices and the singular values of the factors.
Load more

Recommended publications
  • Some Inequalities About Trace of Matrix
    Available online www.jsaer.com Journal of Scientific and Engineering Research, 2019, 6(7):89-93 ISSN: 2394-2630 Research Article CODEN(USA): JSERBR Some Inequalities about Trace of Matrix TU Yuanyuan*1, SU Runqing2 1Department of Mathematics, Taizhou College, Nanjing Normal University, Taizhou 225300, China Email:[email protected] 2College of Mathematics and Statistics, Nanjing University of Information Science and Technology, Nanjing, 210044, China Abstract In this paper, we studied the inequality of trace by using the properties of the block matrix, singular value and eigenvalue of the matrix. As a result, some new inequalities about trace of matrix under certain conditions are given, at the same time, we extend the corresponding results. Keywords eigenvalue, singular value, trace, inequality 1. Introduction For a complex number x a ib , where a,b are all real, we write Re x a, Im x b , as usual , let I n mn be an n n unit matrix, M be the set of m n complex matrices, diag d1,,L dn be the diagonal matrix with diagonal elements dd1,,L n , if A be a matrix, denote the eigenvalues of by i A, H the singular values of A by i A, the trace of by trA , the associate matrix of A by A , A be a semi- positive definite matrix if be a Herimite matrix and i A 0. In 1937 , Von Neumann gave the famous inequality [1] n (1.1) |tr ( AB ) | ii ( A ) ( B ), i1 where AB, are nn complex matrices. Scholars were very active in the study of this inequality, and obtained many achievements.
    [Show full text]
  • Arxiv:1904.05239V2 [Math.FA]
    ON MATRIX REARRANGEMENT INEQUALITIES RIMA ALAIFARI, XIUYUAN CHENG, LILLIAN B. PIERCE AND STEFAN STEINERBERGER Abstract. Given two symmetric and positive semidefinite square matrices A, B, is it true that any matrix given as the product of m copies of A and n copies of B in a particular sequence must be dominated in the spectral norm by the ordered matrix product AmBn? For example, is kAABAABABBk ≤ kAAAAABBBBk? Drury [10] has characterized precisely which disordered words have the property that an inequality of this type holds for all matrices A, B. However, the 1-parameter family of counterexamples Drury constructs for these characterizations is comprised of 3 × 3 matrices, and thus as stated the characterization applies only for N × N matrices with N ≥ 3. In contrast, we prove that for 2 × 2 matrices, the general rearrangement inequality holds for all disordered words. We also show that for larger N × N matrices, the general rearrangement inequality holds for all disordered words, for most A, B (in a sense of full measure) that are sufficiently small perturbations of the identity. 1. Introduction 1.1. Introduction. Rearrangement inequalities for functions have a long history; we refer to Lieb and Loss [20] for an introduction and an example of their ubiquity in Analysis, Mathematical Physics, and Partial Differential Equations. A natural question that one could ask is whether there is an operator-theoretic variant of such rearrangement inequalities. For example, given two operators A : X → X and B : X → X, is there an inequality kABABAk≤kAAABBk where k·k is a norm on operators? In this paper, we will study the question for A, B being symmetric and positive semidefinite square matrices and k·k denoting the classical operator norm kMk = sup kMxk2.
    [Show full text]
  • Spectral Inequalities for Schr¨Odinger Operators with Surface Potentials
    SPECTRAL INEQUALITIES FOR SCHRODINGER¨ OPERATORS WITH SURFACE POTENTIALS RUPERT L. FRANK AND ARI LAPTEV Dedicated to M. Sh. Birman on the occasion of his 80th birthday Abstract. We prove sharp Lieb-Thirring inequalities for Schr¨odingeroperators with po- tentials supported on a hyperplane and we show how these estimates are related to Lieb- Thirring inequalities for relativistic Schr¨odingeroperators. 1. Introduction The Cwikel-Lieb-Rozenblum and the Lieb-Thirring inequalities estimate the number and N moments of eigenvalues of Schr¨odingeroperators −∆ − V in L2(R ) in terms of an integral of the potential V . They state that the bound Z γ γ+N=2 tr(−∆ − V )− ≤ Lγ;N V (x)+ dx (1.1) N R holds with a constant Lγ;N independent of V iff γ ≥ 1=2 for N = 1, γ > 0 for N = 2 and γ ≥ 0 for N ≥ 3. Here and below t± := maxf0; ±tg denotes the positive and negative part of a real number, a real-valued function or a self-adjoint operator t. In particular, the problem of finding the optimal value of the constant Lγ;N has attracted a lot of attention recently. We refer to the review articles [H2, LW2] for background information, references and applications of (1.1). The purpose of the present paper is twofold. First, we would like to find an analog of in- equality (1.1) for Schr¨odingeroperators with singular potentials V (x) = v(x1; : : : ; xd)δ(xN ), d := N − 1, supported on a hyperplane. It turns out that such an inequality is indeed valid, provided the integral on the right hand side of (1.1) is replaced by Z 2γ+d v(x1; : : : ; xd)+ dx1 : : : dxd : d R We determine the complete range of γ's for which the resulting inequality holds.
    [Show full text]
  • Some Trace Inequalities for Operators in Hilbert Spaces
    Kragujevac Journal of Mathematics Volume 41(1) (2017), Pages 33–55. SOME TRACE INEQUALITIES FOR OPERATORS IN HILBERT SPACES SILVESTRU SEVER DRAGOMIR1;2 Abstract. Some new trace inequalities for operators in Hilbert spaces are provided. The superadditivity and monotonicity of some associated functionals are investigated and applications for power series of such operators are given. Some trace inequalities for matrices are also derived. Examples for the operator exponential and other similar functions are presented as well. 1. Introduction Let (H; h·; ·i) be a complex Hilbert space and feigi2I an orthonormal basis of H. We say that A 2 B (H) is a Hilbert-Schmidt operator if X 2 (1.1) kAeik < 1: i2I It is well know that, if feigi2I and ffjgj2J are orthonormal bases for H and A 2 B (H) then X 2 X 2 X ∗ 2 (1.2) kAeik = kAfjk = kA fjk i2I j2I j2I showing that the definition (1.1) is independent of the orthonormal basis and A is a Hilbert-Schmidt operator iff A∗ is a Hilbert-Schmidt operator. Key words and phrases. Trace class operators, Hilbert-Schmidt operators, trace, Schwarz inequal- ity, trace inequalities for matrices, power series of operators. 2010 Mathematics Subject Classification. Primary: 47A63. Secondary: 47A99. Received: May 18, 2016. Accepted: July 4, 2016. 33 34 S. S. DRAGOMIR Let B2 (H) the set of Hilbert-Schmidt operators in B (H). For A 2 B2 (H) we define 1 ! 2 X 2 kAk2 := kAeik ; i2I for feigi2I an orthonormal basis of H. This definition does not depend on the choice of the orthonormal basis.
    [Show full text]
  • A Note on Von Neumann's Trace Inequality the Following
    – 1 – A Note on von Neumann's Trace Inequality By ROLF DIETER GRIGORIEFF* The following trace inequality first proved by von Neumann [6] has found repeated interest in the literature: Theorem. Let A,B be complex n×n matrices. Then (*) | tr(AB) | ! ("(A), "(B)) where "(A) = ("1,"2,...,"n) denotes the ordered vector of singular values "1 # "2 # ... # "n of A and ( $ , $ ) the euclidean scalar product. The importance of this result stems from the fact that it is used as an essential tool in Schatten's theory of cross-spaces and more recently in Ball's treatment of the equations of nonlinear elasticity. The original proof was not particularly easy. While Schatten's representation essentially followed the original one (see e.g. [7, p. 58]) it was Mirsky [4,5] who presented two new ways in obtaining the result. The second one in [5] relies on a property of double stochastic matrices which is easy enough to access. Ball [1] and Ciarlet [2, p. 99] adapted this version in their representation. Nevertheless, Ciarlet remarks that 'unexpectedly, finding a decent proof of this seemingly simple result turns out to be anything but trivial'. The aim of the present note is to present still a further proof which seems to be elementary enough to correspond to the simplicity of the statement in von Neumann's Theorem. P r o o f . It is a basic fact that A,B have the canonical representation (see e.g. [3, p. 261]) n n A = & "k(A ) ( $ , %k)%k' , B = & "k(B) ( $ , 'k)'k' k=1 k=1 * Fachbereich Mathematik, Technische Universität Berlin, Strasse d.
    [Show full text]
  • VON NEUMANN TYPE of TRACE INEQUALITIES for SCHATTEN-CLASS OPERATORS 103 Recall Only Some Basic Results Which Will Be Used Frequently Throughout This Pa- Per
    J. OPERATOR THEORY © Copyright by THETA, 0000 00:0(0000), 101–110 VON NEUMANN TYPE OF TRACE INEQUALITIES FOR SCHATTEN-CLASS OPERATORS GUNTHER DIRR and FREDERIK VOM ENDE Communicated by Editor ABSTRACT. We generalize von Neumann’s well-known trace inequality, as well as related eigenvalue inequalities for hermitian matrices, to Schatten- class operators between complex Hilbert spaces of infinite dimension. To this end, we exploit some recent results on the C-numerical range of Schatten-class operators. For the readers’ convenience, we sketched the proof of these results in the Appendix. KEYWORDS: C-numerical range; Schatten-class operators; trace inequality; von Neu- mann inequality MSC (2010): 47B10, 15A42, 47A12 1. INTRODUCTION In the mid thirties of the last century, von Neumann [20, Thm. 1] derived the following beautiful and widely used trace inequality for complex n × n matrices: Cn×n Let A, B ∈ with singular values s1(A) ≥ s2(A) ≥ ... ≥ sn(A) and s1(B) ≥ s2(B) ≥ ... ≥ sn(B), respectively, be given. Then n (1.1) max | tr(AUBV)| = ∑j=1 sj(A)sj(B) , U,V∈ Un arXiv:1906.00758v1 [math.FA] 3 Jun 2019 where Un denotes the unitary group. In fact, the above result can be reinterpreted as a characterization of the im- age of the unitary double-coset {AUBV | U, V ∈ Cn×n unitary} under the trace- functional, i.e. (1.2) {tr(AUBV) | U, V ∈ Un} = Kr(0) n C with r := ∑j=1 sj(A)sj(B) and Kr(0) = {z ∈ , |z| ≤ r} being the closed disk of radius r centred around the origin.
    [Show full text]
  • Von Neumann's Trace Inequality for Tensors
    Von Neumann’s trace inequality for tensors Stephane Chretien, Tianwen Wei To cite this version: Stephane Chretien, Tianwen Wei. Von Neumann’s trace inequality for tensors. Linear Algebra and its Applications, Elsevier, 2015, 482, pp.149 - 157. 10.1016/j.laa.2015.05.015. hal-02515996 HAL Id: hal-02515996 https://hal.archives-ouvertes.fr/hal-02515996 Submitted on 25 Mar 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. VON NEUMANN’S INEQUALITY FOR TENSORS STÉPHANE CHRÉTIENAND TIANWEN WEI n ×n Abstract. For two matrices in R 1 2 , the von Neumann inequality says that their scalar product is less than or equal to the scalar product of their singular spectrum. In this short note, we extend this result to real tensors and provide a complete study of the equality case. 1. Introduction The goal of this paper is to generalize von Neumann’s inequality from n ×n matrices to tensors. Consider two matrices X and Y in R 1 2 . Denote their singular spectrum, i.e. the vector of their singular values, by σ(X) (resp. σ(Y )). The classical matrix von Neumann’s inequality [6] says that hX; Y i ≤ hσ(X); σ(Y )i; and equality is achieved if and only if X and Y have the same singular sub- spaces.
    [Show full text]
  • Some Trace Inequalities for Exponential and Logarithmic Functions
    2nd Reading May 13,2019 11:36 WSPC/1664-3607 319-BMS 1950008 Bulletin of Mathematical Sciences Vol. 1, No. 2 (2019) 1950008 (39 pages) c The Author(s) ⃝ DOI: 10.1142/S1664360719500085 Some trace inequalities for exponential and logarithmic functions , , Eric A. Carlen∗ ‡ and Elliott H. Lieb† § ∗Department of Mathematics, Hill Center, Rutgers University 110 Frelinghuysen Road Piscataway, NJ 08854-8019, USA †Departments of Mathematics and Physics Jadwin Hall, Princeton University Washington Road, Princeton, NJ 08544, USA ‡[email protected] §[email protected] Received 8 October 2017 Accepted 24 April 2018 Published 14 May 2019 Communicated by Ari Laptev 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 )=XpY q . Our first main result gives conditions on F such that Tr[X log(F (Z, Y ))] Tr[X(p log X + q log Y )] for all ≤ X, Y, Z such that TrZ =TrX.(NotethatZ is absent from the right side of the inequal- ity.) 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 Bull. Math. Sci. Downloaded from www.worldscientific.com just X, Y alone. The investigation of these logarithmic inequalities is closely connected with three quantum relative entropy functionals: The standard Umegaki quantum rel- ative entropy D(X Y )=Tr[X(log X log Y ]), and two others, the Donald relative ∥ − entropy D (X Y ), and the Belavkin–Stasewski relative entropy D (X Y ).
    [Show full text]
  • On Some Trace Inequalities for Positive Definite Hermitian Matrices
    Zhou Journal of Inequalities and Applications 2014, 2014:64 http://www.journalofinequalitiesandapplications.com/content/2014/1/64 RESEARCH Open Access On some trace inequalities for positive definite Hermitian matrices Houqing Zhou* *Correspondence: [email protected] Abstract Department of Mathematics, Shaoyang University, Shaoyang City, Let A be a positive definite Hermitian matrix, we investigate the trace inequalities Hunan 422000, China of A. By using the equivalence of the deformed matrix, according to some properties of positive definite Hermitian matrices and some elementary inequalities, we extend some previous works on the trace inequalities for positive definite Hermitian matrices, and we obtain some valuable theory. MSC: Primary 15A45; 15A57 Keywords: Hermitian matrix; positive definite; trace inequality 1 Introduction In mathematics, a Hermitian matrix (or self-adjoint matrix) is a square matrix with com- plex entries that is equal to its own conjugate transpose. That is, the elements in the ith row and jth column are equal to the complex conjugates of the elements in the jth row T and ith column. In other words, the matrix A is Hermitian if and only if A = A ,where T A denotes the conjugate transpose of matrix A. Hermitian matrices play an important role in statistical mechanics [], engineering; in casessuchascommunication,todescriben-dimensional signal cross-correlation proper- ties, like conjugate symmetry, we can use Hermitian matrices. The earliest study of matrix inequality work in the literature was []. In , Bellman [] proved some trace inequalities for positive definite Hermitian matrices: () tr(AB) ≤ tr(AB); () tr(AB) ≤ tr A + tr B; () tr(AB) ≤ (tr A) (tr B) . Since then, the problems of the trace inequality for positive definite (semidefinite) Her- mitian matrices have caught the attention of scholars, getting a lot of interesting results.
    [Show full text]
  • Multivariate Trace Inequalities
    Commun. Math. Phys. 352, 37–58 (2017) Communications in Digital Object Identifier (DOI) 10.1007/s00220-016-2778-5 Mathematical Physics Multivariate Trace Inequalities David Sutter1 , Mario Berta2, Marco Tomamichel3 1 Institute for Theoretical Physics, ETH Zurich, Zurich, Switzerland. E-mail: [email protected] 2 Institute for Quantum Information and Matter, Caltech, California, USA 3 School of Physics, The University of Sydney, Sydney, Australia Received: 30 April 2016 / Accepted: 11 August 2016 Published online: 18 October 2016 – © The Author(s) 2016. This article is published with open access at Springerlink.com Abstract: We prove several trace inequalities that extend the Golden–Thompson and the Araki–Lieb–Thirring inequality to arbitrarily many matrices. In particular, we strengthen Lieb’s triple matrix inequality. As an example application of our four matrix extension of the Golden–Thompson inequality, we prove remainder terms for the monotonicity of the quantum relative entropy and strong sub-additivity of the von Neumann entropy in terms of recoverability. We find the first explicit remainder terms that are tight in the commutative case. Our proofs rely on complex interpolation theory as well as asymptotic spectral pinching, providing a transparent approach to treat generic multivariate trace inequalities. 1. Introduction Trace inequalities are mathematical relations between different multivariate trace func- tionals. Often these relations are straightforward equalities if the involved matrices commute—and can be difficult to prove for the non-commuting case. Arguably one of the most powerful trace inequalities is the celebrated Golden– Thompson (GT) inequality [23,64]. It states that for any two Hermitian matrices H1 and H2 we have tr exp(H1 + H2) ≤ tr exp(H1) exp(H2).
    [Show full text]
  • On Some Matrix Trace Inequalities
    Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 201486, 8 pages doi:10.1155/2010/201486 Research Article On Some Matrix Trace Inequalities Zubeyde¨ Ulukok¨ and Ramazan Turkmen¨ Department of Mathematics, Science Faculty, Selc¸uk University, 42003 Konya, Turkey Correspondence should be addressed to Zubeyde¨ Ulukok,¨ [email protected] Received 23 December 2009; Revised 4 March 2010; Accepted 14 March 2010 Academic Editor: Martin Bohner Copyright q 2010 Z. Ulukok¨ and R. Turkmen.¨ This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We first present an inequality for the Frobenius norm of the Hadamard product of two any square matrices and positive semidefinite matrices. Then, we obtain a trace inequality for products of two positive semidefinite block matrices by using 2 × 2 block matrices. 1. Introduction and Preliminaries Let Mm,n denote the space of m × n complex matrices and write Mn ≡ Mn,n. The identity ∗ T matrix in Mn is denoted In. As usual, A A denotes the conjugate transpose of matrix ∗ A. A matrix A ∈ Mn is Hermitian if A A. A Hermitian matrix A is said to be positive semidefinite or nonnegative definite, written as A ≥ 0, if ∗ n x Ax ≥ 0, ∀x ∈ C . 1.1 A is further called positive definite, symbolized A>0, if the strict inequality in 1.1 holds n for all nonzero x ∈ C . An equivalent condition for A ∈ Mn to be positive definite is that A is Hermitian and all eigenvalues of A are positive real numbers.
    [Show full text]
  • Geometry of Quantum States
    Geometry of Quantum States Ingemar Bengtsson and Karol Zyczk_ owski An Introduction to Quantum Entanglement 12 Density matrices and entropies A given object of study cannot always be assigned a unique value, its \entropy". It may have many different entropies, each one worthwhile. |Harold Grad In quantum mechanics, the von Neumann entropy S(ρ) = Trρ ln ρ (12.1) − plays a role analogous to that played by the Shannon entropy in classical prob- ability theory. They are both functionals of the state, they are both monotone under a relevant kind of mapping, and they can be singled out uniquely by natural requirements. In section 2.2 we recounted the well known anecdote ac- cording to which von Neumann helped to christen Shannon's entropy. Indeed von Neumann's entropy is older than Shannon's, and it reduces to the Shan- non entropy for diagonal density matrices. But in general the von Neumann entropy is a subtler object than its classical counterpart. So is the quantum relative entropy, that depends on two density matrices that perhaps cannot be diagonalized at the same time. Quantum theory is a non{commutative proba- bility theory. Nevertheless, as a rule of thumb we can pass between the classical discrete, classical continuous, and quantum cases by choosing between sums, integrals, and traces. While this rule of thumb has to be used cautiously, it will give us quantum counterparts of most of the concepts introduced in chapter 2, and conversely we can recover chapter 2 by restricting the matrices of this chapter to be diagonal. 12.1 Ordering operators The study of quantum entropy is to a large extent a study in inequalities, and this is where we begin.
    [Show full text]