Norm of a matrix and sum of eigenvalues
- Tolaso J Kos
- Administrator
- Posts: 867
- Joined: Sat Nov 07, 2015 6:12 pm
- Location: Larisa
- Contact:
Norm of a matrix and sum of eigenvalues
Let $A \in \mathcal{M}_{n \times n}(\mathbb{C})$ and let $\ell_1, \dots, \ell_n$ be its eigenvalues. Prove that:
$$\left \| A \right \|_2^2 \geq \sum_{i=1}^{n} \left| \ell_i \right|^2$$
where $\left \| \cdot \right \|_2$ denotes the $\displaystyle \left \| A \right \|_2 = \sqrt{\sum_{i=1}^{n}\sum_{j=1}^{n}\left | a_{ij} \right |^2}$ norm.
Edit: A typo and the declaration of the norm was corrected. To this new version I don't have a starting point as I had to the old version.
$$\left \| A \right \|_2^2 \geq \sum_{i=1}^{n} \left| \ell_i \right|^2$$
where $\left \| \cdot \right \|_2$ denotes the $\displaystyle \left \| A \right \|_2 = \sqrt{\sum_{i=1}^{n}\sum_{j=1}^{n}\left | a_{ij} \right |^2}$ norm.
Edit: A typo and the declaration of the norm was corrected. To this new version I don't have a starting point as I had to the old version.
Imagination is much more important than knowledge.
Create an account or sign in to join the discussion
You need to be a member in order to post a reply
Create an account
Not a member? register to join our community
Members can start their own topics & subscribe to topics
It’s free and only takes a minute
Sign in
Who is online
Users browsing this forum: No registered users and 29 guests