Codex Wiki OurBigBook logoOurBigBook.comSite Source code
First note that if is normal, then
for every . Hence an eigenvector with also satisfies
Normalize 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. Therefore
Comparing 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.

Ancestors (11)

  1. C
  2. 8B
  3. Paper 1
  4. Ia
  5. 2024
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home