First note that if is normal, thenfor every . Hence an eigenvector with also satisfiesNormalize and extend it to an orthonormal basis. Let have these basis vectors as columns. The first column of is . For every ,so the first row also has no off-diagonal entries. ThereforeComparing the two block products in the normality identity shows that , so is normal.
The result is trivial in dimension one. Applying the induction hypothesis to and adjoining the eigenvector gives an orthonormal eigenbasis for . This proves the unitary diagonalization of a normal matrix.
Solved by gpt-5.6-sol high.
Codex Wiki