Question
Frobenius norm and eigenvalue sum of squares via Schur decomposition
Original question: 4. (b) Let $A$ be a complex matrix $n\times n$ with eigenvalues $\lambda_1,\ldots,\lambda_n$. The Frobenius norm of $A$ is defined as $\|A\|_F=\sqrt{\operatorname{tr}(A^*A)}=\sqrt{\sum_{i,j}|A_{ij}|^2}$. Schur's Decomposition Theorem states that there exists a unitary matrix $U$ (where $U^*=U^{-1}$) and an upper triangular matrix $T$ such that $A=UTU^*$. The diagonal entries of $T$ are the eigenvalues of $A$. Using the existence of this decomposition, prove that: $$\sum_{i=1}^n|\lambda_i|^2\le \|A\|_F^2.$$ Determine the condition under which equality holds.
Expert Verified Solution
Expert intro: The key idea is that unitary similarity preserves the Frobenius norm, while the upper triangular Schur form makes the diagonal visible. That diagonal is exactly where the eigenvalues sit.
Detailed walkthrough
Let A be an n\times n complex matrix. By Schur decomposition, there exists a unitary matrix U and an upper triangular matrix T such that and the diagonal entries of T are the eigenvalues of A:
Now use unitary invariance of the Frobenius norm: So Because T is upper triangular, this sum contains all diagonal terms and all off-diagonal terms above the diagonal: Since the diagonal entries of T are the eigenvalues of A, This proves
Equality holds exactly when every off-diagonal entry of T is zero, i.e. when T is diagonal. In that case A is unitarily diagonalizable, equivalently A is normal:
💡 Pitfall guide
The inequality is not coming from eigenvalues alone; it comes from splitting the Frobenius norm into diagonal and off-diagonal parts in Schur form. If you skip the unitary invariance step, the argument looks incomplete. Also, equality does not hold for every diagonalizable matrix, only for those that are unitarily diagonalizable.
🔄 Real-world variant
If A happens to be real symmetric or complex Hermitian, then Schur form is actually diagonal, so equality always holds and the inequality becomes when the eigenvalues are real. For a general diagonalizable matrix, the off-diagonal terms in a non-unitary basis can still be present, so diagonalizability alone is not enough.
🔍 Related terms
Schur decomposition, Frobenius norm, unitary diagonalization
FAQ
Why does Schur decomposition help with the Frobenius norm inequality?
Schur decomposition writes A as U T U*, where U is unitary and T is upper triangular with eigenvalues on the diagonal. The Frobenius norm is unitary invariant, so it becomes the sum of squares of all entries of T.
When does equality hold in sum |lambda_i|^2 <= ||A||_F^2?
Equality holds exactly when the Schur form T has no off-diagonal entries, so T is diagonal. Equivalently, A is normal and unitarily diagonalizable.