Let V be a finite-dimensional vector space and T:V→V a linear operator such that is diagonalizable over . Which of the following statements are necessarily true?
Part CCSIR NET December 2025non-negative-quietly-admits-zero-which-breaks-the-strict-positivity-the-diagonalizability-argument-actually-needs
Non negative quietly admits zero which breaks the strict positivity the diagonalizability argument actually needs
Related counterexample: Diagonalisable ⇒ invertible
- satisfying a polynomial is not having it as minimalDecember 2024
- orthogonally diagonalizable means symmetricDecember 2024
- invariant complements need semisimplicityDecember 2024
- cube roots of unity are distinct but not realDecember 2024
The chapter behind this: Diagonalisability — the criteria card — free to read
From Eigenvalues and Canonical Forms › Diagonalisability criteria
Last revised . Found a mistake? Tell us — corrections are the fastest thing we act on.