1 Introduction

Throughout the paper, we assume C m × n is the set of m×n complex matrices, I is a identity matrix, E i i is a diagonal matrix with 1 at its (i,i)th position and 0 elsewhere, and Z n = [ E 11 , E 22 , , E n n ] C n 2 × n is a selection matrix. A stands for the conjugate transpose of A C m × n . The matrix A is Hermitian if A =A, denoted by AH(n). Furthermore, we denote by H 0 + (n) and H + (n) the sets of Hermitian semi-positive matrices and Hermitian positive matrices, respectively. Recall that A, B are said to have the inequality AB or BA, if AB H 0 + (n). In particular, A H 0 + (n) (resp. A H + (n)), denoted by A0 (resp. A>0), and denoted by A 1 2 the square root of A. For a positive integer k, we have α(k) n k ={1,2,, n k }, α (k)= n k α(k). Especially, α=α(1)n. For A C n × n , A(α,β) denotes the submatrix of A lying in rows indexed by α and the columns indexed by β and A(α,α)=A(α). The Hadamard and Kronecker products of A=( a i j ), B=( B i j ) are defined as AB=( a i j b i j ) and AB=( a i j B), respectively. If AXA=X, XAX=X, ( A X ) =AX, and ( X A ) =XA, then X is said to be a Moore-Penrose generalized inverse of A, denoted by X= A + .

Recall that if every diagonal element of R H 0 + (n) is 1, then R is said to be a correlation matrix, in symbol RC H 0 + (n) (see [1]). The invertible matrix A H 0 + (n) implies A H + (n), thus the set of invertible matrices C H + (n) H + (n).

By multivariate analysis, Styan obtained the inequalities as follows in 1973 (see [[1], Theorem 4.1, Corollary 4.2(4.21) and Corollary 4.3]):

RR2 ( R 1 R + I ) 1 0,RC H + (n);
(1.1)
R 1 R+I2 ( R R ) 1 0,RC H + (n);
(1.2)
AA2(AI) ( A 1 A + I ) 1 (AI)0,A H + (n);
(1.3)
A 1 A+I2(AI) ( A A ) 1 (AI)0,A H + (n).
(1.4)

Meanwhile, Styan pointed out ‘A matrix-theoretic proof of Theorem 4.1 would be of interest.’ (see [1]).

Many papers [210] focus on the generalization of inequalities (1.1)-(1.4) to Hermitian (semi-)positive matrices by matrix methods. As a generalization of the usual Hadamard product, the Khatri-Rao product [5, 6, 8] has many similar properties to the Hadamard product (see [5]), thus here we only focus on the Hadamard product, a basic product. Referring to [2] and [6], we denote

l = 1 k A l = A 1 A 2 A k , l = 1 k A l = A 1 A 2 A k , A l C n × n ,l=1,2,,k.

In 1979, Ando [2] obtained the following.

Proposition 1.1 (see [[2], Theorem 20])

Let A H + (n), for any positive integer k (≥2), one has

l = 1 k Ak ( A I ) k 1 [ A 1 ( l = 1 k 1 A ) + ( k 1 ) ( A I ) k 2 ] 1 ( A I ) k 1 .
(1.5)

When k=2, the inequality (1.5) implies (1.3). Ando also made clear, by applying the method of Proposition 1.1, that one has the following.

Proposition 1.2 (see [[2], p.239])

Let A,B H + (n). Then

AB(AI+BI) ( A B 1 + A 1 B + 2 I ) 1 (AI+BI).
(1.6)

In 2000, Zhang showed the following.

Proposition 1.3 (see [[3], Application 4])

Let A,B H + (n). Then

A B 1 + A 1 B+2I(AI+BI) ( A B ) 1 (AI+BI).
(1.7)

As applications, (1.2) and (1.4) were also given by Visick in 2000 (see [[4], Theorem 20]).

Moreover, Al Zhour and Kilicman obtained a matrix inequality as follows in 2006 (see [[6], Theorem 4.4]):

( A 1 l = 2 k A l 1 2 A l + 1 2 + A 1 1 2 A 1 + 1 2 l = 2 k A l ) ( l = 1 k A l ) + × ( A 1 l = 2 k A l 1 2 A l + 1 2 + A 1 1 2 A 1 + 1 2 l = 2 k A l ) 2 ( l = 1 k A l 1 2 A l + 1 2 ) + ( A 1 l = 2 k A l + ) + ( A 1 + l = 2 k A l ) , A l H 0 + ( n ) , l = 1 , 2 , , k ;
(1.8)
( A B 1 2 B + 1 2 + A 1 2 A + 1 2 B ) ( A B ) + ( A B 1 2 B + 1 2 + A 1 2 A + 1 2 B ) A B + + A + B + 2 A 1 2 A + 1 2 B 1 2 B + 1 2 , A , B H 0 + ( n ) .
(1.9)

For A H 0 + (n), by [11], one has A 1 2 A + 1 2 =A A + . Because of the commutativity of the Hadamard product, the inequality (1.9) is equivalent to [[7], Proposition 1], [[8], Corollary 1(5)], it could be viewed as a generalization of (1.4) over Hermitian semi-positive matrices.

For A,B H + (n), (1.6) and (1.7) are the forward and backward inequalities to each other, and determined mutually as well (Theorem 2.6), [8] has ever called them as companion inequalities. Of course, (1.1) and (1.2), (1.3) and (1.4) are also the companion inequalities determined by each other (Lemma 2.4). In fact, [[9], Theorem 1] shows us the backward inequality which is companied to (1.9).

Papers [110] all discuss on Hermitian (semi-)positive matrices. However, the following Example 1.4 illustrates that the condition ‘positive definiteness’ is not necessary for the inequality (1.7) to hold.

Example 1.4 Let A= 1 2 [ 1 1 1 1 ] ,B= 1 3 [ 1 1 1 2 ] H(2). Then the matrix inequality (1.7) holds, this is because

( A B 1 + A 1 B + 2 I ) ( ( A + B ) I ) ( A B ) 1 ( ( A + B ) I ) = [ 1 1 1 1 ] H 0 + (2).

Example 1.5 Let A= [ 1 1 1 1 ] ,B= [ 1 1 1 2 ] H(2). Then the inequality (1.7) does not hold anymore, this is because

( A B 1 + A 1 B + 2 I ) ( ( A + B ) I ) ( A B ) 1 ( ( A + B ) I ) = 1 6 [ 29 31 31 34 ] .

Example 1.5 indicates that, in general, the matrix inequality (1.7) does not hold for all invertible Hermitian matrices. Hence we will add some constraint conditions in our discussion.

In this paper, without the ‘positive definiteness’ demanded in the inequality (1.5), we will show inequalities and their companion forms for any number of invertible Hermitian matrices and get sufficient and necessary conditions for the equations in the related inequalities to hold. In view of [12, 13]etc., we see the discussion of the equation conditions for the inequalities is significant. Further, Hermitian positive matrices satisfy the added constraints naturally, thus these results generalize and improve the corresponding results in the present literature. However, with no demand of ‘positive definiteness’, the new forward and backward companion inequalities are not determined mutually.

2 Preliminaries

For matrices of appropriate sizes, in view of [[14], Proposition 4.2.14] and [[15], Propositions 7.13-7.17], by induction to k, it follows that

(AB)C=A(BC);
(2.1)
(A+B)C=AC+BC,C(A+B)=CA+CB;
(2.2)
( l = 1 k A l ) = l = 1 k A l , A l C m × n ,l=1,2,,k;
(2.3)
( l = 1 k A l ) ( l = 1 k B l ) = l = 1 k A l B l , l = 1 k ( A l B l )= ( l = 1 k A l ) ( l = 1 k B l ) ;
(2.4)
( l = 1 k A l ) 1 = l = 1 k A l 1 ,any of  A l C n × n  is invertible,l=1,2,,k;
(2.5)
A l H ( n ) ( H 0 + ( n ) , H + ( n ) ) , l = 1 , 2 , , k l = 1 k A l H ( n k ) ( H 0 + ( n k ) , H + ( n k ) ) .
(2.6)

Lemma 2.1 Let A l C n × n , l=1,2,,k. Then

l = 1 k A l = ( l = 1 k A l ) ( α ( k ) ) C n × n ,α(k)= ( α k ( 1 ) , α k ( 2 ) , , α k ( n ) ) n k ;
(2.7)
α k ( l ) = [ ( l 1 ) ( n k 1 ) / ( n 1 ) ] +1,1ln.
(2.8)

Proof In view of [[4], Theorem 1 and Corollary 2] or [[15], Proposition 7.3.1] yields

A 1 A 2 =P ( n , 2 ) ( A 1 A 2 )P(n,2),P(n,2)= Z n C n 2 × n , A 1 , A 2 C n × n ,

that is,

A 1 A 2 =( A 1 A 2 ) ( α ( 2 ) ) ,α(2)= ( 1 , n + 2 , 2 n + 3 , , n 2 ) n 2 ,
(2.9)

which indicates (2.7) and (2.8) hold for k=2.

By (2.9), (2.1), (2.3), and (2.4), similar to [[10], Lemma 2.1], it follows that

A 1 A 2 A 3 = A 1 ( A 2 A 3 ) = P ( n , 2 ) [ I A 1 I P ( n , 2 ) ( A 2 A 3 ) P ( n , 2 ) ] P ( n , 2 ) = P ( n , 2 ) ( I P ( n , 2 ) ) ( A 1 A 2 A 3 ) ( I P ( n , 2 ) ) P ( n , 2 ) ,

that is,

A 1 A 2 A 3 =P ( n , 3 ) ( A 1 A 2 A 3 )P(n,3) C n × n ,P(n,3)= ( I P ( n , 2 ) ) Z n .
(2.10)

As E i i E j j = E i i (i=j), E i i E j j =0 (ij), and E i i H(n), by (2.9) and (2.10), we see

P ( n , 3 ) = diag ( P ( n , 2 ) , P ( n , 2 ) , , P ( n , 2 ) ) Z n = ( E 11 , 0 , , 0 ; 0 , E 22 , 0 , , 0 ; ; 0 , , 0 , E n n ) C n 3 × n ,

which shows the α(3) determined by P(n,3) satisfies (2.8), then (2.7) holds.

Just as the proof of [[10], Lemma 2.1], similarly, one has

l = 1 k A l =P ( n , k ) ( l = 1 k A l ) P(n,k),P(n,k)= ( I P ( n , k 1 ) ) Z n C n k × n ,
(2.11)

thus the α(k) determined by P(n,k) satisfies (2.8), then (2.7) follows by (2.11). □

The proof method of Lemma 2.1 plays a great role in discussing the matrix inequalities for Khatri-Rao products of any finite number of positive matrices (see [[16], Lemma 2.1], [[6], Lemmas 2.1 and 2.2]). Recently, [[17], Theorem 3] has also discussed a similar problem to Lemma 2.1, but our results (2.7) and (2.8) should be more convenient in applications.

When A C n × n , if α=α(1)n and A(α) is invertible, we call

A/α=A ( α ) A ( α , α ) A ( α ) 1 A ( α , α ) , α =nα,A ( α ) 1 = ( A ( α ) ) 1

the Schur complement of A(α) in A (see [8, 18, 19]).

Lemma 2.2 Let AH(n) and A( α ) be both invertible. Then both of A/ α and A 1 (α) are invertible as well, and ( A / α ) 1 = A 1 (α).

Proof By assumption, there exists a permutation matrix U such that

U AU= [ A ( α ) A ( α , α ) A ( α , α ) A ( α ) ] , U A 1 U= [ A 1 ( α ) A 1 ( α , α ) A 1 ( α , α ) A 1 ( α ) ] H(n).
(2.12)

Since both of A and A( α ) are invertible, by (2.12), one has a matrix V= [ I 0 A ( α ) 1 A ( α , α ) I ] such that

( U V ) A(UV)=diag ( A / α , A ( α ) ) =A/ α A ( α ) H(n),

thus A/ α is invertible. By (2.12),

U A 1 U= ( U A U ) 1 =V ( ( A / α ) 1 A ( α ) 1 ) V = [ ( A / α ) 1 ] ,

by comparing with (2.12), it follows that A 1 (α) is invertible and ( A / α ) 1 = A 1 (α). □

When A H + (n), it is natural that A( α ) is invertible, hence we could obtain [[18], formula (4)] again by Lemma 2.2.

Lemma 2.3 Let C C n × n and AH(n) be invertible, αn, α =nα, if A 1 ( α )>0, then A(α) is invertible and

C ( α ) A ( α ) 1 C(α) ( C A 1 C ) (α),where C ( α ) = ( C ( α ) ) .
(2.13)

Moreover, the equation in (2.13) holds if and only if A 1 ( α ,α)C(α)+ A 1 ( α )C( α ,α)=0.

Proof In this case, there is a permutation matrix U such that (2.12) holds and U CU= [ C ( α ) C ( α , α ) C ( α , α ) C ( α ) ] , then

U ( C A 1 C ) U= [ ( C A 1 C ) ( α ) ( C A 1 C ) ( α , α ) ( C A 1 C ) ( α , α ) ( C A 1 C ) ( α ) ] H(n).
(2.14)

By assumption, both of A 1 H(n) and A 1 ( α ) are Hermitian and invertible, then by applying Lemma 2.2, A(α) is invertible and

A 1 / α = A 1 (α) A 1 ( α , α ) A 1 ( α ) 1 A 1 ( α , α ) 1 = ( A 1 ) 1 ( α ) 1 =A ( α ) 1 ;

combining with (2.12), there exists W= [ I 0 A 1 ( α ) 1 A 1 ( α , α ) I ] such that

W U A 1 UW=diag ( A 1 / α , A 1 ( α ) ) =A ( α ) 1 A 1 ( α ) ,
(2.15)
W 1 U CU= [ C ( α ) C ( α , α ) X Y ] ,X= A 1 ( α ) 1 A 1 ( α , α ) C(α)+C ( α , α ) .
(2.16)

By (2.14)-(2.16), as A 1 ( α )>0, then ( C A 1 C)(α)C ( α ) A ( α ) 1 C(α)= X A 1 ( α )X0, that is, (2.13) follows. Meanwhile, the equation in (2.13) holds; therefore X=0, it is equivalent to

A 1 ( α ) X= A 1 ( α , α ) C(α)+ A 1 ( α ) C ( α , α ) =0.

 □

For a Hermitian positive matrix A, one has A 1 ( α )>0; then we get [[3], Theorem 1(7)] again by Lemma 2.3.

Lemma 2.4 Let F,G H + (n). Then

FT G 1 T G T F 1 TandF=T G 1 T G= T F 1 T.

Proof In this case, M= [ F T T G ] H(2n), and there exist invertible matrices P= [ I 0 G 1 T I ] and Q= [ I F 1 T 0 I ] such that

P MP= ( F T G 1 T ) G, Q MQ=F ( G T F 1 T ) ,

which indicates

F T G 1 T P M P H 0 + ( 2 n ) F T G 1 T Q M Q H 0 + ( 2 n ) G T F 1 T , F = T G 1 T rank P M P = rank G = n F = T G 1 T rank Q M Q = rank F = n G = T F 1 T .

 □

Lemmas 2.2-2.4 will play an important role in the discussion.

Theorem 2.5 Let A H + (n), for any positive integer k (≥2). Then

A 1 ( l = 1 k 1 A ) +(k1) ( A I ) k 2 k ( A I ) k 1 ( l = 1 k A ) 1 ( A I ) k 1 .
(2.17)

Moreover, the equation in (1.5) holds if and only if the one in (2.17) holds.

Proof As A H + (n), by (2.6), l = 1 k A, A 1 ( l = 1 k 1 A)+(k1) ( A I ) k 2 H + (n). Taking T =T= k ( A I ) k 1 H(n), in view of Proposition 1.1, yields the inequality (1.5), that is, l = 1 k A T ( A 1 ( l = 1 k 1 A ) + ( k 1 ) ( A I ) k 2 ) 1 T, then by Lemma 2.4, A 1 ( l = 1 k 1 A)+(k1) ( A I ) k 2 T ( l = 1 k A ) 1 T, which shows (2.17) holds, meanwhile, the equation in (1.5) holds; therefore the one in (2.17) holds. □

Theorem 2.5 not only leads to the backward inequality (2.17) of (1.5) (in this case, the inequalities (1.5) and (2.17) are mutually determined), but it also shows us that the inequalities (1.1) and (1.2), (1.3) and (1.4) given by Styan are companied and determined by each other (the case of k=2 in Theorem 2.5).

By applying Lemma 2.4, Propositions 1.2 and 1.3, with a similar discussion as Theorem 2.5, we have the following.

Theorem 2.6 Let A H + (n). Then the inequalities (1.6) and (1.7) are companied and determined by each other, and the equation in (1.6) holds; therefore the one in (1.7) holds.

3 Main results

For Hermitian matrices A l (l=1,2,,k), unless otherwise specified, we always assume

C= t = 1 k [ ( l = 1 t 1 A l ) I ( l = t + 1 k A l ) ] ,N= t = 1 k ( ( l t A l ) I ) .

Theorem 3.1 Let A l H(n) be invertible, l=1,2,,k, and α(k) be as in (2.7) and (2.8), if ( l = 1 k A l 1 )( α (k))>0, then l = 1 k A l is also invertible and

t = 1 k [ A t 1 ( l t A l ) ] +2 1 t < s k [ ( l t , s A l ) I ] N ( l = 1 k A l ) 1 N.
(3.1)

Moreover, the equation in (3.1) holds if and only if

( l = 1 k A l 1 ) ( α ( k ) , α ( k ) ) N+ ( l = 1 k A l 1 ) ( α ( k ) ) C ( α ( k ) , α ( k ) ) =0.
(3.2)

Proof By (2.6), we see C= t = 1 k [( l = 1 t 1 A l )I( l = t + 1 k A l )]H( n k ), and by (2.5), l = 1 k A l 1 = ( l = 1 k A l ) 1 is invertible. From our assumption, ( l = 1 k A l 1 )( α (k))>0, then by applying (2.7) and Lemma 2.3, l = 1 k A l =( l = 1 k A l )(α(k)) is invertible. By the commutativity of Hadamard products, combining with (2.1)-(2.6) yields

C ( l = 1 k A l ) 1 C = C ( l = 1 k A l 1 ) C = [ t = 1 k ( ( l = 1 t 1 A l ) I ( l = t + 1 k A l ) ) ] ( l = 1 k A l 1 ) × [ t = 1 k ( ( l = 1 t 1 A l ) I ( l = t + 1 k A l ) ) ] = [ t = 1 k ( ( l = 1 t 1 A l A l 1 ) I A t 1 ( l = t + 1 k A l A l 1 ) ) ] × [ t = 1 k ( ( l = 1 t 1 A l ) I ( l = t + 1 k A l ) ) ] = [ t = 1 k ( ( l = 1 t 1 I ) A t 1 ( l = t + 1 k I ) ) ] × [ t = 1 k ( ( l = 1 t 1 A l ) I ( l = t + 1 k A l ) ) ] H ( n k ) ,

that is,

C ( l = 1 k A l ) 1 C = t = 1 k ( A 1 A t 1 A t 1 A t + 1 A k ) + 2 1 t < s k ( A 1 A t 1 I A t + 1 A s 1 I A s + 1 A k ) .
(3.3)

By (2.7), (2.13), and (3.3), we have C(α(k))= t = 1 k [( l t A l )I]=NH(n), and

( C ( l = 1 k A l ) 1 C ) ( α ( k ) ) = t = 1 k ( ( l = 1 t 1 A l ) A t 1 ( l = t + 1 k A l ) ) ( α ( k ) ) + 2 1 t < s k ( ( l = 1 t 1 A l ) I ( l = t + 1 s 1 A l ) I ( l = s + 1 k A l ) ) ( α ( k ) ) = t = 1 k ( A 1 A t 1 A t 1 A t + 1 A k ) + 2 1 t < s k ( A 1 A t 1 I A t + 1 A s 1 I A s + 1 A k ) = t = 1 k ( A t 1 ( l t A l ) ) + 2 1 t < s k ( ( l t , s A l ) I ) C ( α ( k ) ) ( l = 1 k A l ) ( α ( k ) ) 1 C ( α ( k ) ) = [ t = 1 k ( ( l t A l ) I ) ] ( l = 1 k A l ) 1 [ t = 1 k ( ( l t A l ) I ) ] = N ( l = 1 k A l ) 1 N H ( n ) ,

so (3.1) holds.

From Lemma 2.3, the equation in (3.1) holds; therefore

( l = 1 k A l 1 ) ( α ( k ) , α ( k ) ) N + ( l = 1 k A l 1 ) ( α ( k ) ) C ( α ( k ) , α ( k ) ) = ( l = 1 k A l ) 1 ( α ( k ) , α ( k ) ) C ( α ( k ) ) + ( l = 1 k A l ) 1 ( α ( k ) ) C ( α ( k ) , α ( k ) ) = 0 .

 □

From Theorems 2.5 and 2.6, we see the inequalities (1.1) and (1.2), (1.3) and (1.4), and the general ones (1.5) and (2.17), (1.6) and (1.7) are companied and determined by each other, hence one of the companion inequalities could be obtained from the other one immediately. However, the following example indicates that the matrix inequality (3.1) is no longer equivalent to its backward inequality, without ‘positive definiteness’.

Example 3.2 Let A, B just as the one in Example 1.4, as ( A 1 B 1 )( α (2))= [ 1 1 1 2 ] >0, then (1.7) follows by Theorem 3.1, but the inequality (1.6) does not hold; this is because

(AB)(AI+BI) ( A 1 B + B 1 A + 2 I ) 1 (AI+BI)= 1 30 [ 10 10 10 16 ] .

Theorem 3.3 Let A l H(n) (l=1,2,,k) be invertible, and α(k) be as in (2.7) and (2.8), if C is invertible and ( C 1 ( l = 1 k A l ) C 1 )( α (k))>0, then t = 1 k ( A t 1 ( l t A l ))+2 1 t < s k (( l t , s A l )I)H(n) is invertible as well and

N [ t = 1 k ( A t 1 ( l t A l ) ) + 2 1 t < s k ( ( l t , s A l ) I ) ] 1 N l = 1 k A l .
(3.4)

Moreover, the equation in (3.4) holds if and only if

( C 1 ( l = 1 k A l ) C 1 ) ( α ( k ) , α ( k ) ) N + ( C 1 ( l = 1 k A l ) C 1 ) ( α ( k ) ) C ( α ( k ) , α ( k ) ) = 0 .
(3.5)

Proof By (2.6), CH( n k ) is invertible, then l = 1 k A l = C ( C ( l = 1 k A l ) 1 C ) 1 CH( n k ) is also invertible. As

( C 1 ( l = 1 k A l ) C 1 ) ( α ( k ) ) = ( C ( l = 1 k A l ) 1 C ) 1 ( α ( k ) ) >0,

in view of (3.3), (2.7), and Lemma 2.3 we find that

( C ( l = 1 k A l ) 1 C ) ( α ( k ) ) = t = 1 k ( A t 1 ( l t A l ) ) + 2 1 t < s k ( ( l t , s A l ) I ) H ( n )

is invertible. Then combining with (2.7), (2.13), and Lemma 2.3, it follows that

l = 1 k A l = ( l = 1 k A l ) ( α ( k ) ) = ( C ( C ( l = 1 k A l ) 1 C ) 1 C ) ( α ( k ) ) C ( α ( k ) ) ( C ( l = 1 k A l ) 1 C ) ( α ( k ) ) 1 C ( α ( k ) ) = C ( α ( k ) ) ( C ( l = 1 k A l ) 1 C ) ( α ( k ) ) 1 C ( α ( k ) ) ,

where C(α(k))= t = 1 k (( l t A l )I)=N, meanwhile

( C ( l = 1 k A l ) 1 C ) ( α ( k ) ) = t = 1 k ( A t 1 ( l t A l ) ) +2 1 t < s k ( ( l t , s A l ) I ) H(n),

thus the inequality (3.4) follows by (3.3).

From Lemma 2.3 and the proof course as above, with a similar discussion as Theorem 3.1, we see the condition for the equation in (3.4) is determined by (3.5). □

From above, the case discussed here is without ‘positive definiteness’, which is different from [110], and in form, the inequalities (3.1) and (3.4) are the reverses to each other; however, Theorems 3.1 and 3.3, and Example 3.2 indicate that their constraints are different, so (3.1) and (3.4) are not determined by each other any longer.

When k=2, we could obtain [[8], Corollaries 2 and 3] from Theorems 3.1 and 3.3 immediately.

Corollary 3.4 Let AH(n) be invertible, and α(k) be as in (2.7) and (2.8),

C= ( t = 1 k ( l = 1 t 1 A ) I ( l = t + 1 k A ) ) ,
  1. (i)

    if C is invertible and ( C 1 ( l = 1 k A) C 1 )( α (k))>0, then A 1 ( l = 1 k 1 A)+(k1) ( A I ) k 2 is also invertible and the inequality (1.5) holds. Meanwhile, we have the equation in (1.5) if and only if

    k ( C 1 ( l = 1 k A ) C 1 ) ( α ( k ) , α ( k ) ) ( A I ) k 1 + ( C 1 ( l = 1 k A ) C 1 ) ( α ( k ) ) C ( α ( k ) , α ( k ) ) = 0 ;
    (3.6)
  2. (ii)

    if ( l = 1 k A 1 )( α (k))>0, then l = 1 k AH(n) is invertible and the inequality (2.17) holds. Meanwhile, the equation in (2.17) holds if and only if

    k ( l = 1 k A 1 ) ( α ( k ) , α ( k ) ) ( A I ) k 1 + ( l = 1 k A 1 ) ( α ( k ) ) C ( α ( k ) , α ( k ) ) = 0 .
    (3.7)

Proof In this case, t = 1 k (( l = 1 k 1 A)I)=k ( A I ) k 1 H(n), by (3.3),

( C ( l = 1 k A ) 1 C ) ( α ( k ) ) =k [ A 1 ( l = 1 k 1 A ) + ( k 1 ) ( A I ) k 2 ] H(n),

then we could obtain the results by taking A l =A (l=1,2,,k) in Theorems 3.1 and 3.3. □

Corollary 3.4 indicates that, without ‘positive definiteness’, not only the inequality (1.5) still holds under some constraints, but also its reverse inequality (2.17) still holds as well. Clearly their constraints are different.

Corollary 3.5 Let A l H(n) (l=1,2,,k) be invertible with all diagonal elements 1 and α(k) as in (2.7) and (2.8),

  1. (i)

    if ( l = 1 k A l 1 )( α (k))>0, then l = 1 k A l is invertible and

    k(k1)I+ t = 1 k ( A t 1 ( l t A l ) ) k 2 ( l = 1 k A l ) 1 ;
    (3.8)

the equation in (3.8) holds if and only if

k ( l = 1 k A l 1 ) ( α ( k ) , α ( k ) ) + ( l = 1 k A l 1 ) ( α ( k ) ) C ( α ( k ) , α ( k ) ) =0;
(3.9)
  1. (ii)

    if C is invertible and ( C 1 ( l = 1 k A l ) C 1 )( α (k))>0, then k(k1)I+ t = 1 k ( A t 1 ( l t A l )) is also invertible and

    l = 1 k A l k 2 [ k ( k 1 ) I + t = 1 k ( A t 1 ( l t A l ) ) ] 1 ;
    (3.10)

the equation in (3.10) holds if and only if

k ( C 1 ( l = 1 k A l ) C 1 ) ( α ( k ) , α ( k ) ) + ( C 1 ( l = 1 k A l ) C 1 ) ( α ( k ) ) C ( α ( k ) , α ( k ) ) = 0 .
(3.11)

Proof By the assumption, A l H(n) (l=1,2,,k) is invertible with all diagonal elements 1, so N= t = 1 k (( l t A l )I)=kI, 2 1 t < s k (( l t , s A l )I)=k(k1)I, then in view of (3.1), (3.2), (3.4), and (3.5) we have the conclusions. □

For A,B H + (n), by (2.6), they satisfy the constraints demanded in Theorems 3.1 and 3.3 naturally. Hence similar to Theorem 2.6, by Lemma 2.4, we have the following.

Theorem 3.6 Let A l H + (n) (l=1,2,,k) and α(k) be the one as in (2.7) and (2.8), then both of inequalities (3.1) and (3.4) hold, and the equation in (3.1) holds iff the one in (3.4) holds iff (3.2) holds iff (3.5) holds.

When A= A l H + (n) (l=1,2,,k), by (1.8), one has

( A I + I l = 1 k 1 A ) ( l = 1 k A ) 1 ( A I + I l = 1 k 1 A ) 2 I + ( A l = 1 k 1 A 1 ) + ( A 1 l = 1 k 1 A ) .
(3.12)

Now in view of Theorem 2.5 and (2.17), we see the inequality (3.12) obtained from (1.8) is different from the one in (1.5). When A= A l H + (n) (l=1,2,,k), by Theorem 3.6, we have the following.

Corollary 3.7 Let A H + (n) and α(k) be the one as in (2.7) and (2.8). Then both of inequalities (1.5) and (2.17) hold, and the equation in (1.5) holds iff the one in (2.17) holds iff (3.6) holds iff (3.7) holds.

By applying Theorem 3.6 and Corollaries 3.4, 3.5, we are led to the following conclusion.

Corollary 3.8 Let A l C H + (n) (l=1,2,,k), α(k) be the one as in (2.7) and (2.8). Then both of inequalities (3.8) and (3.10) hold, moreover, the equation in (3.8) holds if and only if the one in (3.10) holds; thus (3.9) and (3.11) hold.

When k=2, the companion inequalities (1.1)-(1.4), (1.6), and (1.7), and their equation conditions are obtained.