CONCENTRATION OF EIGENVALUE SUMS AND GENERALIZED LIEB’S CONCAVITY THEOREM
5.4 Proof of Concavity Theorems
5.4.1 A First Proof by Matrix Derivative
As Theorem 5.3.4 is sufficient to lead to our concentration results, we provide in this subsection an independent proof of it. As mentioned before, this generalized Lieb’s theorem is a joint result of the original Lieb’s theorem and the Alexandrov–Fenchel inequality. But we will not use the Lieb’s theorem directly. Instead, we will be using the following lemma, also due to Lieb [67], which is an equivalence of the Lieb’s theorem. We provide the proof here only to show its connection to the Lieb’s theorem.
Lemma 5.4.1. Given any A∈H++n ,C ∈Hn, define T = Z ∞
0 (A+τI)−1C(A+τI)−1dτ, R= 2Z ∞
0 (A+τI)−1C(A+τI)−1C(A+τI)−1dτ, then for anyB ∈H+n, we have
Z 1
0 dsTr
T BsT B1−s −Tr
RB ≤ 0. (5.21)
Proof. By Lieb’s theorem (Theorem 6 [67]), for any H ∈ Hn, the functiong(t) = Trexp(H+log(A+tC)) is concave. Also this function is smooth intfortsmall enough such that A+tC ∈ H++n . Thus we have ∂t∂22g(t)|t=0 = g00(0) ≤ 0. Write B(t)= exp(H+log(A+tC)), and
T(t) = Z ∞
0 (A+tC+τI)−1C(A+tC+τI)−1dτ, R(t) =2
Z ∞
0 (A+tC+τI)−1C(A+tC+τI)−1C(A+tC+τI)−1dτ.
It is easy to check that ∂t∂ log(A+tC) =T(t),T0(t) =−R(t)by formulas (5.58) and (5.59). Then using the derivative formulas (5.57), (5.58) and (5.59), we have
g0(t) =Z 1
0 dsTr
(B(t))sT(t)(B(t))1−s = Tr
T(t)B(t), and
g00(t)= Tr
T0(t)B(t)+Z 1
0 dsTr
T(t)(B(t))sT(t)(B(t))1−s.
For anyB ∈H++n , we may chooseH =logB−logA, so thatB(0) =exp(H+logA) = B. And notice thatT(0)=T,R(0) = R, we thus have
−Tr
RB +Z 1
0 dsTr
T BsT B1−s = g00(0) ≤ 0.
The extension toB ∈H+n can be done by continuity.
We use this variant of the Lieb’s theorem since it is more convenient for us to choose arbitraryB ∈H++n in inequality (5.21). In particular, if we chooseBto be diagonal with diagonal entriesb1,b2,· · ·,bn, then Lemma 5.4.1 implies that
n
X
i=1
Riibi ≥ Z 1
0 ds
n
X
i=1 n
X
j=1
Ti jbsjTjib1i−s, (5.22) which is a critical estimate that we will be using.
We now prove a trace inequalities using Lemma 5.4.1 and the Alexandrov–Fenchel inequality Theorem 5.6.1. This inequality can be seen as a generalization of Lemma 5.4.1 from k =1 to all 1 ≤ k ≤ n.
Lemma 5.4.2. For arbitrary A∈H++n ,B ∈H+n,C ∈Hn, let T =
Z ∞
0 (A+τI)−1C(A+τI)−1dτ, R= 2
Z ∞
0 (A+τI)−1C(A+τI)−1C(A+τI)−1dτ, then we have, for all1≤ k ≤ n,
Z 1
0 TrM1(k)(T Bs;Bs)M1(k)(T B1−s;B1−s)
ds−TrM1(k)(RB;B)
≤ TrM2(k)(T B,T B,B).
(5.23)
Proof. We first claim that we only need to consider the case when B = Λ is a diagonal matrix with all diagonal entries λ1, λ2,· · ·, λn ≥ 0. Indeed, if B is not diagonal, we consider its eigenvalue decomposition B = UΛUT, whereU ∈ Cn×n is unitary, and Λ is a diagonal matrix whose diagonal entries λ1, λ2,· · ·, λn are the eigenvalues of B. Since B ∈ H+n, λ1, λ2,· · ·, λn ≥ 0. If we introduce AH = UTAU,CH=UTCU,HT =UTTU,RH=UTRU, we have
TH= Z ∞
0 (HA+τI)−1C(H AH+τI)−1dτ, RH= 2Z ∞
0 (HA+τI)−1C(H AH+τI)−1CH(AH+τI)−1dτ.
Then using the cyclic invariance of trace and the product properties (5.47), we have, for example,
TrM1(k)(T Bs;Bs)M1(k)(T B1−s;B1−s)
=TrM1(k)(UUTTUΛsUT;UΛsUT)M1(k)(UUTTUΛ1−sUT;UΛ1−sUT)
=TrM0(k)(U)M1(k)(HTΛs;Λs)M0(k)(UT)M0(k)(U)M1(k)(HTΛ1−s;Λ1−s)M0(k)(UT)
=TrM1(k)(THΛs;Λs)M0(k)(UT)M0(k)(U)M1(k)(THΛ1−s;Λ1−s)M0(k)(UT)M0(k)(U)
=TrM1(k)(THΛs;Λs)M1(k)(THΛ1−s;Λ1−s).
Using the same trick to the other terms in the inequalities (5.23), one can show that (5.23) is equivalent to
Z 1
0 TrM1(k)(HTΛs;Λs)M1(k)(HTΛ1−s;Λ1−s)
ds−TrM1(k)(RΛH ;Λ)
≤ TrM2(k)(HTΛ,THΛ,Λ).
which justifies our claim. In what follows, we will still use A,C,T,Rfor A,HC,HT,H RH. We now prove (5.23) with B = Λ being diagonal whose diagonal entries are λ1, λ2,· · ·, λn ≥ 0. Using product properties (5.47) and identities in Lemma 5.6.4, we rewrite the quantity
I , Z 1
0 dsTrM1(k)(TΛs;Λs)M1(k)(TΛ1−s;Λ1−s)−TrM1(k)(RΛ;Λ)
= Z 1
0 ds(
TrM1(k)(TΛsTΛ1−s;Λ) +TrM2(k)(TΛsΛ1−s,ΛsTΛ1−s;Λ))
−TrM1(k)(RΛ;Λ)
= Z 1
0 ds
n
X
i=1 n
X
j=1
Ti jλsjTjiλ1i−s di(n,k)
+ X
1≤i,j≤n
(TiiλiλsjTj jλ1j−s −TjiλiλisTi jλ1j−s)gi j(n,k)
−
n
X
i=1
Riiλidi(n,k).
Then replacingbi byλidi(n,k) in (5.22), we have by Lemma 5.4.1
n
X
i=1
Riiλidi(n,k) ≥ Z 1
0 ds
n
X
i=1 n
X
j=1
Ti j(λjd(n,k)j )sTji(λidi(n,k))1−s.
Therefore we have I ≤
Z 1
0 ds( X
1≤i,j≤n
Ti jTjiλsjλ1i−sdi(n,k) + X
1≤i,j≤n
(TiiTj jλiλj−TjiTi jλi1+sλ1j−s)gi j(n,k)
− X
1≤i,j≤n
Ti jTji(λjd(n,k)j )s(λidi(n,k))1−s) .
We now investigate the integrand for anys ∈[0,1]. We have X
1≤i,j≤n
Ti jTjiλsjλ1i−sdi(n,k) + X
1≤i,j≤n
(TiiTj jλiλj−TjiTi jλi1+sλ1j−s)gi j(n,k)
− X
1≤i,j≤n
Ti jTji(λjd(n,k)j )s(λidi(n,k))1−s
=
n
X
i=1
Tii2λidi(n,k)+ X
1≤i<j≤n
|Ti j|2(λsjλ1i−sdi(n,k) +λisλ1j−sd(n,k)j ) + X
1≤i,j≤n
TiiTj jλiλjgi j(n,k) − X
1≤i<j≤n
|Ti j|2(λ1+i sλ1j−s+λ1+j sλ1i−s)gi j(n,k)
−
n
X
i=1
Tii2λidi(n,k)
− X
1≤i<j≤n
|Ti j|2(λsjλ1i−s(d(n,k)j )s(di(n,k))1−s +λsiλ1j−s(di(n,k))s(d(n,k)j )1−s)
= X
1≤i,j≤n
TiiTj jλiλjgi j(n,k) + X
1≤i<j≤n
|Ti j|2(
λsjλ1i−sdi(n,k)+λsiλ1j−sd(n,k)j −(λ1+i sλ1j−s+ λ1+j sλi1−s)gi j(n,k)
−λsjλ1i−s(d(n,k)j )s(di(n,k))1−s−λisλ1j−s(di(n,k))s(d(n,k)j )1−s)
≤ X
1≤i,j≤n
TiiTj jλiλjgi j(n,k)−2 X
1≤i<j≤n
|Ti j|2λiλjgi j(n,k)
= X
1≤i,j≤n
(TiiTj jλiλj−Ti jTjiλiλj)gi j(n,k).
We have usedgi j(n,k) = g(n,k)ji andgii(n,k) = 0. The proof of the last inequality above is as follows. For anys ∈[0,1], we have a Hölder-type inequality for scalars:
(a+b)s(c+d)1−s ≥ asc1−s+bsd1−s, a,b,c,d ≥ 0. Then using the expansion relations (5.53),
di(n,k) = λjgi j(n,k) +gi j(n,k+1), d(n,k)j = λigi j(n,k) +gi j(n,k+1),
we have
λsjλ1i−sdi(n,k)+λisλ1j−sd(n,k)j − (λ1+i sλ1j−s+λ1+j sλi1−s)gi j(n,k)
−λsjλi1−s(d(n,k)j )s(di(n,k))1−s−λsiλ1j−s(di(n,k))s(d(n,k)j )1−s
≤ λsjλ1i−s(λjgi j(n,k) +gi j(n,k+1))+ λsiλ1j−s(λigi j(n,k) +gi j(n,k+1))
−(λ1+i sλ1j−s+λ1+j sλ1i−s)gi j(n,k)
−λsjλi1−s(λisλ1j−sgi j(n,k) +gi j(n,k+1))− λsiλ1j−s(λsjλ1i−sgi j(n,k) +gi j(n,k+1))
= −2λiλjgi j(n,k).
Finally using Lemma 5.6.4 again, we have I ≤
Z 1
0 ds
X
1≤i,j≤n
(TiiTj jλiλj −Ti jTjiλiλj)gi j(n,k)
=TrM2(k)(TΛ,TΛ,Λ).
This completes the proof of Lemma 5.4.2.
We are now ready to prove Theorem 5.3.1 with all established results.
Proof of Theorem 5.3.1. We first prove the concavity of the function fH,k(A) = Trkexp H+logA k1.
Notice that given any A ∈ H++n and any C ∈ Hn, there exist some such that A+tC ∈H++n fort ∈ (−, ), and fH,k(A+tC)is continuously differentiable with respect tot on (−, ). In what follows, any function oft is always assumed to be defined on a reasonable neighborhood of 0 (so that A+tC ∈H++n ).
Then the concavity of fH,k(A)onH++n is equivalently to the statement that∂t∂22 fH,k(A+ tC) ≤ 0|t=0 for all choices of A ∈ H++n ,C ∈ Hn. Now fix a pair A,C, define B(t) = exp H +log(A+tC) ∈ H++n andg(t) = Trkexp H +log(A+tC) = TrM0(k)(B(t)) >0. Since fH,k(A+tC) =g(t)1k, and
∂2
∂t2fH,k(A+tC)= 1
kg(t)1k−2 g00(t)g(t)− k−1
k (g0(t))2,
we then need to show thatg(0)g00(0) ≤ k−k1(g0(0))2. Using the derivative formulas (5.58) and (5.59), we have
∂
∂t log(A+tC) = Z ∞
0 (A+tC+ x In)−1C(A+tC+x In)−1 ,T(t),
∂
∂tT(t) =−2
0 (A+tC+x In)−1C(A+tC+ x In)−1C(A+tC+x In)−1 , −R(t).
Then using formula (5.57), we can compute the first derivative g0(t)= ∂
∂tTrM0(k)(B(t))
=TrM1(k)(B0(t);B(t))
=TrM1(k) Z 1
0 dsB(t)sT(t)B(t)1−s;B(t)
= Z 1
0 dsTrM1(k) B(t)sT(t)B(t)1−s;B(t)sB(t)1−s
= Z 1
0 dsTrM0(k)(B(t)s)M1(k)(T(t);In)M0(k)(B(t)1−s)
= Z 1
0 dsTrM1(k)(T(t);In)M0(k)(B(t)1−s)M0(k)(B(t)s)
=TrM1(k)(T(t);In)M0(k)(B(t)).
We have used the fact that M1(k)(X;Y) is linear in X, and so we can pull out the integral symbol. Then the second derivative is
g00(t) = ∂
∂tTrM1(k)(T(t);In)M0(k)(B(t))
=TrM1(k)(T(t);In)M1(k)(B0(t);B(t)) +TrM1(k)(T0(t);In)M0(k)(B(t))
= Z 1
0 dsTrM1(k)(T(t);In)M0(k)(B(t)s)M1(k)(T(t);In)M0(k)(B(t)1−s)
−TrM1(k)(R(t);In)M0(k)(B(t)).
WriteT =T(0), R= R(0)and B= B(0). We then apply Lemma 5.4.2 to reach g(0)g00(0)
=TrM0(k)(B)(Z 1
0 dsTrM1(k)(T;In)M0(k)(Bs)M1(k)(T;In)M0(k)(B1−s)
−TrM1(k)(R;In)M0(k)(B))
=TrM0(k)(B)(Z 1
0 dsTrM1(k)(T Bs;Bs)M1(k)(T B1−s;B1−s)
−TrM1(k)(RB;B))
≤ TrM0(k)(B)TrM2(k)(T B,T B,B)].
To continue, we use definitions (5.46), identity (5.50) and the Alexandrov–Fenchel inequality (Theorem 5.6.1) to obtain
TrM0(k)(B)TrM2(k)(T B,T B,B)]
= n!
k!(n−k)!D(B,· · · ,B
| {z }
k
,In,· · ·,In
| {z }
n−k
)
× n!
(k−2)!(n−k)!D(T B,T B,B· · · ,B
| {z }
k−2
,In,· · · ,In
| {z }
n−k
)
≤ k−1 k
n!
(k−1)!(n−k)!D(T B,B· · ·,B
| {z }
k−1
,In,· · ·,In
| {z }
n−k
)2
= k−1
k TrM1(k)(T B,B)2
= k−1
k (g0(0))2. We therefore have proved that
g(0)g00(0) ≤ k−1
k (g0(0))2. The concavity of fH,k(A)onH++n then follows.
Next we prove the equivalence of (i) the concavity of the functions fH,k(A)onH++n and (ii) the concavity of the functions ˜fH,k =log Trkexp H+logA onH++n . (i)
⇒(ii) is trivial. To prove (ii)⇒(i), we need the following lemma.
Let x = (x1,x2) ∈ (0,+∞)2. Define f(x) = Trkexp H + log(x1A1+ x2A2) . One can easily verify that fH,k(A) being concave on H++n is equivalent to f(x)1k being concave on(0,+∞)2for arbitrary but fixed choice of A1,A2 ∈H++n ,H ∈Hn. Similarly, ˜fH,k(A) being concave onH++n is equivalent to log f(x) being concave on (0,+∞)2 for arbitrary but fixed choice of A1,A2 ∈ H++n ,H ∈ Hn. Using the definition of the k-trace Trk, it is easy to check that f(x)is homogeneous of order k. By Lemma 5.6.9, we know f(x)1k is concave if and only if log f(x)is concave.
Therefore we have (i)⇔(ii).