Proving a Theorem, related to Gerschgorin

  • Thread starter Thread starter syj
  • Start date Start date
  • Tags Tags
    Theorem
syj
Messages
53
Reaction score
0

Homework Statement


Here is the theorem I need to prove:

For A=(aij)\inCnxn

we have

p(A)\leqmax_{i}\Sigma^{n}_{j=1}|aij|


Homework Equations





The Attempt at a Solution


I have no idea how to go about this. :cry:
 
Physics news on Phys.org
Some definitions might be nice.
What is C_{n \times n}? What is p(A)? What does i run over?
 
Sorry,
Cnxn is the set of nxn matrices with entries in the complex number system.

p(A)= max{|\lambda1|, |\lambda2|, ...}

p(A) is the smallest circle in the comple plane, centered at the origin, which contains all the characteristic values of A.
 
Maybe it's a good idea to start with the simple case, where A is diagonalizable.
 
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...

Similar threads

Replies
11
Views
4K
Replies
16
Views
3K
Replies
11
Views
2K
Replies
11
Views
1K
Replies
6
Views
2K
Replies
2
Views
1K
Replies
5
Views
3K
Back
Top