Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Homework 2: Scribes: Rajshekhar Bhat

    Uploaded by

    mayapur
    1. A matrix is nilpotent if it has only zero as an eigenvalue. 2. A matrix is invertible if and only if it does not have zero as an eigenvalue. 3. The eigenvalues of the inverse of an invertible matrix A are the reciprocals of the eigenvalues of A.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Homework 2: Scribes: Rajshekhar Bhat

    Uploaded by

    mayapur
    29 views2 pages
    1. A matrix is nilpotent if it has only zero as an eigenvalue. 2. A matrix is invertible if and only if it does not have zero as an eigenvalue. 3. The eigenvalues of the inverse of an invertible matrix A are the reciprocals of the eigenvalues of A.

    Original Description:

    Linear Algebra Chosen questions from David Lewis book.

    Original Title

    Homework 2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. A matrix is nilpotent if it has only zero as an eigenvalue. 2. A matrix is invertible if and only if it does not have zero as an eigenvalue. 3. The eigenvalues of the inverse of an invertible matrix A are the reciprocals of the eigenvalues of A.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    29 views2 pages

    Homework 2: Scribes: Rajshekhar Bhat

    Uploaded by

    mayapur
    1. A matrix is nilpotent if it has only zero as an eigenvalue. 2. A matrix is invertible if and only if it does not have zero as an eigenvalue. 3. The eigenvalues of the inverse of an invertible matrix A are the reciprocals of the eigenvalues of A.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Linear Algebra Aug - Dec 2019

    Homework 2
    Instructor: Rajshekhar Bhat Scribes: Rajshekhar Bhat

    1. A matrix A is said to be nilpotent if Ak = 0 for some k ∈ {1, 2, . . .}. Show that zero is the only
    eigenvalue of a nilpotent matrix A.
    2. Show that a matrix is invertible if and only if zero is not an eigenvalue of A.
    3. Let the spectrum of an invertible n × n matrix A be σ(A) = {λ1 , . . . , λn }. Find the spectrum of A−1 .
    (Recall that the spectrum of a matrix is a set of all its eigenvalues).
    4. If A is a rank 1 matrix, show that the trace of A is an eigenvalue of A.
    5. An n × n matrix is called a stochastic matrix if all the entries are non-negative and sum of the entries
    in each column is one. Show that |λ| ≤ 1, where λ is an eigenvalue of A.
    6. Find the minimum polynomial of following matrices:
       
    2 0 0 0 0 3
    0 2 2 and 0 0 4 (2.1)
    0 0 2 0 0 0
     
    2 3
    7. Is A = diagonalizable over C? If yes, find P such that P −1 AP = D, where D is a diagonal
    6 −1
    matrix.
    8. If an n × n matrix has trace zero and rank one, show that it is nilpotent.
    9. Find the Jordan form of
     
    1 0 0
    2 1 0 (2.2)
    0 2 1

    T
    10. Let A ∈ C be a skew-hermitian√ matrix, i.e., Ā = −A. Show that all the eigenvalues of A are of the
    form iα for α ∈ R, where i = −1.
       
    0 1 1 2
    11. Show that is a Schur form of .
    0 7 3 6

    12. Let σ(A) be the spectrum of an n × n matrix. Show that σ(p(A)) = {p(λ) | λ ∈ σ(A)} for any
    polynomial p in one variable.
    13. Show that two symmetric bilinear forms are equivalent if and only if any pair of matrices representing
    the forms are congruent.
    14. Determine if the following matrices are positive-definite:
       
    2 −2 1 1 0 0
    −2 1 0 and 2 1 0 (2.3)
    1 0 4 0 2 1

    2-1
    2-2 Homework 2

    15. Show that a hermitian matrix A ∈ Cn×n is positive definite if and only if A = P P̄ T for some P ∈ Cn×n .

    16. If A ∈ Rn×n is non-singular, show that we can find B and T such that A = BT , where B is positive-
    definite and T is orthogonal. This decomposition is called the polar decomposition of A.

    You might also like