Results 1 to 5 of 5

Math Help - Hard question about linear algebra 2

  1. #1
    Newbie
    Joined
    Jul 2012
    From
    anus
    Posts
    2

    Hard question about linear algebra 2

    does someone know how to solve the following?

    "Find all matrices A so
    I A
    0 I
    is Diagonalizable "

    this is a picture of the matrice
    http://i46.tinypic.com/258v514.jpg
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Prove It's Avatar
    Joined
    Aug 2008
    Posts
    11,560
    Thanks
    1425

    Re: Hard question about linear algebra 2

    Am I correct in assuming that 0 entry is the zero matrix?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Jul 2012
    From
    anus
    Posts
    2

    Re: Hard question about linear algebra 2

    yes
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Newbie
    Joined
    Jul 2012
    From
    Over here
    Posts
    4
    Thanks
    1

    Re: Hard question about linear algebra 2

    Block matrix - Wikipedia, the free encyclopedia

    Please correct me if I'm wrong, but doesn't that imply that A = 0?
    Follow Math Help Forum on Facebook and Google+

  5. #5
    GJA
    GJA is offline
    Member
    Joined
    Jul 2012
    From
    USA
    Posts
    109
    Thanks
    29

    Re: Hard question about linear algebra 2

    I think A=0 is correct, bopbop. In the following I will take M to be the original matrix, i.e. M is the given block matrix with A in the upper right corner. For generality, I'm assuming M is an n\times n matrix. Here's an outline of what I think supports this:

    1) An n \times n matrix is diagonalizable if and only if the sum of the dimensions of its eigenspaces is equal to n. See Diagonalizable matrix - Wikipedia, the free encyclopedia for this statement.

    2) Since the original matrix is upper triangular with 1's along the main diagonal, the only eigenvalue is 1.

    3) From 2) we know the only eigenspace is that corresponding to the eigenvalue 1, because there were no other eigenvalues. By definition, the eigenspace belonging to 1 is \text{Ker}(M-1I), where I is the n\times n identity matrix. For M to be diagonalizable, 1) tells us that we want the dimension of \text{Ker}(M-1I) (i.e. the nullity of M-1I) to be n. The matrix M-1I is the 2\times 2 block matrix with A in the upper right corner and 0's for the other entries. Now, if A\neq 0, then the rank of M-1I is at least one, because there will be at least one linearly independent column of M-1I when A\neq 0. By the rank-nullity theorem, this implies the nullity of M-1I is less than or equal to n-1. Since we require the nullity of M-1I to be n, we must have A=0.

    If something is unclear or incorrect let me know. Hope this helps, MisterF!
    Last edited by GJA; July 31st 2012 at 10:33 PM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Linear Algebra: Linear Independence question
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: May 3rd 2011, 05:28 AM
  2. Linear Algebra Question - Linear Operators
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: March 3rd 2009, 04:33 AM
  3. linear algebra, hard for me
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: March 24th 2008, 03:43 PM
  4. Linear algebra question...
    Posted in the Algebra Forum
    Replies: 1
    Last Post: September 30th 2007, 10:25 PM
  5. Really hard algebra question help plz
    Posted in the Algebra Forum
    Replies: 3
    Last Post: September 21st 2005, 04:03 PM

Search Tags


/mathhelpforum @mathhelpforum