Open Access

Some new refinements of Heinz inequalities of matrices

Journal of Inequalities and Applications20132013:424

https://doi.org/10.1186/1029-242X-2013-424

Received: 27 April 2013

Accepted: 21 August 2013

Published: 8 September 2013

Abstract

Firstly, a new refinement of the Heinz inequality is given. Then, by using the inequality, some new refinements of Heinz inequalities of matrices are given. Lastly, we declare that the results are better than the ones in (Kittaneh in Integral Equ. Oper. Theory 68:519-527, 2010), but we cannot say that our results are better than the ones in (Feng in J. Inequal. Appl. 2012:18, 2012, doi:10.1186/1029-242X-2012-18).

Keywords

new refinements Heinz inequality convex function unitarily invariant norm

1 Introduction

For every unitarily invariant norm, we have the Heinz inequalities (see [1])
2 A 1 2 X B 1 2 A v X B 1 v + A 1 v X B v A X + X B ,
(1.1)

where A, B, X are operators on a complex separable Hilbert space such that A and B are positive and denotes a unitarily invariant norm.

The function f ( v ) = A v X B 1 v + A 1 v X B v is convex on the interval [ 0 , 1 ] , attains its minimum at v = 1 2 , and attains its maximum at v = 0 and v = 1 . Moreover, f ( v ) = f ( 1 v ) for 0 v 1 .

In [4], (1.1) is refined by Kittaneh by using the following equalities (see p.122 of [2]):
f ( a + b 2 ) 1 b a a b f ( t ) d t f ( a ) + f ( b ) 2 ,
(1.2)

where f is a real-valued function which is convex on the interval [ a , b ] .

In [3], Feng used the following inequalities to get refinements of (1.1):
f ( a + b 2 ) 1 b a a b f ( t ) d t 1 4 ( f ( a ) + 2 f ( a + b 2 ) + f ( b ) ) f ( a ) + f ( b ) 2 ,
(1.3)

where f is a real-valued function which is convex on the interval [ a , b ] .

In this paper, we prove that 1 4 ( f ( a ) + 2 f ( a + b 2 ) + f ( b ) ) of (1.3) can be replaced by 1 32 ( 15 f ( a ) + 2 f ( a + b 2 ) + 15 f ( b ) ) , and based on the inequalities
f ( a + b 2 ) 1 b a a b f ( t ) d t 1 32 ( 15 f ( a ) + 2 f ( a + b 2 ) + 15 f ( b ) ) f ( a ) + f ( b ) 2 ,
(1.4)

we give some new refinements of Heinz inequalities of matrices.

Our results are better than the ones in [4], but we cannot say that our results are better than the ones in [3].

2 Main results

In [4], Kittaneh gave some refinements of the Heinz inequalities by using the previous lemma. In the following, we will use the following lemma to obtain several better refinements of the Heinz inequalities.

Lemma 1 Let f be a real-valued function which is convex on the interval [ a , b ] . Then
f ( a + b 2 ) 1 b a a b f ( t ) d t 1 32 ( 15 f ( a ) + 2 f ( a + b 2 ) + 15 f ( b ) ) f ( a ) + f ( b ) 2 .
Proof Since f ( a + b 2 ) f ( a ) + f ( b ) 2 , we know that 15 f ( a ) + 2 f ( a + b 2 ) + 15 f ( b ) 16 f ( a ) + 16 f ( b ) . Thus
1 32 ( 15 f ( a ) + 2 f ( a + b 2 ) + 15 f ( b ) ) f ( a ) + f ( b ) 2 .
Next, we will prove the following inequality:
1 b a a b f ( t ) d t 1 32 ( 15 f ( a ) + 2 f ( a + b 2 ) + 15 f ( b ) ) .
We have
1 b a a b f ( t ) d t = 1 b a ( a a + b 2 f ( t ) d t + a + b 2 b f ( t ) d t ) 1 b a ( f ( a ) + f ( a + b 2 ) 2 b a 2 + f ( a + b 2 ) + f ( b ) 2 b a 2 ) = 1 4 ( f ( a ) + 2 f ( a + b 2 ) + f ( b ) ) = 1 32 ( 8 f ( a ) + 16 f ( a + b 2 ) + 8 f ( b ) ) 1 32 ( 8 f ( a ) + 2 f ( a + b 2 ) + 7 ( f ( a ) + f ( b ) ) + 8 f ( b ) ) = 1 32 ( 15 f ( a ) + 2 f ( a + b 2 ) + 15 f ( b ) ) .

 □

Applying the previous lemma to the function f ( v ) = A v X B 1 v + A 1 v X B v on the interval [ μ , 1 μ ] when 0 μ 1 2 , and on the interval [ 1 μ , μ ] when 1 2 μ 1 , we obtain refinement of the first inequality in (1.1).

Theorem 1 Let A, B, X be operators such that A, B are positive. Then, for 0 μ 1 and for every unitarily invariant norm, we have
2 A 1 2 X B 1 2 1 | 1 2 μ | | μ 1 μ A v X B 1 v + A 1 v X B v d v | 1 16 ( 15 A μ X B 1 μ + A 1 μ X B μ + 2 A 1 2 X B 1 2 ) A μ X B 1 μ + A 1 μ X B μ .
(2.1)
Proof First assume that 0 μ 1 2 . Then it follows by the previous lemma that
f ( 1 μ + μ 2 ) 1 1 2 μ μ 1 μ f ( t ) d t 1 32 ( 15 f ( μ ) + 2 f ( 1 μ + μ 2 ) + 15 f ( 1 μ ) ) f ( μ ) + f ( 1 μ ) 2 ,
and so
f ( 1 2 ) 1 1 2 μ μ 1 μ f ( t ) d t 1 16 ( 15 f ( μ ) + f ( 1 2 ) ) f ( μ ) .
Thus,
2 A 1 2 X B 1 2 1 1 2 μ μ 1 μ A v X B 1 v + A 1 v X B v d v 1 16 ( 15 A μ X B 1 μ + A 1 μ X B μ + 2 A 1 2 X B 1 2 ) A μ X B 1 μ + A 1 μ X B μ .
(2.2)
Now, assume that 1 2 μ 1 . Then, by applying (2.2) to 1 μ , it follows that
2 A 1 2 X B 1 2 1 2 μ 1 1 μ μ A v X B 1 v + A 1 v X B v d v 1 16 ( 15 A μ X B 1 μ + A 1 μ X B μ + 2 A 1 2 X B 1 2 ) A μ X B 1 μ + A 1 μ X B μ .
(2.3)
Since
lim μ 1 2 1 | 1 2 μ | | μ 1 μ A v X B 1 v + A 1 v X B v d v | = lim μ 1 2 1 16 ( 15 A μ X B 1 μ + A 1 μ X B μ + 2 A 1 2 X B 1 2 ) = 2 A 1 2 X B 1 2 ,

the inequalities in (2.1) follow by combining (2.2) and (2.3). □

Applying the previous lemma to the function f ( v ) = A v X B 1 v + A 1 v X B v on the interval [ μ , 1 2 ] when 0 μ 1 2 , and on the interval [ 1 2 , μ ] when 1 2 μ 1 , we obtain the following.

Theorem 2 Let A, B, X be operators such that A, B are positive. Then, for 0 μ 1 and for every unitarily invariant norm, we have
A 2 μ + 1 4 X B 3 2 μ 4 + A 3 2 μ 4 X B 2 μ + 1 4 2 | 1 2 μ | | μ 1 2 A v X B 1 v + A 1 v X B v d v | 1 32 ( 15 A μ X B 1 μ + A 1 μ X B μ + 2 A 2 μ + 1 4 X B 3 2 μ 4 + A 3 2 μ 4 X B 2 μ + 1 4 + 30 A 1 2 X B 1 2 ) 1 2 ( A μ X B 1 μ + A 1 μ X B μ + 2 A 1 2 X B 1 2 ) .
(2.4)

Inequality (2.4) and the first inequality in (1.1) yield the following refinement of the first inequality in (1.1).

Corollary 1 Let A, B, X be operators such that A, B are positive. Then, for 0 μ 1 and for every unitarily invariant norm, we have
2 A 1 2 X B 1 2 A 2 μ + 1 4 X B 3 2 μ 4 + A 3 2 μ 4 X B 2 μ + 1 4 2 | 1 2 μ | | μ 1 2 A v X B 1 v + A 1 v X B v d v | 1 32 ( 15 A μ X B 1 μ + A 1 μ X B μ + 2 A 2 μ + 1 4 X B 3 2 μ 4 + A 3 2 μ 4 X B 2 μ + 1 4 + 30 A 1 2 X B 1 2 ) 1 2 ( A μ X B 1 μ + A 1 μ X B μ + 2 A 1 2 X B 1 2 ) A μ X B 1 μ + A 1 μ X B μ .
(2.5)

Applying the previous lemma to the function f ( v ) = A v X B 1 v + A 1 v X B v on the interval [ 0 , μ ] when 0 μ 1 2 , and on the interval [ μ , 1 ] when 1 2 μ 1 , we obtain the following theorem.

Theorem 3 Let A, B, X be operators such that A, B are positive. Then,
  1. (1)
    for 0 μ 1 2 and for every unitarily norm,
    A μ 2 X B 1 μ 2 + A 1 μ 2 X B μ 2 1 μ 0 μ A v X B 1 v + A 1 v X B v d v 1 32 ( 15 A X + X B + 2 A μ 2 X B 1 μ 2 + A 1 μ 2 X B μ 2 + 15 A μ X B 1 μ + A 1 μ X B μ ) 1 2 ( A X + X B + A μ X B 1 μ + A 1 μ X B μ ) ;
    (2.6)
     
  2. (2)
    for 1 2 μ 1 and for every unitarily norm,
    A 1 + μ 2 X B 1 μ 2 + A 1 μ 2 X B 1 + μ 2 1 1 μ μ 1 A v X B 1 v + A 1 v X B v d v 1 32 ( 15 A X + X B + 2 A 1 + μ 2 X B 1 μ 2 + A 1 μ 2 X B 1 + μ 2 + 15 A μ X B 1 μ + A 1 μ X B μ ) 1 2 ( A X + X B + A μ X B 1 μ + A 1 μ X B μ ) .
    (2.7)
     

Since the function f ( v ) = A v X B 1 v + A 1 v X B v is decreasing on the interval [ 0 , 1 2 ] and increasing on the interval [ 1 2 , 1 ] , and using the inequalities (2.6) and (2.7), we obtain the refinement of the second inequality in (1.1).

Corollary 2 Let A, B, X be operators such that A, B are positive. Then, for 0 μ 1 and for every unitarily invariant norm, we have
  1. (1)
    for 0 μ 1 2 and for every unitarily norm,
    A μ X B 1 μ + A 1 μ X B μ A μ 2 X B 1 μ 2 + A 1 μ 2 X B μ 2 1 μ 0 μ A v X B 1 v + A 1 v X B v d v 1 32 ( 15 A X + X B + 2 A μ 2 X B 1 μ 2 + A 1 μ 2 X B μ 2 + 15 A μ X B 1 μ + A 1 μ X B μ ) 1 2 ( A X + X B + A μ X B 1 μ + A 1 μ X B μ ) A X + X B ;
    (2.8)
     
  2. (2)
    for 1 2 μ 1 and for every unitarily norm,
    A μ X B 1 μ + A 1 μ X B μ A 1 + μ 2 X B 1 μ 2 + A 1 μ 2 X B 1 + μ 2 1 1 μ μ 1 A v X B 1 v + A 1 v X B v d v 1 32 ( 15 A X + X B + 2 A 1 + μ 2 X B 1 μ 2 + A 1 μ 2 X B 1 + μ 2 + 15 A μ X B 1 μ + A 1 μ X B μ ) 1 2 ( A X + X B + A μ X B 1 μ + A 1 μ X B μ ) A X + X B .
    (2.9)
     
It should be noticed that in inequalities (2.6) to (2.9),
lim μ 0 1 μ 0 μ A v X B 1 v + A 1 v X B v d v , lim μ 1 1 1 μ μ 1 A v X B 1 v + A 1 v X B v d v = A X + X B .

Declarations

Authors’ Affiliations

(1)
School of Mathematics and Statistics, Chongqing Three Gorges University

References

  1. Bhatia R, Davis C: More matrix forms of the arithmetic-geometric mean inequality. SIAM J. Matrix Anal. Appl. 1993, 14: 132–136. 10.1137/0614012MathSciNetView ArticleGoogle Scholar
  2. Bullen PS Pitman Monographs and Surveys in Pure and Applied Mathematics 97. In A Dictionary of Inequalities. Addison-Wesley, Reading; 1998.Google Scholar
  3. Feng Y: Refinements of the Heinz inequalities. J. Inequal. Appl. 2012., 2012: Article ID 18 10.1186/1029-242X-2012-18Google Scholar
  4. Kittaneh F: On the convexity of the Heinz means. Integral Equ. Oper. Theory 2010, 68: 519–527. 10.1007/s00020-010-1807-6MathSciNetView ArticleGoogle Scholar

Copyright

© Wang; licensee Springer. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.