Linear Algebra and its Applications

Size: px
Start display at page:

Download "Linear Algebra and its Applications"

Transcription

1 Linear Algebra and its Applications 36 ( Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: The sum of orthogonal matrices Dennis I. Merino Department of Mathematics, Southeastern Louisiana University, Hammond, LA , USA ARTICLE INFO Article history: Received 1 October 010 Accepted 3 October 011 Availableonline3November011 Submitted by R.A. Brualdi Keywords: Sum of unitary matrices Sum of orthogonal matrices ABSTRACT Let F {R, C, H}. Let U n (F be the set of unitary matrices in M n (F, andleto n (F be the set of orthogonal matrices in M n (F. Suppose n. We show that every A M n (F can be written as a sum of matrices in U n (F and of matrices in O n (F. Let A M n (F be given and let k be the least integer that is a least upper bound of the singular values of A. When F = C, we show that A can be written as a sum of k matrices from U n (F. WhenF = R,weshow that if k 3, then A can be written as a sum of 6 orthogonal matrices; if k, we show that A can be written as a sum of k + orthogonal matrices. 011 Elsevier Inc. All rights reserved. 1. Introduction Let F = C (the set of complex numbers or F = R (the set of real numbers. Let n be a given positive integer. We let M n (F be the set of all n-by-n matrices with entries in F. WealsoletE ij M n (F be the matrix whose (i, j entry is 1 and all other entries are 0. We study the sums of unitary matrices and we also study the sums of orthogonal matrices. We determine which matrices (if any in M n (F can be written as a sum of unitary or orthogonal matrices. We note that the sum of unitary matrices in M n (C has been previously studied (see [5] and the references therein. Moreover, for A, B M n (C,sumsoftheformUAU +VBV, where U, V M n (C are unitary, have also been studied []. We let U n (F be the set of unitary matrices in M n (F and we let O n (F be the set of orthogonal matrices in M n (F. We begin with the following observation. Lemma 1. Let n be a given positive integer. Let G M n (F be a group under multiplication. Then A M n (F can be written as a sum of matrices in G if and only if for every Q, P G,thematrixQAPcan bewrittenasasumofmatricesing. address: dmerino@selu.edu /$ - see front matter 011 Elsevier Inc. All rights reserved. doi: /j.laa

2 D.I. Merino / Linear Algebra and its Applications 36 ( Notice that both U n (F and O n (F are groups under multiplication. Let α F be given. Then Lemma 1 guarantees that for each Q G, we have that αq can be written as a sum of matrices from G if and only if αi can be written as a sum of matrices from G. Lemma. Let n be a given integer. Let G M n (F be a group under multiplication. Suppose that G contains K diag(1, 1,..., 1 and the permutation matrices. Then every A M n (F can be written as a sum of matrices in G if and only if for each α F, αi canbewrittenasasumofmatricesing. Proof. The forward implication is trivial. For the other direction, suppose that for each α F, αi can be written as a sum of matrices in G. Now,K G so that for each α F, Lemma 1 guarantees that αk can also be written as a sum of matrices in G. It follows that αe 11 = α I + α K can be written as a sum of matrices in G. Now,foreach1 i, j n, notice that E ij = PE 11 Q for some permutation matrices P and Q, and that P, Q G. Therefore, if A M n (F, thena can be written as a sum of matrices in G, as A = [ ] a ij = i,j a ij E ij.. Sum of orthogonal matrices The only matrices in O 1 (F are ±1. Hence, not every element of M 1 (F canbewrittenasasum of elements in O 1 (F. In fact, only the integers can be written as a sum of elements of O 1 (F..1. The case F = C Notice that U 1 (C = { e iθ : θ R }. Set C { e iθ + e iβ : θ,β R }. Ifθ,β R are given, then e iθ + e iβ. Hence, C A {z C : z }. We show that A C. Let 0 r be given. Set β = θ, and choose θ so that cos θ = r. Thene iθ + e iθ = cos θ = r. Ifz = re iδ,then choose β = θ + δ, and choose θ so that cos (θ δ = r. Let k be an integer. Set C k { } k j=1 eiθ j : θ j R for j=1,..., k and set A k {z C : z k}. We show that for each k, wehavea k = C k. First, notice that for each k, wehavec k A k. We now show that A k C k. If z = re iβ,with r,β R and r 0, then e iθ 1 + +e iθ k = re iβ if and only if e i(θ 1 β + +e i(θ k β = r. (1 Hence, z = re iβ C k if and only if r C k. Forθ 1,..., θ k R, setf k (θ 1,..., θ k e iθ 1 + +e iθ k. The case k = has already been shown. Let k = 3, and suppose 0 r 3. Set θ 3 = 0 and set θ 1 = θ = θ. Then, f 3 (θ 1,θ,θ 3 = 1 + cos θ, and θ may be chosen so that 0 r 1 + cos θ 3. We use mathematical induction to show the general case. The base cases k = and k = 3have already been shown. Assume that k > 3 and suppose that C k = A k. Consider f k+1 (θ 1,..., θ k,θ k+1 e iθ 1 + +e iθ k +e iθ k+1.letz = re iβ be given with 0 r k+1. We show that r C k+1. First, we show that A C k+1.ifkis even, choose θ 3 = =θ k 1 = 0 and θ = =θ k = π. Then f k+1 (θ 1,..., θ k,θ k+1 = e iθ 1 + e iθ. If k is odd, choose θ = = θ k 1 = 0 and θ 5 = = θ k = π. Thenf k+1 (θ 1,..., θ k,θ k+1 e iθ 1 + e iθ + e iθ 3. In both cases, notice that A C k+1. Hence, we may assume further that r 1; that is, we need to show that r C k+1 for 1 r k + 1. Choose θ k+1 = 0, so that f k+1 (θ 1,..., θ k,θ k+1 = f k (θ 1,..., θ k + 1. Now, by our inductive hypothesis, the equation f k (θ 1,..., θ k + 1 = r has a solution since 0 r 1 k. Lemma 3. Let k be a given integer. Let A k {z C : z k} and let C k { k j=1 eiθ j : θ j R for j = 1,..., k}. Then A k = C k.

3 196 D.I. Merino / Linear Algebra and its Applications 36 ( The case U n (C Let α C be given. Then there exist an integer k and θ 1,..., θ k R such that α = f k (θ 1,..., θ k. Now, notice that αi = f k (θ 1,..., θ k I = e iθ 1 I + +e iθ k I is a sum of matrices in U n (C. When n = 1, every α C can be written as a sum of elements of U 1 (C. When n, Lemma guarantees that every A M n (C can be written as a sum of matrices in U n (C. Lemma. Let n be a given positive integer. Then every A M n (C can be written as a sum of matrices in U n (C. Let A M n (C be given. We look at the number of matrices that make up the sum A. Let α C be given. If α k for some positive integer k, thenα A k. Moreover, α A m for every integer m k. For any such m, Lemma 3 guarantees that there exist θ 1,..., θ m R such that α = e iθ 1 + +e iθ m. However, if α > k, thenα / A k and α cannot be written as a sum of k elements of U 1 (C. Write A = U V (the singular value decomposition of A, see[1, Theorem 7.3.5] or [, Theorem 3.1.1], where U, V M n (C are unitary and = diag(σ 1,..., σ n with σ 1 σ n 0. Let k be the least integer such that σ 1 k. Suppose that k. Then, for each l, wehaveσ l A k. Moreover, σ 1 / A k 1. Hence, A cannot be written as a sum of k 1 unitary matrices. However, for each l, wehaveσ l = e iθ l1 + +e iθ lk, where each θ l1,..., θ lk R. For each t = 1,..., k, setu t = diag (e iθ 1t,..., e iθ nt. Then U t M n (C is unitary and k t=1 U t =. Hence, A can be written as a sum of k unitary matrices. Suppose that k = 1. If σ n = 1, then = I and A is unitary. If σ n = 1, then for each l, wehave σ l A, and A can be written as a sum of two unitary matrices. We summarize our results. Theorem 5. Let A M n (C be given. Let k be the least (positive integer so that there exist U 1,..., U k U n (C satisfying U 1 + +U k = A. 1. If A is unitary, then k = 1.. If A is not unitary and σ 1 (A, thenk=. 3. If m is an integer such that m <σ 1 (A m + 1, thenk= m + 1. For positive integers m k, wehavea k A m. Hence, every U U n (C canbewrittenasasum of two or more elements of U n (C. It follows that every A M n (C that can be written as a sum of k elements of U n (C can be written as a sum of m elements of U n (C..1.. The case O n (C Let n =. Let α, β C be given. Set A (α, β α β. ( β α Choose β such that α + β = 1 and notice that A (±α, ±β O (C. Set A 1 A (α, β and set A A (α, β. Then A 1 + A = αi. Lemma guarantees that every A M (C can be written as a sum of matrices from O (C. We look at the case when n = 3. Let α, β F be given. Set B (α, β 0 αβ, (3 0 β α

4 D.I. Merino / Linear Algebra and its Applications 36 ( set α 0 β C (α, β 01 0, ( β 0 α and set αβ 0 D (α, β β α 0. ( Choose β so that α + β = 1. Then, B (±α, ±β, C (±α, ±β, and D (±α, ±β are all elements of O 3 (C. Set B 1 B (α, β, setb B ( α, β, setc 1 C (α, β, setc C ( α, β, set D 1 D (α, β, and set D D ( α, β. Then, B 1 B + C 1 C + D 1 D = αi 3. Lemma now guarantees that every A M 3 (C can be written as a sum of matrices in O 3 (C. Let n = m be a positive even integer, and let δ C be given. Choose A 1, A O (C so that A 1 + A = δi. Set E 1 = A 1 A 1 (m copies and set E = A A (m copies. Then E 1, E O m (C, and E 1 + E = δi m. Let n = m be an odd integer, and let δ C be given. Choose A 1, A O (C so that A 1 +A = δi. Also, choose B 1, B, C 1, C, D 1, D O 3 (C such that B 1 B +C 1 C +D 1 D = δi 3. Set E 1 = A 1 A 1 B 1 (m 1 copies of A 1, set E = A A B (m 1 copies of A, set E 3 = I m C 1,setE = I m C,setE 5 = I m D 1, and set E 6 = I m D. Then each E j O m+1 (C, and E 1 + +E 6 = δi m+1. Hence, for every α C and for every integer n, αi can be written as a sum of matrices from O n (C. Lemma guarantees that every A M n (C can be written as a sum of matrices from O n (C. Theorem 6. Let n be a given integer. Then every A M n (C can be written as a sum of matrices from O n (C. Suppose that A = Q 1 + Q, where Q 1, Q O n (C. Then one checks that AA T = Q 1 A T AQ1 T,so that AA T and A T A are similar. Theorem 13 of [3] ensures that A = QS, where Q is orthogonal and S is symmetric (or that A has a QS decomposition. Suppose now that has a QS decomposition. Is it true that A can be written as a sum of two (complex orthogonal matrices? Take the case n = 1, and notice that every A M n (C is a scalar and has a QS decomposition. However, only the integers can be written as a sum of orthogonal matrices in this case. Lemma 7. Let an integer n and 0 = α C be given. If αi = Q + V is a sum of two matrices from O n (C, then there exists a skew-symmetric D M n (C such that Q = α I + D, V = α I D, and DD T = ( 1 α I. Conversely, if there exists a skew-symmetric D M n (C such that DD T = ( 1 α I, then Q α I + DandV α I DareinO n (C and Q + V = αi. Proof. Let an integer n and 0 = α C be given. Suppose that αi M n (C can be written as a sum of two orthogonal matrices, say, αi = Q + V. Write Q = [ ] a ij = [q1... q n ] and V = [ ] b ij = [v 1... v n ]. Then, b ij = a ij for i = j. Now, for each i = 1,..., n, wehave n j=1 a ij = q T i q i = 1 = v T i v i = n j=1 b ij = b + n ii j =i,j=1 a ij. Hence, b ii =±a ii. Because Q + V = αi and α = 0, we have b ii = a ii = α. Set D = [ ] d ij,withdij = a ij if i = j, and d ii = 0, so that Q = α I + D and V = α I D. Now, since Q and V are orthogonal, we have QQ T = α I + α ( D + D T + DD T = I (6

5 196 D.I. Merino / Linear Algebra and its Applications 36 ( and VV T = α I α ( D + D T + DD T = I. (7 Subtracting Eq. (7 fromeq.(6, we get D = D T, so that D is skew-symmetric. Moreover, DD T = (1 α I. For the converse, suppose that D M n (C is skew-symmetric and satisfies DD T = ( 1 α I. Set Q α I + D and set V α I D. Then one checks that both Q and V are orthogonal matrices and Q + V = αi. If α = 0, then for any orthogonal Q, notice that αi = Q + ( Q is a sum of two orthogonal matrices. Let n = and α = 0. Set β 1 α (either square root. Then D 0 β is β 0 skew-symmetric and satisfies DD T = ( 1 α I. Lemma 7 guarantees that αi can be written as a sum of two orthogonal matrices. If n = k and α = 0, set E D D (k copies and notice that I. Hence,ifn = k and if α is a scalar, then αi can E is skew-symmetric and satisfies EE T = ( 1 α be written as a sum of two orthogonal matrices. Theorem 8. Let n be a given positive integer. For each α C and each orthogonal Q M n (C, αq can be written as a sum of two orthogonal matrices. Let an integer n begiven. Ifα {, 0, }, then one checks that αi M n (C can be written as a sum of two orthogonal matrices. Theorem 9. Let α C and let a positive integer n be given. Then αi M n+1 (C can be written as a sum of two matrices from O n (C if and only if α {, 0, }. Proof. For the forward implication, let α C and let a positive integer n be given. Suppose that αi M n+1 (C can be written as a sum of two orthogonal matrices. Then α = 0orα = 0. If α = 0, then α {, 0, }. Ifα = 0, we show that α =±. Lemma 7 guarantees that there exists a skew-symmetric D M n (C satisfying DD T = ( 1 α D is singular. Hence, DD T is singular and α =±. The backward implication can be shown by direct computation... The case F = R I. Now,sincen is odd, the skew-symmetric Notice that O n (R = U n (R. Whenn = 1, only the integers can be written as a sum of elements of O 1 (R. Suppose that n =. We mimic the computations done in the case when F = C. Let θ R be given, set α = cos θ, and set β = sin θ. Then A (α, β in Eq. ( isanelementofo (R. Moreover, A 1 + A = cos θi.now,foreveryδ R,thereexistapositiveintegerm and θ R such that m cos θ = δ. We conclude that every A M (R can be written as a sum of an even number of matrices from O (R. When n = 3, we again mimic the computations done in the case when F = C using α = cos θ and β = sin θ to show that for every δ R,thematrixδI 3 can be written as a sum of an even number of matrices from O 3 (R. Let n be a given integer. If n = k is even, then write δi k = δi δi (k copies, and note that each δi can be written as a sum of an even number of matrices from O (R. Ifn = k + 1 is odd, then write δi k+1 = δi n δi 3. Now,δI n can be written as a sum of an even number of matrices from O n (R and δi 3 can be written as a sum of an even number of matrices from O 3 (R. We conclude that δi k+1 can be written as a sum of an even number of matrices from O k+1 (R.

6 D.I. Merino / Linear Algebra and its Applications 36 ( Hence, Lemma guarantees that for every integer n, every A M n (R can be written as a sum of matrices from O n (R. Theorem 10. Let n be a given integer. Every A M n (R can be written as a sum of matrices from O n (R = U n (R. Let n be a given integer and let U U n (R be given. Then U U n (C O n (C, that is, a real orthogonal matrix is both complex unitary and complex orthogonal. Hence, an A M n (R, which is a sumofmatricesinu n (R is both a sum of complex unitary matrices and a sum of complex orthogonal matrices. Thus, the restrictions on these cases apply. If k is a positive integer such that σ 1 (A > k, then A cannot be written as a sum of k real orthogonal matrices. Let m be a positive integer. Theorem 9 guarantees that I M m+1 (C cannot be written as a sum of two matrices in O m+1 (C. Now,I cannot be written as a sum of two matrices from O m+1 (R O m+1 (C. In general, if α/ {, 0, } and if Q O m+1 (R, thenαq cannot be written as a sum of two matrices from O m+1 (R. Let n be a given integer, and let A M n (R be given. We now look at the matrices in O n (R that make up the sum A. Definition 11. Let θ R be given. We define A (θ cos θ sin θ and B (θ cos θ sin θ. (8 sin θ cos θ sin θ cos θ Set K B (0 and notice that A (0 = I. Let 0 r, s R be given, and let k be an integer. If r, s k, then Lemma 3 and taking the real and imaginary parts of the equation e iθ 1 + +e iθ k = α (9 show that there exist θ 1,..., θ k R such that A (θ 1 + +A (θ k = ri. Moreover, there exist β 1,..., β k R such that B (β 1 + +B (β k = sk. Theorem 1. Let a positive integer n and let A M n (R be given. Suppose that k is an integer such that σ 1 (A k. Then A can be written as a sum of k matricesino n (R. Moreover, for every integer m k, the matrix A can be written as a sum of m matrices in O n (R. Proof. Let A = U V be a singular value decomposition of A. Then Lemma 1 guarantees that we only need to concern ourselves with. For n = 1, notice that diag(σ 1,σ = si + tk, where s = 1 (σ 1 + σ and t = 1 (σ 1 σ. Now, 0 t s k. Notice that si and tk can each be written as a sum of k orthogonal matrices. Moreover, for each integer p k, notice that si can be written as a sum of p orthogonal matrices. Hence, si + tk can be written as a sum of p + k orthogonal matrices. For n > 1, write = diag(σ 1,σ,..., σ n 1,σ n = diag(σ 1,σ diag(σ n 1,σ n.notice now that for each j = 1,..., n,diag ( σ j 1,σ j can be written as a sum of k orthogonal matrices, say P j1,..., P j(k. For each l = 1,..., k, setq l P 1l P nl, and notice that = Q 1 + +Q k. Finally, notice that for each integer m k and for each j = 1,..., n, the matrix diag ( σ j 1,σ j is also a sum of m orthogonal matrices. Consider C 0 diag(b, a with real numbers b a 0. If b, then Theorem 1 ensures that C 0 can be written as a sum of real orthogonal matrices. Moreover, for each integer t, C 0 can be written as a sum of t real orthogonal matrices. Suppose that b 3. If 0 b, then Theorem 1 guarantees that C 0 can be written as a sum of real orthogonal matrices. Moreover, C 0 can also be written as a sum of 5 real orthogonal matrices. If < b 3, then we look at two cases: (i 0 a 1 and (ii 1 a 3. In the first case, set C 1 C 0 K. Then 0 b 1 and 0 a + 1 <. Notice now that for each integer t, C 1

7 1966 D.I. Merino / Linear Algebra and its Applications 36 ( can be written as a sum of t real orthogonal matrices. In the second case, set C 1 C 0 I. Then we have 0 a 1 b 1. Theorem 1 guarantees that for each integer t, C 1 can be written as a sum of t real orthogonal matrices. Hence, for each integer t 5, C 0 can be written as a sum of t real orthogonal matrices. We now use induction to show that if k is an integer satisfying b k, thenforeachinteger t k +, C 0 can be written as a sum of t real orthogonal matrices. Suppose that the claim is true for some integer k 3. We show that the claim is true when 0 b k + 1. If 0 b k, then our inductive hypothesis guarantees that for each integer t k +, C 0 can be written as a sum of t (and hence, also of t k + 3 real orthogonal matrices. If k < b k + 1, we take a look at two cases: (i 1 a k + 1 and (ii 0 a < 1. In case (i, set C 1 C 0 I ; and in case (ii, set C 1 C 0 K. We summarize our results. Lemma 13. Let C M (R be given. Suppose that k is an integer such that σ 1 (C k. Then for each integer t k +, C can be written as a sum of t matrices from U (R. Let A M n (R be given, and suppose that the singular values of A are σ 1 σ n 0. Set D diag(σ 1,..., σ n.writed = diag(σ 1,σ diag(σ n 1,σ n.letk be an integer such that σ 1 (A k. Then Lemma 13 guarantees that for each integer t k +, and for each j = 1,..., n, diag ( σ j 1,σ j canbewrittenasasumoft real orthogonal matrices. We conclude that for each integer t k +, A can be written as a sum of t real orthogonal matrices. Theorem 1. Let n be positive integer, and let A M n (R be given. Suppose that k is an integer such that σ 1 (A k. Then for each integer t k +, A can be written as a sum of t matrices in U n (R. Let A M 3 (R be given. Suppose that A = P Q, withp, Q O 3 (R and = diag(a, b, c with 0 c b a. If a =, then notice that diag(b, c can be written as a sum of four orthogonal matrices. One checks that can be written as a sum of four real orthogonal matrices. Suppose a <. If c = 0, then can be written as a sum of four orthogonal matrices. If 0 = c <, then choose θ so that cos θ = c. Notice that A (θ + A ( θ = cos θi.setu 1 = [1] A (θ and set U = [ 1] A ( θ. Then (U 1 + U = diag(a, b c, 0, which can be written as a sum of four real orthogonal matrices. Hence, A can be written as a sum of six real orthogonal matrices. Let n be a given positive integer and let A M n+1 (R. Let A=P Q be the singular value decomposition of A. Suppose that k is a positive integer such that σ 1 (A k. If k, then A can be written as a sum of at most six matrices in O n+1 (R. If k > and if σ 1 (A =k, wewrite = [k] diag(σ,σ 3 diag(σ n,σ n+1. Notice that each of the -by- matrices can be written as a sum of k+ (or more orthogonal matrices. Hence, canbewrittenasasumofk+matricesfromo n+1 (R. Suppose that σ 1 < k. Ifk = 3, choose θ so that σ 1 cos θ =. For j = 3,..., n + 1, set d j = 1; if σ j, then set e j = 1, and if σ j <, then set e j = 1. Set D = diag(d 3,..., d n+1 and set E = diag(e 3,..., e n+1.setu 1 = A (θ D and set U = A ( θ E. Notice that (U 1 + U can be written as a sum of four orthogonal matrices, so that is a sum of six orthogonal matrices. If k, choose θ so that σ 1 cos θ = k. MakethesamechoicesforD and E as in the case k = 3, and also make the same choices for U 1 and U. Notice now that can be written as a sum of k + orthogonal matrices. We summarize our results. Theorem 15. Let A M n+1 (R be given. Suppose k is an integer such that σ 1 (A k. If k 3, then A can be written as a sum of at most six matrices in O n+1 (R. If k, then A can be written as a sum of k + matrices in O n+1 (R. Let A M n+1 (R be given. Write A = P Q, with the singular values arranged in decreasing order, that is, σ 1 σ n+1. Let U = diag(u 1,..., u n+1, where u i = 1ifσ i 1 and u i = 1 otherwise. Consider U. Then, we have subtracted 1 to those singular values that are bigger than

8 D.I. Merino / Linear Algebra and its Applications 36 ( and we have added 1 to the singular values that are less than 1. Suppose that σ 1 k and k >. Repeating this process k 3 more times results in a matrix whose (diagonal entries are only between 0 and. Suppose that σ 1. Then B diag(σ 1,σ can be written as a sum of four or more orthogonal matrices, say B = t i=1 Q i. If t is even, set P i = Q i [ ( 1 i+1]. Let C = diag(σ 1,σ,σ 3 and let D = t i=1 P i. Then C D = diag(0, 0,σ 3 can be written as a sum of four orthogonal matrices. If t is odd and if σ 3 1, set P i = Q i [ ( 1 i+1]. Then C D = diag(0, 0,σ 3 1 is a sum of four orthogonal matrices. If t is odd and if σ 3 < 1, set P i = Q i [ ( 1 i].thenc D = diag(0, 0,σ is a sum of four orthogonal matrices. Hence, A can be written as a sum of k + 6 or more orthogonal matrices..3. The case F = H Let H be the set of quaternions with real coefficients, that is, let H = {a + bi + cj +dk : a, b, c, d R}. Let M n (H be the set of n-by-n matrices with entries from H. See [6] for a discussion on M n (H. Notice that U 1 (H = {z H : z = 1}. Letz = a + bi + cj + dk H be given. Then z = x + yj, where x = a + bi C and y = c + di C. Now, x and y can be written as a sum of elements of U 1 (C. Note that if p U 1 (C,thenp and pj are elements of U 1 (H. One checks that U n (H forms a group under multiplication, so that Lemma 1 applies. Let n. Then, xi and yi M n (C can be written as a sum of matrices from U n (C. Now, if U U n (C, then U and Uj U n (H. Hence, zi can be written as a sum of matrices in U n (H. Following the proof of Lemma, this shows that αe 11 can be written as a sum of matrices from U n (H. Now,forpermutation matrices P, Q U n (H, noticethatp (αe 11 Q = αpe 11 Q,asα H commutes with real matrices. Thus, every A M n (H can be written as a sum of matrices from U n (H. Let A M n (H be given, and write A = U V. Suppose that σ 1 (A k, and suppose that k. Then canbewrittenasasumofk unitary matrices in M n (C. Hence, A canbewrittenasasumof k matrices from U n (H. Theorem 16. Let n be a given positive integer. Let A M n (H be given. Then A can be written as a sum of matrices from U n (H. Moreover,ifk is an integer such that σ 1 (A k, then A can be written as a sum of k matrices from U n (H. Let A, B M n (H be given. We say that A is orthogonal if AA T = I. Notice that (AB T is not necessarily equal to B T A T.Whenn = 1, the equality fails to hold because multiplication of quaternions i j is not commutative. Let C = i and let D = j. One checks that both C and D are orthogonal. However, CD = + k j i is not orthogonal, that is, the set of i j + k orthogonal matrices in M (H does not form a group under multiplication. Let n. Set E = C I n and set F = D I n. Then, E, F O n (H but EF / O n (H. Hence, O n (H does not form a group under multiplication. Let an integer n and let X, Y M n (R. Then X + Yi M n (C can be written as a sum of matrices from O n (C. Similarly, X + Yj can be written as a sum of matrices from O n (R + Rj and X + Yk can be written as a sum of matrices from O n (R + Rk. Hence, every A M n (H can be written as a sum of matrices from O n (H. Theorem 17. Let n be a given integer. Let A M n (H be given. Then A can be written as a sum of matrices from O n (H.

9 1968 D.I. Merino / Linear Algebra and its Applications 36 ( References [1] R.A. Horn, C.R. Johnson, Matrix Analysis, Cambridge University Press, New York, NY, [] R.A. Horn, C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, New York, NY, [3] R.A. Horn, D.I. Merino, Contragredient equivalence: a canonical form and some applications, Linear Algebra Appl. 1 ( [] C.K. Li, Y.T. Poon, N.S. Sze, Eigenvalues of the sum of matrices from unitary similarity orbits, SIAM J. Matrix Anal. Appl. 30 ( ( [5] F.Y. Wu, Additive combinations of special operators, Functional Analysis and Operator Theory Banach Center Publication, vol. 30, Institute of Mathematics, Polish Academy of Sciences, Warszawa, 199, pp [6] F. Zhang, Quaternions and matrices of quaternions, Linear Algebra Appl. 51 (

Skew-coninvolutory matrices

Skew-coninvolutory matrices Linear Algebra and its Applications 426 (2007) 540 557 www.elsevier.com/locate/laa Skew-coninvolutory matrices Ma. Nerissa M. Abara a, Dennis I. Merino b,, Agnes T. Paras a a Department of Mathematics,

More information

arxiv: v1 [math.ra] 8 Aug 2016

arxiv: v1 [math.ra] 8 Aug 2016 Each n-by-n matrix with n > 1 is a sum of 5 coninvolutory matrices arxiv:1608.02503v1 math.ra 8 Aug 2016 Ma. Nerissa M. Abara b, Dennis I. Merino 1,, Vyacheslav I. Rabanovich c, Vladimir V. Sergeichuk

More information

Orthogonal similarity of a real matrix and its transpose

Orthogonal 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 information

Some inequalities for sum and product of positive semide nite matrices

Some 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 information

Spectral inequalities and equalities involving products of matrices

Spectral 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 information

A property concerning the Hadamard powers of inverse M-matrices

A property concerning the Hadamard powers of inverse M-matrices Linear Algebra and its Applications 381 (2004 53 60 www.elsevier.com/locate/laa A property concerning the Hadamard powers of inverse M-matrices Shencan Chen Department of Mathematics, Fuzhou University,

More information

Characterization of half-radial matrices

Characterization 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 information

Wavelets and Linear Algebra

Wavelets and Linear Algebra Wavelets and Linear Algebra 4(1) (2017) 43-51 Wavelets and Linear Algebra Vali-e-Asr University of Rafsanan http://walavruacir Some results on the block numerical range Mostafa Zangiabadi a,, Hamid Reza

More information

Spectrally arbitrary star sign patterns

Spectrally arbitrary star sign patterns Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,

More information

Minimum number of non-zero-entries in a 7 7 stable matrix

Minimum number of non-zero-entries in a 7 7 stable matrix Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a

More information

Intrinsic products and factorizations of matrices

Intrinsic products and factorizations of matrices Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences

More information

Matrix Inequalities by Means of Block Matrices 1

Matrix 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 information

QUASI-DIAGONALIZABLE AND CONGRUENCE-NORMAL MATRICES. 1. Introduction. A matrix A C n n is normal if AA = A A. A is said to be conjugate-normal if

QUASI-DIAGONALIZABLE AND CONGRUENCE-NORMAL MATRICES. 1. Introduction. A matrix A C n n is normal if AA = A A. A is said to be conjugate-normal if QUASI-DIAGONALIZABLE AND CONGRUENCE-NORMAL MATRICES H. FAßBENDER AND KH. D. IKRAMOV Abstract. A matrix A C n n is unitarily quasi-diagonalizable if A can be brought by a unitary similarity transformation

More information

Linear and Multilinear Algebra. Linear maps preserving rank of tensor products of matrices

Linear and Multilinear Algebra. Linear maps preserving rank of tensor products of matrices Linear maps preserving rank of tensor products of matrices Journal: Manuscript ID: GLMA-0-0 Manuscript Type: Original Article Date Submitted by the Author: -Aug-0 Complete List of Authors: Zheng, Baodong;

More information

Numerical Linear Algebra Homework Assignment - Week 2

Numerical Linear Algebra Homework Assignment - Week 2 Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.

More information

Two applications of the theory of primary matrix functions

Two applications of the theory of primary matrix functions Linear Algebra and its Applications 361 (2003) 99 106 wwwelseviercom/locate/laa Two applications of the theory of primary matrix functions Roger A Horn, Gregory G Piepmeyer Department of Mathematics, University

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds

More information

Absolute value equations

Absolute value equations Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West

More information

Chapter XI Novanion rings

Chapter XI Novanion rings Chapter XI Novanion rings 11.1 Introduction. In this chapter we continue to provide general structures for theories in physics. J. F. Adams proved in 1960 that the only possible division algebras are at

More information

The minimum rank of matrices and the equivalence class graph

The minimum rank of matrices and the equivalence class graph Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,

More information

Convexity of the Joint Numerical Range

Convexity 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 information

Cospectral graphs and the generalized adjacency matrix

Cospectral graphs and the generalized adjacency matrix Linear Algebra and its Applications 42 2007) 41 www.elsevier.com/locate/laa Cospectral graphs and the generalized adjacency matrix E.R. van Dam a,1, W.H. Haemers a,, J.H. Koolen b,2 a Tilburg University,

More information

A property of orthogonal projectors

A property of orthogonal projectors Linear Algebra and its Applications 354 (2002) 35 39 www.elsevier.com/locate/laa A property of orthogonal projectors Jerzy K. Baksalary a,, Oskar Maria Baksalary b,tomaszszulc c a Department of Mathematics,

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors /88 Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Eigenvalue Problem /88 Eigenvalue Equation By definition, the eigenvalue equation for matrix

More information

Complex Numbers and Quaternions for Calc III

Complex Numbers and Quaternions for Calc III Complex Numbers and Quaternions for Calc III Taylor Dupuy September, 009 Contents 1 Introduction 1 Two Ways of Looking at Complex Numbers 1 3 Geometry of Complex Numbers 4 Quaternions 5 4.1 Connection

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra its Applications 432 21) 394 41 Contents lists available at ScienceDirect Linear Algebra its Applications journal homepage: wwwelseviercom/locate/laa On the Perron exponents of discrete

More information

1 Linear Algebra Problems

1 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 information

Convexity and Star-shapedness of Real Linear Images of Special Orthogonal Orbits

Convexity and Star-shapedness of Real Linear Images of Special Orthogonal Orbits Convexity and Star-shapedness of Real Linear Images of Special Orthogonal Orbits Pan-Shun Lau 1, Tuen-Wai Ng 1, and Nam-Kiu Tsing 1 1 Department of Mathematics, The University of Hong Kong, Pokfulam, Hong

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 433 (2010) 476 482 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Nonsingularity of the

More information

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

Throughout 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 information

b jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60

b jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60 On the Hu-Hurley-Tam Conjecture Concerning The Generalized Numerical Range Che-Man Cheng Faculty of Science and Technology, University of Macau, Macau. E-mail: fstcmc@umac.mo and Chi-Kwong Li Department

More information

Sums of diagonalizable matrices

Sums of diagonalizable matrices Linear Algebra and its Applications 315 (2000) 1 23 www.elsevier.com/locate/laa Sums of diagonalizable matrices J.D. Botha Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 436 (2012) 2054 2066 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa An eigenvalue

More information

EXERCISES. a b = a + b l aq b = ab - (a + b) + 2. a b = a + b + 1 n0i) = oii + ii + fi. A. Examples of Rings. C. Ring of 2 x 2 Matrices

EXERCISES. a b = a + b l aq b = ab - (a + b) + 2. a b = a + b + 1 n0i) = oii + ii + fi. A. Examples of Rings. C. Ring of 2 x 2 Matrices / rings definitions and elementary properties 171 EXERCISES A. Examples of Rings In each of the following, a set A with operations of addition and multiplication is given. Prove that A satisfies all the

More information

The estimation of eigenvalues of sum, difference, and tensor product of matrices over quaternion division algebra

The estimation of eigenvalues of sum, difference, and tensor product of matrices over quaternion division algebra Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 3023 3033 www.elsevier.com/locate/laa The estimation of eigenvalues of sum, difference, and tensor product of matrices

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 436 (2012) 99 111 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On weighted directed

More information

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

MATH 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 information

Math 108b: Notes on the Spectral Theorem

Math 108b: Notes on the Spectral Theorem Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator

More information

Math 408 Advanced Linear Algebra

Math 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 information

Interpolating the arithmetic geometric mean inequality and its operator version

Interpolating the arithmetic geometric mean inequality and its operator version Linear Algebra and its Applications 413 (006) 355 363 www.elsevier.com/locate/laa Interpolating the arithmetic geometric mean inequality and its operator version Rajendra Bhatia Indian Statistical Institute,

More information

The skew-symmetric orthogonal solutions of the matrix equation AX = B

The skew-symmetric orthogonal solutions of the matrix equation AX = B Linear Algebra and its Applications 402 (2005) 303 318 www.elsevier.com/locate/laa The skew-symmetric orthogonal solutions of the matrix equation AX = B Chunjun Meng, Xiyan Hu, Lei Zhang College of Mathematics

More information

Yimin Wei a,b,,1, Xiezhang Li c,2, Fanbin Bu d, Fuzhen Zhang e. Abstract

Yimin Wei a,b,,1, Xiezhang Li c,2, Fanbin Bu d, Fuzhen Zhang e. Abstract Linear Algebra and its Applications 49 (006) 765 77 wwwelseviercom/locate/laa Relative perturbation bounds for the eigenvalues of diagonalizable and singular matrices Application of perturbation theory

More information

ABSOLUTELY FLAT IDEMPOTENTS

ABSOLUTELY FLAT IDEMPOTENTS ABSOLUTELY FLAT IDEMPOTENTS JONATHAN M GROVES, YONATAN HAREL, CHRISTOPHER J HILLAR, CHARLES R JOHNSON, AND PATRICK X RAULT Abstract A real n-by-n idempotent matrix A with all entries having the same absolute

More information

Quadratic Gauss sums on matrices

Quadratic Gauss sums on matrices Linear Algebra and its Applications 384 (2004) 187 198 www.elsevier.com/locate/laa Quadratic Gauss sums on matrices Mitsuru Kuroda 410, Haitsu-hosha, 61, Nojiri-cho, Sakai, Osaka 599-8116, Japan Received

More information

Linear Algebra: Matrix Eigenvalue Problems

Linear 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 information

On the second Laplacian eigenvalues of trees of odd order

On the second Laplacian eigenvalues of trees of odd order Linear Algebra and its Applications 419 2006) 475 485 www.elsevier.com/locate/laa On the second Laplacian eigenvalues of trees of odd order Jia-yu Shao, Li Zhang, Xi-ying Yuan Department of Applied Mathematics,

More information

The Perron eigenspace of nonnegative almost skew-symmetric matrices and Levinger s transformation

The Perron eigenspace of nonnegative almost skew-symmetric matrices and Levinger s transformation Linear Algebra and its Applications 360 (003) 43 57 www.elsevier.com/locate/laa The Perron eigenspace of nonnegative almost skew-symmetric matrices and Levinger s transformation Panayiotis J. Psarrakos

More information

Two Results About The Matrix Exponential

Two Results About The Matrix Exponential Two Results About The Matrix Exponential Hongguo Xu Abstract Two results about the matrix exponential are given. One is to characterize the matrices A which satisfy e A e AH = e AH e A, another is about

More information

CANONICAL FORMS, HIGHER RANK NUMERICAL RANGES, TOTALLY ISOTROPIC SUBSPACES, AND MATRIX EQUATIONS

CANONICAL FORMS, HIGHER RANK NUMERICAL RANGES, TOTALLY ISOTROPIC SUBSPACES, AND MATRIX EQUATIONS CANONICAL FORMS, HIGHER RANK NUMERICAL RANGES, TOTALLY ISOTROPIC SUBSPACES, AND MATRIX EQUATIONS CHI-KWONG LI AND NUNG-SING SZE Abstract. Results on matrix canonical forms are used to give a complete description

More information

Multiple eigenvalues

Multiple eigenvalues Multiple eigenvalues arxiv:0711.3948v1 [math.na] 6 Nov 007 Joseph B. Keller Departments of Mathematics and Mechanical Engineering Stanford University Stanford, CA 94305-15 June 4, 007 Abstract The dimensions

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 432 2010 661 669 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On the characteristic and

More information

On matrix equations X ± A X 2 A = I

On matrix equations X ± A X 2 A = I Linear Algebra and its Applications 326 21 27 44 www.elsevier.com/locate/laa On matrix equations X ± A X 2 A = I I.G. Ivanov,V.I.Hasanov,B.V.Minchev Faculty of Mathematics and Informatics, Shoumen University,

More information

The effect on the algebraic connectivity of a tree by grafting or collapsing of edges

The effect on the algebraic connectivity of a tree by grafting or collapsing of edges Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 855 864 www.elsevier.com/locate/laa The effect on the algebraic connectivity of a tree by grafting or collapsing

More information

Linear Algebra. Workbook

Linear 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 information

Tactical Decompositions of Steiner Systems and Orbits of Projective Groups

Tactical Decompositions of Steiner Systems and Orbits of Projective Groups Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON

More information

The inverse of a tridiagonal matrix

The inverse of a tridiagonal matrix Linear Algebra and its Applications 325 (2001) 109 139 www.elsevier.com/locate/laa The inverse of a tridiagonal matrix Ranjan K. Mallik Department of Electrical Engineering, Indian Institute of Technology,

More information

On the Hermitian solutions of the

On the Hermitian solutions of the Journal of Applied Mathematics & Bioinformatics vol.1 no.2 2011 109-129 ISSN: 1792-7625 (print) 1792-8850 (online) International Scientific Press 2011 On the Hermitian solutions of the matrix equation

More information

SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra

SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra 1.1. Introduction SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 435 (2011) 2889 2895 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Idempotent elements

More information

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background Lecture notes on Quantum Computing Chapter 1 Mathematical Background Vector states of a quantum system with n physical states are represented by unique vectors in C n, the set of n 1 column vectors 1 For

More information

Applied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices

Applied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices Applied Mathematics Letters 25 (202) 2339 2343 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Comparison theorems for a subclass

More information

Linear Algebra (Review) Volker Tresp 2018

Linear Algebra (Review) Volker Tresp 2018 Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications xxx (2008) xxx xxx Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Graphs with three distinct

More information

3 (Maths) Linear Algebra

3 (Maths) Linear Algebra 3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra

More information

Econ Slides from Lecture 7

Econ Slides from Lecture 7 Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for

More information

Definition 2.3. We define addition and multiplication of matrices as follows.

Definition 2.3. We define addition and multiplication of matrices as follows. 14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row

More information

j=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p.

j=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p. LINEAR ALGEBRA Fall 203 The final exam Almost all of the problems solved Exercise Let (V, ) be a normed vector space. Prove x y x y for all x, y V. Everybody knows how to do this! Exercise 2 If V is a

More information

Graphs with given diameter maximizing the spectral radius van Dam, Edwin

Graphs with given diameter maximizing the spectral radius van Dam, Edwin Tilburg University Graphs with given diameter maximizing the spectral radius van Dam, Edwin Published in: Linear Algebra and its Applications Publication date: 2007 Link to publication Citation for published

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,

More information

Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2

Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2 Solutions to odd-numbered exercises Peter J Cameron, Introduction to Algebra, Chapter 1 The answers are a No; b No; c Yes; d Yes; e No; f Yes; g Yes; h No; i Yes; j No a No: The inverse law for addition

More information

Matrix Factorization and Analysis

Matrix Factorization and Analysis Chapter 7 Matrix Factorization and Analysis Matrix factorizations are an important part of the practice and analysis of signal processing. They are at the heart of many signal-processing algorithms. Their

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors Chapter 1 Eigenvalues and Eigenvectors Among problems in numerical linear algebra, the determination of the eigenvalues and eigenvectors of matrices is second in importance only to the solution of linear

More information

Sydney University Mathematical Society Problems Competition Solutions.

Sydney University Mathematical Society Problems Competition Solutions. Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed

More information

Jordan Canonical Form of A Partitioned Complex Matrix and Its Application to Real Quaternion Matrices

Jordan 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 information

Linear Algebra in Actuarial Science: Slides to the lecture

Linear Algebra in Actuarial Science: Slides to the lecture Linear Algebra in Actuarial Science: Slides to the lecture Fall Semester 2010/2011 Linear Algebra is a Tool-Box Linear Equation Systems Discretization of differential equations: solving linear equations

More information

Bounds for Levinger s function of nonnegative almost skew-symmetric matrices

Bounds for Levinger s function of nonnegative almost skew-symmetric matrices Linear Algebra and its Applications 416 006 759 77 www.elsevier.com/locate/laa Bounds for Levinger s function of nonnegative almost skew-symmetric matrices Panayiotis J. Psarrakos a, Michael J. Tsatsomeros

More information

Diagonalizing Matrices

Diagonalizing Matrices Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B

More information

Linear Algebra 1. M.T.Nair Department of Mathematics, IIT Madras. and in that case x is called an eigenvector of T corresponding to the eigenvalue λ.

Linear Algebra 1. M.T.Nair Department of Mathematics, IIT Madras. and in that case x is called an eigenvector of T corresponding to the eigenvalue λ. Linear Algebra 1 M.T.Nair Department of Mathematics, IIT Madras 1 Eigenvalues and Eigenvectors 1.1 Definition and Examples Definition 1.1. Let V be a vector space (over a field F) and T : V V be a linear

More information

Positive definite solutions of some matrix equations

Positive definite solutions of some matrix equations Available online at www.sciencedirect.com Linear Algebra and its Applications 49 (008) 40 44 www.elsevier.com/locate/laa Positive definite solutions of some matrix equations Aleksandar S. Cvetković, Gradimir

More information

Means of unitaries, conjugations, and the Friedrichs operator

Means of unitaries, conjugations, and the Friedrichs operator J. Math. Anal. Appl. 335 (2007) 941 947 www.elsevier.com/locate/jmaa Means of unitaries, conjugations, and the Friedrichs operator Stephan Ramon Garcia Department of Mathematics, Pomona College, Claremont,

More information

An estimation of the spectral radius of a product of block matrices

An estimation of the spectral radius of a product of block matrices Linear Algebra and its Applications 379 (2004) 267 275 wwwelseviercom/locate/laa An estimation of the spectral radius of a product of block matrices Mei-Qin Chen a Xiezhang Li b a Department of Mathematics

More information

5.6. PSEUDOINVERSES 101. A H w.

5.6. PSEUDOINVERSES 101. A H w. 5.6. PSEUDOINVERSES 0 Corollary 5.6.4. If A is a matrix such that A H A is invertible, then the least-squares solution to Av = w is v = A H A ) A H w. The matrix A H A ) A H is the left inverse of A and

More information

Mathematics. EC / EE / IN / ME / CE. for

Mathematics.   EC / EE / IN / ME / CE. for Mathematics for EC / EE / IN / ME / CE By www.thegateacademy.com Syllabus Syllabus for Mathematics Linear Algebra: Matrix Algebra, Systems of Linear Equations, Eigenvalues and Eigenvectors. Probability

More information

On the spectral radius of graphs with cut edges

On the spectral radius of graphs with cut edges Linear Algebra and its Applications 389 (2004) 139 145 www.elsevier.com/locate/laa On the spectral radius of graphs with cut edges Huiqing Liu a,meilu b,, Feng Tian a a Institute of Systems Science, Academy

More information

Inertially arbitrary nonzero patterns of order 4

Inertially arbitrary nonzero patterns of order 4 Electronic Journal of Linear Algebra Volume 1 Article 00 Inertially arbitrary nonzero patterns of order Michael S. Cavers Kevin N. Vander Meulen kvanderm@cs.redeemer.ca Follow this and additional works

More information

Linear Algebra - Part II

Linear Algebra - Part II Linear Algebra - Part II Projection, Eigendecomposition, SVD (Adapted from Sargur Srihari s slides) Brief Review from Part 1 Symmetric Matrix: A = A T Orthogonal Matrix: A T A = AA T = I and A 1 = A T

More information

The total positivity interval

The total positivity interval Linear Algebra and its Applications 393 (2004) 197 202 wwwelseviercom/locate/laa The total positivity interval GML Gladwell a,, K Ghanbari b a Department of Civil Engineering, University of Waterloo, Waterloo,

More information

determinantal conjecture, Marcus-de Oliveira, determinants, normal matrices,

determinantal conjecture, Marcus-de Oliveira, determinants, normal matrices, 1 3 4 5 6 7 8 BOUNDARY MATRICES AND THE MARCUS-DE OLIVEIRA DETERMINANTAL CONJECTURE AMEET SHARMA Abstract. We present notes on the Marcus-de Oliveira conjecture. The conjecture concerns the region in the

More information

arxiv: v1 [math.rt] 16 Jun 2015

arxiv: v1 [math.rt] 16 Jun 2015 Representations of group rings and groups Ted Hurley arxiv:5060549v [mathrt] 6 Jun 205 Abstract An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is

More information

J. D. Botha* Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003, South Africa

J. D. Botha* Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003, South Africa NORIT]- ~ Products of Diagonalizable Matrices J. D. Botha* Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003, South Africa Submitted by Richard A. Brualdi ABSTRACT Let 0:

More information

On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs

On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs Saieed Akbari 1,2 Ebrahim Ghorbani 1,2 Jacobus H. Koolen 3,4 Mohammad Reza Oboudi 1,2 1 Department of Mathematical Sciences

More information

Minimizing the Laplacian eigenvalues for trees with given domination number

Minimizing the Laplacian eigenvalues for trees with given domination number Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School

More information

Banach Journal of Mathematical Analysis ISSN: (electronic)

Banach Journal of Mathematical Analysis ISSN: (electronic) Banach J. Math. Anal. 6 (2012), no. 1, 139 146 Banach Journal of Mathematical Analysis ISSN: 1735-8787 (electronic) www.emis.de/journals/bjma/ AN EXTENSION OF KY FAN S DOMINANCE THEOREM RAHIM ALIZADEH

More information

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES olume 10 2009, Issue 2, Article 41, 10 pp. ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG, AND HUA SHAO COLLEGE OF MATHEMATICS AND PHYSICS CHONGQING UNIERSITY

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 435 (011) 95 105 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Boolean invertible matrices

More information

Improved Multilevel Hadamard Matrices and their Generalizations over the Gaussian and Hamiltonian Integers

Improved Multilevel Hadamard Matrices and their Generalizations over the Gaussian and Hamiltonian Integers Improved Multilevel Hadamard Matrices and their Generalizations over the Gaussian and Hamiltonian Integers Sarah Spence Adams a, Elsa Culler b, Mathav Kishore Murugan c, Connor Stokes b, Steven Zhang b

More information

ACI-matrices all of whose completions have the same rank

ACI-matrices all of whose completions have the same rank ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices

More information

Moore Penrose inverses and commuting elements of C -algebras

Moore 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 information

MATHEMATICS 217 NOTES

MATHEMATICS 217 NOTES MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable

More information

1 Positive definiteness and semidefiniteness

1 Positive definiteness and semidefiniteness Positive definiteness and semidefiniteness Zdeněk Dvořák May 9, 205 For integers a, b, and c, let D(a, b, c) be the diagonal matrix with + for i =,..., a, D i,i = for i = a +,..., a + b,. 0 for i = a +

More information