Knowen

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

Graphs

  • Public graph
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
How Knowen works
#
  • 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).

Navigate

Jump to a node in this graph, or explore your graphs and public knowledge.

Quick Navigation

Jump to a node or explore another graph.

  • Current graph nodes
  • Public graph
351–375 of 713 nodes
  • Equivalence theorem for injective linear transformations: The kernel of T is 0.#24081
  • Equivalence theorem for injective linear transformations: The nullity of T is 0.#24080
  • Equivalence theorem for injective linear transformations: The null space of T is 0.#24079
  • Equivalence theorem for injective linear transformations: The rank of T is equals the number of columns in any matrix representation..#24084
  • Equivalence theorem for injective linear transformations: The rank of T is n.#24083
  • Equivalence theorem for injective linear transformations: T(x)=0 only for x=0.#24082
  • Equivalence theorem for nonsingular matrices: the columns of A are a basis for R^n (or C^n).#23653
  • Equivalence theorem for nonsingular matrices: the columns of A are linearly independent.#23651
  • Equivalence theorem for nonsingular matrices: the columns of A span R^n (or C^n).#23649
  • Equivalence theorem for nonsingular matrices: the determinant of A is nonzero.#23665
  • Equivalence theorem for nonsingular matrices: the dimension of the column space of A is n.#23654
  • Equivalence theorem for nonsingular matrices: the equation Ax=0 has only the trivial solution.#23647
  • Equivalence theorem for nonsingular matrices: the equation Ax=b has a solution for all b.#23646
  • Equivalence theorem for nonsingular matrices: the equation Ax=b has a unique solution for all b.#23645
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax has an inverse.#23663
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax is an isomorphism.#23664
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax is one-to-one/injective.#23661
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax is onto/surjective.#23662
  • Equivalence theorem for nonsingular matrices: the matrix A does not have 0 as an eigenvalue.#23669
  • Equivalence theorem for nonsingular matrices: the matrix A has a left inverse.#23658
  • Equivalence theorem for nonsingular matrices: the matrix A has an inverse.#23657
  • Equivalence theorem for nonsingular matrices: the matrix A has a right inverse.#23659
  • Equivalence theorem for nonsingular matrices: the matrix A has rank n.#23666
  • Equivalence theorem for nonsingular matrices: the matrix A is a change-of-basis matrix.#23670
  • Equivalence theorem for nonsingular matrices: the matrix A represents the identity map with respect to some pair of bases.#23671
« First ← Previous ... 11 12 13 14 15 16 17 18 19 ... Next → Last »
1–25 of 40 public graphs
  • All about DApps and Dapp.com#24834
  • Chainbreakers at Dapp.com#24837
  • CryptoWars in Dapp.com#24833
  • CTSI Resources#23365
  • Dapp and Cubego partnership and It’s Giveaway Time!#24754
  • Dapp.com AMA Recap#24765
  • Dapp.com and the Cubegoes#24795
  • Dapp.com and the Yummies#24785
  • Dapp.com Ranking#24758
  • Dapp.com where the blockchain comes alive#24775
  • Finance#616
  • Giveaways at Dapp.com#24841
  • Group Theory Through Problems#1078
  • Holiday Gifts from Dapp.com#24843
  • How Knowen works#29500
  • How Long Do The Baked Potatoes Take on the Grill#23374
  • Imperial Thrones Dapp.com#24810
  • Imperial Thrones & Yummie#24826
  • Imperial Thrones & Yummie#24813
  • Knowen blog#943
  • Lecture Notes#272
  • Lecture notes test#23095
  • Math#23168
  • Media Coverage#953
  • Misc#929
1 2 Next → Last »

Knowen© 2026 KTree Inc.

ExplorePricingIntegrationsContact usHow Knowen worksLeave feedback