Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras
|
|
- Bathsheba Williams
- 6 years ago
- Views:
Transcription
1 positivity manuscript No. (will be inserted by the editor) Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras M. Seetharama Gowda Jiyuan Tao February 9, 200, Revised July 8, 200 Abstract In this paper, using Schur complements, we prove various inequalities in Euclidean Jordan algebras. Specifically, we study analogues of the inequalities of Fischer, Hadamard, Bergstrom, Oppenheim, and other inequalities related to determinants, eigenvalues, and Schur complements. Keywords Euclidean Jordan algebras Cauchy interlacing theorem Schur complement Schur interlacing inequalities Mathematics Subject Classification (2000) 5A33 7C20 7C55 Introduction Inequalities abound in matrix theory. A number of them are derived from classical results involving norms, eigenvalues, Schur complements, Schur products, etc. In this paper, we consider some inequalities that arise from Schur complements and study their analogues in the setting of Euclidean Jordan algebras. Given a complex matrix M in the block form [ ] A B M = () C D M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland Baltimore County Baltimore, Maryland 2250, USA, gowda@math.umbc.edu Jiyuan Tao Department of Mathematical Sciences Loyola University Maryland Baltimore, Maryland 220, USA, jtao@loyola.edu
2 2 with A invertible, the Schur complement of A in M is M/A = D CA B. The Schur complement enjoys numerous properties such as the Schur determinantal formula, the Haynsworth inertia formula, the Guttman rank formula, etc., and appears in various applications [22]. While the above definition continues to hold for quaternionic matrices, for lack of associativity property, it is not defined for octonionic matrices; lack of a nontrivial multiplicative determinant for matrices over quaternions and octonions [2] is perhaps another reason why Schur complements have not been studied for matrices over such numbers. However, the concept of Schur complement can be studied for square Hermitian matrices (of suitable size) over quaternions and octonions, and more generally over Euclidean Jordan algebras. Consider a Euclidean Jordan algebra V (which is a finite dimensional real inner product space with a compatible Jordan product), an idempotent c V (that is, c 2 = c), and the corresponding Peirce decomposition [5] V = V (c, ) V (c, ) V (c, 0), (2) 2 where V (c, γ) = {x V : x c = γx} and γ {0, 2, }. For any x V, let x = u + v + w, (3) where u V (c, ), v V (c, 2 ), and w V (c, 0). When u is invertible in the Euclidean Jordan (sub)algebra V (c, ), let u denote the inverse of u in V (c, ). In this case, the Schur complement of u in x is defined by x/u := w P v (u ), where, for any element a V, the quadratic representation P a is defined on V by P a (z) = 2a (a z) (a a) z (z V ). (4) The concept of Schur complement was introduced in [5], see also [4], where it was shown that x/u V (c, 0) and det(x) = det(u) det(x/u). (5) Here, the determinants det(x), det(u), and det(x/u) are taken in the algebras V, V (c, ), and V (c, 0) respectively. In a recent article [8], Gowda and Sznajder showed that (i) In(x) = In(u) + In(x/u), (ii) x > 0 ( 0) in V if and only if u > 0 ( 0) in V (c, ) and x/u > 0 ( 0) in V (c, 0), and (iii) rank(x) = rank(u) + rank(x/u),
3 3 where In(x) and rank(x) denote the inertia and rank of an element x respectively, and x 0 means that x belongs to the symmetric cone in V. With appropriate identification, the above results reduce to the familiar results of matrix theory in the algebras Herm(R n n ) and Herm(C n n ) of all n n Hermitian matrices over real numbers and complex numbers. Items (i) (iii) show that they continue to hold even in Herm(H n n ) (the algebra of all n n Hermitian matrices over quaternions), Herm(O 3 3 ) (the algebra of all 3 3 Hermitian matrices over octonions), and the Jordan spin algebra L n. As we shall see, these items will allow us to extend many of the (real/complex) matrix theory results to Hermitian matrices over quaternions/octonions and to objects in L n. In this paper, we study some inequalities that arise via Schur complements in the setting of Euclidean Jordan algebras. Specifically, we study analogues of inequalities due to Fischer, Hadamard, Bergstrom, Oppenheim, and inequalities related to determinants and eigenvalues. The organization of the paper is as follows. In Section 2, we recall various concepts, results, and notation from Euclidean Jordan algebra theory. Section 3 deals with some inequalities involving quadratic representations and determinants. In Section 4, we study analogues of inequalities of Hadamard, Fischer, and Bergstrom. An inequality involving the sum of two Schur complements is also presented in this section. In Section 5, we consider interlacing inequalities for Schur complements. Section 6 deals with the (new) concept of Schur (or Hadamard) product of two objects in a Euclidean Jordan algebra when their Peirce decompositions with respect to a Jordan frame are given. A generalization of Schur s product theorem and related results are also studied in this section. Finally, in Section 7, we present a converse of the Schur complement interlacing theorem. 2 Preliminaries Throughout this paper, we let (V,,, ) denote a Euclidean Jordan algebra of rank r [5], [9], [8]. The symmetric cone of V is the cone of squares K := {x 2 : x V }. We use the notation x y (x > y) when x y K (respectively, x y interior(k)). As is well known, any Euclidean Jordan algebra is a product of simple Euclidean Jordan algebras and every simple algebra is isomorphic to the Jordan spin algebra L n or to the algebra of all n n real/complex/quaternion Hermitian matrices or to the algebra of all 3 3 octonion Hermitian matrices. Given a Euclidean Jordan algebra V of rank r, for every x V, there exist a Jordan frame {e,..., e r } and unique real numbers λ,...,λ r called the (spectral) eigenvalues of x such that x = λ e + + λ r e r. (6)
4 4 We remark that these eigenvalues coincide with the real right eigenvalues of matrices in Herm(R n n ), Herm(C n n ), and Herm(H n n ). However, they can be different for matrices in Herm(O 3 3 ), see [3], [7]. Corresponding to the spectral decomposition of x given by (6), the determinant, inertia and rank of x are respectively defined by det(x) := λ λ 2...λ r, (7) In(x) := (π(x), ν(x), δ(x)), and rank(x) = π(x) + ν(x), (8) where π(x), ν(x), and δ(x) are, respectively, the number of eigenvalues of x which are positive, negative, and zero, counting multiplicities. We note that x > 0 (x 0) if and only if all eigenvalues of x are positive (respectively, nonnegative). When all the eigenvalues λ i are nonzero, we define the inverse of x by x := λ e + + λ r e r. Referring to the space V (c, ) defined in (2), if {e, e 2,...,e k } is a Jordan frame in V (c, ) with c = e + e e k and u = λ e + λ 2 e λ k e k is invertible in V (c, ), we define the (partial) inverse of u in V (c, ) by u = λ e + + λ k e k + 0f k f r, where {f k+, f k+2,...,f r } is any Jordan frame in V (c, 0). Given two elements a and b, we say that a and b operator commute if a (b x) = b (a x) x V. (This is equivalent to saying that a and b have their spectral decompositions with respect to a common Jordan frame.) Let {e, e 2,..., e r } be a Jordan frame in V. For i, j {, 2,..., r}, the Peirce eigenspaces are given by and when i j, V ii := {x V : x e i = x} = Re i V ij := {x V : x e i = 2 x = x e j}. It is well known that V is an orthogonal direct sum of V ij s with i j. In particular, any element x V can be written as an orthogonal sum x = i j r x ij = r x i e i + i= i<j r x ij (9) where x i R and x ij V ij. This expression is the Peirce decomposition of x with respect to {e, e 2,..., e r }. If c = e + e e k, the decompositions (3) and (9) are related by u = x ij, w = x ij, and v = x u w. (0) i j k k+ i j r
5 5 In addition, see Page 64, [5], u = P c (x). We collect below some properties of quadratic representations defined by (4) that are needed in this paper. Proposition For any a, z V, the following hold: (i) P a is linear and self-adjoint. (ii) P a (K) K with equality when a is invertible. (iii) det(p a (z)) = (det(a)) 2 det(z). (iv) P Pa(z) = P a P z P a. (v) P a (z) is invertible if and only if a and z are invertible, in which case, [P a (z)] = P a (z ). (vi) If {e, e 2,..., e r } is a Jordan frame, a = r a ie i and z = i j z ij, then P a (z) = i j a i a j z ij. Regarding Schur complements, we have Theorem ([5], [8]) The following statements hold: (a) x/u V (c, 0). In addition, if x is invertible in V, then the component of x in V (c, 0) is (x/u). (b) x/u = x P x (u ). Given any set of numbers {b, b 2,..., b r }, we denote the decreasing rearrangement by {b, b 2,...,b r}; in particular, for z V, λ i (z) (i =, 2,..., r) denote the eigenvalues of z written in the decreasing order. A consequence of Hirzebruch s min-max theorem, see [], is the following: When V is simple with rank r, for any two elements x, y, we have x y λ i (x) λ i (y) i =, 2...,r. We recall the Cauchy interlacing theorem in Euclidean Jordan algebras [0]: Theorem 2 Let V be simple and {e, e 2,..., e r } be a Jordan frame. For any element z V, let z := P e+e 2+ +e k (z). Then λ i (z) λ i (z) λ r k+i (z) (i =, 2,...,k). We conclude this section by recalling the description of the Jordan spin algebra L n. For the Jordan spin algebra L n, the underlying space is R n, n >. We write any element x in the form [ ] x0 x = x ()
6 6 with x 0 R and x R n. The inner product in L n is the usual inner product on R n. The Jordan product x y in L n is defined by x y = [ x0 x ] [ y0 ] [ ] x, y y := x 0 y + y 0 x. Then L n is a Euclidean Jordan algebra of rank 2 and for any element x L n, see Example 0 in [8], the eigenvalues and the determinant are given by λ (x) = x 0 + x, λ 2 (x) = x 0 x, (2) and det(x) = x 2 0 x 2. Now consider any Jordan frame {e, e 2 } in L n. Then there exists (see e.g., Lemma 2.3., [20]) a unit vector u R n such that e := 2 [ u ] and e 2 := 2 [ u ]. With respect to this, any x L n given by () has a Peirce decomposition x = [ x0 x ] [ ] [ ] [ ] 0 = x e + x 2 e 2 + x 2 = x 2 u + x 2 2 u + z (3) where z R n with u, z = 0. (This is easy to verify, see e.g., Lemma 2.3.4, [20].) Given the above Peirce decomposition with u := x e 0, we have x/u = x 2 e 2 P x2 (x e ) = x x 2 x 2 2 e 2 = det(x) det(u) e 2. x From now onwards, our setting is that of a (general) Euclidean Jordan algebra. 3 Inequalities involving quadratic representations and determinants In this section, we present a few inequalities involving quadratic representations and determinants. These results, while known, are presented here for completeness, and for the novelty/simplicity of their proofs. We begin with a lemma that will facilitate the proofs of some of our results. Lemma Let x 0 and y 0. Then there exists d > 0 such that a = P d (x) and b = P d (y) operator commute. In particular, if x > 0, we can take a = e.
7 7 Proof Without loss of generality, we assume that x + y 0. Let the spectral decomposition of x + y be given by where λ i > 0. Now, define Then x + y = d = k k λ i e i + P d (x + y) = λi e i + r 0e i, k+ r e j. k+ k e i =: c. Put a := P d (x) and b := P d (y). Then a 0 and b 0. Since a + b = c V (c, ) K and V (c, ) K is a face of K (see, [7], Theorem 3.), we have a, b V (c, ). As c is the unit element of V (c, ), we see that a and b (= c a) operator commute in V (c, ), and hence in V. Finally, if x > 0, we may choose a d > 0 such that P d (x) = e (which can be seen by putting y = 0 in the previous argument). Hence e = P d (x) operator commutes with P d (y). Corollary (Cf. [6] or [5], Exercise 7, page 59) If x y > 0, then x y. Proof Let x y > 0. When x and y operator commute, we can compare the eigenvalues of x and y, and get the result. In the general case, by Lemma, there exists a d > 0 such that a = P d (x) and b = P d (y) operator commute. Since a b > 0, we have a b and a b [P d (x)] [P d (y)] P d (x ) P d (y ) x y. This completes the proof. Corollary 2 If x 0 and y 0, then det(x + y) det(x) + det(y). Proof For any two sets of nonnegative numbers x i and y i, i =, 2,..., r, r (x i + y i ) r x i + r y i. This inequality proves our result when x and y operator commute (so that they have spectral expansions with respect to a common Jordan frame). Now assume that x 0 and y 0 are arbitrary. Then by Lemma, there exists d > 0 such that a = P d (x) and b = P d (y) operator commute. Since a 0 and b 0, by the previously considered case, we have det(a + b) det(a) + det(b). Thus detp d (x + y) detp d (x) + detp d (y). Since det(p d (x)) = (det(d)) 2 det(x), etc., see Prop., we have det(x + y) det(x) + det(y).
8 8 Corollary 3 (Cf. [5], Exercise 4, page 59) If x y 0, then det(x) det(y). Proof When x y 0, from the previous Corollary, det(x) = det(x y + y) det(x y) + det(y) det(y). 4 Inequalities involving Schur complements In matrix theory, the well-known Fischer s inequality ([2], Theorem 7.8.3) asserts that if the complex matrix M given by () is Hermitian and positive semidefinite, then det(m) det(a) det(d). We state an analogue of this result in Euclidean Jordan algebras; see [0], Corollary 4.9, for a different proof. Proposition 2 (A generalized Fischer inequality) For x 0, consider the Peirce decomposition x = u + v + w of the form (3). Then det(x) det(u) det(w). Proof By continuity, we may assume that u is invertible in V (c, ). Since x 0 in V, we have, by Item (ii) in Section, u > 0 in V (c, ) and x/u 0; thus, u 0. Now, by the definition of Schur complement, w x/u = w (w P v (u )) = P v (u ) 0. Hence w x/u 0. Applying Corollary 3 in the algebra V (c, 0), we have det(w) det(x/u). Replacing det(x/u) by det(x) det(u) (see (5)) and simplifying, we get the required inequality. The inequality in the above proposition can be slightly extended. First, we introduce some notation. Let {e, e 2,..., e r } be a Jordan frame in V with subsets α and β, and their complements α and β. Define s(α) := e i α e i and x α := P s(α) (x) (x V ). Note that x α, which belongs to V (s(α), ), is nothing but a component of x in the Peirce decomposition (3) corresponding to the idempotent s(α). With this notation, the inequality in the above proposition yields: For α β = and z 0 in V, det(z α β ) det(z α ) det(z β ). (4) Also, when x and x α are invertible, we get the following from Theorem (a) and (5): (x ) α = (x/x α ) and det(x ) α = det(x α) det(x). (5) We now state the promised extension: For any α, β {e, e 2,...,e r } and x 0 in V, det(x α β ) det(x α β ) det(x α ) det(x β ). (6) To see this, assume without loss of generality, α β = {e, e 2,...,e r } and x > 0 in V. Then α β =. Applying (4) to z = x we get det((x ) α β ) det((x ) α ) det((x ) β ).
9 9 This leads, upon using determinantal relations in (5) to (6). For complex Hermitian matrices, the inequality (6) is often known as the Hadamard-Fischer inequality, see []. An immediate consequence of Proposition 2 is the following: Proposition 3 (A generalized Hadamard inequality) If x = r x ie i + i<j x ij is the Peirce decomposition of x with respect to the Jordan frame {e, e 2,..., e r } and x 0, then r det(x) x i. Theorem 3 For any idempotent c in V, consider the Peirce decomposition x = u + v + w of the form (3) with u invertible in V (c, ). If x 0, then x x/u 0. Moreover, when V is simple and c has rank k < r, λ i (x x/u) = 0 for k + i r. Proof When x 0 and u is invertible, we have u > 0 in V (c, ) and so u 0. From Theorem, we have x x/u = P x (u ) 0. Now assume that V is simple and rank of c is k < r. Since u is invertible in V (c, ), the rank of u in V (which is the number of nonzero eigenvalues of u in V ) is k. The same is true for u. Now, from Theorem in [], π(p x (u )) π(u ) = k, where π of an element is the number of positive eigenvalues of that element. Since P x (u ) cannot have any negative eigenvalues (as P x (u ) 0), it follows that λ k+ (x x/u) = λ k+ (P x(u )) = 0. This implies that λ i (x x/u) = 0 for all i k +, completing the proof. Theorem 4 For x 0 and y 0, consider Peirce decompositions x = u + v + w and y = p + q + r of the form (3) with u and p invertible in V (c, ). Then (x + y)/(u + p) x/u + y/p. Proof Noting that P v (u ), P q(p ), and P v+q((u + p) ) belong to V (c, 0) (see Theorem ), we claim that a := u + v + P v (u ) 0 and b := p + q + P q(p ) 0. As u > 0 and v > 0 in V (c, ), we have a/u = 0 and b/p = 0. By Item (ii) in Section, a 0 and b 0 in V. Hence the claim. Now a + b = (u + p) + (v + q) + [P v (u ) + P q (p )] 0 with u+p > 0 in V (c, ). Hence by Item (ii) in Section, (a +b)/(u+p) 0, that is, [P v (u ) + P q(p )] P v+q((u + p) ) 0. (7)
10 0 As x/u = w P v (u ), y/p = r P q(p ), and (x + y)/(u + p) = w + r P v+q ((u + p) ) ), we have (x + y)/(u + p) [x/u + y/p] = [P v (u This completes the proof. ) + P q(p )] P v+q((u + p) ) 0. Remarks. As x P x (u ) = x/u = w P v (u ), y P y (p ) = y/p = r P q (p ), and x + y P x+y((u + p) ) = w + r P v+q((u + p) ), the inequality (7) can be rewritten as P x (u ) + P y(p ) P x+y((u + p) ). Combining Theorem 4 with Corollaries 2 and 3, and using (5), we get the following. Corollary 4 (A Bergstrom type inequality) Let x, y, u and p be as in the previous theorem. Then det(x + y) det(u + v) det(x) det(u) + det(y) det(p). It has been observed in [0] that in a simple algebra of rank r, the following Minkowski type inequality holds for all x, y 0: [det(x + y)] r [det(x)] r + [det(y)] r. Now suppose that the conditions of Theorem 4 are in place and further suppose that V is simple, has rank r, and c has rank k < r. Then applying the above inequality in V (c, 0), which is a simple algebra of rank r k, we get [ ] [ det(x + y) r k det(x) det(u + v) det(u) ] [ ] r k det(y) r k +. det(p) This inequality can be regarded as a generalization of Ky Fan s inequality, see [4]. Proposition 4 Suppose that x, y > 0. Then for all a, b V. P a (x ) + P b (y ) 2 P a+b((x + y) ), Proof Fix a, b V. First we show that P a (u)+p b (u) 2 P a+b(u) for all u > 0. Fix u > 0. Then there exists d > 0 such that P d (e) = u (see Lemma ). Since r 2 + s 2 2 (r + s)2 for all r, s V, we have P r (e) + P s (e) 2 P r+s(e). Now, taking r = P d (a) and s = P d (b), we have P Pd (a)(e) + P Pd (b)(e) 2 P P d (a+b)(e).
11 This leads to P d P a P d (e) + P d P b P d (e) 2 P dp a+b P d (e) and P a (u) + P b (u) 2 P a+b(u). Now, put u = (x + y). Then P a ((x + y) ) + P b ((x + y) ) 2 P a+b((x + y) ). Since x+y x (x+y) x (see Corollary ), we have P a ((x+y) ) P a (x ). Similarly, P b ((x + y) ) P b (y ). Therefore, P a (x ) + P b (y ) 2 P a+b((x + y) ). Remarks. For Hermitian matrices over reals/complex numbers, the factor 2 in the above inequality is not needed, see [2], Theorem It is not clear if a similar result holds in the general case also. 5 Interlacing inequalities for Schur complements In this section, we state some interlacing inequalities involving Schur complements. First, we recall the following generalization of Weyl s theorem [6]. Theorem 5 Let V be a simple Euclidean Jordan algebra of rank r, and a, b V. Then and λ j (a) + λ r(b) λ j (a + b) λ j (a) + λ (b), j {, 2,..., r} λ i+j (a + b) λ i (a) + λ j (b), i, j {, 2,..., r}, i + j r. Theorem 6 Let V be simple with rank r. For an x 0, corresponding to an idempotent c of rank k < r, consider the Peirce decomposition x = u + v + w of the form (3) with u invertible in V (c, ). Then the sets of nonnegative numbers {λ i (x) : i =, 2,..., r} and {λ i (x/u) : i =, 2...,r k} have the same number of zeros, and λ i (x) λ i (x/u) λ i+k (x) (i =, 2,..., r k). Proof By Item (ii) of Section, x 0 implies that u > 0 and x/u 0; hence eigenvalues of x and x/u are all nonnegative. By Item (i) of Section, In(x) = In(u) + In(x/u) and so δ(x) = δ(x/u), proving the first part of the assertion. Now combining the previous theorem with Theorem 3, we get the following inequalities: λ i+k (x) = λ i+k (x/u + x x/u) λ i (x/u) + λ k+ (x x/u) = λ i (x/u); λ i (x) = λ i (x/u + x x/u) λ i (x/u) + λ r(x x/u) = λ i (x/u).
12 2 The above result admits a converse, see Section 7. It is known that the Cauchy interlacing theorem does not hold for the Schur complement of a Hermitian matrix but it holds for the reciprocals of nonsingular Hermitian matrices (see, [9], [22]), i.e., if H is an n n complex Hermitian nonsingular matrix and A is a k k nonsingular principal submatrix of H, where k < n, then λ i (H ) λ i [(H/A) ] λ i+k (H ) (i =, 2,...,n k). Combining Theorem (a) with Theorem 2, we get the following generalization: Theorem 7 Let V be simple of rank r, c be an idempotent of rank k < r, x = u + v + w (of the form (3)) be invertible in V with u invertible in V (c, ). Then λ i (x ) λ i [(x/u) ] λ i+k (x ) (i =, 2,...,r k). 6 Schur product and a determinantal inequality Consider two real symmetric matrices A = [a ij ] and B = [b ij ] in Herm(R r r ). Then the Schur (or Hadamard) product of A and B is the matrix C := [a ij b ij ]. This product enjoys numerous properties, see e.g., [2], [2], [22]. In this section, we consider a generalization of this for Euclidean Jordan algebras. Fix a Jordan frame {e, e 2,...,e r } in a Euclidean Jordan algebra V and consider the Peirce decompositions of x and y with respect to this Jordan frame: r x = x i e i + r x ij and y = y i e i + y ij. i<j i<j Let E ij be the matrix in Herm(R r r ) with ones in the (i, j) and (j, i) slots and zeros elsewhere; let E i := E ii. Now, we define the Schur (or Hadamard) product of x and y with respect to {e, e 2,..., e r } by: x y := r x i y i e i 2 E i + x ij, y ij E ij Herm(R r r ). 2 i<j It is easy to see that this definition reduces to the classical Schur product in the algebra V = Herm(R r r ) when we consider two matrices A and B whose Peirce decompositions (= usual matrix representations) are given with respect to the canonical Jordan frame {E, E 2,...,E r }. Also, the above product is bilinear and symmetric in its variables. In the rest of the section, we assume that all Schur products are defined with respect to the (fixed) Jordan frame {e, e 2,...,e r }. The following result generalizes Schur s classical theorem on Schur products to the setting of Euclidean Jordan algebras. In what follows, we use the
13 3 notation A 0 (A 0) to say that the (real) matrix A is Hermitian and positive semidefinite (respectively, Hermitian and positive definite). Theorem 8 If x 0 and y 0, then x y 0. Also, x > 0 and y > 0 imply x y 0. Proof Suppose x 0 and y 0 and let A = x y. Corresponding to any (column) vector s = [t, t 2,..., t r ] T R r, let a = r t ie i. As P a (x) = r t 2 i x i e i + t i t j x ij, i<j by the orthogonality of the Peirce spaces V ij, we have s T As = r i= x i y i e i 2 t 2 i + i<j x ij, y ij t i t j = P a (x), y. Since x 0 and P a (K) K, we see that P a (x) 0. Thus, P a (x), y 0. This means that A is positive semidefinite. When x, y > 0 and t i 0 for some i, we have 0 P a (x) 0. Hence s T As = P a (x), y > 0. This proves that A 0. The following result provides a necessary condition for an object x to be in the symmetric cone K. In particular, it proves the well-known inequality x ij 2 2x i x j when 0 x = r i= x ie i + i<j x ij, see [5], Exercise 7(b), page 80. Corollary 5 If x 0, then x x 0. We recall the generalized Hadamard inequality det(x) x i when the Peirce decomposition of x 0 is given. The following inequality, which generalizes the so-called Oppenheim inequality of matrix theory, gives a lower bound on the determinant of x y. Theorem 9 (A generalized Oppenheim inequality) Suppose x 0, y 0, and let δ := r e i 2. Then det(x)det(y) (x x r )det(y) r r δ det(x y) ( x i )( y i ). Proof A general Euclidean Jordan algebra is a product of simple algebras. Since determinants, Schur complements, and Schur products can be studied by working with components, we prove the above result by assuming that V is simple. Also, by continuity, it is enough to prove the inequalities for x > 0 and y > 0. Now the first and last inequalities come from the generalized Hadamard inequality (see Prop. 3) applied to x and x y, respectively; we prove only the second inequality. Our proof is by induction on the rank r. There is nothing
14 4 to prove when r =, so assume r > and that the result holds in all algebras of rank r. Corresponding to the Jordan frame {e, e 2,...,e r }, let c = e and consider the Peirce decompositions of the form (3): x = u + v + w and y = p + q + r, where u = x e and p = y e. Now consider z := p + q + P q (y e ). Since p > 0 in V (c, ) and z/p = P q (y e ) P q (y e ) = 0, by Item (ii) of the Introduction, z 0. By the previous theorem, x z = u p + v q + w P q (y e ) 0. Note that u p = x y e 2 E and the right-hand side in the above expression is nothing but the decomposition of x z of the form (3) with respect to the idempotent E in Herm(R r r ). To simplify the notation, let µ := x y e 2 so that u p = µ E. As x > 0 and y > 0, we can compute the Schur complement of u p in x z and get 0 (x z)/(u p) = w P q (y e ) P v q (µ E ). Replacing P q (y e ) by r y/p in the above expression and simplifying, we get w r P v q (µ E ) w (y/p). Now, implies x y = µ E + v q + w r (x y)/(µ E ) = w r P v q (µ E ) w (y/p). Using the well-known implication in matrix theory, namely, A B 0 det(a) det(b), we get By the induction hypothesis and (0), det(x y/(µ E )) det(w (y/p)). det(w (y/p)) (x 2 x r )( r e i 2 )det(y/p). 2 From the determinantal formula (5) applied to x y/(µ E ) and y/p, along with det(p) = y and µ = x y e 2, we have det(x y) x y e 2 (x 2 x r ) ( This completes the proof. r e i 2 ) det(y)/y = δ (x x r )det(y). 2
15 5 Recall that for z V or for a Hermitian matrix z, λ i (z) (i =, 2,..., r) denote the eigenvalues of z written in the decreasing order. We use the familiar notation λ (z) = λ max(z) and λ r(z) = λ min (z). We also recall that in any simple algebra, the norms of all primitive idempotents are the same. Theorem 0 Let V be simple and θ := c 2 for any primitive idempotent c. If x 0 and y 0, then for all i =, 2,...,r, Proof Let x i λ min(y)θ λ i (x y) x i λ max(y)θ. a := λ max (y)e y and b := y λ min (y)e, where e = e + e e r is the unit element in V. It is easy to verify that a 0 and b 0. Then we have x a 0 x y λ max (y)x e, and x b 0 x y λ min (y)x e. We note that x e is a diagonal matrix with entries x i θ for i =,...,r. Using the well-known fact that A B in Herm(R r r ) implies λ i (A) λ i (B) for all i, we have This completes the proof. x i λ min(y)θ λ i (x y) x i λ max(y)θ. For a real Hermitian positive definite matrix A, the (Schur product) inequality A A I holds. This is referred to as Fiedler s inequality in []. A generalization of this result is given below. Theorem If x > 0, then x x r e i 2 E i. In particular, when V is simple, x x θi, where θ := e i 2 for any i. Proof Corresponding to the idempotent c := e, consider the Peirce decompositions of the form (3): x = u + v + w and y := x = p + q + r. As x, y > 0, u and r are invertible in their respective algebras. Then, as in the proof of Theorem 9, By Theorem 8, Now putting P v (u u + v + P v (u ) 0 and P q (r ) + q + r 0. ( u + v + Pv (u ) ) ( P q (r ) + q + r ) 0. ) = w x/u, P q (r ) = p y/r, and simplifying, we get u (p y/r) + v q + (w x/u) r 0
16 6 which yields, u p + v q + w r u (y/r) + (x/u) r. Note that the left-hand side of the above inequality is x x. In view of Theorem (a), the right-hand side of the above inequality is Thus, u u + r r = (x e ) ( e ) + r r = e 2 E + r r x. x x e 2 E + r r. By repeating this argument (or by induction), we may write r r This leads to r x x e i 2 E i. r 2 e i 2 E i. When V is simple, θ = e i 2 is a constant for all i and the stated result follows. 7 Miscellaneous In [3], Hu and Smith showed that converse of Theorem 6 holds for complex Hermitian matrices. It turns out that a similar result holds in any simple Euclidean Jordan algebra. Theorem 2 For k < r, consider two sets of nonnegative real numbers {α, α 2,...,α r } and {β, β 2,...,β r k }, both arranged in the decreasing order, having the same number of zeros, and α i β i α i+k 0 for all i =, 2,...,r k. Let V be any simple Euclidean Jordan algebra of rank r and c ( 0, e) be any idempotent of rank k. Then there exists x 0 in V with u = P c (x) invertible in V (c, ) and λ i (x) = α i and λ j (x/u) = β j for all i =, 2,...,r and j =, 2,...,r k. Proof Corresponding to the given α i and β j, there exists a real symmetric positive semidefinite matrix H with k k nonsingular submatrix A such that the eigenvalues of H and H/A are α i and β j, respectively, see [3]. Since real numbers are included in complex numbers/quaternions/octonions, we have the result in the case of matrix algebras (and also in algebras isomorphic to these). Now consider the algebra L n (see Section 2) for n > 2. Recall that rank of L n is 2. Let c be a nonzero, non-unit idempotent in L n. Then there is a Jordan frame {e, e 2 } such that (see Section 2) c = e = [ ] 2 u and e 2 = [ ] 2 u for some u R (n ) with u =. Corresponding to this Jordan frame, the Peirce decomposition of any x L n is: x = x e + x 2 e 2 + x 2. Then
17 7 u = x e V (c, ), v = x 2 V (c, 2 ) and w = x 2e 2 V (c, 0). We are given that the sets {α, α 2 } and {β } have the same number of zeros and α β α 2 0. To complete the proof, we have to construct an element x whose Peirce decomposition and eigenvalues are given by [ ] [ ] x0 0 x = x = x e + x 2 e 2 + z, (8) α = λ (x) = x 0 + x, α 2 = λ 2 (x) = x 0 x, and β = λ (x/u) = det(x/u) = det(x) det(u) = αα2 x. Case : β 0. Then α 0 α 2. As n > 2, we can take z R n, such that z αα = 2(β α 2)(α β ) β and z, u = 0. Now define x 0 = 2 (α +α 2 ), x = αα2 β, x 2 = 2x 0 x, and x = 2 (x x 2 )u +z. Then it is easily verified that x defined by (8) will have the right properties. Case 2: β = 0. Because of our assumptions, α > 0 = α 2. Now take x = α, x 2 = 0, x 0 = 2 α, z = 0, and x = 2 α u. Then it is easily verified that x defined by (8) will have the right properties. This completes the proof. In matrix theory, for any two real symmetric matrices, the rank of a Schur product satisfies the inequality [2] rank(a B) rank(a)rank(b). The following example shows this result need not hold in the setting of Euclidean Jordan algebras. Example. Let V = L 4. Let e = 2 [ 0 0 ]T, e 2 = 2 [ 0 0 ]T, x 2 = [ ] T and y 2 = [ ] T. Then, it is easy to verify that x := e + e 2 + x 2 0, y := e + e 2 + y 2 0, while rank(x) = rank(y) =, rank(x y) = 2. References. Bapat, R.B., Raghavan, T.E.S.: Nonnegative Matrices and Applications. Cambridge University Press, Cambridge (997) 2. Cohen, N., De Leo, S.: The quaternionic determinant. Elect. J. Linear Algebra. 7, 00 (2000) 3. Dray, T., Manogue, C.A.: The octonionic eigenvalue problem. Adv. Appl. Clifford Algebr. 8, (998) 4. Fan, K.: Generalization of Bergstrom s Inequality. The Amer. Math. Monthly. 66, (959) 5. Faraut, J., Korányi, A.: Analysis on Symmetric Cones. Clarendon Press, Oxford (994) 6. Koufany, K.: Contractions of angles in symmetric spaces. Publ. RIMS, Kyoto University. 38, (2002) 7. Gowda, M.S., Sznajder, R.: Automorphism invariance of P and GUS properties of linear transformations in Euclidean Jordan algebras. Math. Oper. Res. 3, (2006)
18 8 8. Gowda, M.S., Sznajder, R.: Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras. Linear Algebra Appl. 432, (200) 9. Gowda, M.S., Sznajder, R., Tao, J.: Some P-properties for linear transformations on Euclidean Jordan algebras. Linear Algebra Appl. 393, (2004) 0. Gowda, M.S., Tao, J.: The Cauchy interlacing theorem in simple Euclidean Jordan algebras and some consequences. Linear Multilinear Algebra. To appear.. Gowda, M.S., Tao, J., Moldovan, M.M.: Some inertia theorems in Euclidean Jordan algebras. Linear Algebra Appl. 430, (2009) 2. Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (985) 3. Hu, S.-A., Smith. R.L.: The Schur complement interlacing theorem. SIAM J. Matrix Anal. 6, (995) 4. Loos, O.: Finiteness condition in Jordan pairs. Math. Z. 206, (99) 5. Massam, H., Neher, E.: On transformations and determinants of Wishart variables on symmetric cones. J. Theoret. Probab. 0, (997) 6. Moldovan, M.M.: A Ger sgorin type theorem, spectral inequalities, and simultaneous stability in Euclidean Jordan algebras. PhD Thesis, University of Maryland Baltimore County (2009) 7. Moldovan, M.M., Gowda, M.S.: Strict diagonal dominance and a Ger sgorin type theorem in Euclidean Jordan algebras. Linear Algebra Appl. 43, 48 6 (2009) 8. Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program, Series A. 96, (2003) 9. Smith, R.L.: Some interlacing properties of the Schur complement of a Hermitian matrix. Linear Algebra Appl. 77, (992) 20. Tao, J.: Some P-Properties for Linear Transformations on the Lorentz Cone. PhD Thesis, University of Maryland Baltimore County (2004) 2. Zhang, F.: Matrix Theory. Springer-Verlag, New York (999) 22. Zhang, F.: The Schur Complement and its Applications. Springer, New York (2005)
Strict diagonal dominance and a Geršgorin type theorem in Euclidean
Strict diagonal dominance and a Geršgorin type theorem in Euclidean Jordan algebras Melania Moldovan Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
More informationComplementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras
Optimization Methods and Software Vol. 00, No. 00, January 2009, 1 14 Complementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras M. Seetharama Gowda a, J. Tao
More informationM. Seetharama Gowda. J. Tao. G. Ravindran
Some complementarity properties of Z and Lyapunov-like transformations on symmetric cones M. Seetharama Gowda Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore,
More informationPositive and doubly stochastic maps, and majorization in Euclidean Jordan algebras
Positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
More informationThe eigenvalue map and spectral sets
The eigenvalue map and spectral sets p. 1/30 The eigenvalue map and spectral sets M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
More informationM. Seetharama Gowda a, J. Tao b & Roman Sznajder c a Department of Mathematics and Statistics, University of Maryland
This article was downloaded by: [University of Maryland Baltimore County] On: 03 April 2013, At: 09:11 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954
More informationKey words. Complementarity set, Lyapunov rank, Bishop-Phelps cone, Irreducible cone
ON THE IRREDUCIBILITY LYAPUNOV RANK AND AUTOMORPHISMS OF SPECIAL BISHOP-PHELPS CONES M. SEETHARAMA GOWDA AND D. TROTT Abstract. Motivated by optimization considerations we consider cones in R n to be called
More informationOn the game-theoretic value of a linear transformation relative to a self-dual cone
On the game-theoretic value of a linear transformation relative to a self-dual cone M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland
More informationMatrix Inequalities by Means of Block Matrices 1
Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,
More informationPermutation invariant proper polyhedral cones and their Lyapunov rank
Permutation invariant proper polyhedral cones and their Lyapunov rank Juyoung Jeong Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA juyoung1@umbc.edu
More informationA PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE
Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ
More informationOn the game-theoretic value of a linear transformation on a symmetric cone
On the game-theoretic value of a linear transformation ona symmetric cone p. 1/25 On the game-theoretic value of a linear transformation on a symmetric cone M. Seetharama Gowda Department of Mathematics
More informationWe describe the generalization of Hazan s algorithm for symmetric programming
ON HAZAN S ALGORITHM FOR SYMMETRIC PROGRAMMING PROBLEMS L. FAYBUSOVICH Abstract. problems We describe the generalization of Hazan s algorithm for symmetric programming Key words. Symmetric programming,
More informationSome characterizations of cone preserving Z-transformations
Annals of Operations Research manuscript No. (will be inserted by the editor) Some characterizations of cone preserving Z-transformations M. Seetharama Gowda Yoon J. Song K.C. Sivakumar This paper is dedicated,
More informationL. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. log-det barrier 18-1
L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones definition spectral decomposition quadratic representation log-det barrier 18-1 Introduction This lecture: theoretical properties of the following
More informationThe Jordan Algebraic Structure of the Circular Cone
The Jordan Algebraic Structure of the Circular Cone Baha Alzalg Department of Mathematics, The University of Jordan, Amman 1194, Jordan Abstract In this paper, we study and analyze the algebraic structure
More informationELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES
ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES ZHONGPENG YANG AND XIAOXIA FENG Abstract. Under the entrywise dominance partial ordering, T.L. Markham
More informationSCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE
SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
More informationSpectral sets and functions on Euclidean Jordan algebras
Spectral sets and functions on Euclidean Jordan algebras Juyoung Jeong Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA juyoung1@umbc.edu
More informationON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION
J. Appl. Math. & Informatics Vol. 33(2015), No. 1-2, pp. 229-234 http://dx.doi.org/10.14317/jami.2015.229 ON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION YOON J. SONG Abstract. In the setting
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko
More informationAbstract. In this article, several matrix norm inequalities are proved by making use of the Hiroshima 2003 result on majorization relations.
HIROSHIMA S THEOREM AND MATRIX NORM INEQUALITIES MINGHUA LIN AND HENRY WOLKOWICZ Abstract. In this article, several matrix norm inequalities are proved by making use of the Hiroshima 2003 result on majorization
More informationPositive definite preserving linear transformations on symmetric matrix spaces
Positive definite preserving linear transformations on symmetric matrix spaces arxiv:1008.1347v1 [math.ra] 7 Aug 2010 Huynh Dinh Tuan-Tran Thi Nha Trang-Doan The Hieu Hue Geometry Group College of Education,
More informationGeometric Mapping Properties of Semipositive Matrices
Geometric Mapping Properties of Semipositive Matrices M. J. Tsatsomeros Mathematics Department Washington State University Pullman, WA 99164 (tsat@wsu.edu) July 14, 2015 Abstract Semipositive matrices
More informationarxiv: v1 [math.ra] 8 Apr 2016
ON A DETERMINANTAL INEQUALITY ARISING FROM DIFFUSION TENSOR IMAGING MINGHUA LIN arxiv:1604.04141v1 [math.ra] 8 Apr 2016 Abstract. In comparing geodesics induced by different metrics, Audenaert formulated
More informationOn Euclidean distance matrices
On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More information2.1. Jordan algebras. In this subsection, we introduce Jordan algebras as well as some of their basic properties.
FULL NESTEROV-TODD STEP INTERIOR-POINT METHODS FOR SYMMETRIC OPTIMIZATION G. GU, M. ZANGIABADI, AND C. ROOS Abstract. Some Jordan algebras were proved more than a decade ago to be an indispensable tool
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationLecture 1 and 2: Random Spanning Trees
Recent Advances in Approximation Algorithms Spring 2015 Lecture 1 and 2: Random Spanning Trees Lecturer: Shayan Oveis Gharan March 31st Disclaimer: These notes have not been subjected to the usual scrutiny
More informationFischer-Burmeister Complementarity Function on Euclidean Jordan Algebras
Fischer-Burmeister Complementarity Function on Euclidean Jordan Algebras Lingchen Kong, Levent Tunçel, and Naihua Xiu 3 (November 6, 7; Revised December, 7) Abstract Recently, Gowda et al. [] established
More informationUsing Schur Complement Theorem to prove convexity of some SOC-functions
Journal of Nonlinear and Convex Analysis, vol. 13, no. 3, pp. 41-431, 01 Using Schur Complement Theorem to prove convexity of some SOC-functions Jein-Shan Chen 1 Department of Mathematics National Taiwan
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationSome parametric inequalities on strongly regular graphs spectra
INTERNATIONAL JOURNAL OF PURE MATHEMATICS Volume 3, 06 Some parametric inequalities on strongly regular graphs spectra Vasco Moço Mano and Luís de Almeida Vieira Email: vascomocomano@gmailcom Faculty of
More informationJordan-algebraic aspects of optimization:randomization
Jordan-algebraic aspects of optimization:randomization L. Faybusovich, Department of Mathematics, University of Notre Dame, 255 Hurley Hall, Notre Dame, IN, 46545 June 29 2007 Abstract We describe a version
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationMoore Penrose inverses and commuting elements of C -algebras
Moore Penrose inverses and commuting elements of C -algebras Julio Benítez Abstract Let a be an element of a C -algebra A satisfying aa = a a, where a is the Moore Penrose inverse of a and let b A. We
More informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationThe Q Method for Symmetric Cone Programming
The Q Method for Symmetric Cone Programming Farid Alizadeh Yu Xia October 5, 010 Communicated by F. Potra Abstract The Q method of semidefinite programming, developed by Alizadeh, Haeberly and Overton,
More informationUniqueness of the Solutions of Some Completion Problems
Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive
More informationSparse Recovery on Euclidean Jordan Algebras
Sparse Recovery on Euclidean Jordan Algebras Lingchen Kong, Jie Sun, Jiyuan Tao and Naihua Xiu February 3, 2013 Abstract We consider the sparse recovery problem on Euclidean Jordan algebra (SREJA), which
More informationZ-transformations on proper and symmetric cones
Math. Program., Ser. B DOI 0.007/s007-007-059-8 FULL LENGTH PAPER Z-transformations on proper and symmetric cones Z-transformations M. Seetharama Gowda Jiyuan Tao Received: 6 February 006 / Accepted: 5
More informationMath 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.
Math 443 Differential Geometry Spring 2013 Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Endomorphisms of a Vector Space This handout discusses
More informationMAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM
MAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM OLGA SLYUSAREVA AND MICHAEL TSATSOMEROS Abstract. The principal pivot transform (PPT) is a transformation of a matrix A tantamount to exchanging
More informationSYLLABUS. 1 Linear maps and matrices
Dr. K. Bellová Mathematics 2 (10-PHY-BIPMA2) SYLLABUS 1 Linear maps and matrices Operations with linear maps. Prop 1.1.1: 1) sum, scalar multiple, composition of linear maps are linear maps; 2) L(U, V
More informationMINIMAL NORMAL AND COMMUTING COMPLETIONS
INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 4, Number 1, Pages 5 59 c 8 Institute for Scientific Computing and Information MINIMAL NORMAL AND COMMUTING COMPLETIONS DAVID P KIMSEY AND
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationTHIS paper is an extended version of the paper [1],
INTERNATIONAL JOURNAL OF MATHEMATICAL MODELS AND METHODS IN APPLIED SCIENCES Volume 8 04 Alternating Schur Series and Necessary Conditions for the Existence of Strongly Regular Graphs Vasco Moço Mano and
More informationError bounds for symmetric cone complementarity problems
to appear in Numerical Algebra, Control and Optimization, 014 Error bounds for symmetric cone complementarity problems Xin-He Miao 1 Department of Mathematics School of Science Tianjin University Tianjin
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationMatrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein
Matrix Mathematics Theory, Facts, and Formulas with Application to Linear Systems Theory Dennis S. Bernstein PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Special Symbols xv Conventions, Notation,
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More information2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian
FE661 - Statistical Methods for Financial Engineering 2. Linear algebra Jitkomut Songsiri matrices and vectors linear equations range and nullspace of matrices function of vectors, gradient and Hessian
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationUniversity of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm
University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm Name: The proctor will let you read the following conditions
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationSecond-order cone programming
Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The
More informationSupplementary Notes on Linear Algebra
Supplementary Notes on Linear Algebra Mariusz Wodzicki May 3, 2015 1 Vector spaces 1.1 Coordinatization of a vector space 1.1.1 Given a basis B = {b 1,..., b n } in a vector space V, any vector v V can
More informationTrace Inequalities for a Block Hadamard Product
Filomat 32:1 2018), 285 292 https://doiorg/102298/fil1801285p Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Trace Inequalities for
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2017 LECTURE 5
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 17 LECTURE 5 1 existence of svd Theorem 1 (Existence of SVD) Every matrix has a singular value decomposition (condensed version) Proof Let A C m n and for simplicity
More informationELA
THE DISTANCE MATRIX OF A BIDIRECTED TREE R. B. BAPAT, A. K. LAL, AND SUKANTA PATI Abstract. A bidirected tree is a tree in which each edge is replaced by two arcs in either direction. Formulas are obtained
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationTopics in Applied Linear Algebra - Part II
Topics in Applied Linear Algebra - Part II April 23, 2013 Some Preliminary Remarks The purpose of these notes is to provide a guide through the material for the second part of the graduate module HM802
More information(K + L)(c x) = K(c x) + L(c x) (def of K + L) = K( x) + K( y) + L( x) + L( y) (K, L are linear) = (K L)( x) + (K L)( y).
Exercise 71 We have L( x) = x 1 L( v 1 ) + x 2 L( v 2 ) + + x n L( v n ) n = x i (a 1i w 1 + a 2i w 2 + + a mi w m ) i=1 ( n ) ( n ) ( n ) = x i a 1i w 1 + x i a 2i w 2 + + x i a mi w m i=1 Therefore y
More informationProduct distance matrix of a tree with matrix weights
Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian
More informationJordan Canonical Form of A Partitioned Complex Matrix and Its Application to Real Quaternion Matrices
COMMUNICATIONS IN ALGEBRA, 29(6, 2363-2375(200 Jordan Canonical Form of A Partitioned Complex Matrix and Its Application to Real Quaternion Matrices Fuzhen Zhang Department of Math Science and Technology
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationFuzhen Zhang s Publication List
Fuzhen Zhang s Publication List Papers in peer-reviewed journals 1. Inequalities of generalized matrix functions via tensor products, with Vehbi E. Paksoy and Ramazan Turkmen, Electron. J. Linear Algebra,
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More information6 Inner Product Spaces
Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW JC Stuff you should know for the exam. 1. Basics on vector spaces (1) F n is the set of all n-tuples (a 1,... a n ) with a i F. It forms a VS with the operations of + and scalar multiplication
More informationAn LMI description for the cone of Lorentz-positive maps
An LMI description for the cone of Lorentz-positive maps Roland Hildebrand January 17, 2006 Abstract Let L n be the n-dimensional second order cone. A linear map from R m to R n is called positive if the
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More informationSome inequalities for sum and product of positive semide nite matrices
Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationLecture notes: Applied linear algebra Part 1. Version 2
Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and
More informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More informationMATH 425-Spring 2010 HOMEWORK ASSIGNMENTS
MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT
More information(6) For any finite dimensional real inner product space V there is an involutive automorphism α : C (V) C (V) such that α(v) = v for all v V.
1 Clifford algebras and Lie triple systems Section 1 Preliminaries Good general references for this section are [LM, chapter 1] and [FH, pp. 299-315]. We are especially indebted to D. Shapiro [S2] who
More informationHUA S MATRIX EQUALITY AND SCHUR COMPLEMENTS
INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 3, Number 1, Pages 1 18 c 2007 Institute for Scientific Computing and Information HUA S MATRIX EQUALITY AND SCHUR COMPLEMENTS CHRIS PAGE,
More informationOctober 25, 2013 INNER PRODUCT SPACES
October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal
More informationIndex. Banach space 630 Basic Jordan block 378, 420
Index Absolute convergence 710 Absolute value 15, 20 Accumulation point 622, 690, 700 Adjoint classsical 192 of a linear operator 493, 673 of a matrix 183, 384 Algebra 227 Algebraic number 16 Algebraically
More informationAnother algorithm for nonnegative matrices
Linear Algebra and its Applications 365 (2003) 3 12 www.elsevier.com/locate/laa Another algorithm for nonnegative matrices Manfred J. Bauch University of Bayreuth, Institute of Mathematics, D-95440 Bayreuth,
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationarxiv: v3 [math.ra] 10 Jun 2016
To appear in Linear and Multilinear Algebra Vol. 00, No. 00, Month 0XX, 1 10 The critical exponent for generalized doubly nonnegative matrices arxiv:1407.7059v3 [math.ra] 10 Jun 016 Xuchen Han a, Charles
More informationOrthogonal similarity of a real matrix and its transpose
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 382 392 www.elsevier.com/locate/laa Orthogonal similarity of a real matrix and its transpose J. Vermeer Delft University
More informationAnn. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:
Ann Funct Anal 5 (2014), no 2, 127 137 A nnals of F unctional A nalysis ISSN: 2008-8752 (electronic) URL:wwwemisde/journals/AFA/ THE ROOTS AND LINKS IN A CLASS OF M-MATRICES XIAO-DONG ZHANG This paper
More informationHermitian octonion matrices and numerical ranges
Electronic Journal of Linear Algebra Volume 27 Article 33 2014 Hermitian octonion matrices and numerical ranges Leiba Rodman lxrodm@gmail.com Follow this and additional works at: http://repository.uwyo.edu/ela
More informationLargest dual ellipsoids inscribed in dual cones
Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that
More information