Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • Matrix diagonalization

Siblings9
  • Sort by title
  • Sort by date

  • Definition of matrix diagonalization
  • Definition of diagonalizable matrix
  • An n-by-n matrix is diagonalizable if and only if it has n linearly independent eigenvectors.
  • An n-by-n matrix is diagonalizable if and only if the sum of the dimensions of the eigenspaces equals n.
  • An n-by-n matrix is diagonalizable if and only if the characteristic polynomial factors completely
  • A diagonalizable matrix is diagonalized by a matrix having the eigenvectors as columns.
  • An n-by-n matrix is diagonalizable if and only if the union of the basis vectors for the eigenspaces is a basis for R^n (or C^n).
  • An n-by-n matrix with n distinct eigenvalues is diagonalizable.
  • Formula for diagonalizing a real 2-by-2 matrix with a complex eigenvalue.
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

Privacy

Now you are in the subtree of Container for Linear Algebra private tree.

This is a private node that you can read and comment on. To be able to edit, ask any of the collaboration members for permission to join.

Contact us or leave feedback

© KTree Inc. 2026