1. .

    • Prove by showing and rank-nullity theorem
  2. is invertible for all , no matter the rank of .

  3. Spectral theorem says that, if is a real symmetric matrix,

    • Eigenvalues of are real.
    • Eigenvectors corresponding to different eigenvalues are linearly independent.
    • is orthogonally diagonalizable.
    • Symmetric matrices always have enough linearly independent eigenvectors to diagonalize the matrix.
  4. Eigenvectors corresponding to distinct eigenvalues are always linearly independent.

  5. for all eigenvalues of a matrix.

    • If some eigenvalue has its AM but AM GM, then it has AM number of linearly independent eigenvectors.
  6. A matrix is diagonalizable if for all eigenvalues their AM = GM.