Codex Wiki OurBigBook logoOurBigBook.comSite Source code
If , then , proving one inclusion. Conversely, if is an eigenvalue of , factor . If none of the were eigenvalues of , every would be invertible, making invertible, a contradiction. Thus for some eigenvalue of .
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. B
  2. 8A
  3. Paper 1
  4. Ia
  5. 2025
  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