Complex and upper triangular matrices

  • Thread starter Thread starter sassie
  • Start date Start date
  • Tags Tags
    Complex Matrices
Click For Summary
For any complex 2x2 matrix, it can be transformed into an upper triangular form using a similarity transformation, specifically PAP^-1, where P is an invertible matrix. The discussion highlights the importance of eigenvalues and eigenvectors in this process, suggesting that distinct eigenvalues lead to a straightforward diagonalization. There is some confusion regarding the terms "nilpotent" and "endomorphism," with clarification that not all upper triangular matrices are nilpotent. The conversation indicates that finding a split polynomial in C[X] that cancels the matrix is essential for proving upper triangularizability. Overall, understanding the relationship between linear transformations and matrix representations is crucial for solving the problem.
sassie
Messages
34
Reaction score
0

Homework Statement



Prove that for all complex two by two matrices, they will be upper triangular matrices (edit: i think what is meant by upper triangular matrices is that PAP^-1 will be upper triangular matrices - the wording of the question i was given was a little misleading it seems)

Homework Equations



A=PDP^-1

The Attempt at a Solution



The way I tried to do it was to show that A will have n distinct eigenval, whereby I let

A=[a b
c d]

i found the eigenvals for that. then and for the case a=d, tried to show that the eigenvec are not linearly independent. However, this is the correct way to do it? or is there a much easier solution to this question?
 
Last edited:
Physics news on Phys.org
Possibly interesting:
An endomorphism is a upper triangularizable endomorphism if and only if it does cancel a split polynomn(in your case, in C[X]).
 
penguin007 said:
Possibly interesting:
An endomorphism is a upper triangularizable endomorphism if and only if it does cancel a split polynomn(in your case, in C[X]).

oh dear. i don't even know what an endomorphism is. i probably can't use it to solve my problem!
 
In the context of linear algebra, 'endomorphism' is just the proper (and short) way of saying 'linear transformation of a space into itself'.At any rate, I don't understand the question. An upper triangular matrix is nilpotent and certainly not all linear transformations of C2 are nilpotent.
 
aPhilosopher said:
In the context of linear algebra, 'endomorphism' is just the proper (and short) way of saying 'linear transformation of a space into itself'.


At any rate, I don't understand the question. An upper triangular matrix is nilpotent and certainly not all linear transformations of C2 are nilpotent.


I'm not quite sure what you meant by nilpotent either (do you mean equal to zero when raised to a certain power?)

By I think what the question means is that there will be an invertible matrix P s.t. PAP^-1 is upper triangular, and is something to do with diagonalisation. not sure though.
 
An upper triangular matrix is not always nilpotent (a "strict" upper triangular one is).
And the link between endomorphism and your problem is that every square matrix can be interpreted as the matrix of an endomorphism in different basis.
But basically, you don't need to introduce it in your problem. You just need to find out a split polynomn in C[X] that cancles your matrix ( I think you can find one of degree 2 or 3).
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
5K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
0
Views
843
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 4 ·
Replies
4
Views
10K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K