Eigenvalues and Norms: Showing Existence of a Nonsingular Matrix

  • Thread starter Thread starter xeno_gear
  • Start date Start date
  • Tags Tags
    Eigenvalues
xeno_gear
Messages
40
Reaction score
0

Homework Statement


Let A \in \mathbb{C}^{n \times n} and set \rho = \max_{1 \le i \le n}|\lambda_i|, where \lambda_i \, (i = 1, 2, \dots, n) are the eigenvalues of A. Show that for any \varepsilon > 0 there exists a nonsingular X \in \mathbb{C}^{n \times n} such that \|X^{-1}AX\|_2 \le \rho + \varepsilon.


Homework Equations


\| \cdot \|_2 is the induced 2-norm.


The Attempt at a Solution


Not much.. I know that \rho is the spectral radius, and as such is equal to the infimum of all the (induced) norms of A. Also, I know that A and X^{-1}AX have the same eigenvalue properties (eigenvalues, spectral radius, algebraic and geometric multiplicities) since they're similar matrices. I can't quite figure out how to use these though. Any thoughts? Thanks..
 
Physics news on Phys.org
Try and diagonalise you matrix A, and then use P as the matrix of eigenvectors, and look at X=P\cdot U then you can look at diagonal matrices, then i think it should be just a matter of differentiation.

I could be wrong though.
 
A is arbitrary and isn't necessarily diagonalizable. There's an SVD and a Schur factorization though.
 
Forget my suggestion: it doesn't work.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top