A matrix [ ai j( a)xi j ] is shown to be positive semidefinite or positive definite if the matrix [xi j] is positive semidefinite or positive definite and aij( a) belongs to a large class of functions of a. This class includes the reciprocals of the ath mean values of xii and xii in the cases where
A nonpolyhedral cone of class function inequalities for positive semidefinite matrices
โ Scribed by Wayne Barrett; H. Tracy Hall; Raphael Loewy
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 150 KB
- Volume
- 302-303
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
A function f from the symmetric group S n into R is called a class function if it is constant on each conjugacy class. Let d f be the generalized matrix function associated with f, mapping the n-by-n Hermitian matrices to R. For example, if f (ฯ ) = sgn(ฯ ), then d f (A) = det A. Let K n (K n (R)) denote the closed convex cone of those f for which d f (A) 0 for all n-by-n positive semidefinite Hermitian (real symmetric) matrices. For n = 1, 2, 3, 4 it is known that K n and K n (R) are polyhedral and there is a finite set of "test" matrices T n (T n (R)) such that f belongs to K n (K n (R)) if and only if d f (A) 0 for each A in T n (T n (R)). We show here that K 5 and K 5 (R) are not polyhedral. Thus, for n = 5 there is no finite set of "test" matrices sufficient to establish which generalized matrix functions are nonnegative on the positive semidefinite matrices.
๐ SIMILAR VOLUMES
The purpose of this paper is to present some inequalities on majorization, unitarily invariant norm, trace, and eigenvalue for sum and product of positive semideยฎnite (Hermitian) matrices. Some open questions proposed by Marshall and Olkin are resolved.
Agler, Helton, McCullough, and Rodman proved that a graph is chordal if and only if any positive semidefinite (PSD) symmetric matrix, whose nonzero entries are specified by a given graph, can be decomposed as a sum of PSD matrices corresponding to the maximal cliques. This decomposition is recently