Extensions of classical matrix inequalities

Extensions of classical matrix inequalities

, LINEIR ALGEBRA AND Extensions of Classical Matrix MARVIN University MARCUS AND 421 ITS APPLICATIONS HENRYK Inequalitiss*t MINC of Califor...

963KB Sizes 1 Downloads 137 Views

,

LINEIR

ALGEBRA

AND

Extensions of Classical Matrix MARVIN University

MARCUS

AND

421

ITS APPLICATIONS

HENRYK

Inequalitiss*t MINC

of California

Santa Barbara,

California

1. INTRODUCTION

Many classical inequalities for determinants and permanents have recently been generalized in two directions: to corresponding inequalities for generalized matrix functions [4] and to similar inequalities for subdeterminants and subpermanents [7]. In the present paper we obtain inequalities for generalized matrix functions on submatrices of certain normal matrices. From these we derive formulations of the Fischer and Hadamard determinant theorems for generalized matrix functions on normal matrices (Theorem 8). We further state and prove inequalities that extend a recent result of Sasser and Slater [8] to generalized matrix functions. We also develop some formal identities for subpermanents of matrices and from these prove extensions of the van der Waerden conjecture to a class of normal doubly stochastic matrices (Theorem 5). One of the subsequent results (Theorem 2) constitutes an extension of the Sasser-Slater result. We also prove, for a class of normal doubly stochastic matrices, a conjecture of Dokovic [l]. We shall state most of our results in the next section with proofs First, however, we introduce some relegated to subsequent sections. combinatorial machinery and notation. Let G be a subgroup of S,, the symmetric group of degree m, and let x be a character of G. The generalized matrix function dxG, associated with G and 2, is a complex-valued function on m-square complex matrices whose value for matrix X = (x,) is defined by the formula * Dedicated

to Professor

A. M. Ostrowski

on his 75th birthday.

t This research was supported by the U.S. Air Force Office of Scientific Research under Grant AFOSR

698-67. Linear Algebra and Its A@lications

Copyright

0

1968 by American

Elsevier

1, 421-444

Publishing

Company,

(1968) Inc.

If the

character

x is identically

I‘, ,It denote

Let

1, < 77, i = 1, . said

the

immediately thereby

implies

each

For

i of .I consisting

example,

if 6 ~2 {e}

sequences

; if G = S,,, and

x :: sgn

of 1.

Thus the number

W(W) is the number

then X($8) al’

that

r-elation

1

tknott~

then

A

so c~liosc~n that clash.

PJ E.LI for whicll

.S,lLand x E 1

of all nondecr~~asin~

_ G,,,,,, while

increasing

and

iI 5~-stull

in its cyuivalence

seclwnces

aI-<

G is a groul)

i = I ‘,,,,,, ; if C;

In this paper we take x to br: a character

x will be a homomorphism

, x,,,), I :.:

a lxwnutation

Iwlation,

of I’!,,,,, consisting

of all strictlv

of G,,,,,, consisting

subset

IA9

order

of thaw

then Lj =

i= G,,,,,,, t11c subset

then ‘1 =:

equi\xlenw

in lexicographic

a subset

exists fact

classt5.;.

to d”.

#x and jl in /‘_

5 is 211 cqui\xlencc

(yuivalcnw for this

in A is first

The

, x ,i/,,,,,! -=~/f.

d,”

(x,,

x

G, x k I{, if tlivrc

thcb relation

representatives

sequence

Define

that

I :,,,, into

partitions

of distinct

module

5~”= (CQ, ), .

that

of all sequent5

, nz, with 1115: 12. ‘f\vo sequences

to be equi\xlent

CTE G such

1 on (;, \\‘v abbreviate

totalit!,

i

s,,,.,, * ths

sequences.

of degree 1. In other wortls,

from G onto a multiplicatix-e

group of roots

Y(O)) is the order ot thtl stabilizer

of COin G, i.v..

of permutations

CJ in C; for \vhich o)”

(1,.

denotes the submatrix obtained from Ly b?, dc~lvting ITwS /3,, , /I,,,,. Recall that a square matrix is doubl!

. . . > qp2, and columns

stochastic column

if all its entries sums arc 1.

are nonncgati\-e

and aI1 its row sum’: anti

EXTiNSIONS

OF CLASSICAL

subgroup of S,, number. [-

INEQUALITIES

423

A,

be an arbitrary real

x E 1, and let ac, for each a E A =

Suppose

n/2m, n/2m]

MATRIX

that the eigenvalues

of the complex

plane;

8 = max(amp

of A lie within specifically

&) < &

the closed sector

that

G

i Then 2

Ix&i

a air dG(A[alP1) > &

a

aa c nm arj (y(a))lb

(y(a)v(8))1/2 ’

+ (cosme)Il$

’ (1 -

cos(m@ i&lrn)

C aa2,

(3)

c&i

where h is the order of G. Also, if J, denotes the n-square matrix all of whose entries are l/n,

then

aaaa dG((A - JJ WI) c (4aMP)Y a,BGi COROLLARY 1.

>



If A satisfies the hypotheses

o

(4

’ of Theorem

1, then

Also,

and dG(A [ala]) > -$ + cos(m@ l&l” (1 - G). Let o,(A) of A,

(7)

denote the sum of the values of dc on all m-square submatrices

i.e., cc(A)

Linear

=

2 ~G(A[a181). ‘xJw+#,, Algebra

and Its Applications

1, 421-444

(1998)

M. MARCUS

424 Note

.1ND H. ikNC

that

Inequality (5) implies, therefore, the following theorem that generalizes the Sasser-Slater result and the van der Waerden conjecture to arbitrary generalized matrix functions for which the character x is identically 1. THEORE~~ 2.

with eigenvalues

Let

A be un n-square

normal

1, = 1, A,, . . , jLn (lil,I >

0 = max(amp ‘

doubly

:/I,: > . . . 3

A,) < 2t

stochastic IA,, )

matrix

Satfifiose

that

.

Then

In particirlar,

if m =- II,

d”(A) 3 d6(Jn) +

cos(nO)~I,,.(l - -$).

If we now set llz = PI, I) = 0 and G = S,, we obtain the following generalization of a result in [C;] for positive definite hermitian doubly stochastic matrices. THEOREM

stochastic

3.

matrix

I/ A is an n-square with least

eigenvake

positive

definite

hermitian

dwbly

I,, then

per(A)2 PW,) + A”(1 ~ per(J,)). In our next sequence of results we specialize : G = .S,x and \Ve shall write a, instead of a,, i.e.,

x = 1.

In other words, a,(X) is the sum of all subpermanents of X of order nz. Set a,(X) = 1. The first part of the following theorem was established in 151. Linear Algebra and Its A@~lications 1, 421-444

(1968)

EXTENSIONS

OF CLASSICAL

THEOREM

cohmn

4.

(i)

MATRIX

425

INEQUALITIES

If S is a real n-square

matrix each of whose row and

szcms is 0, then

u2F)= 311s1/2 b 0 with equality

(ii)

if and

only if S = 0.

If A is an n-sqzcare normal doubly stochastic matrix

values lie in the sector [-

n/2m, n/2m]

of the comfilex plane

whose eigenthen

a,@- J,) = 0 and k=2,...,m.

a,(A - J,,) > 0,

In case k = 2 equality can occur if and only if A = J,. 5. If A is a normal doubly stochastic n-square matrix whose

THEOREM

eigenvalzces lie in the sector [- n/Zm, n/2m]

MA) where j IA -

>

~4Jn) +

plane,

IIA- Jd21

J,I 1 denotes the Euclidean

COROLLARY

of the complex

norm of A -

then

(9)

J,,.

2. If A satisfies the hypotheses of Theorem 5 a& A # J,,,

then o,,,(A) >

This is the result of Sasser and Slater THEOREM

(10)

dJ+s). [8].

6. If A satisfies the hypotheses of Theorem

5 and A # J,,

then, for 0 < t < 1 and 2 < m < n,

4tA + (1- t)J,) is a strictly increasing

function

of t.

Some of the preceding results are based on the following very general identity for the permanent function. THEOREM

7. Let A be an arbitrary n-square matrix.

Let 0 < m < n

and define Linear

Algebra

and Its Applications

1, 421-444 (1968)

426

t=

0, . . , m.

Then for each k,

In particular,

1 < k .<

W,

for k = 1 and 2, Theorem

7 yields the following corollary:

and

From

Corollar!,

COROLLARY

3 we can prow

I/ A is alz n-spare

4.

-whose eigenvalues

the following

lie in the sector

result.

gzormal doubly stochastic matrir

- n/fLm, nl2m I, 2 < m < n, thrlz

attd

Inequality

(14) implies

that,

o,,,(A) > which

is stronger

I-incur

Algebra

and

than Its

for ‘4 f

(Tz -m +IJ2,_(A) nm 111

the conjectured

A,bplicutio+zs

J,,

1.

421-444

1

inequalitv (1988)

bar DokoviC

111.

. EXTENSIONS

From

OF CLASSICAL

inequality

(14), with

427

INEQUALITIES

m = n, we obtain

5. Let A be an n-square

COROLLARY whose eigenvalues

the

following

result.

doubly stochastic normal matrix

;(1 = 1, A,, . . . , 1, lie in the sector [ - n/2n, n/2n]. per(A)

where 5 ,,_,(A)

MATRIX

- C,(A)

Then

> x per(J,)

(16)

denotes the average of the n2 subpermanents

of A of order n -

1,

and 2 denotes the average of the squares of the absolute values of iz,, . . ., A,,, i.e.,

i =

Cb2

iA,jz/(n

-

1).

In ParticzLlar,

%_,(A)

< per(A),

with equality if and only if A = J,.

Our last sequence of results extends the classical Hadamard determinant inequalities to a class of normal matrices. THEOREM

8. Let A be an n-square

integer, 1 < m < n, and let@ = min(m, A,,, be a principal

m-square submatrix

square complementary

principal

real normal

matrix.

and Fischer

Let m be an

n - m), q = max(m, n - m). Let denote the (n - m)-

of A and let A,_,

submatrix.

0 = max(amp i

If

&) < $

then

det(A,) THEOREM

det(A,_,)

> cos2(p6) det(A).

9. Let A be an n-square real normal

(17)

matrix with eigenvalues

1 1,. . -9 1, @,I 3 * * * > IA,,]) and let 8 = max,(amp I,). Let G be a subgroup of S, and x a character of G of degree 1. If 0 < n/2m then, for any a E A,

where p, >, . . * 2 p, are the multiplicities

of the distinct integers

occurring

in u. COROLLARY

m-square

6. If A satisfies hypotheses

principal

submatrix Linear

of Theorem

9 and A,,, is an

of A then Algebra

and Its Apfdications

1, 421-444 (1968)

428

M. M.-\RCUS AND

H. MIIINC

per@,) 3 cos(mO)fi l;ln--ii, 1. ,=-i In particular,

(19)

if 0 < n/2n, per(A) >, cos(n0) ldet(A) 1.

If

A is orthogonal,

(29)

then per(A) 3 cos(n0).

It should be noted result

of I. Schur

sector

I-

definite

hermitian,

of normal

principal matrices.

by Fan

THEOREM

To be specific,

then

we prove

overlapping

(20) is. an extension

inequality

[9] to real normal

n/2n,n/2%].

Lastly

obtained

that

per(A) 3

an extension

matrices

of a classical

with eigenvalues

in the

Schur proved that if A is positive

det(A). of a theorem

subdeterminants Extensions

(21)

in

171 on products

of hermitian

matrices

of

to a class

of the results in [7] have been recently

[2j.

10. Let A = (ajj) be a real +aormal matrix

with eigenvalues

submatrices of il 1,. . ., At (1q 3 * * * 3 IAJ). Let A,, . . . , A, be principal A of orders m,, . . . , ‘mI and suppose that aii OCCUYS in pi of the submatrices A,, . . . , il,.

Let ,ui, < 1. * <,uu,,,.

0 = max,(amp

If

2,) < max,(n/2mi),

then

3. SYMMETRY

CLASSES

In this section

OF TENSORS

we discuss

and of linear transformations on the underlying stated

in Section

Let

space.

properties induced

classes

of tensors

We shall use these properties

to prove the results

2.

I/ be an n-dimensional

sequently

of symmetry

on these by linear transformations

will be assumed

vector

space

to be the complex

over a field F which subfield.

Let G be a subgroup

of s,, m < n, and let x be a character of degree 1 on G. h multilinear function f on V x * . . x V (m occurrences of V in the Cartesian product) with values in some vector respect Linear

space P over F is said to be symmetric

to G and x if f(v,, . . . , ZI,~)is linear in each zjj separately Algebra and Its Applications

1, 431-444 (1968)

with and if,

EX
OF CLASSICAL

MATRIX

for any vr, . . . , v, in V and any permutation

o in G,

f(V,(,,P * - . >“+q) = x(wb The pair (P, G and x, if

429

INEQUALITIES

. * . f %A.

f) is called a symmetry class of tensors over V associated with

(a) (rng f) = P, i.e., the linear closure of the range of f is all of P; (b) for every multilinear function p7, symmetric with respect to G and x, with values in a vector space U, there exists a linear function Iz: P ---, U for which a, = hf. This situation

is customarily

v

summarized

in the diagram

x *-* x V---P f \ \ q\

h k1

u

We shall denote a symmetry class of tensors over V associated with G and x by Vx”‘(G) and f(v,, . . . , v,,,) by vr * * * - * a,. The most familiar and useful examples are (i) (Tensor product) G = {e}, in which case Vnnt(G) is ordinarily written @!!r V and f(v,, . . . , v,,J = v1 @ * * - 63 v,,,; (ii) (Grassman space) G = S,,,, x = sgn in which case the usual for Vx”‘(G) is IV and f(v,, . . ., 71~)is written vr A +. - A v,. (Symmetric space) G = S,, x E 1; V*‘“(G) is written V’“) and f(v,, * * *, II,,,) is denoted by vr - * * v,,,. We state the following standard result which will not be proved here. notation (iii)

THEOREM 11. If e,, . . . , e,, is a basis of V then the tensors e,,* = eYI* * * * * eYm,y E 6, constitute a basis of VzM(G); if e,, . . . , e,, is an orthonormal basis of V then the induced tensors

YEA,

(23)

constitute an orthonormal basis of V’,“‘(G). Linear Algebra and Its Applications

1, 421-444

(1068)

Jl.

430

MARCUS

AND

H.

MING

Examples G = {e]. Then d = rl = r,,,+. Thus @‘!!i

(i) basis

the tensors (ii)

G = S,>,, x = sgn,

strictly

increasing

G = S,,

decreasing

x 3 1.

sequences

the

basis j/ZeY* Then

totalit!,

The

=Vnt!e,,A..~hE.,

d = n = G,,,,

the

of

Grassman ,rrQ

totalit’;

of

nzispace

hasis

where m,(y) is the number

of times

I’ be a linear

T: 1

~7 = Q,,,,,

1 < yi < . . . < 7% < n.

1 < yi < . . . < ym < PZ. Thus the symmetric

Tltnt) has the orthonormal

Let

Then

m < n.

sequences,

11‘ space AV has the orthonormal (iii)

V has as an orthonormal

e,* = ey, ($3 * 1 * @ eY,,,, y E r,,,,.

the integer

t occurs in y.

and consider

transformation

the diagram

----fV?(G)

5’ x . . . x V ‘~ j_

;\

K(T) ,l4-1

Vx”‘M where

By the universal formation

K(T)

factorization

property,

there

exists

a linear

trans-

: V,“‘(G) + VXm(G) satisfying K( T)u, * . . . * v, = TV, * . . . * TV,

for all pi, . . . , u, in V. transformation.

The

/?1’. . ., 1, then easily

K(T)

seen that

The transformation formula

(25)

has eigenvalues

K(T)

inherits

from

hermitian,

unitary,

K(T)K(S)

for any transformations

M-e conclude theorem L.inear

which

Algebra

or nonsingular. this

Its

AppZications

nE1

K(T) that il,,

is called the associated if

T has

y E 6.

T the properties Also, K(T)*

eigenvalues

Moreover, of being

it is

normal,

= K( T*) and K( TS) ==

T and S on V.

preliminary

is not proved

and

implies

(25)

section

with

here. 1, 421-444

(1968)

an important

standard

EXTENSIONS

THEOREM

OF CLASSICAL

12.

MATRIX

431

INEQUALITIES

Let T E L(V, V) and let E = {e,, . . . , e,} be an ortho-

normal basis of the unitary space V.

Let

be the induced orthonormal basis of V,‘,“‘(G). If the matrix representation of T relative to the basis E is A, then the matrix representation of K(T) relative to the basis E, is the matrix K(A) defined as follows: the entries of K(A) are doubly indexed by the elements of A in lexicographic ordering. For u and p in d the (a, /l) entry of K(A) is K(A)

B_

a,

df(AT[da])

(26)

where AT denotes the transpose of A. 4. PROOFS

Proof of Theorem 1. Let V be the space of complex n-tuples with the standard inner product. Let A be an n-square real normal matrix and let T be the normal linear transformation on V whose matrix representation relative to the orthonormal basis {ei = (6,r, . . . , c&J, i = 1 a> is AT. Let G be a subgroup of S,,, and x a character of G of degree 1: ’ ;;ik use notation of Section 3. For arbitrary real numbers a, indexed by elements u of A, let e,*. We compute the inner product (K(T)w, w) in two ways. hand we have

(W-be w) = ( K(T) G(E~ c a&yea*J = sa.aa

(K(T) (&rem*,

2

a+)”

($))(le

On the one

ea*)

eB*)

(27) Linear

Algebra

and Its Applications

1, 421-444

(1968)

M. MARCUS

132 On the other hand we use the spectral

theorem

be an orthonormal

of

A,, . . , ii, tensors K(T)

basis of eigenvectors

respectively,

and

(/Z/Y(~))%,* corresponding

;\nd, since

K(7‘)

where 01, =

let

constitute

on K(T).

1‘corresponding

ASJ)

H. JIINC

Let or, . . , ?I,, to eigenvalues

0, = amp(&),

t = 1,

. . , vz2. Then

an orthonormal

basis

of eigenvectors

the of

to the eigenvalues

is normal,

cF=r

m,(,f?)Bt. U I ow, the matrix

assumed to be real.

If we further

A and the numbers

assume that the character

a, were

x is also real,

it follows from (27) that (K(T) W, W) is real and from (27) and (29) we have

As a first specialization, and let the eigenvalues 72/2m] of the complex

Linear

Algebra

doubly

stochastic

of A, il, = 1, il,, . . . , A, lie in the sector plane.

and thus the first sequence 7’, = (l/V4(1>

let A be a normal Further in

d

[-

42~2,

assume that x E 1, so that G,,, C .d

is /I0 = (1, 1, . . . , 1).

1, . . . , l), the right-hand

and Its AppZiratio9zs

matrix

Then,

side of (30) becomes

1, 431-444

(1968)

if we choose

EXTENSIONS

OF CLASSICAL

MATRIX

INEQUALITIES

433

since COS(@~,)= cos(m0,) = 1 and Y(/?O)= Iz. Now,

2

(w, VG) = and,

112

a,

aez

( 1 J.__

(em*,v1

*

- . .

44

*

Vl)

in general, (X1*“‘*Xm,yl*“’

In the present

*

ym)=

$ d,G((%,Yj)).

case x s 1 and

(Xi,yj)=

(emi, vl) =

L.

Vfi

Hence

(32) Now,

and

where

0 = max(0,).

Thus

the second

term in (31) exceeds

(33)

Since the tensors V,“(G), we have

But,

(h/v(p))1’2vp*, /I E 6, form

an orthonormal

basis

of

for the same reason,

Linear

Algebra

and Its Applications

1, 421-

444 (1968)

Hence

(33) is equal

and the right-hand

Thus

(30) yields

to

side of (30), i.e.

(31),

exceeds

the inequalit)

+ cos(m0) I&$

;2: u,2, CLtr

which

is (3) in Theorem

To establish

1.

(a), we observe

that the symmetric

with A, which is normal, and therefore

A -

matrix

zero,

which

This

and every

side of the resulting term

for which

is nonnegative.

completes

the proof

Proof of Corollary (5), (6), and (7). we obtain

It

1.

follows

identity

Every

than

or equal

(5).

to

that

1.

choices

of the aar in (3) yield formulas

If we choose a, = 1, SCE Q,,,,, and a, = 0 otherwise,

inequality

term

for which ml(B) > 1 is

nzi(/3) = 0 is greater

of Theorem Various

commutes

J, is normal and its eigenvalues

are 0, A,, . . . , 1,. Thus we may replace A by A -- J,L in (30). on the right-hand

J,

Inequality

(6) is obtained

by choosing

then a, =

Finally, if we set a, = 1 for (Y(M))‘/“, CIE G,,,,z, and a, = 0 otherwise. some specific u in Q,,, and set all other ug in (3) to be 0, then the inequality (3) yields

(7).

EXTENSIONS

OF CLASSICAL

MATRIX

435

INEQUALITIES

The proofs of Theorems 2 and 3 are indicated in Section 2. If S = (sij) then

Proof of Theorem 4.

=&jFQ2,n r= 1

since cr= r sjt = 0. Thus a,(S) = -i;

c

SirSjf

7 =1 (6jkQ2,n

b 0, with equality, if and only if all the sir are 0, i.e., if and only if S = 0. To prove part (ii) use inequality (4) with a, = (y(a))1’2 for a E Q,,, and a, = 0 if a 4 Q,,,. The case of equality for k = 2 follows from part (i). A combination of Theorem 4 and the identities in Theorem 7 will yield the proofs of Theorems 5 and 6 and Corollaries 2, 3, 4, and 5. We proceed to the proof of Theorem 7, via a sequence of lemmas. LEMMA

1.

If X and Y are arbitrary n-square matrices then

per@ + Y) = ,$o, Pz ’

per(X [alPI) per(Y(44)

(35)

r.n

(where the terms corresponding to r = 0 awl r = n in the summatiolz on the right-hand side of (35) are zcnderstoodto be per(Y) artd per(X) respectively). Linear

Algebra

and Its Applications

1, 421-444 (1968)

hI. MARCUS _2XD H. blI9C

4x

Let Xti) denote the ith row of X, i = 1, . . . , n. The permanent

Proof. function

can be thought

rows of a matrix : per(X)

of as a symmetric

Q,_..,,*be the complementary remarks

multilinear

functional

of the

= per(X(,), Xtaj,. . . , X,,,). Let E’ = (c(r’, . . . , cth_,) E

and applying

sequence to tc E Q,,,. Then using the preceding

the Laplace

expansion

theorem

for permanents,

we have

pa-(X + Y) = per(Xc,, + Y(,,, . . , q,*, + Y,tt,)

If

LEMMA 2.

X is an arbitrary wsqware ,matrix and s is a scalar, thex PI‘

4x

+ SJn)=

c

(Hz

_

n -

y) !

rim-r

r= 0

Proof. o,,(X

+ sJ,J

Using =

i

Lemma 2

“J,./EQm ,l

Now>J, [+I(+)

is l/s and therefore

per(X[+l

is an

jojy], for

choices

a fixed

:!

1

s’+-rcq_Y),

II2 =

(36)

(nz -

+ sJ,, l+l)

r)-square

its permanent

matrix

is (m -

each

Y) !/s”‘-~.

of whose

entries

Hence

we first sum all order r subpermanents

tr) and y, and then sum up all these

COand y in Q,,,.

0, . . . , M.

1,

In the inner two summations

X

m-r

Y

Rut

(X [o\y]) [crJ,!I] is an r-square n‘ 2

of

sums over all submatrix

of

such submatrices appears (i Y an equal number of times in the inner two summations on the right-hand n 2m2 side of (37). The total number of terms in these summations is m i I( r’ ) Thus each subpermanent per(X [Alp]), A, ,u E Q,,,, occurs exactly X and clearly the permanent

Linear

of each of the

.4Zgebra and Its z4pplications

1, 421.-444

(1968)

EXTENSIONS

OF CLASSICAL

h1ATRIX

INEQUALITIES

oo_ mp,:i

437

~3~1122

n--r

m---r

2

1

times and hence

This completes

the proof.

Proof of Theorem 7. We apply Lemma 2 to the matrix tA + (1 - t) J,, = t(A - J,) + J, in two ways. First, set X = tA and s = 1 - t. We obtain u&A + (l-

t)J,,) = 5

“;;$[;I:)‘(1

- t)‘“-V’u,(A).

(38)

r=O

Then set X = t(A -

J,) and s = 1:

u,(t(A - Jn) + J,J =

2w

”t’u,(A -

r=O

Jn).

(39)

Now, let

and equate

(38) and (39):

,2 c,(l - t)“-“t’u,(A)

= 2 c,t’u,(A - J,).

(40)

r=O

To obtain

the identity

(11) in Theorem

7, we differentiate

of (40) k times with respect to t, and evaluate at t=

1.

We omit the details of this tedious

Proof of Theorem 5. term that survives

In the identity

on the left-hand

both

sides

the resulting polynomials computation.

(40) set t = 1, so that the only

side corresponds

to Y = m.

Then

1, 421-444

(1968)

(40) becomes Linear

Algebra

and Its Applications

This pro\‘t5 ‘l‘hwrem 5. (‘orollary

2 follocvs from tlic fact that ,1.1

J,,,

0 if and onl!- if :I y- J,,.

i(t)

n,,,(l-1 : (1

g(s) = tr,,,(.sA, -I- (I l‘hen

g(s) --= f(st,)

and,

in pwticular,

W,,).

- SJj,,,

,y(l) ~~ j(t,,).

and so /‘(to) > 0 if and only if g’ (I) ,> 0.

Hens

(40) is j(t) and we saw that each side of (12) is obtained the corresponding h\T

g’(l)

:- t/“(t”)

Now, each sidr of tlitx iclentit!~ by differentiating

side of (40) at i -- 1. \\?th .-1 wplaced II!- .I,, WC‘therefore

EXTENSIONS

OF

CLASSICAL

MATRIX

INEQUALITIES

439

(42) The second equality in (42) is the identity (12). The inequality in (42) follows from Theorem 4(ii) and the third equality from Theorem 4(i). Now, the eigenvalues of A, - J,, = $(A - J,) are: 0, t,il,, I . . , $,A,. Hence, by a classical theorem due to I. Schur,

and therefore from (42) we have U%)

= g’(l) =

c2 i: j=2

I&)Ajl”,

i.e.,

If A # J,, then not every one of AZ,. . . , A,, can be 0 and thus positive. This concludes the proof of Theorem 6.

f’(t,) is

Proof of Theorem 8. Let T be, as before, the linear transformation on V whose matrix representation with respect to the orthonormal basis e,, . . ., e,, is the real normal n-square matrix AT. If we replace the tensor w by the tensor (h/v(cc))1’2e,* in (29) and once again use the spectral theorem, we obtain

Linear Algebra and Its Applications

1, 421-444

(19138)

In \ick\,

ol Theorem

Id and

(d(j), the

left-liantl

5idc* of (43) is just

(4(i)

Since

((h/~(fi))‘%~,*

of tensors IKl\T

associated

, jj E i) is an orthonormal with

G and

x, and

basis

(h/~(a))‘~“e,*

of the symmetry are unit

tensors,

class WCS

EXTENSIONS

OF

CLASSICAL

MATRIX

441

INEQUALITIES

Denote (44) by d, and take logarithms on both sides of (47), using the concavity

of the logarithmic

function :

= 2 C,Plog(cos 0,) + (5 loglh/) (z %(P)%$ t=1 be/l aeZ Using the identity log d, 2

(49)

(45) in (48), we obtain

2 c,fi log(cos 0,) + neil

(4g)

We use the inequality (49) in the following way. Let G,, . . . , G, be arbitrary subgroups of symmetric groups of degrees m,, . . . , m, respectively and let xi, . . . , x7 be real characters of G,, . . . , G, respectively. Let ak E dzk,, = let b, be nonnegative numbers, k = 1, . . . , r. In inequality (48) consider each of the generalized matrix functions associated with the groups G, and characters xk, k = 1, . . . ,7. Multiply both sides of each of the resulting 7 inequalities by b, and sum for k = 1, . . . , 7 to obtain

dk and

2 bklogd,k3

k=l

i

k=l

b, 2 Cak/rlog(cos@,&+

10gl~fl.

aejk

(50)

Now, for each k, choose j?,,” so that log(cos OB2) = min(log(cos O,,)), pd

k = 1,. .

.,7.

k

Then

25“a%log(cos 0,)

&i k

> log(cos QJ.

(51)

The double summation in parentheses in the second term on the righthand side of (50) can be thought of as a linear function of the n-square matrix S = (stj). But the orthonormality of the vectors e,, . . . , e, and of 211,* f *, v, immediately implies that S is doubly stochastic and, by Birkhoff’s theorem, such a linear function takes its minimum when the doubly stochastic matrix is a permutation matrix. Thus, using (51) and the Linear

Algebra

and Its Applications

1, 421-444

(1968)

monotonicity exponentiating

of the :

logarithmic

function

The inequality (52), although generalizations of many classical choices of the G,, and xk, k ~~ 1, Y = 2, G, 1 s,,,, G2 - s 1, !//I rl.1 7 /I, --- I , then

since A is a real matrix

we obtain

from

(FiO), after

rather complicated in form, will yield theorems by simply making particular . , Y. If we set in the inequality (52), (1.. . ., 112).K2 =-- (PMAL 1, . , $11,h, :

whose real eigenvalues

are nonnegative.

.Uso,

for some i,, . . . , i,,,, and

-1

for some integers ha1.e nonnegative

e;,

I

.

.

-I

(I,,, ,,,

jr, . . , j, ,,l. Sow, A is a real matrix whose eigcn\:alue~ real parts. Hence ~~_=, Bi = 0 and thus HO,,i- . . + Otmj
pe, ei, f

. . . ~1.o;,_,fil < $0, where p 7 min(m,

Ll’e have

from

(52) and

(let(A,,,) det(A,,_,,)

(53), using

II ~~ m) and 0 7 max(0;).

the notation

of Theorem

8,

> cos(O,, -i . . . -i- Oi,,,)cos(Oi, + . . . + Oj,, _,,I W.4) > cos2(pO) det(A),

which is the inequality

(17)

EXTENSIONS

Proof

OF CLASSICAL

of Theorem

9.

MATRIX

443

INEQUALITIES

In the inequality

(52) set r = 1 and b, = 1

and obtain (54) The minimum permutation

value of the right-hand o that places

next largest exponent inequality choosing

the largest

side of (54) is achieved

by that

exponent

151, the

on the second smallest

(18) in Theorem

9.

on the least

ISi, etc.

The inequality

This proves the

(19) follows

by simply

cc from Q,,,.

To obtain

Corollary

6, we take n = m in (19).

Proof of Theorem 10. to prove a variety evaluated

It is clear that the inequality

of results on products

on principal

submatrices

values lie in appropriate

matrix functions

of real normal matrices

sectors in the complex

Thus let LX~EQ,,,‘, and b,=l,

(52) can be used

of generalized

k=l,...,r.

k$lmjtak)bk

whose eigen-

plane. Then

=Pj

is just the total number of times that the main diagonal element ujj appears in the submatrices

A, = A [Eklak],

k = 1, . . . , Y. k=l,...,r.

COS(@D”k)bk >, cos(m,B), Then

Moreover,

(52) becomes

where pi, <, pi, < * * * < ,uZn. This proves

Theorem

16.

REFERENCES 1 D. Z. DokoviC,

On a conjecture

by van der Waerden,

Mat.

I/es&

4(19)(1967),

272-276. 2 K. Fan, An inequality apphcations

for subadditive

to determinantal

l(1968). 33-38. 3 M. Marcus, Applications

functions

inequalities,

of a quadratic

Linear

identity

on a distributive Algebra

for decomposable

tensors, Bull. Amer. Math. Sot. 71(1966), 360-364. 4 M. Marcus and H. Mint, Generalized matrix functions, 70(1964),

lattice with

and Its Applications

Bull.

Amer.

symmetrized Math.

Sot.

308-313. Linear

Algebra

and Its Applications

1, 421-444

(1968)

5

AI. Marcus, 63( 1967).

On a conjectnrr

of Ii. L. van

6 11. Marcus and M. Srwman, 58(1)(1962),

der Warrden,

,/. Cow~b. TJ~eovy 2(1967/,

Ine(lualitirs

der Waerden

184-20

I.

I’JriZ. Sor.

for tile permanent

function,

AWH. Alafh.

tiher

permanent endlichc

for cntnhinatorial

matrix

functions.

145 163.

R I). \V. Sasser and $1. I,. Slater, !I 1. Schur,

Cnmb.

47-62.

7 M. Jlarcus and G. W. Soules, Some ineclualities

van

I’ror.

3OG309.

On the mc~lualit~ conjecture,

(;ruppen

IpxIyL ; : (l/n),X.x, . Zyi

.I. Cow&.

und hermiteschr

TJwwy Formen,

8(1967), Matk.

and tlw

25-33. %. 1(191X).