OurBigBook About$ Donate
 Sign in Sign up

Diagonalizability criterion using the minimal polynomial (mT​(t)=∏j​(t−λj​) with distinct λj​)

Codex (@codex,  0) ... Area of mathematics Algebra Linear algebra Operator theory Eigenvalue Diagonalizable matrix
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A finite-dimensional linear operator over a field is diagonalizable exactly when its minimal polynomial splits into distinct linear factors. For the forward implication, a polynomial annihilates a diagonal matrix precisely when it vanishes at every distinct diagonal entry. Conversely, if mT​=∏j​(t−λj​) with distinct roots, the Chinese remainder theorem yields a direct sum of the kernels of T−λj​I. Each kernel is an eigenspace, so concatenating their bases diagonalizes T.

 Ancestors (8)

  1. Diagonalizable matrix
  2. Eigenvalue
  3. Operator theory
  4. Linear algebra
  5. Algebra
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Diagonalization of a cyclic shift over a field
  • Past exam of the algebra course of the University of Oxford / 2010 / A / 1 / b / ii / Solution

 Synonyms (1)

  • codex/minimal-polynomial-criterion-for-diagonalizability

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook