Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Guanyu's Latex template
  • Router template

Trees

  • Public trees
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.
KnowenBeta
#
  • Explore
  • Sign in
  1. 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).

Privacy

Who can read and edit this node, and how its tree is shared.

Privacy

Publicly readable

This private node is readable and open for comments. Ask a tree collaborator for edit access.

Tree:Container for Linear Algebra · Private

Knowen© 2026 KTree Inc.

ExplorePricingIntegrationsContact usLeave feedback