• Tidak ada hasil yang ditemukan

E2 212: Homework - 4

N/A
N/A
Protected

Academic year: 2025

Membagikan "E2 212: Homework - 4"

Copied!
2
0
0

Teks penuh

(1)

E2 212: Homework - 4

1 Topics

• Eigenvalues and Eigenvectors

• Schur’s theorem

• Unitary equivalence

• Normal matrices

• QR decomposition and Jordan form

2 Problems

1. Letλ1, . . . , λn be the eigenvalues ofA∈Cn×n. Then, prove the following:

(a) trA=Pn i=1λi. (b) det (A) =Qn

i=1λi.

2. Let the eigenvectors and eigenvalues of the matrix A∈Cn×n be vi andλi such that λi 6=λj for all j 6=i, i= 1,2, . . . , r. Then, prove thatv1, . . . ,vr is a linearly independent set.

3. Let the subspaceU ⊆Cn×n be an invariant subspace under the matrix transformationA∈Cn×n, i.e., Au⊆U for allu∈U. Then, prove the following

(a) There exists a vectoru∈U andλ∈Csuch that Au=λu.

(b) If u1, . . . ,uk ∈ U are eigenvectors of A corresponding to distinct eigenvalues λ1, . . . , λk, then dim(U)≥k.

(c) The subspaceU,{v∈V :hu,vi= 0,for allu∈U}is also an invariant subspace with respect A.

4. Let σ(A) denote the spectrum of the matrixA. Show that for a triangular matrix A ∈Cn×n with entriesaij,σ(A) =Sn

i=1{aii}.

5. Let A ∈ Cn×n has n distinct eigenvalues in C. Then, prove that there exists an invertible matrix U ∈Cn×n and a diagonal matrixD such that

exp{A}=U DU−1.

6. LetA∈Cn×n,λ∈C. Prove that if (A−λIn)ju= 0 for somej≥1, andu∈Cn, then (A−λIn)nu= 0.

7. Letλ1, . . . , λn (not necessarily distinct) be the eigenvalues ofA∈Cn×n. Then,

n

X

i=1

i|2

n

X

i,j=1

|aij|2.

(2)

8. LetA∈Cn×n, andβ ,max{|aij|:i, j= 1,2, . . . , n}. Then,

|detA| ≤βnnn/2.

9. Prove that for every matrix A∈Cn×n, and for every >0, there exists a matrix A such thatA is equivalent to a diagonal matrix, and kA−AkF < .Hint: Use Schur’s theorem.

10. Let A,B ∈ Cn×n be given, and suppose A and B are simultaneously similar to upper triangular matrices: that is, S−1ASand S−1BS are both upper triangular for some nonsingularS. Show that every eigenvalue ofAB−BAmust be zero.

11. IfA∈Cn×n, show that rank ofAis not less than the number of nonzero eigenvalues ofA.

12. LetA∈Cn×n be a nonsingular matrix. Show that any matrix that commutes withA also commutes withA−1.

13. IfA ∈ Cn×n is normal, and if x and y are eigenvectors corresponding to distinct eigenvalues, show that xandyare orthogonal.

14. Show that a normal matrix is unitary if and only if all its eigenvalues have absolute value 1.

15. Show that a given matrixA∈Cn×n is normal if and only if (Ax)H(Ay) = (AHx)H(AHy).

16. Let n1, n2, . . . , nk be given positive integers and let Aj ∈Mnj, j = 1,2, . . . , k. Show that the direct sumA1⊕. . .⊕Ak is normal if and only if eachAj is normal.

17. Show that eachAk produced by theQRalgorithm is unitarily equivalent to A0,k= 1,2, . . ..

18. LetA∈Cn×n be given. Define

Kλ,{x∈Cn : (A−λI)px= 0 for some integerp >0}.

Prove that

(a) Ifλis an eigenvalue ofA, thenKλis aA−invariant subspace ofCn, i.e.,Ay⊆Kλfor ally∈Kλ. (b) Ifλis an eigenvalue ofAwith multiplicitym, then dim(Kλ)≤m.

19. Find an invertible matrixUsuch that U−1AUis in Jordan form when

A=

1 0 i

0 2 0

−i 0 1

,

where i=√

−1.

20. Find the Jordan form of the following matrices

B=

1 1 1 0 0 2 0 1 3

, C=

1 2 0

2 −4 2

−i 0 1

.

Referensi

Dokumen terkait

A theorem of Mirsky provides necessary and sufficient conditions for the existence of an N -square complex matrix with prescribed diagonal entries and prescribed eigenvalues.. A

Our aim in this section is to show that for any stable n -tuple ζ of complex numbers, n &gt; 1, consisting of real numbers and conjugate pairs, there exists a real stable n×n matrix

d Theorem 5.15 Lindenstrauss–Tzafriri [1].Assume thatEis a Banach space such that every closed subspace has a complement.8ThenEis Hilbertizable, i.e., there exists an equivalent Hilbert

1/2 point If A is a square invertible matrix then prove that the inverse ofA> is A−1> Solution: 6.. 2 points Prove that an×n matrix A is invertible if and only if Gaussian Elimination

Theorem 3.1 For every language L generated by a PC grammar system there exists an equivalent parallel communicating string- graph P system generating the string-graph language

The ‗n‘ value of ‗C‘ is also ‗n‘ 2.2 Mathematical proof generation of a self repetitive matrix for an ‘n’ AN = I as calculated before as it is a diagonal matrix and ‗n‘ is the LCM

MM then proceed to prove that because dividends and earnings are perfect economic substitutes in reasonably efficient markets: For a given investment policy of equivalent business

Multiplied by a scalar Examples To multiply a matrix by a single number n, every single element must be multiplied by that number n... You did