Diagonalization
Dependencies:
Let $A$ be an $n$ by $n$ matrix. Let $P$ be an $n$ by $k$ matrix. Let $v_i$ be the $i^{\textrm{th}}$ column of $P$. Let $D$ be a $k$ by $k$ diagonal matrix where $D[i, i] = d_i$.
Then $AP = PD \iff \forall i, (d_i, v_i)$ is an eigenvalue-eigenvector pair.
If $P$ is an invertible square matrix, this means that $D = P^{-1}AP$. $A$ is said to be diagonalizable iff $\exists$ an invertible matrix $P$, such that $P^{-1}AP$ is diagonal.
Proof
\[ (PD)[i, j] = \sum_{t=1}^k P[i, t]D[t, j] = P[i, j]D[j, j] = (v_j)_i d_j = (d_jv_j)_i \]
\[ (AP)[i, j] = (A[v_1|v_2|\ldots|v_k])[i, j] = [Av_1|Av_2|\ldots|Av_k][i, j] = (Av_j)_i \]
\begin{align} & AP = PD \\ &\iff \forall i, \forall j, (AP)[i, j] = (PD)[i, j] \\ &\iff \forall i, \forall j, (Av_j)_i = (d_jv_j)_i \\ &\iff \forall j, Av_j = d_jv_j \\ &\iff \forall j, (d_j, v_j) \textrm{ is an eigenvalue-eigenvector pair} \end{align}
Dependency for:
- Orthogonally diagonalizable iff hermitian
- A is diagonalizable iff there are n linearly independent eigenvectors
Info:
- Depth: 12
- Number of transitive dependencies: 49
Transitive dependencies:
- /linear-algebra/vector-spaces/condition-for-subspace
- /linear-algebra/matrices/gauss-jordan-algo
- /sets-and-relations/composition-of-bijections-is-a-bijection
- /sets-and-relations/equivalence-relation
- Group
- Ring
- Polynomial
- Integral Domain
- Comparing coefficients of a polynomial with disjoint variables
- Field
- Vector Space
- Linear independence
- Span
- Linear transformation
- Composition of linear transformations
- Vector space isomorphism is an equivalence relation
- Semiring
- Matrix
- Stacking
- System of linear equations
- Product of stacked matrices
- Matrix multiplication is associative
- Reduced Row Echelon Form (RREF)
- Matrices over a field form a vector space
- Row space
- Elementary row operation
- Every elementary row operation has a unique inverse
- Row equivalence of matrices
- Row equivalent matrices have the same row space
- RREF is unique
- Identity matrix
- Inverse of a matrix
- Inverse of product
- Elementary row operation is matrix pre-multiplication
- Row equivalence matrix
- Equations with row equivalent matrices have the same solution set
- Basis of a vector space
- Linearly independent set is not bigger than a span
- Homogeneous linear equations with more variables than equations
- Rank of a homogenous system of linear equations
- Rank of a matrix
- Basis of F^n
- Matrix of linear transformation
- Coordinatization over a basis
- Basis changer
- Basis change is an isomorphic linear transformation
- Vector spaces are isomorphic iff their dimensions are same
- Canonical decomposition of a linear transformation
- Eigenvalues and Eigenvectors