Positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras
|
|
- Eleanore Shelton
- 5 years ago
- Views:
Transcription
1 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 2250, USA Aug 5, 205, Revised January 20, 206 Abstract A positive map between Euclidean Jordan algebras is a (symmetric cone) order preserving linear map. We show that the norm of such a map is attained at the unit element, thus obtaining an analog of the operator/matrix theoretic Russo-Dye theorem. A doubly stochastic map between Euclidean Jordan algebras is a positive, unital, and trace preserving map. We relate such maps to Jordan algebra automorphisms and majorization. Key Words: Euclidean Jordan algebra, positive map, doubly stochastic map, majorization AMS Subject Classification: 5A8, 5A48, 5B5, 5B57, 7C30. Dedication: This paper is dedicated, with much admiration and appreciation, to Professor Rajendra Bhatia on the occasion of his 65th birthday.
2 Introduction This paper deals with positive and doubly stochastic maps, and majorization in Euclidean Jordan algebras. In the first part of the paper, we describe the spectral norm of a positive map between Euclidean Jordan algebras. To elaborate, consider the space M n of all n n complex matrices and its real subspace H n of all n n Hermitian matrices. A complex linear map Φ : M n M k is said to be positive [5] if Φ maps positive semidefinite (Hermitian) matrices in M n to positive semidefinite matrices in M k. For such a map, the following result a consequence of the so called the Russo-Dye Theorem [5] holds: Φ = Φ(I), where the norms are operator norms. Now, by writing A for the spectral norm/radius of A H n, observing A = A, and restricting Φ to H n, the above relation yields Φ = Φ(I), () where Φ is the operator norm of Φ : (H n, ) (H k, ). In this paper, we show that () extends to any positive map between Euclidean Jordan algebras. A Euclidean Jordan algebra is a finite dimensional real inner product space with a compatible Jordan product. In such an algebra, the cone of squares induces a partial order with respect to which the positivity of a map is defined. Using the spectral decomposition of an element in such an algebra, one defines eigenvalues and the spectral norm. It is in this setting, a generalization of () is proved. We remark that unlike C -algebras which are associative, Euclidean Jordan algebras are non-associative. Along with the positivity result, we prove an analog of the following spread inequality stated for any two positive maps Φ and Φ 2 from M n to M k and any x H n [6]: Φ (x) Φ 2 (x) λ (x) λ n(x), (2) where λ (x) and λ n(x) are the largest and smallest eigenvalues of x H n. The second part of the paper deals with doubly stochastic maps and majorization. Given two vectors x and y in R n, we say that x is majorized by y and write x y [6] if their decreasing rearrangements x and y satisfy k k x i y i and n x i = n y i for all k n. When this happens, a theorem of Hardy, Littlewood, and Polya ([3], Theorem II..0) says that x = Dy, where D is a doubly stochastic matrix (which means that D is a nonnegative matrix with row and column sums equal to one). In addition, by a theorem of Birkhoff ([3], Theorem II.2.3), there exist positive numbers λ i and permutation matrices P i such that N λ i = and x = N λ i P i y. (3) 2
3 Now for given Hermitian matrices X and Y in H n, one says that X is majorized by Y (see [], page 234) if λ (X) λ (Y ), where λ (X) denotes the vector of eigenvalues of X written in the decreasing order, etc. In this case, it is known, (see e.g., [], Theorem 7.) X = Φ(Y ) for some linear map Φ : H n H n (equivalently, Φ : M n M n ) that is doubly stochastic (which means that Φ is positive, unital, and trace preserving, see Section 2 for definitions). Moreover, there exist positive numbers λ i and unitary matrices U i such that N λ i = and X = N λ i Ui Y U i. (4) With the observations that R n and H n are two instances of Euclidean Jordan algebras and permutation matrices on R n and maps of the form X U XU (with unitary U) on H n are Jordan algebra automorphisms (these are invertible linear maps that preserve the Jordan product), we extend the above two results to Euclidean Jordan algebras. By defining x y to mean λ (x) λ (y), we show that in any Euclidean Jordan algebra V, the convex hull of the (algebra) automorphism group Aut(V ) and the set of all doubly stochastic maps DS(V) are related by conv (Aut(V)) y DS(V) y {x V : x y} (y V ), with equalities when V is a simple Euclidean Jordan algebra. In addition, we show that for the Jordan spin algebra L n, conv (Aut(L n )) = DS(L n ). (5) An outline of the paper is as follows. In Section 2, we cover some preliminary material. Section 3 deals with a consequence of Hirzebruch s min-max theorem and the spectral norm. In Section 4, we prove analogs of () and (2) for Euclidean Jordan algebras. Examples of doubly stochastic maps on Euclidean Jordan algebras are given in Section 5. Majorization results are covered in Section 6. In Sections 7 and 8, we relate Jordan algebra automorphisms and doubly stochastic maps. 2 Preliminaries Throughout this paper, V and V denote Euclidean Jordan algebras. Recall that a Euclidean Jordan algebra V is a finite dimensional real vector space that carries an inner product x, y (with induced norm x ) and a bilinear Jordan product x y satisfying the following properties: (a) x y = y x. (b) x (x 2 y) = x 2 (x y), where x 2 = x x, (c) x y, z = x, y z. It is known that every Euclidean Jordan algebra has a unit element e that satisfies x e = x for all x. The monograph [8] is our primary source on Euclidean Jordan algebras; for a short summery relevant to our study, see [0]. 3
4 Clearly, R n, with the usual inner product and componentwise product, is a Euclidean Jordan algebra. It is well-known that every nonzero Euclidean Jordan algebra is isomorphic to a product of the following simple algebras: (i) the algebra S n of all n n real symmetric matrices, (ii) the algebra H n of n n complex Hermitian matrices, (iii) the algebra Q n of n n quaternion Hermitian matrices, (iv) the algebra O 3 of 3 3 octonion Hermitian matrices, and (v) the Jordan spin algebra L n, n 3. In all the matrix algebras above, the Jordan product and inner product are respectively given by X Y = XY + Y X 2 and X, Y = Re tr(xy ), where the trace of a matrix is the sum of its diagonal elements. The Jordan spin algebra L n is defined as follows. For n >, consider R n with the usual inner product. Writing any element x R n as [ ] x0 x = x with x 0 R and x R n, we define the Jordan product: [ ] [ ] [ x0 y0 x, y x y = := x y x 0 y + y 0 x Then L n denotes the Euclidean Jordan algebra (R n,,, ). In a Euclidean Jordan algebra V, we let V + = {x x : x V } ]. (6) denote its symmetric cone. This closed convex cone is self-dual and homogeneous. In particular, x V + x, y 0 y V +. (7) In V, we write x y (or y x) when x y V +. An element c in V is an idempotent if c 2 = c; it is a primitive idempotent if it is nonzero and cannot be written as a sum of two nonzero idempotents. The set of all primitive idempotents in V, denoted by τ(v ), is a compact set, see [8], page 78. For each c τ(v ), we let c := c e, c (= 4 c c 2 ).
5 A Jordan frame in V is a set {e, e 2,..., e r }, where each e i is a primitive idempotent, e i e j = 0 for all i j, and e = e + e e r. In V, any two Jordan frames will have the same number of objects; this number is the rank of V. Throughout this paper, we let V and V denote Euclidean Jordan algebras with respective symmetric cones V + and V +, and respective unit elements e and e. Ranks of V and V are denoted by r and s respectively. Any element x V will have a spectral decomposition x = x e + x 2 e x r e r, (8) where {e, e 2,..., e r } is a Jordan frame and the real numbers x, x 2,..., x r are (called) the eigenvalues of x. As e i, e j = 0 for all i j, we note that x i := x, e i e i, e i = x, e i e, e i = x, ē i, i =, 2,..., r. We define λ(x) to be any vector in R r with components x, x 2,..., x r and λ (x) be its (unique) decreasing rearrangement. In particular, we write Then λ (x) := max {x, x 2,..., x r } and λ r(x) := min{x, x 2,..., x r }. The trace and the spectral norm of x are respectively defined by tr(x) := r x i and x := max i r x i. x, y tr := tr(x y) defines the canonical inner product on V which is also compatible with the Jordan product on V. Various concepts/results/decompositions remain the same when the given inner product is replaced by the canonical inner product; in particular, for an element, the spectral decomposition, eigenvalues, and trace remain the same. We note that under the canonical inner product, the norm of any element x, via (8), is x 2 := x, x tr = r x i 2. In particular, in this setting, the norm of a primitive idempotent is one and tr(x) = x, e tr. When V is simple, the given inner product is a (positive) multiple of the canonical inner product, see Prop. III.4. in [8]. Given Euclidean Jordan algebras V and V, we let B(V, V ) denote the set of all (continuous) linear maps from V to V. Note that B(V, V ) is a (finite dimensional) normed linear space with respect to the operator norm. We recall the following. An invertible linear transformation Γ B(V, V ) is 5
6 (i) a (Jordan) algebra automorphism if (ii) a (symmetric) cone automorphism if Γ(x y) = Γ(x) Γ(y) x, y V ; Γ(V + ) = V + ; (iii) orthogonal if Γ(x), Γ(y) = x, y for all x, y V. We recall that a complex linear map Φ : M n M k is doubly stochastic [] if it is positive, unital (which means, Φ maps the identity matrix in M n to identity matrix in M k ), and trace preserving (that is, tr(φ(x)) = tr(x) for all X M n ). We have an analogous definition for Euclidean Jordan algebras. A linear map Φ : V V is said to be (a) positive if Φ(V + ) V +, (b) unital if Φ(e) = e, (c) trace preserving if tr(φ(x)) = tr(x) for all x V, and (d) doubly stochastic if it is positive, unital, and trace preserving. Recall that the transpose of a linear map Φ : V V is the map Φ T : V V defined by: Φ(x), y = x, Φ T (y ) for all x V and y V. We have the following. (i) The positivity of Φ : V V is equivalent to that of Φ T : V V. (This is an easy consequence of (7)). (ii) When V and V carry canonical inner products, the trace preserving (unital) property of Φ is equivalent to the unital (respectively, trace preserving) property of Φ T. This can be seen by observing x, e = tr(x) = tr(φ(x)) = Φ(x), e = x, Φ T (e ). (9) In particular, when V is simple and Φ B(V, V ), Φ is doubly stochastic if and only if its transpose is doubly stochastic. We respectively write Aut(V ), Aut(V + ), Orth(V ), and DS(V ) for the set of all algebra automorphisms, cone automorphisms, orthogonal maps, and doubly stochastic maps. It is easy to see that algebra automorphisms of R n are just permutation matrices. As noted in [0], algebra automorphisms of H n (of S n ) are given by Φ(X) = U XU for some unitary (respectively, real orthogonal) matrix U and those of L n are given by matrices of the form [ ] 0 Ψ =, 0 D for some orthogonal matrix D on R n. 6
7 Let V and V 2 be two Euclidean Jordan algebras. We define the Jordan and inner products on V V 2 by (x, x 2 ) (y, y 2 ) = (x y, x 2 y 2 ) and (x, x 2 ), (y, y 2 ) = x, y + x 2, y 2. If Φ i Aut(V i ) for i =, 2, then the map (Φ, Φ 2 ) : (x, x 2 ) (Φ(x ), Φ(x 2 )) is in Aut(V V 2 ). In the following result (which is perhaps known), we state a converse and sketch a proof. Proposition Let V and V 2 be two non-isomorphic simple Euclidean Jordan algebras with Φ Aut(V V 2 ). Then Φ is of the form (Φ, Φ 2 ) for some Φ i Aut(V i ) for i =, 2. Proof. We assume without loss of generality that V and V 2 carry canonical inner products. To simplify the notation, we write Φ in the (block) form: [ ] A B Φ =, C D where A : V V, B : V 2 V, C : V V 2, and D : V 2 V 2 are linear transformations. We show that A and D are algebra automorphisms, and B and C are zero. Now, for x i and y i in V i, A(x y ) + B(x 2 y 2 ) = (Ax + Bx 2 ) (Ay + By 2 ) C(x y ) + D(x 2 y 2 ) = (Cx + Dx 2 ) (Cy + Dy 2 ). By choosing appropriate x i and y i, we see that A, B, C, D are algebra homomorphisms (that is, they preserve Jordan products) and Ax By 2 = 0 and Dy 2 Cx = 0. As the kernels of these four transformations are ideals and V i s are assumed to be simple (which means that they do not contain any non-trivial ideals, see Page 5, [8]), we see that A and D are either zero or invertible, B and C are either zero or one-to-one. In addition, from Ax, By 2 = 0 and Dy 2, Cx = 0, we get A T B = 0 and D T C = 0. The cases A = 0, B = 0 and C = 0 and D = 0 are not possible due to the invertibility of Φ. The cases A 0, B = 0 and C 0, D = 0 are also not possible. Now suppose A = 0, B 0 and D = 0, C 0. Then, as B : V 2 V and C : V V 2 are one-to-one, the algebras V and V 2 have equal dimensions, and B (which is an algebra homomorphism) becomes an algebra isomorphism. Thus, B maps Jordan frames to Jordan frames and (hence) preserves trace and (canonical) inner product. In this case, V and V 2 are isomorphic, contradicting our assumption. Hence, this situation does not arise. In the (last) case when A 0, B = 0 and C = 0, D 0, we have A Aut(V ) and D Aut(V 2 ). 3 The spectral norm Theorem (Hirzebruch [4]) Let V be a Euclidean Jordan algebra of rank r. For any element x V, the smallest and largest eigenvalues are given, respectively, by λ r(x) = min x, c and c τ(v ) λ (x) = max x, c. c τ(v ) The above result is usually stated for simple Euclidean Jordan algebras [4], [8]. To see the general case, we write V as a product of simple algebras: V = V V 2 V k. Then, any 7
8 primitive idempotent in V is of the form (0, 0,..., 0, e i, 0, 0..., 0) for some primitive idempotent e i in V i (i =, 2,..., k). Also, for any x in V, eigenvalues of x come from the eigenvalues of the components of x. With these facts, one easily verifies the above result. Corollary Let x, a V with a 0. Then, (i) max c τ(v ) x, c = max c τ(v ) x, c = x. (ii) a x a x a. Proof. (i) For any y 0 in V, by the above theorem, y = λ (y) = max c τ(v ) y, c. Now, consider any x V with its spectral decomposition x = r x i e i. From y := x = r x i e i, we see that y ± x 0 and so for any c τ(v ), y ± x, c 0, that is, x, c y, c. Since y = x, max x, c max y, c = y = x. c τ(v ) c τ(v ) However, x i = x, ē i max c τ(v ) x, c for all i, and so, x max c τ(v ) x, c. Thus we have (i). (ii) For any c τ(v ), from a x a a, c x, c a, c we get x, c a, c. Taking the maximum over τ(v ), using (i), we get x a. From Item (i) of the Corollary, we get the triangle inequality x + y x + y. Thus, is a norm on V, a fact that is already known, see Theorem 4., [20]. 4 The norm of a positive map For a linear map Φ : V V, we define Φ := Theorem 2 Let Φ : V V be a positive map. Then max Φ(x). x V, x Φ = Φ(e). Proof. For any x V, by writing the spectral decomposition x = r x i e i and using the fact that e = r e i, we get x e x x e. From the linearity and positivity of Φ, we get x Φ(e) Φ(x) x Φ(e). Now, Item (ii) in Corollary yields Φ(x) x Φ(e). Hence, Φ Φ(e). As e =, we have Φ = Φ(e). 8
9 Corollary 2 Suppose φ : V R is a linear functional on V. Then φ = φ(e) if and only if φ is positive. Proof. Assume first that φ is positive. Define Φ : V V by Φ(x) = φ(x) e. Then Φ is positive on V. An application of the above theorem gives the equality φ = φ(e). To see the converse, let φ = φ(e). Without loss of generality, let φ(e) =. For any x V with eigenvalues x, x 2,..., x r, φ(x) λ = φ(x λ e) φ x λ e = max x i λ i for all λ R. This implies that φ(x) is between min x i and max x i. In particular, taking x 0 (for which min x i 0), we see that φ(x) 0. Theorem 3 Suppose Φ : V V is a linear map with Φ = and Φ(e) = e. Then Φ is positive. Proof. Without loss of generality, we assume that V carries the canonical inner product. We fix c τ(v ) and define φ : V R, φ(x) = Φ(x), c (x V ). Then, φ is a linear functional with φ(e) = Φ(e), c = e, c =. (We note that as V carries the canonical inner product, the norm of any primitive element is one.) In addition, φ(x) = Φ(x), c Φ(x) x, where we have used Item (i) of Corollary for Φ(x) in V. We see that conditions of the previous corollary hold. Hence, φ(x) 0 for all x 0 in V. This means that when x 0, Φ(x), c 0 for all c τ(v ). This leads to, by considering nonnegative linear combinations of elements of τ(v ), Φ(x), y 0 for all y V +. By an application of (7), we get Φ(x) 0 for any x 0. This proves that Φ is a positive map. We illustrate the above results by some examples. Example. Let b V. Then the quadratic representation P b is defined by P b (x) = 2 b (b x) b 2 x. Its norm is given by P b = b 2. This follows easily from the observations that P b is a positive map (see Prop. III.2.2, [8]) and P b (e) = b 2 and b 2 = b 2. Example 2. Let L : V V be a Z-transformation [], that is, L is linear and satisfies x 0, y 0, and x, y = 0 L(x), y 0. 9
10 If L is positive stable (which means that all eigenvalues of L have positive real parts), then L is a positive map ([], Theorem 6). Hence, L = L (e). We can further specialize by taking V = S n. Then for any A R n n, the transformations L A (X) := AX + XA T and S A (X) := X AXA T (X S n ) (which are respectively, the Lyapunov and Stein transformations) are Z-transformations on S n. When they are positive stable (which happens when A is positive stable for L A and Schur stable for S A ) we see that the spectral norms of L A and S A are attained at the Identity matrix in Sn. These results are known, see e.g., [4], [5]. Example 3. Corresponding to a Jordan frame {e, e 2,..., e r } in V, consider the Peirce decomposition V = i j V ij [8], where V ii := {x V : x e i = x} and for i j, V ij := {x V : x e i = 2 x = x e j}. Thus, for any x V, we can write x = i j x ij, where x ij V ij. (0) As V ii = R e i for all i, we may write x ii = x i e i with x i R. Then, the above decomposition reads: r x = x i e i + x ij. () i<j As V ij s are mutually orthogonal, tr(x) = x + x x r. Also, when x V +, x i 0 for all i. Let A = [a ij ] be any r r real symmetric matrix. Given (0), we can define the Schur product of A and x in V by A x := i j a ij x ij. (2) Now suppose that A is positive semidefinite and let Φ(x) := A x. It has been shown in [3], Proposition 2.2, that in this situation, x V + Φ(x) V +. This means that Φ is a positive map. Then, Φ = Φ(e) = a e + a 22 e a rr e r = max i r a ii. The following result is motivated by Theorem in [6]. Theorem 4 Let Φ and Φ 2 be two positive unital maps from V to V. Then for any x V, Φ (x) Φ 2 (x) λ (x) λ r(x). 0
11 Proof. Fix x in V, and let (for ease of notation), α = λ r(x) and β = λ (x). Then, α e x β e. Using the positivity and the unital properties of Φ i (i =, 2), we get α e Φ (x) β e and β e Φ 2 (x) α e. Hence, (α β) e Φ (x) Φ 2 (x) (β α)e. By Item (ii) in Corollary, we get the required inequality. 5 Doubly stochastic maps Recall that a linear map Φ on a Euclidean Jordan algebra V is doubly stochastic if it is positive, unital, and trace preserving. It is easy to see that the set of all such maps, DS(V), is convex, and (from Theorem 2) compact in B(V, V ). We now list some examples. Example 4. Consider a doubly stochastic map Φ : M n M n. By definition, this map takes positive semidefinite matrices in M n to positive semidefinite matrices and is unital and trace preserving. As every Hermitian matrix is the difference of two positive semidefinite matrices, we see that the restriction of Φ to H n is a doubly stochastic map on the Euclidean Jordan algebra H n. Conversely, as M n = {A + ib : A, B H n }, it follows that every (real linear) doubly stochastic map Φ on H n can be extended to a (complex linear) doubly stochastic map Φ on M n by Φ(A + ib) = Φ(A) + iφ(b). Example 5. Every Jordan algebra automorphism (on a Euclidean Jordan algebra) is a doubly stochastic map. This is because any Jordan algebra automorphism Φ satisfies Φ(x 2 ) = Φ(x) 2 (implying positivity), Φ(e) = e (unital property), and maps Jordan frames to Jordan frames (implying the trace preserving property). Thus, Aut(V) DS(V); Denoting the convex hull of a set S by conv(s), we see that conv(aut(v )) is convex, and We shall see later that Aut(V) is also compact in B(V, V ). Example 6. Let V be of rank r. It is easy to see that the map conv(aut(v)) DS(V). (3) Φ(x) := tr(x) e, r
12 is doubly stochastic. Example 7. We fix a Jordan frame {e, e 2,..., e r } in V and consider the Peirce decomposition (). Then the diagonal map Diag : V V defined by is doubly stochastic. Diag(x) = x e + x 2 e x r e r (x V ) (4) Example 8. Consider a Jordan frame {e, e 2,..., e r } in V and the set up of Example 3. let A be an r r real symmetric positive semidefinite matrix with every diagonal entry one. Then, the map is doubly stochastic. Φ(x) := A x Example 9. We fix a nonzero idempotent c e in V, and let V (c, γ) := {x V : x c = γ x}, where γ {0, 2, }. Then the Peirce (orthogonal) decomposition holds [8]. In particular, for any element x V, we have V = V (c, ) + V (c, ) + V (c, 0) (5) 2 x = u + v + w with u V(c, ), v V(c, ), w V(c, 0). (6) 2 Now, consider the pinching map Φ on V defined by Φ(x) := u + w. (7) We claim that Φ is doubly stochastic. To see this, let ω = c (e c). By writing the spectral decomposition c = e + e e k + 0 e k e r, k < r, we see that ω = e + e e k (e k+ + + e r ). As ω 2 = e, by Prop. II.4.4 in [8], P ω is an algebra automorphism of V. Using the definition of P ω and properties of the spaces V (c, γ), one verifies that x + P ω (x) 2 = u + w. (8) This means that the pinching map is the average of two algebra automorphisms, namely the identity transformation and P ω. Thus, it is doubly stochastic. The following result exhibits a connection between doubly stochastic maps and doubly stochastic matrices. 2
13 Theorem 5 Let Φ B(V, V ) be doubly stochastic. Let {e, e 2,..., e r } be a Jordan frame in V and {f, f 2,..., f s } be a Jordan frame in V. Then the matrix A = [a ij ], a ij := Φ(e i ), f j tr, is a doubly stochastic matrix. Proof. We assume without loss of generality that both V and V carry canonical inner products. With respect to these inner products, Φ continues to have the doubly stochastic property. In particular, as observed previously in (9), the trace preserving property of Φ becomes the unital property of the transpose Φ T. Now, Φ(V + ) V + together with (7) implies that A is a nonnegative matrix. From Φ(e) = e and the orthogonality relations of a Jordan frame, we have, for each fixed j, As Φ T (e ) = e, for each fixed i, r a ij = Φ(e), f j = e, f j = f j, f j =. i= s a ij = Φ(e i ), e = e i, Φ T (e ) = e i, e = e i, e i =. j= Thus A is doubly stochastic. Remarks. Suppose for a given map Φ B(V, V ), the matrix [ Φ(e i ), f j tr ] is doubly stochastic for arbitrary Jordan frames in V and V. Then, an easy argument shows that Φ is doubly stochastic. We omit the proof. 6 Majorization Given x, y V, we say that x is majorized by y and write x y if the eigenvalue vectors of x and y satisfy λ(x) λ(y). Theorem 6 For x, y V, consider the following statements: (a) x = Ψ(y), where Ψ is a convex combination of algebra automorphisms of V. (b) x = Φ(y), where Φ is doubly stochastic on V. (c) x y. Then, (a) (b) (c). Furthermore, when V is R n or simple, the reverse implications hold. Proof. (a) (b): This follows from (3). (b) (c): Let x = Φ(y), where Φ is doubly stochastic. Writing the spectral decompositions x = r x i e i and y = r y i f i, we see that λ(x) = A λ(y), where A = [ Φ(f j ), e i tr ], λ(x) = 3
14 [x, x 2,..., x r ] T, etc. As A is a doubly stochastic matrix by Theorem 5, we see that λ(x) λ(y) proving (c). Now suppose (c) holds. When V is R n, the implication (c) (a) is covered by (3). Now assume that V is simple. Let x y with spectral decompositions x = r x i e i and y = r y i f i ; without loss of generality, let x x 2 x r and y y 2 y r so that λ (x) = [x, x 2,..., x r ] T and λ (y) = [y, y 2,..., y r ] T. By definition, λ (x) λ (y). Then there exists positive numbers µ i and permutation matrices P i such that N µ i = and N λ (x) = µ j P j (λ (y)). j= Now, each P j induces a permutation σ j on {, 2,..., r}. Let (P j (λ (y))) i = y σj (i). Then x i = Nj= µ j y σj (i). Hence, ( r r N N r ) x = x i e i = µ j y σj (i) e i = µ j y σj (i)e i. i= i= j= j= i= Now for each j =, 2,..., N, let Ψ j Aut(V) such that Ψ j (e i ) = f σj (i) for all i. Since V is simple, such an automorphism exists, see [8], Theorem IV.2.5. Then e i = Ψ j (f σj (i)) for all i. Hence, ( N r ) ( N r x = µ j y σj (i)e i = µ j Ψ j j= i= j= i= ) N y σj (i)f σj (i) = µ j Ψ j (y) j= as y = r y i f i = r i= y σj (i)f σj (i) for every j. We thus have (a). Here are some illustrations of the above theorem. From Example 7, Diag(x) x. This is a generalization of the Schur inequality, see [2]. When A is an r r real symmetric positive semidefinite matrix with every diagonal entry one, by Example 8, A x x. This yields λ(a x) λ(x), extending a result of Bapat and Sunder, see [2], Corollary 2. From Example 9, for the pinching map (7), u+w x. This result is proved in [20] for simple algebras, based on case by case analysis. Remarks. Let W be a finite dimensional real inner product space and G be a closed subgroup of the group of orthogonal (that is, inner product preserving) linear maps on W. In several works, see for example, [7], [9], [7], [9], the concept of G-majorization is developed and studied. One says that x is G-majorized by y in W if x conv(g) y (that is, x is in the convex hull of the G-orbit of y). If we take W to be a Euclidean Jordan algebra with the canonical inner product, then G = Aut(W ) Orth(W ) (see [8], page 57). In this setting, the implication (a) (c) in Theorem 6 shows that G-majorization is stronger than our eigenvalue-majorization. While they 4
15 are the same when the algebra is simple, they could be different in the general case, as our next example shows. Example 0. We recall that S 2 is the algebra of all real 2 2 symmetric matrices, with X XY +Y X Y = 2 and X, Y = tr(xy ). Let V = R S 2 with (λ, X) (µ, Y ) := (λµ, X Y ) and (λ, X), (µ, Y ) := λµ + X, Y for λ, µ R and X, Y S 2. Consider two elements of V : p = (0, A) and q = (, B), where [ ] [ ] A = and B = Clearly, λ (p) = λ (q) and so p q. Now, it follows from Proposition that algebra automorphisms of V are given by (λ, X) (λ, U T XU) for some orthogonal matrix U. Thus, p Ψ(q) for any Ψ which is a convex combination of algebra automorphisms of V. So in this algebra, the implication (c) (a) does not hold. We also observe that with G = Aut(V), p is not G-majorized by q. Now, consider the map Φ defined by ( [ ]) ( [ ]) x y λ 0 Φ : λ, x,. y z 0 z It is easy to see that Φ is doubly stochastic. Also, p = Φ(q). This means that in this algebra, conv(aut(v)) DS(V). 7 Relations between Aut(V), Aut(V + ) and DS(V) Theorem 7 The following statements are equivalent: (a) Φ Aut(V). (b) Φ DS(V) and Φ(x) = x for all x V. (c) Φ Aut(V + ) and Φ(x) 2 = x 2 for all x V. Proof. We assume without loss of generality that V carries the canonical inner product. (a) (b): Let Φ Aut(V ). Clearly, Φ is doubly stochastic and maps Jordan frames to Jordan frames. In particular, it preserves eigenvalues and so, Φ(x) = x for all x V. Thus, we have (b). Now assume that (b) holds. We show the following: (i) Φ(c) τ(v ) for all c τ(v ), where τ(v ) denotes the set of all primitive idempotents in V ; (ii) Φ maps Jordan frames to Jordan frames; (iii) Φ preserves eigenvalues; (iv) Φ Aut(V + ). 5
16 To see (i), let c τ(v ). Then (from the positive property) Φ(c) V + and Φ(c) = c =. So, in the spectral decomposition Φ(c) = λ f + λ 2 f λ r f r, every λ i is nonnegative and max i λ i =. Without loss of generality, let λ = so that Φ(c) = f + r 2 λ i f i. Since Φ preserves the trace, = tr(c) = tr(φ(c)) = + r 2 λ i. Thus, r 2 λ i = 0 and λ i = 0 for all i 2. Therefore, Φ(c) = f τ(v ). Now, to see (ii), let {e, e 2..., e r } be any Jordan frame in V. For any i, put Φ(e i ) = p i. Then, Φ(e) = e implies that p + p p r = e and so, p p + p p p p r = p e = p. As p p = p (from (i)), this leads to p p p p r = 0. Taking the trace, we get r 2 p, p i = 0 (recall that V carries the canonical inner product). As p i τ(v ), from (7), we get p, p i = 0 for all i 2. From this and Prop. 6 in [0], we infer that p p i = 0 for all i 2. In a similar way, we show that p i p j = 0 for all i j. Thus, {p, p 2,..., p r } is a Jordan frame. So, (ii) holds. Now, from the spectral decomposition x = r x i e i, we get Φ(x) = r x i Φ(e i ). From (ii), we see that the eigenvalues of x and Φ(x) are the same. Thus, Φ(x) 2 2 = r x 2 i = x 2 2, proving the second part of (c) as well as the invertibility of Φ. As any x V + is a finite nonnegative linear combination of elements of τ(v ) and Φ preserves τ(v ), we see that Φ(V + ) V +. We now show that Φ also preserves V +. Let c τ(v ) and p := Φ (c). Starting with the spectral decomposition p = r α i e i, via (ii), we get the spectral decomposition c = Φ(p) = r α i Φ(e i ). Thus, α i s are the eigenvalues of c; we may let, without loss of generality, α = and α i = 0 for all i 2. This means that p = e and so Φ c = e τ(v ). Once again, by considering nonnegative finite linear combinations of elements of τ(v ), we get Φ (V + ) V +. Combining this with Φ(V + ) V +, we get Φ Aut(V + ). Thus we have (c). (c) (a): The second part of condition (c) says that Φ is an isometry (hence orthogonal) under the canonical inner product. So condition (c) means that Φ Aut(V + ) Orth(V). As V carries the canonical inner product, Φ Aut(V + ) Orth(V) = Aut(V), see [8], page 57. Thus, we have (a). Theorem 8 Suppose V is simple. Then Aut(V) = Aut(V + ) DS(V) = {Φ Aut(V + ) : Φ(e) = e}. Proof. The inclusions Aut(V) Aut(V + ) DS(V) {Φ Aut(V + ) : Φ(e) = e} always hold. When V is simple, the reverse inclusions follow from {Φ Aut(V + ) : Φ(e) = e} = Aut(V + ) Orth(V) = Aut(V), see [8], Pages 56 and 57, Propositions III.4.3 and I.4.3. Remarks. It follows from Theorem 7 that Aut(V ) is compact in B(V, V ). Thus, conv(aut(v )) is a compact convex subset of DS(V). When V is simple, the equivalence of (a) and (b) in Theorem 6
17 6 shows that pointwise equality conv (Aut(V)) z = DS(V) z (z V ) holds. Example 0 shows that such an equality may not hold in non-simple algebras. We now ask if a stronger equality conv (Aut(V)) = DS(V) can hold in simple algebras. The following result and the example shows that the equality holds in the algebra L n (which is of rank 2), but may fail in other algebras. Theorem 9 Every doubly stochastic map on L n is a convex combination of algebra automorphisms, that is, it is of the form N A = λ i Ψ i, where λ i s are positive, N λ i =, and Ψ i = [ 0 0 U i for some orthogonal matrix U i on R n. Thus, conv(aut(l n )) = DS(L n ). Proof. We recall that for n >, L n = (R n,,, ), where R n carries the usual inner product and the Jordan product is given by (6). The vector e in R n with one in the first slot and zeros elsewhere is the unit element of L n. Also, a vector x = [x 0, x] T R R n belongs to L n + (the symmetric cone of L n ) if and only if x 0 x 2. As observed previously, algebra automorphisms of L n have the form of (above) Ψ i and so a convex combination of such automorphisms is doubly stochastic. Now consider a doubly stochastic map A on L n written in the matrix form: [ ] a b T A =, c D where a R, b, c R n and D R (n ) (n ). From Ae = e, we get a = and c = 0. As L n is an algebra where the inner product is a multiple of the trace inner product, the trace preserving property of A is equivalent to A T e = e. This implies that b = 0. Thus, [ ] 0 A =. (9) 0 D We now show that D is a convex combination of orthogonal matrices. Let u be a vector of norm one in R n. As x = [ u] T L n +, we must have Ax L n +. This implies that Du. Hence, D. (Thus, every doubly stochastic matrix on L n is of the form (9) for some contractive ], 7
18 matrix D.) Now, using the singular value decomposition (for the real matrix D), we can write D = Udiag(s, s 2,..., s n )W, where U and W are (real) orthogonal matrices. As D, we have 0 s i for all i. Thus, we can write diag(s, s 2,..., s n ) as a convex combination of diagonal matrices D i, each of the form diag(ε, ε 2,..., ε n ), with ε j = for all j. We see that D is a convex combination of orthogonal matrices of the form U i := UD i W. Using U i, we define the algebra automorphism Ψ i. It follows that A is a convex combination of these algebra automorphisms. Example. Consider the simple algebra H 3 of all 3 3 complex Hermitian matrices. We show that conv(aut(h 3 )) DS(H 3 ) (20) by using an example of Landau and Streater ([5], page 8) given in connection with the extreme points of the set of all doubly stochastic maps on M 3. Consider the map Φ : H 3 H 3 defined by where V i = 2 J i, J = Φ(X) := V XV + V 2 XV 2 + V 3 XV 3 (X H 3 ), 0 i 0 i , J 2 = i 0 i 0, J 3 = 0 0 i i 0 0 As each V i is Hermitian and V 2 + V V 2 3 = I, we see that Φ DS(H3 ). We now claim that Φ conv(aut(h 3 )). Assuming the contrary, suppose Φ is a convex combination of Φ k Aut(H 3 ), k =, 2,..., N. As observed in Example 4, all these doubly stochastic maps on H 3 can be extended to doubly stochastic maps on M 3. We see that the extension Φ given by Φ(X) := V XV + V 2 XV 2 + V 3 XV 3 (X M 3 ), is a convex combination of Φ k, k =, 2,..., N. However, it has been noted in [5], based on Choi s characterization of extreme completely positive doubly stochastic maps, that Φ is an extreme point of the set of all doubly stochastic maps on M 3. Thus, Φ k = Φ for all k. It follows that Φ = Φ k Aut(H 3 ). However, considering the matrix E i (i =, 2) in H 3 with one in the (i, i) slot and zeros elsewhere, we see that E E 2 = 0 while Φ(E ) Φ(E 2 ) 0. Thus, Φ cannot be an algebra automorphism, yielding a contradiction. Hence, we have (20). 8 Extreme points of DS(V) As DS(V) is compact and convex, by a well-known Minkowski-Carathéodory Theorem, DS(V) is the convex hull of (the set of) its extreme points. While the description of all extreme points of DS(V) seems to be a difficult task, in the result below, we show that when V is simple, Jordan algebra automorphisms are extreme points of DS(V). We first prove a simple proposition.. 8
19 Proposition 2 Let V be a simple Euclidean Jordan algebra and Φ DS(V). Then, Φ(x) x (x V ). Proof. Since V is simple, the given inner product on V is a positive multiple of the canonical inner product; we may assume without loss of generality that V carries the canonical inner product and x 2 = x for all x. Now, let x V and y := Φ(x). As V is simple, the implication (b) (a) in Theorem 6 shows that y = Ψ(x), where Ψ is a convex combination of algebra automorphisms of V. Now, algebra automorphisms preserve the 2-norm of a vector (cf. Theorem 7), we see (by triangle inequality) that Ψ(x) 2 x 2. Thus, Φ(x) x. In the result below, we let Ext(DS(V)) denote the set of all extreme points of DS(V). Theorem 0 Suppose V is simple. Then Aut(V) Ext(DS(V)). Moreover, when n 3, Aut(L n ) = Ext(DS(L n )). Proof. We assume that V carries the canonical inner product, so x = x 2 for all x V. Let Φ Aut(V) and suppose it is written as a convex combination Φ = N λ k Φ k of doubly stochastic maps on V. As Jordan algebra automorphisms preserve the 2-norm (thus, in our setting, the inner product norm), we have, by the above proposition, N N x = Φ(x) λ k Φ k (x) λ k x = x for all x V. As the inner product norm is strictly convex, it follows that for each x V, and k, Φ k (x) is a positive multiple of Φ(x). Fix k and write Φ k (x) = β(x) Φ(x), where β(x) > 0. As Φ and Φ k preserve the trace, we see that β(x) = whenever tr(x) 0. Thus, Φ k (x) = Φ(x) whenever tr(x) 0. As the set of all such vectors form a dense set in V, by continuity, we see that Φ k (x) = Φ(x) for all x V. Hence Φ k = Φ. As this holds for every k, we see that Φ is an extreme point of DS(V). Now the statement about L n follows from Theorem 9. Concluding Remarks. In this paper, we studied some properties of positive and doubly stochastic maps, and their connection to majorization. A number of questions remain, some of which are listed below. In Theorem 6, does the implication (c) (b) hold for a general V? The resolution of this question depends on whether any two Jordan frames can be mapped to each other by doubly stochastic maps (on a general algebra). When do we have the equality conv(aut(v )) = DS(V )? What are the extreme points of DS(V )? Acknowledgment: Thanks are due to the Referees for their comments and suggestions. 9
20 References [] T. Ando, Majorization, doubly stochastic matrices, and comparison of eigenvalues, Linear Algebra and Its Applications, 8 (989) [2] R.B. Bapat and V.S. Sunder, On majorization and Schur products, Linear Algebra and Its Applications, 72 (985) [3] R. Bhatia, Matrix Analysis, Springer, New York, 997. [4] R. Bhatia, A note on the Lyapunov equation, Linear Algebra and Its Applications, 259 (997) [5] R. Bhatia, Positive Definite Matrices, Princeton University Press, Princeton, [6] R. Bhatia and R. Sharma, Positive linear maps and spreads of matrices, American Mathematical Monthly, 2 (204) [7] M.L. Eaton and M.D. Perlman, Reflection groups, generalized Schur functions and the geometry of majorization, Ann. Probability, 5 (977) [8] J. Faraut and A. Korányi, Analysis on Symmetric Cones, Clarendon Press, Oxford, 994. [9] A. Giovagnoli and H.P. Wynn, G-majorization with applications to matrix orderings, Linear Algebra and Its Applications, 67 (985) -35. [0] M.S. Gowda, R. Sznajder, and J. Tao, Some P-properties for linear transformations on Euclidean Jordan algebras, Linear Algebra and Its Applications, 393 (2004) [] M.S. Gowda and J. Tao, Z-transformations on proper and symmetric cones, Mathematical Programming, 7 (2009) [2] M.S. Gowda and J. Tao, The Cauchy interlacing theorems in simple Euclidean Jordan algebras and some consequences, Linear and Multilinear Algebra, 59 (20) [3] M.S. Gowda, J. Tao, and R. Sznajder, Complementarity properties of Peirce-diagonalizable linear transformations on Euclidean Jordan algebras, Optimization Methods and Software, 27 (202) [4] U. Hirzebruch, Der min-max-satz von E. Fischer für formal-reelle Jordan-Algebren, Mathematische Annalen, 86 (970) [5] L.J. Landau and R.F. Streater, On Birkhoff s theorem for doubly stochastic completely positive maps of matrix algebras, Linear Algebra and Its Applications, 93 (993) [6] A.W. Marshall and I. Olkin, Inequalities: Theory of majorization and its Applications, Academic Press, New York,
21 [7] H.F. Miranda and R.C. Thompson, Group majorization, the convex hulls of set of matrices, and the diagonal element-singular value inequalities, Linear Algebra and its Applications, 99 (994) 3-4. [8] M.M. Moldovan, A Gersgorin type theorem, spectral inequalities, and simultaneous stability in Euclidean Jordan algebras, PhD Thesis, University of Maryland Baltimore County, Baltimore, Maryland, USA, [9] M. Niezgoda, A unified treatment of certain majorization results on eigenvalues and singular values of matrices, Forum Math. 2 (2009) [20] J. Tao, L. Kong, Z. Luo, and N. Xiu, Some majorization inequalities in Euclidean Jordan algebras, Linear Algebra and Its Applications, 46 (204)
Spectral 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 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 informationStrict 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 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 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 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 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 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 informationSome inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras
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
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 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 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 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 informationPOSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS
Adv. Oper. Theory 3 (2018), no. 1, 53 60 http://doi.org/10.22034/aot.1702-1129 ISSN: 2538-225X (electronic) http://aot-math.org POSITIVE MAP AS DIFFERENCE OF TWO COMPLETELY POSITIVE OR SUPER-POSITIVE MAPS
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 informationCHI-KWONG LI AND YIU-TUNG POON. Dedicated to Professor John Conway on the occasion of his retirement.
INTERPOLATION BY COMPLETELY POSITIVE MAPS CHI-KWONG LI AND YIU-TUNG POON Dedicated to Professor John Conway on the occasion of his retirement. Abstract. Given commuting families of Hermitian matrices {A
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 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 informationIsometries Between Matrix Algebras
Abstract Isometries Between Matrix Algebras Wai-Shun Cheung, Chi-Kwong Li 1 and Yiu-Tung Poon As an attempt to understand linear isometries between C -algebras without the surjectivity assumption, we study
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 informationMajorization-preserving quantum channels
Majorization-preserving quantum channels arxiv:1209.5233v2 [quant-ph] 15 Dec 2012 Lin Zhang Institute of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, PR China Abstract In this report, we give
More informationCompression, Matrix Range and Completely Positive Map
Compression, Matrix Range and Completely Positive Map Iowa State University Iowa-Nebraska Functional Analysis Seminar November 5, 2016 Definitions and notations H, K : Hilbert space. If dim H = n
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 informationKantorovich type inequalities for ordered linear spaces
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 8 2010 Kantorovich type inequalities for ordered linear spaces Marek Niezgoda bniezgoda@wp.pl Follow this and additional works at:
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 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 informationENTANGLED STATES ARISING FROM INDECOMPOSABLE POSITIVE LINEAR MAPS. 1. Introduction
Trends in Mathematics Information Center for Mathematical Sciences Volume 6, Number 2, December, 2003, Pages 83 91 ENTANGLED STATES ARISING FROM INDECOMPOSABLE POSITIVE LINEAR MAPS SEUNG-HYEOK KYE Abstract.
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 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 informationLinear Algebra. Session 12
Linear Algebra. Session 12 Dr. Marco A Roque Sol 08/01/2017 Example 12.1 Find the constant function that is the least squares fit to the following data x 0 1 2 3 f(x) 1 0 1 2 Solution c = 1 c = 0 f (x)
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 informationWeakly homogeneous variational inequalities and solvability of nonlinear equations over cones
Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore,
More informationCompound matrices and some classical inequalities
Compound matrices and some classical inequalities Tin-Yau Tam Mathematics & Statistics Auburn University Dec. 3, 04 We discuss some elegant proofs of several classical inequalities of matrices by using
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 informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
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 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 informationLecture 7: Semidefinite programming
CS 766/QIC 820 Theory of Quantum Information (Fall 2011) Lecture 7: Semidefinite programming This lecture is on semidefinite programming, which is a powerful technique from both an analytic and computational
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
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 informationCommutative Banach algebras 79
8. Commutative Banach algebras In this chapter, we analyze commutative Banach algebras in greater detail. So we always assume that xy = yx for all x, y A here. Definition 8.1. Let A be a (commutative)
More informationLinear Operators Preserving the Numerical Range (Radius) on Triangular Matrices
Linear Operators Preserving the Numerical Range (Radius) on Triangular Matrices Chi-Kwong Li Department of Mathematics, College of William & Mary, P.O. Box 8795, Williamsburg, VA 23187-8795, USA. E-mail:
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 informationOn common linear/quadratic Lyapunov functions for switched linear systems
On common linear/quadratic Lyapunov functions for switched linear systems M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland, USA
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 informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationThroughout these notes we assume V, W are finite dimensional inner product spaces over C.
Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal
More informationConvexity of the Joint Numerical Range
Convexity of the Joint Numerical Range Chi-Kwong Li and Yiu-Tung Poon October 26, 2004 Dedicated to Professor Yik-Hoi Au-Yeung on the occasion of his retirement. Abstract Let A = (A 1,..., A m ) be an
More informationNotes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers
Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop Eric Sommers 17 July 2009 2 Contents 1 Background 5 1.1 Linear algebra......................................... 5 1.1.1
More informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationSummer School on Quantum Information Science Taiyuan University of Technology
Summer School on Quantum Information Science Taiyuan University of Technology Yiu Tung Poon Department of Mathematics, Iowa State University, Ames, Iowa 50011, USA (ytpoon@iastate.edu). Quantum operations
More informationCHAPTER VIII HILBERT SPACES
CHAPTER VIII HILBERT SPACES DEFINITION Let X and Y be two complex vector spaces. A map T : X Y is called a conjugate-linear transformation if it is a reallinear transformation from X into Y, and if T (λx)
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 informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationPolynomial complementarity problems
Polynomial complementarity problems M. Seetharama Gowda Department of Mathematics and Statistics University of Maryland, Baltimore County Baltimore, Maryland 21250, USA gowda@umbc.edu December 2, 2016
More informationCharacterization of half-radial matrices
Characterization of half-radial matrices Iveta Hnětynková, Petr Tichý Faculty of Mathematics and Physics, Charles University, Sokolovská 83, Prague 8, Czech Republic Abstract Numerical radius r(a) is the
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 informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationSome notes on Coxeter groups
Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three
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 informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
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 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 informationTrace Class Operators and Lidskii s Theorem
Trace Class Operators and Lidskii s Theorem Tom Phelan Semester 2 2009 1 Introduction The purpose of this paper is to provide the reader with a self-contained derivation of the celebrated Lidskii Trace
More informationNumerical Linear Algebra
University of Alabama at Birmingham Department of Mathematics Numerical Linear Algebra Lecture Notes for MA 660 (1997 2014) Dr Nikolai Chernov April 2014 Chapter 0 Review of Linear Algebra 0.1 Matrices
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 informationArchive of past papers, solutions and homeworks for. MATH 224, Linear Algebra 2, Spring 2013, Laurence Barker
Archive of past papers, solutions and homeworks for MATH 224, Linear Algebra 2, Spring 213, Laurence Barker version: 4 June 213 Source file: archfall99.tex page 2: Homeworks. page 3: Quizzes. page 4: Midterm
More informationAssignment 1: From the Definition of Convexity to Helley Theorem
Assignment 1: From the Definition of Convexity to Helley Theorem Exercise 1 Mark in the following list the sets which are convex: 1. {x R 2 : x 1 + i 2 x 2 1, i = 1,..., 10} 2. {x R 2 : x 2 1 + 2ix 1x
More information6 Orthogonal groups. O 2m 1 q. q 2i 1 q 2i. 1 i 1. 1 q 2i 2. O 2m q. q m m 1. 1 q 2i 1 i 1. 1 q 2i. i 1. 2 q 1 q i 1 q i 1. m 1.
6 Orthogonal groups We now turn to the orthogonal groups. These are more difficult, for two related reasons. First, it is not always true that the group of isometries with determinant 1 is equal to its
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 information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationThe Singular Value Decomposition
The Singular Value Decomposition Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) SVD Fall 2015 1 / 13 Review of Key Concepts We review some key definitions and results about matrices that will
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 informationLecture Notes 1: Vector spaces
Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector
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 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 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 informationTHE SINGULAR VALUE DECOMPOSITION AND LOW RANK APPROXIMATION
THE SINGULAR VALUE DECOMPOSITION AND LOW RANK APPROXIMATION MANTAS MAŽEIKA Abstract. The purpose of this paper is to present a largely self-contained proof of the singular value decomposition (SVD), and
More informationOptimization Theory. A Concise Introduction. Jiongmin Yong
October 11, 017 16:5 ws-book9x6 Book Title Optimization Theory 017-08-Lecture Notes page 1 1 Optimization Theory A Concise Introduction Jiongmin Yong Optimization Theory 017-08-Lecture Notes page Optimization
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationMATH 431: FIRST MIDTERM. Thursday, October 3, 2013.
MATH 431: FIRST MIDTERM Thursday, October 3, 213. (1) An inner product on the space of matrices. Let V be the vector space of 2 2 real matrices (that is, the algebra Mat 2 (R), but without the mulitiplicative
More informationSince G is a compact Lie group, we can apply Schur orthogonality to see that G χ π (g) 2 dg =
Problem 1 Show that if π is an irreducible representation of a compact lie group G then π is also irreducible. Give an example of a G and π such that π = π, and another for which π π. Is this true for
More informationSemismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones
to appear in Linear and Nonlinear Analysis, 2014 Semismooth Newton methods for the cone spectrum of linear transformations relative to Lorentz cones Jein-Shan Chen 1 Department of Mathematics National
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 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 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 informationSpectral Theory, with an Introduction to Operator Means. William L. Green
Spectral Theory, with an Introduction to Operator Means William L. Green January 30, 2008 Contents Introduction............................... 1 Hilbert Space.............................. 4 Linear Maps
More informationConvex analysis on Cartan subspaces
Nonlinear Analysis 42 (2000) 813 820 www.elsevier.nl/locate/na Convex analysis on Cartan subspaces A.S. Lewis ;1 Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario,
More informationBulletin of the Iranian Mathematical Society
ISSN: 7-6X (Print ISSN: 735-855 (Online Special Issue of the ulletin of the Iranian Mathematical Society in Honor of Professor Heydar Radjavi s 8th irthday Vol. 4 (5, No. 7, pp. 85 94. Title: Submajorization
More informationBasic Properties of Metric and Normed Spaces
Basic Properties of Metric and Normed Spaces Computational and Metric Geometry Instructor: Yury Makarychev The second part of this course is about metric geometry. We will study metric spaces, low distortion
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 informationDepartment of Social Systems and Management. Discussion Paper Series
Department of Social Systems and Management Discussion Paper Series No. 1262 Complementarity Problems over Symmetric Cones: A Survey of Recent Developments in Several Aspects by Akiko YOSHISE July 2010
More informationInvertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices
Geršgorin circles Lecture 8: Outline Chapter 6 + Appendix D: Location and perturbation of eigenvalues Some other results on perturbed eigenvalue problems Chapter 8: Nonnegative matrices Geršgorin s Thm:
More informationLecture 2: Linear Algebra Review
EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationSTRUCTURE AND DECOMPOSITIONS OF THE LINEAR SPAN OF GENERALIZED STOCHASTIC MATRICES
Communications on Stochastic Analysis Vol 9, No 2 (2015) 239-250 Serials Publications wwwserialspublicationscom STRUCTURE AND DECOMPOSITIONS OF THE LINEAR SPAN OF GENERALIZED STOCHASTIC MATRICES ANDREAS
More informationFunctional Analysis Exercise Class
Functional Analysis Exercise Class Week 9 November 13 November Deadline to hand in the homeworks: your exercise class on week 16 November 20 November Exercises (1) Show that if T B(X, Y ) and S B(Y, Z)
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 information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
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 information