PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] Schur's inequality (Theorem)

Theorem (Schur's inequality) Let $A$ be a square $n\times n$ matrix with real (or possibly complex entries). If $\lambda_1,\ldots, \lambda_n$ are the eigenvalues of $A$ , and $D$ is the diagonal matrix $D=\operatorname{diag}(\lambda_1,\ldots, \lambda_n)$ , then \begin{eqnarray*} \Vert D \Vert_F &\le& \Vert A \Vert_F, \end{eqnarray*}where $\Vert\cdot \Vert_F$ is the Frobenius matrix norm. Equality holds if and only if $A$ is a normal matrix.

References

1
V.V. Prasolov, Problems and Theorems in Linear Algebra, American Mathematical Society, 1994.




Anyone with an account can edit this entry. Please help improve it!

"Schur's inequality" is owned by matte. [ full author list (2) ]
(view preamble | get metadata)

View style:

See Also: trace of a matrix, Wielandt-Hoffman theorem, Frobenius matrix norm


This object's parent.

Attachments:
proof of Schur's inequality (Proof) by Andrea Ambrosio
Log in to rate this entry.
(view current ratings)

Cross-references: normal matrix, equality, Frobenius matrix norm, diagonal matrix, eigenvalues, complex, real, matrix, square, theorem
There are 2 references to this entry.

This is version 11 of Schur's inequality, born on 2003-06-28, modified 2006-06-12.
Object id is 4410, canonical name is ShursInequality.
Accessed 5769 times total.

Classification:
AMS MSC15A42 (Linear and multilinear algebra; matrix theory :: Inequalities involving eigenvalues and eigenvectors)
 26D15 (Real functions :: Inequalities :: Inequalities for sums, series and integrals)

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)